Public report — st2, published 5 Aug 2026.
Concrete security findings (CVE IDs, secret matches, dependency versions) are hidden in this version;
ask the repo owner for the full report.
218findings with an exact file:lineof 229 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
23/94dimensions across the health lenses67518 LoC — wide & deep
Executive summary
Read through the Production lens — the standard calibration. *Green* means good enough to run in production. The score is absolute and comparable across repos.
winem/st2 carries serious gaps (44%). Several issues below can materially affect correctness, security, or the cost of changing it — and propagate to everything that depends on it.
It is strongest in Architecture (96%) — the structure is clean and changes stay contained. Code Health (77%) is solid too.
Most urgent: a critical security exposure was detected (see the Security & Compliance lens). Treat it as a priority regardless of the overall grade.
The area that most needs attention is Security (34%) — exposure to security and compliance incidents is elevated. Readiness (39%) is the next concern — releases are harder to depend on — versioning, release notes and dependency hygiene are thin, so consumers can't easily tell what changed or trust an upgrade.
Leadership focus, highest impact first: SAST step to CI running what this repository's stack ships (Security & performance tooling); 1 Leaked secret finding(s) (Secret Scanning); Nothing pauses a release for a human (Deployment & Rollback).
For scale: Medium (~67,518 production lines); rebuilding it from scratch would take roughly ~0.7 person-years (~1–2 engineers). Approximate, ±~30%.
It builds on a genuinely strong Architecture foundation (96%); the priorities above are the highest-leverage way to bring the rest up to that level.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
0.7× (at 44% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~0.7 person-years of build effort (about ~€98,000 to rebuild). Its weakest lens is Security at 34% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Low (×0.9) — transaction-script/CRUD × a 0.7× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with dummy_rsa.
Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.7 person-years to rebuild), and its weakest lens is Security at 34%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Security first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 7.1/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 2–5% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4 code quality: averaging 7.1/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2021 — Injection
26
Medium
A06:2021 — Vulnerable & Outdated Components
12
High / Critical
A02:2021 — Cryptographic Failures
7
High / Critical
Roadmap
First, integrate static application security testing into the CI pipeline to automatically fail builds containing security regressions. Next, immediately resolve the single leaked secret found in the repository. Then, implement draft releases or manual dispatch gates to prevent bad builds from reaching users. Additionally, enforce versioning in build manifests or release tags to ensure traceability. Finally, begin documenting significant architectural decisions in a dedicated, discoverable location.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with dummy_rsa.
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Stamp a version in your build/package manifest (e.g. csproj <Version>, package.json, pyproject.toml, Cargo.toml, or a VERSION file) or tag releases with semver so builds and releases are traceable.
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 22 of 23 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 1 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.5 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 23 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 218 of 229 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D19 Documentation Quality — LLM provider failed — The model provider returned an unusable result, so this LLM-assisted dimension fell back to a measurement gap (confidence 0) rather than a penalty. Re-run with a reachable provider to score it.
D30 Dependency Vulnerabilities — scanner not present in this environment — The backing tool was not installed where this scan ran, so this dimension was not scored. Install the tool (or run in the hosted environment, where it is always present) for a graded result.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity (jscpd) — it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (2): D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score (documentation, ADR quality, naming, comment value, onboarding) — D25 sets the ADR-conformance fraction over sampled code, D22 judges API accuracy over a sample. These are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
+ 21 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Router.__call__ (cyclomatic 84) finding(s) in Cyclomatic Complexity — start with router.py. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 ActionChainRunner._run_chain (cyclomatic 42) finding(s) in Cyclomatic Complexity — start with action_chain_runner.py. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 ParamikoSSHClient._connect (cyclomatic 30) finding(s) in Cyclomatic Complexity — start with paramiko_ssh.py. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 67 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Router.__call__ (cognitive 165) finding(s) in Cognitive Complexity — start with router.py. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 ActionChainRunner._run_chain (cognitive 63) finding(s) in Cognitive Complexity — start with action_chain_runner.py. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 MultiColumnTable.format (cognitive 52) finding(s) in Cognitive Complexity — start with table.py. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.6 / 10Exemplary✓ 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.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
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.
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with dummy_rsa. — One of this dimension's main actionable groups (1 issue-level).
Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Git-history secret scan via gitleaks detect over full history in an isolated checkout; each match flagged High. Exhaustive; degrades cleanly when tool absent.
10 finding(s): 0 critical, 10 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
Secret: generic-api-key · ×5st2common/st2common/openapi.yaml.j2:42detected by gitleaks finding
Rotate the exposed credentials — git history can't be un-committed
What to do
Resolve the 5 Secret finding(s) in Secrets (history) — start with openapi.yaml.j2 (3), .codecov.yml, st2_kvstore_demo.crypto.key.json. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
Medium: insecure-ssl-version · ×22conf/nginx/st2.conf:32detected by semgrep finding
Low: request-host-used · ×4conf/HA/nginx/st2.conf.blueprint.sample:16detected by semgrep finding
What to do
Resolve the 22 Medium finding(s) in Static Analysis (SAST) — start with test_wiring_with_items.py (5), base.py (4), crypto.py (4). — One of this dimension's main actionable groups (22 warning-level).
Resolve the 4 Low finding(s) in Static Analysis (SAST) — start with st2.conf.blueprint.sample, st2.conf.controller.sample, st2.conf. — One of this dimension's main actionable groups (4 recommendation-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
326 of 326 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is st2client/st2client/commands/action.py.
Largest orphaned file · ×3st2client/st2client/commands/action.py
Dormant codebase
What to do
Resolve the 3 Largest orphaned file finding(s) in Knowledge Freshness — start with action.py, workflows.py, action_chain_runner.py. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling; coupling through a build step, config, or non-source file isn't seen.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
Resolve the 1 No build provenance finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 No artifact signing finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 No SBOM finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether dependencies have known published vulnerabilities (CVEs) per the OSV database — read natively from whatever lockfile the repository ships (Cargo, npm, Go, Python, Maven, RubyGems, …). D33 and D30 add ecosystem-specific scanners on top for npm and .NET.
Method: Multi-ecosystem dependency-CVE scan via osv-scanner --recursive (queries the osv.dev database + parses lockfiles natively across ecosystems: npm package-lock/yarn/pnpm/bun, Go go.mod, Rust Cargo.lock, Maven/Gradle pom.xml/gradle.lockfile, PyPI requirements.txt/poetry.lock/Pipfile.lock, Composer composer.lock, RubyGems Gemfile.lock, Hex mix.lock, pub pubspec.lock, Swift Package.resolved); severity tally (Critical/High/Medium/Low) to 0-10 tight normalizer (8.0). NotApplicable only when the repo declares no supported non-.NET dependency lockfile (a NuGet-only repo stays NotApplicable — .NET CVEs are D30's domain); coverage needs a resolved lockfile. Additive to D33 (trivy fs); exhaustive + deterministic, DB kept fresh.
High CVE: [GHSA redacted] · ×4fixed-requirements.txtdetected by osv-scanner finding
Critical CVE: [GHSA redacted] · ×2fixed-requirements.txtdetected by osv-scanner finding
Medium CVE: [GHSA redacted] · ×6fixed-requirements.txtdetected by osv-scanner finding
What to do
Resolve the 6 Medium CVE finding(s) in OSV Dependency Vulnerabilities — start with fixed-requirements.txt (6). — One of this dimension's main actionable groups (6 warning-level).
Resolve the 4 High CVE finding(s) in OSV Dependency Vulnerabilities — start with fixed-requirements.txt (4). — One of this dimension's main actionable groups (4 issue-level).
Resolve the 2 Critical CVE finding(s) in OSV Dependency Vulnerabilities — start with fixed-requirements.txt (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d38_recommendation.md · top locations in Appendix A, every location in findings.md.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Add a 'Testing' section to the root README — how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no `NNNN-title.md` documents and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
README advertises a microservices architecture, but the repo is a single project with no service manifests
What to do
Reconcile the README with reality: README advertises a microservices architecture, but the repo is a single project with no service manifests.
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 bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step.
What to do
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python 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.
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
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
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.
What to do
Stamp a version in your build/package manifest (e.g. csproj <Version>, package.json, pyproject.toml, Cargo.toml, or a VERSION file) or tag releases with semver so builds and releases are traceable.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Not included — 71 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 — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AC2 Forms & labels — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AC3 Page structure — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AC4 Keyboard semantics — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AC5 ARIA correctness — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AC6 Visual & motion safety — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AC7 A11y enforcement — Frontend below the scale floor (5 DOM element(s) < 25) — too little surface to assess accessibility.
AX1 Captive dependencies — no DI registrations detected
AX10 Code composition — not assessed — code composition is computed by ROLE over a document set that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX2 Stateful singletons — no singleton implementations detected
AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX4 Dependency direction — not applicable to a transaction-script/CRUD architecture (the inward-dependency rule is for layered/clean styles)
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~56707 lines of test source are present (.py) but the test-quality collector reads C# only, so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included
D12 Dependency Hygiene — Dependency hygiene not measured — dependency manifest found but not parsed for hygiene
D14 License Compliance — Not scored — this repository's package manifest is not parsed for licence data yet. A gap in the analyzer's language coverage, NOT a finding that the repository's licenses are compliant (a Python pyproject.toml/requirements.txt (pip/uv/Poetry)), which this pass does not parse yet — so this dimension asserts nothing about this repository's licensing in either direction.
D16 Bus Factor — dormant codebase — no living knowledge left to concentrate
D17 Explicit Debt — explicit-debt markers are read through a C# workspace today, so they were not read for this repository's language — this asserts nothing about how many markers the code carries. Not scored — this is a gap in the analyzer, not a finding about this repository
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D19 Documentation Quality — LLM evaluation failed
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D22 Internal API Consistency — No exposed public API
D23 Boundary Type-Coupling — Production source is present (.py) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — No calls could be sampled, so navigability was not assessed — tracing effort is measured over resolved call sites and this target exposed none. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry) — not scanned yet) — where an OSV-supported manifest exists, dependency vulnerabilities for this repository are reported under D38 instead.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
D32 Data Compliance (PII/GDPR) — No PII/GDPR-handling patterns detected (p/gdpr ruleset) — no data-compliance surface to assess.
D33 JS/npm Dependency Vulnerabilities — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
D6 Cohesion (LCOM4) — Cohesion (LCOM4) is measured over a C#/VB class graph, and this repository's production source is .py, which this pass does not read — so no class could be assessed. Not scored — this is a gap in the analyzer, not a finding about this repository.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
D9 Test Distribution — Test source is present (.py) but the test-pyramid classifier reads C# only, so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this check looks for (1 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this check looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this check looks for
GD1 Unfinished & placeholder code — no source files
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
P8 Schema migrations — not assessed — schema-migration practice is read from a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
D38 · OSV Dependency Vulnerabilities· High CVE · ×4
High CVE: [GHSA redacted] fixed-requirements.txt— cryptography 3.2: [GHSA redacted] — upgrade to 42.0.0. This is 1 of 16 advisories with a published fix this scan raises against cryptography 3.2, and their fixed versions do not agree — anything below 3.3.2 still leaves at least one of them open. Take this package to 3.3.2 or later: that is the floor for the package, not this row's target alone. (in 4 dependency files) This one row stands for the 16 advisories this scan raises against cryptography 3.2: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], PYSEC-2021-62, PYSEC-2024-225, PYSEC-2026-35.
High CVE: [GHSA redacted] fixed-requirements.txt— gunicorn 19.9.0: [GHSA redacted] — upgrade to 22.0.0 (in 5 dependency files) This one row stands for the 2 advisories this scan raises against gunicorn 19.9.0: [GHSA redacted], [GHSA redacted].
High CVE: [GHSA redacted] fixed-requirements.txt— ujson 1.35: [GHSA redacted] — upgrade to 5.12.1. This is 1 of 6 advisories with a published fix this scan raises against ujson 1.35, and their fixed versions do not agree — anything below 5525f8c9ef8bb879dadd0eb942d524827d1b0362 still leaves at least one of them open. Take this package to 5525f8c9ef8bb879dadd0eb942d524827d1b0362 or later: that is the floor for the package, not this row's target alone. (in 3 dependency files: fixed-requirements.txt, requirements.txt, st2common/requirements.txt) This one row stands for the 6 advisories this scan raises against ujson 1.35: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], OSV-2021-955.
High CVE: [GHSA redacted] fixed-requirements.txt— virtualenv 16.6.0: [GHSA redacted] — upgrade to 20.26.6. This is 1 of 2 advisories with a published fix this scan raises against virtualenv 16.6.0, and their fixed versions do not agree — anything below 20.36.1 still leaves at least one of them open. Take this package to 20.36.1 or later: that is the floor for the package, not this row's target alone. This one row stands for the 2 advisories this scan raises against virtualenv 16.6.0: [GHSA redacted], [GHSA redacted].
Critical CVE: [GHSA redacted] fixed-requirements.txt— gitpython 2.1.15: [GHSA redacted] — upgrade to 3.1.30. This is 1 of 20 advisories with a published fix this scan raises against gitpython 2.1.15, and their fixed versions do not agree — anything below 3.1.57 still leaves at least one of them open. Take this package to 3.1.57 or later: that is the floor for the package, not this row's target alone. (in 4 dependency files) This one row stands for the 20 advisories this scan raises against gitpython 2.1.15: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
Critical CVE: [GHSA redacted] fixed-requirements.txt— pyyaml 5.1.2: [GHSA redacted] — upgrade to 5.2. This is 1 of 3 advisories with a published fix this scan raises against pyyaml 5.1.2, and their fixed versions do not agree — anything below 5.4 still leaves at least one of them open. Take this package to 5.4 or later: that is the floor for the package, not this row's target alone. (in 5 dependency files) This one row stands for the 3 advisories this scan raises against pyyaml 5.1.2: [GHSA redacted], [GHSA redacted], [GHSA redacted].
Leaked secret: private-key st2tests/st2tests/resources/ssh/dummy_rsa:1— private-key detected. Treat the value as compromised: it is readable by everyone who has ever had the repository, and deleting the line does not un-publish it. In order — (1) REVOKE it at whatever issued it and issue a replacement, which is the only step that actually closes the exposure; (2) load the replacement at run time from your platform's secret store or the process environment instead of from the tree, so no future value is committable; (3) remove the file or line and add its path to the repository's ignore rules, so it cannot come back; (4) if the value was ever live, purge it from the history as well, since a clone taken before the deletion still carries it. If this is instead a FIXTURE — key material generated for tests and valid nowhere — then the exposure is nil and the fix is to make that legible: generate it in test setup, or keep it under a test-data path, so a reader (and this scan) can tell it from the real thing.
Medium: insecure-ssl-version conf/nginx/st2.conf:32— Detected use of an insecure SSL version. Secure SSL versions are TLSv1.2 and TLS1.3; older versions are known to be broken and are susceptible to attacks. Prefer use of TLSv1.2 or later. This is a semgrep security-AUDIT rule reporting a POLICY that is absent or weaker than its recommendation, not an exploitable defect. Confirm whether the current setting is a deliberate decision for this repository — and apply the change where it is not; where it is (a policy your release process already enforces elsewhere, or one this repository has consciously opted out of), record the decision and leave the configuration as it is.
Medium: insecure-file-permissions st2client/st2client/base.py:240— These permissions `0o2770` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2client/st2client/base.py:308— These permissions `0o2770` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2client/st2client/base.py:347— These permissions `0o660` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2client/st2client/commands/auth.py:148— These permissions `0o660` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-hash-algorithm-md5 st2common/st2common/models/db/trace.py:102— Detected MD5 hash algorithm which is considered insecure. MD5 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: insecure-hash-algorithm-md5 st2common/st2common/models/db/trigger.py:111— Detected MD5 hash algorithm which is considered insecure. MD5 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: insecure-hash-algorithm-sha1 st2common/st2common/util/crypto.py:76— Detected SHA1 hash algorithm which is considered insecure. SHA1 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: insecure-hash-algorithm-sha1 st2common/st2common/util/crypto.py:243— Detected SHA1 hash algorithm which is considered insecure. SHA1 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: insecure-hash-algorithm-sha1 st2common/st2common/util/crypto.py:291— Detected SHA1 hash algorithm which is considered insecure. SHA1 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: crypto-mode-without-authentication st2common/st2common/util/crypto.py:296— An encryption mode of operation is being used without proper message authentication. This can potentially result in the encrypted content to be decrypted by an attacker. Consider instead use an AEAD mode of operation like GCM. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: missing-autoescape-disabled st2common/st2common/util/jinja.py:102— Detected a Jinja2 environment without autoescaping. Jinja2 does not autoescape by default. This is dangerous if you are rendering to a browser because this allows for cross-site scripting (XSS) attacks. If you are in a web context, enable autoescaping by setting 'autoescape=True.' You may also consider using 'jinja2.select_autoescape()' to only enable automatic escaping for certain file extensions. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-hash-algorithm-md5 st2common/st2common/util/pack_management.py:118— Detected MD5 hash algorithm which is considered insecure. MD5 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: insecure-hash-algorithm-md5 st2reactor/st2reactor/container/hash_partitioner.py:110— Detected MD5 hash algorithm which is considered insecure. MD5 is not collision resistant and is therefore not suitable as a cryptographic signature. Use SHA256 or SHA3 instead.
Medium: python-logger-credential-disclosure st2reactor/st2reactor/container/process_container.py:327— Detected a python logger call with a potential hardcoded secret 'Creating temporary auth token for sensor %s' % (sensor['class_name']) being logged. This may lead to secret credentials being exposed. Make sure that the logger is not logging sensitive information. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/base.py:48— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/test_wiring_rerun.py:34— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/test_wiring_with_items.py:77— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/test_wiring_with_items.py:108— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/test_wiring_with_items.py:154— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/test_wiring_with_items.py:200— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Medium: insecure-file-permissions st2tests/integration/orquesta/test_wiring_with_items.py:244— These permissions `0o755` are widely permissive and grant access to more people than may be necessary. A good default is `0o644` which gives read and write access to yourself and read access to everyone else. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Duplicated block (10 lines × 2) st2api/st2api/controllers/v1/actionalias.py:201— st2api/st2api/controllers/v1/actionalias.py:201-210 | st2api/st2api/controllers/v1/triggers.py:281-290 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) st2auth/st2auth/backends/__init__.py:55— st2auth/st2auth/backends/__init__.py:55-64 | st2auth/st2auth/sso/__init__.py:60-69 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) st2client/st2client/commands/action.py:1085— st2client/st2client/commands/action.py:1085-1094 | st2client/st2client/commands/rule_enforcement.py:79-89 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `st2client/st2client/commands/action.py:1085` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) st2client/st2client/commands/pack.py:224— st2client/st2client/commands/pack.py:224-233 | st2client/st2client/commands/pack.py:244-253 — 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 `st2client/st2client/commands/pack.py:224` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) st2client/st2client/commands/resource.py:619— st2client/st2client/commands/resource.py:619-628 | st2common/st2common/util/loader.py:189-198 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) st2client/st2client/commands/rule_enforcement.py:69— st2client/st2client/commands/rule_enforcement.py:69-79 | st2client/st2client/commands/triggerinstance.py:81-90 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `st2client/st2client/commands/rule_enforcement.py:69` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) st2client/st2client/utils/interactive.py:242— st2client/st2client/utils/interactive.py:242-251 | st2client/st2client/utils/interactive.py:368-377 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) st2common/st2common/services/sensor_watcher.py:71— st2common/st2common/services/sensor_watcher.py:71-80 | st2common/st2common/services/triggerwatcher.py:82-91 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (10 lines × 2) st2common/st2common/services/workflows.py:597— st2common/st2common/services/workflows.py:597-606 | st2common/st2common/services/workflows.py:613-622 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) contrib/runners/local_runner/local_runner/base.py:129— contrib/runners/local_runner/local_runner/base.py:129-139 | contrib/runners/python_runner/python_runner/python_runner.py:238-248 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `contrib/runners/local_runner/local_runner/base.py:129` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) st2client/st2client/commands/action.py:1070— st2client/st2client/commands/action.py:1070-1080 | st2client/st2client/commands/trace.py:129-139 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `st2client/st2client/commands/action.py:1070` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) st2client/st2client/commands/auth.py:49— st2client/st2client/commands/auth.py:49-59 | st2client/st2client/commands/auth.py:91-101 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `st2client/st2client/commands/auth.py:49` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) st2client/st2client/commands/resource.py:361— st2client/st2client/commands/resource.py:361-372 | st2client/st2client/commands/resource.py:447-457 — 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 `st2client/st2client/commands/resource.py:361` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) st2common/st2common/bootstrap/sensorsregistrar.py:117— st2common/st2common/bootstrap/sensorsregistrar.py:117-127 | st2common/st2common/bootstrap/triggersregistrar.py:118-128 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) st2common/st2common/garbage_collection/executions.py:119— st2common/st2common/garbage_collection/executions.py:119-129 | st2common/st2common/garbage_collection/executions.py:168-178 — 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 (11 lines × 2) st2common/st2common/persistence/base.py:136— st2common/st2common/persistence/base.py:136-146 | st2common/st2common/persistence/base.py:175-185 — 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 `st2common/st2common/persistence/base.py:136` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) tools/diff-db-disk.py:178— tools/diff-db-disk.py:178-189 | tools/diff-db-disk.py:190-200 — 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 `tools/diff-db-disk.py:178` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Change coupling: action.py ↔ triggerinstance.py st2client/st2client/commands/action.py— `st2client/st2client/commands/action.py` and `st2client/st2client/commands/triggerinstance.py` change together 65% of the time (13 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking.
Change coupling: rule_enforcement.py ↔ trace.py st2client/st2client/commands/rule_enforcement.py— `st2client/st2client/commands/rule_enforcement.py` and `st2client/st2client/commands/trace.py` change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking.
Change coupling: action.py ↔ rule_enforcement.py st2client/st2client/commands/action.py— `st2client/st2client/commands/action.py` and `st2client/st2client/commands/rule_enforcement.py` change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking.
Change coupling: rule_enforcement.py ↔ triggerinstance.py st2client/st2client/commands/rule_enforcement.py— `st2client/st2client/commands/rule_enforcement.py` and `st2client/st2client/commands/triggerinstance.py` change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking.
Change coupling: announcement_runner.py ↔ noop_runner.py contrib/runners/announcement_runner/announcement_runner/announcement_runner.py— `contrib/runners/announcement_runner/announcement_runner/announcement_runner.py` and `contrib/runners/noop_runner/noop_runner/noop_runner.py` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking.
Change coupling: action_chain_runner.py ↔ noop_runner.py contrib/runners/action_chain_runner/action_chain_runner/action_chain_runner.py— `contrib/runners/action_chain_runner/action_chain_runner/action_chain_runner.py` and `contrib/runners/noop_runner/noop_runner/noop_runner.py` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking.
D38 · OSV Dependency Vulnerabilities· Medium CVE · ×6
Medium CVE: [GHSA redacted] fixed-requirements.txt— eventlet 0.25.1: [GHSA redacted] — upgrade to 0.35.2. This is 1 of 3 advisories with a published fix this scan raises against eventlet 0.25.1, and their fixed versions do not agree — anything below 0.40.3 still leaves at least one of them open. Take this package to 0.40.3 or later: that is the floor for the package, not this row's target alone. (in 9 dependency files) This one row stands for the 3 advisories this scan raises against eventlet 0.25.1: [GHSA redacted], [GHSA redacted], [GHSA redacted].
Medium CVE: [GHSA redacted] fixed-requirements.txt— jinja2 2.10.3: [GHSA redacted] — upgrade to 3.1.6 (in 4 dependency files) This one row stands for the 5 advisories this scan raises against jinja2 2.10.3: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
Medium CVE: [GHSA redacted] fixed-requirements.txt— paramiko 2.7.1: [GHSA redacted] — upgrade to 3.4.0 (in 3 dependency files: fixed-requirements.txt, requirements.txt, st2common/requirements.txt) This one row stands for the 3 advisories this scan raises against paramiko 2.7.1: [GHSA redacted], PYSEC-2022-166, PYSEC-2026-2858.
Medium CVE: [GHSA redacted] fixed-requirements.txt— pymongo 3.10.0: [GHSA redacted] — upgrade to 4.6.3 (in 6 dependency files)
Medium CVE: [GHSA redacted] fixed-requirements.txt— requests 2.23.0: [GHSA redacted] — upgrade to 2.32.4. This is 1 of 4 advisories with a published fix this scan raises against requests 2.23.0, and their fixed versions do not agree — anything below 2.33.0 still leaves at least one of them open. Take this package to 2.33.0 or later: that is the floor for the package, not this row's target alone. (in 5 dependency files) This one row stands for the 4 advisories this scan raises against requests 2.23.0: [GHSA redacted], [GHSA redacted], [GHSA redacted], [GHSA redacted].
Medium CVE: [GHSA redacted] fixed-requirements.txt— webob 1.8.5: [GHSA redacted] — upgrade to 1.8.10. This is 1 of 2 advisories with a published fix this scan raises against webob 1.8.5, and their fixed versions do not agree — anything below 1.8.10 still leaves at least one of them open. Take this package to 1.8.10 or later: that is the floor for the package, not this row's target alone. (in 3 dependency files: fixed-requirements.txt, requirements.txt, st2common/requirements.txt) This one row stands for the 2 advisories this scan raises against webob 1.8.5: [GHSA redacted], [GHSA redacted].
Duplicated block (8 lines × 2) st2actions/st2actions/container/base.py:200— st2actions/st2actions/container/base.py:200-207 | st2actions/st2actions/container/base.py:227-235 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) st2auth/st2auth/handlers.py:115— st2auth/st2auth/handlers.py:115-123 | st2auth/st2auth/handlers.py:176-183 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) st2client/st2client/commands/keyvalue.py:120— st2client/st2client/commands/keyvalue.py:120-127 | st2client/st2client/commands/trace.py:190-197 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `st2client/st2client/commands/keyvalue.py:120` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) st2client/st2client/commands/pack.py:273— st2client/st2client/commands/pack.py:273-280 | st2client/st2client/commands/pack.py:325-332 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) st2common/st2common/services/policies.py:45— st2common/st2common/services/policies.py:45-52 | st2common/st2common/services/policies.py:69-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) st2common/st2common/services/workflows.py:1033— st2common/st2common/services/workflows.py:1033-1042 | st2common/st2common/services/workflows.py:1124-1131 — 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.
FileTooLong: commands/action.py st2client/st2client/commands/action.py:0— FileTooLong — 1126 significant lines (blank, comment-only and punctuation-only lines excluded). 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: services/workflows.py st2common/st2common/services/workflows.py:0— FileTooLong — 933 significant lines (blank, comment-only and punctuation-only lines excluded). 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: api/action.py st2common/st2common/models/api/action.py:0— FileTooLong — 601 significant lines (blank, comment-only and punctuation-only lines excluded). 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: action_chain_runner/action_chain_runner.py contrib/runners/action_chain_runner/action_chain_runner/action_chain_runner.py:0— FileTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded). 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: models/core.py st2client/st2client/models/core.py:0— FileTooLong — 530 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Duplicated block (7 lines × 2) st2actions/st2actions/container/base.py:156— st2actions/st2actions/container/base.py:156-162 | st2actions/st2actions/container/base.py:237-243 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) st2client/st2client/commands/rule.py:101— st2client/st2client/commands/rule.py:101-107 | st2client/st2client/commands/webhook.py:46-52 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (7 lines × 2) st2client/st2client/models/core.py:190— st2client/st2client/models/core.py:190-197 | st2client/st2client/models/core.py:462-468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) st2tests/st2tests/api.py:232— st2tests/st2tests/api.py:232-238 | st2tests/st2tests/api.py:250-256 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) st2tests/st2tests/api.py:248— st2tests/st2tests/api.py:248-254 | st2tests/st2tests/api.py:288-295 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) contrib/runners/remote_runner/remote_runner/remote_command_runner.py:39— contrib/runners/remote_runner/remote_runner/remote_command_runner.py:39-44 | contrib/runners/remote_runner/remote_runner/remote_script_runner.py:42-47 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (6 lines × 2) st2client/st2client/models/core.py:305— st2client/st2client/models/core.py:305-310 | st2client/st2client/models/core.py:371-377 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) st2client/st2client/models/core.py:360— st2client/st2client/models/core.py:360-365 | st2client/st2client/models/core.py:608-613 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) st2common/st2common/models/api/action.py:299— st2common/st2common/models/api/action.py:299-304 | st2common/st2common/models/api/action.py:656-661 — 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 `st2common/st2common/models/api/action.py:656` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) st2common/st2common/models/system/action.py:331— st2common/st2common/models/system/action.py:331-336 | st2common/st2common/models/system/action.py:361-366 — 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 `st2common/st2common/models/system/action.py:331` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 2) st2api/st2api/controllers/v1/actionexecutions.py:332— st2api/st2api/controllers/v1/actionexecutions.py:332-344 | st2stream/st2stream/controllers/v1/executions.py:63-75 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 2) st2api/st2api/controllers/v1/actionexecutions.py:377— st2api/st2api/controllers/v1/actionexecutions.py:377-389 | st2api/st2api/controllers/v1/actionexecutions.py:404-416 — 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 (13 lines × 2) st2common/st2common/models/db/__init__.py:316— st2common/st2common/models/db/__init__.py:316-328 | st2common/st2common/transport/utils.py:98-112 — 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 (13 lines × 2) st2common/st2common/util/virtualenvs.py:246— st2common/st2common/util/virtualenvs.py:246-258 | st2common/st2common/util/virtualenvs.py:291-303 — 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 (12 lines × 2) contrib/runners/python_runner/python_runner/python_runner.py:291— contrib/runners/python_runner/python_runner/python_runner.py:291-302 | st2common/st2common/runners/base.py:477-488 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12 lines × 2) st2api/st2api/controllers/v1/packs.py:111— st2api/st2api/controllers/v1/packs.py:111-122 | st2api/st2api/controllers/v1/packs.py:138-149 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) st2api/st2api/controllers/v1/rules.py:111— st2api/st2api/controllers/v1/rules.py:111-124 | st2api/st2api/controllers/v1/rules.py:170-181 — 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 (12 lines × 2) st2common/st2common/bootstrap/sensorsregistrar.py:130— st2common/st2common/bootstrap/sensorsregistrar.py:130-141 | st2common/st2common/bootstrap/triggersregistrar.py:131-142 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (14 lines × 2) st2actions/st2actions/policies/concurrency.py:58— st2actions/st2actions/policies/concurrency.py:58-71 | st2actions/st2actions/policies/concurrency_by_attr.py:81-94 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `st2actions/st2actions/policies/concurrency.py:58` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) st2api/st2api/controllers/resource.py:290— st2api/st2api/controllers/resource.py:290-303 | st2api/st2api/controllers/resource.py:537-550 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14 lines × 2) st2common/st2common/services/workflows.py:769— st2common/st2common/services/workflows.py:769-782 | st2common/st2common/services/workflows.py:832-845 — 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 `st2common/st2common/services/workflows.py:769` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) st2actions/st2actions/worker.py:185— st2actions/st2actions/worker.py:185-195 | st2actions/st2actions/worker.py:205-215 | st2actions/st2actions/worker.py:225-235 — 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.
Duplicated block (11 lines × 3) st2client/st2client/commands/action.py:1100— st2client/st2client/commands/action.py:1100-1110 | st2client/st2client/commands/rbac.py:58-68 | st2client/st2client/commands/rbac.py:123-133 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `st2client/st2client/commands/action.py:1100` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) st2common/st2common/services/workflows.py:321— st2common/st2common/services/workflows.py:321-331 | st2common/st2common/services/workflows.py:364-374 | st2common/st2common/services/workflows.py:421-431 — 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.
Change coupling clique: app.py, app.py, app.py st2api/st2api/app.py— 3 files — `st2api/st2api/app.py`, `st2auth/st2auth/app.py`, `st2stream/st2stream/app.py` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
Change coupling clique: garbagecollector.py, rulesengine.py, sensormanager.py st2reactor/st2reactor/cmd/garbagecollector.py— 3 files — `st2reactor/st2reactor/cmd/garbagecollector.py`, `st2reactor/st2reactor/cmd/rulesengine.py`, `st2reactor/st2reactor/cmd/sensormanager.py` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
Duplicated block (9 lines × 2) st2api/st2api/controllers/v1/inquiries.py:119— st2api/st2api/controllers/v1/inquiries.py:119-127 | st2api/st2api/controllers/v1/inquiries.py:160-169 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) st2client/st2client/models/core.py:432— st2client/st2client/models/core.py:432-440 | st2client/st2client/models/core.py:444-452 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Router.__call__ (cyclomatic 84) st2common/st2common/router.py:244— Router.__call__ has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ActionChainRunner._run_chain (cyclomatic 42) contrib/runners/action_chain_runner/action_chain_runner/action_chain_runner.py:368— ActionChainRunner._run_chain has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ParamikoSSHClient._connect (cyclomatic 30) st2common/st2common/runners/paramiko_ssh.py:617— ParamikoSSHClient._connect has cyclomatic complexity 30 (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.
ResourceController._get_all (cyclomatic 29) st2api/st2api/controllers/resource.py:133— ResourceController._get_all has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PackRegisterController.post (cyclomatic 25) st2api/st2api/controllers/v1/packs.py:156— PackRegisterController.post has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MultiColumnTable.format (cyclomatic 25) st2client/st2client/formatters/table.py:60— MultiColumnTable.format has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ActionExecutionsController.put (cyclomatic 23) st2api/st2api/controllers/v1/actionexecutions.py:569— ActionExecutionsController.put has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
service_setup.setup (cyclomatic 22) st2common/st2common/service_setup.py:68— service_setup.setup 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.
actionalias_helpstring.generate_helpstring_result (cyclomatic 21) st2common/st2common/util/actionalias_helpstring.py:26— actionalias_helpstring.generate_helpstring_result 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.
GetPackDependencies.run (cyclomatic 20) contrib/packs/actions/pack_mgmt/get_pack_dependencies.py:26— GetPackDependencies.run 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.
KeyValuePairController.get_all (cyclomatic 20) st2api/st2api/controllers/v1/keyvalue.py:130— KeyValuePairController.get_all has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActionExecutionTailCommand.tail_execution (cyclomatic 20) st2client/st2client/commands/action.py:1460— ActionExecutionTailCommand.tail_execution 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.
bootstrap.register_content (cyclomatic 20) st2common/st2common/content/bootstrap.py:351— bootstrap.register_content has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
pack_management.clone_repo (cyclomatic 20) st2common/st2common/util/pack_management.py:181— pack_management.clone_repo 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.
shell.run_command (cyclomatic 18) st2common/st2common/util/green/shell.py:39— shell.run_command 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.
TraceGetCommand._filter_trace_components (cyclomatic 17) st2client/st2client/commands/trace.py:254— TraceGetCommand._filter_trace_components 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.
workflows.request_next_tasks (cyclomatic 17) st2common/st2common/services/workflows.py:1012— workflows.request_next_tasks 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.
workflows.update_execution_records (cyclomatic 17) st2common/st2common/services/workflows.py:1288— workflows.update_execution_records has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
action_db.update_liveaction_status (cyclomatic 17) st2common/st2common/util/action_db.py:180— action_db.update_liveaction_status has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
schema.modify_schema_allow_default_none (cyclomatic 17) st2common/st2common/util/schema/__init__.py:233— schema.modify_schema_allow_default_none 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.
PythonRunner.run (cyclomatic 16) contrib/runners/python_runner/python_runner/python_runner.py:125— PythonRunner.run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActionExecutionReRunController.post (cyclomatic 16) st2api/st2api/controllers/v1/actionexecutions.py:394— ActionExecutionReRunController.post has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActionAliasExecutionController._post (cyclomatic 16) st2api/st2api/controllers/v1/aliasexecution.py:99— ActionAliasExecutionController._post 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.
StandaloneAuthHandler.handle_auth (cyclomatic 16) st2auth/st2auth/handlers.py:134— StandaloneAuthHandler.handle_auth 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.
ExecutionResult.format (cyclomatic 16) st2client/st2client/formatters/execution.py:51— ExecutionResult.format 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.
schema.assign_default_values (cyclomatic 16) st2common/st2common/util/schema/__init__.py:178— schema.assign_default_values 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.
dormant codebase — no living knowledge left to concentrate — All 51 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains — nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness).
LLM evaluation failed — JSON parse error: Expected end of string, but instead reached end of data. Path: $.findings[0].suggestion | LineNumber: 0 | BytePositionInLine: 1091.
Router.__call__ (cognitive 165) st2common/st2common/router.py:244— Router.__call__ has cognitive complexity 165 (threshold 15). Drivers by points: if/else 118, error handling 30, boolean chains 14, loops 3 (nesting depth added 89). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionChainRunner._run_chain (cognitive 63) contrib/runners/action_chain_runner/action_chain_runner/action_chain_runner.py:368— ActionChainRunner._run_chain has cognitive complexity 63 (threshold 15). Drivers by points: if/else 40, error handling 13, boolean chains 5, loops 3, ternaries 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MultiColumnTable.format (cognitive 52) st2client/st2client/formatters/table.py:60— MultiColumnTable.format has cognitive complexity 52 (threshold 15). Drivers by points: if/else 33, loops 10, boolean chains 4, ternaries 4, error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GetPackDependencies.run (cognitive 44) contrib/packs/actions/pack_mgmt/get_pack_dependencies.py:26— GetPackDependencies.run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 32, boolean chains 5, ternaries 4, loops 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackRegisterController.post (cognitive 43) st2api/st2api/controllers/v1/packs.py:156— PackRegisterController.post has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21, boolean chains 12, error handling 5, loops 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ResourceController._get_all (cognitive 40) st2api/st2api/controllers/resource.py:133— ResourceController._get_all has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18, boolean chains 8, error handling 6, loops 4, ternaries 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionExecutionTailCommand.tail_execution (cognitive 37) st2client/st2client/commands/action.py:1460— ActionExecutionTailCommand.tail_execution has cognitive complexity 37 (threshold 15). Drivers by points: if/else 32, boolean chains 4, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workflows.request_next_tasks (cognitive 35) st2common/st2common/services/workflows.py:1012— workflows.request_next_tasks has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22, loops 8, error handling 3, boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExecutionResult.format (cognitive 34) st2client/st2client/formatters/execution.py:51— ExecutionResult.format has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16, ternaries 7, error handling 6, boolean chains 3, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionRunCommandMixin._get_action_parameters_from_args (cognitive 33) st2client/st2client/commands/action.py:531— ActionRunCommandMixin._get_action_parameters_from_args has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, error handling 3, boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ParamikoSSHClient._connect (cognitive 33) st2common/st2common/runners/paramiko_ssh.py:617— ParamikoSSHClient._connect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18, boolean chains 14, 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.
PackInstallCommand._get_content_counts_for_pack (cognitive 32) st2client/st2client/commands/pack.py:216— PackInstallCommand._get_content_counts_for_pack has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, loops 9 (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.
pack_management.clone_repo (cognitive 31) st2common/st2common/util/pack_management.py:181— pack_management.clone_repo has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, ternaries 6, boolean chains 5, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema.assign_default_values (cognitive 30) st2common/st2common/util/schema/__init__.py:178— schema.assign_default_values has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21, loops 5, boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
actionalias_helpstring.generate_helpstring_result (cognitive 29) st2common/st2common/util/actionalias_helpstring.py:26— actionalias_helpstring.generate_helpstring_result has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16, boolean chains 10, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RulesRegistrar._register_rules_from_pack (cognitive 26) st2common/st2common/bootstrap/rulesregistrar.py:106— RulesRegistrar._register_rules_from_pack has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, error handling 9, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
service_setup.setup (cognitive 26) st2common/st2common/service_setup.py:68— service_setup.setup has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 5, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
action._validate_parameters (cognitive 26) st2common/st2common/validators/api/action.py:80— action._validate_parameters has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
reactor.validate_trigger_payload (cognitive 26) st2common/st2common/validators/api/reactor.py:113— reactor.validate_trigger_payload has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, error handling 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionAliasExecutionController._post (cognitive 25) st2api/st2api/controllers/v1/aliasexecution.py:99— ActionAliasExecutionController._post has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, error handling 7, boolean chains 2, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackAsyncCommand.run_and_print (cognitive 24) st2client/st2client/commands/pack.py:108— PackAsyncCommand.run_and_print has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, boolean chains 3, ternaries 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AuthHandlerBase._get_username_for_request (cognitive 23) st2auth/st2auth/handlers.py:51— AuthHandlerBase._get_username_for_request has cognitive complexity 23 (threshold 15). Drivers by points: error handling 14, if/else 9 (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.
StandaloneAuthHandler.handle_auth (cognitive 23) st2auth/st2auth/handlers.py:134— StandaloneAuthHandler.handle_auth has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, error handling 9, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runnersregistrar.register_runner (cognitive 23) st2common/st2common/bootstrap/runnersregistrar.py:58— runnersregistrar.register_runner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, error handling 4, loops 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionRunCommandMixin._print_help (cognitive 22) st2client/st2client/commands/action.py:736— ActionRunCommandMixin._print_help has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, error handling 6, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TraceGetCommand._filter_trace_components (cognitive 22) st2client/st2client/commands/trace.py:254— TraceGetCommand._filter_trace_components has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 4, loops 3 (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.
packs.search_pack_index (cognitive 22) st2common/st2common/services/packs.py:180— packs.search_pack_index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, loops 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
param._cast_params_from (cognitive 22) st2common/st2common/util/param.py:234— param._cast_params_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, loops 6, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionExecutionsController.put (cognitive 21) st2api/st2api/controllers/v1/actionexecutions.py:569— ActionExecutionsController.put has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 7, error handling 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
KeyValuePairController.get_all (cognitive 21) st2api/st2api/controllers/v1/keyvalue.py:130— KeyValuePairController.get_all has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 10 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PropertyValueTable.format (cognitive 21) st2client/st2client/formatters/table.py:218— PropertyValueTable.format has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 5, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workflows.update_task_execution (cognitive 21) st2common/st2common/services/workflows.py:1144— workflows.update_task_execution has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, ternaries 7, boolean chains 4 (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.
workflows.update_execution_records (cognitive 21) st2common/st2common/services/workflows.py:1288— workflows.update_execution_records has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 4, ternaries 4, loops 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
PythonRunner.run (cognitive 20) contrib/runners/python_runner/python_runner/python_runner.py:125— PythonRunner.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 2, error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActionRunCommandMixin._format_child_instances (cognitive 20) st2client/st2client/commands/action.py:833— ActionRunCommandMixin._format_child_instances has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 4, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KeyValuePairLoadCommand.run (cognitive 20) st2client/st2client/commands/keyvalue.py:302— KeyValuePairLoadCommand.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TraceGetCommand._apply_display_filters (cognitive 20) st2client/st2client/commands/trace.py:330— TraceGetCommand._apply_display_filters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 5, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CLIConfigParser.parse (cognitive 20) st2client/st2client/config_parser.py:142— CLIConfigParser.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap.register_content (cognitive 20) st2common/st2common/content/bootstrap.py:351— bootstrap.register_content has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
log.find_caller (cognitive 20) st2common/st2common/log.py:73— log.find_caller has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 2, 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.
BaseListener.generator (cognitive 20) st2common/st2common/stream/listener.py:81— BaseListener.generator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 4, error handling 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
action_db.serialize_positional_argument (cognitive 20) st2common/st2common/util/action_db.py:262— action_db.serialize_positional_argument has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, ternaries 9 (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.
shell.run_command (cognitive 20) st2common/st2common/util/green/shell.py:39— shell.run_command has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
secrets.get_secret_parameters (cognitive 20) st2common/st2common/util/secrets.py:28— secrets.get_secret_parameters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
diff-db-disk._diff (cognitive 20) tools/diff-db-disk.py:160— diff-db-disk._diff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
runtime.task (cognitive 19) contrib/runners/orquesta_runner/orquesta_functions/runtime.py:48— runtime.task has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 3, loops 3, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Notifier._post_notify_subsection_triggers (cognitive 19) st2actions/st2actions/notifier/notifier.py:132— Notifier._post_notify_subsection_triggers has cognitive complexity 19 (threshold 15). Drivers by points: error handling 9, boolean chains 5, if/else 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ParamikoSSHClient._consume_stdout (cognitive 19) st2common/st2common/runners/paramiko_ssh.py:490— ParamikoSSHClient._consume_stdout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ParamikoSSHClient._consume_stderr (cognitive 19) st2common/st2common/runners/paramiko_ssh.py:536— ParamikoSSHClient._consume_stderr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
packs._fetch_and_compile_index (cognitive 19) st2common/st2common/services/packs.py:65— packs._fetch_and_compile_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, error handling 6, boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PythonRunner._get_output_values (cognitive 18) contrib/runners/python_runner/python_runner/python_runner.py:306— PythonRunner._get_output_values has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, error handling 2, 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.
fixate-requirements.write_requirements (cognitive 18) scripts/fixate-requirements.py:137— fixate-requirements.write_requirements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ErrorHandlingMiddleware.__call__ (cognitive 18) st2common/st2common/middleware/error_handling.py:39— ErrorHandlingMiddleware.__call__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 2, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RoleDefinitionFileFormatAPI.validate (cognitive 18) st2common/st2common/models/api/rbac.py:204— RoleDefinitionFileFormatAPI.validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 7 (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.
Access.add_or_update (cognitive 18) st2common/st2common/persistence/base.py:166— Access.add_or_update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, error handling 5, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Router.add_spec (cognitive 18) st2common/st2common/router.py:184— Router.add_spec has cognitive complexity 18 (threshold 15). Drivers by points: loops 11, if/else 7 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
workflows.identify_orphaned_workflows (cognitive 18) st2common/st2common/services/workflows.py:1366— workflows.identify_orphaned_workflows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
schema.modify_schema_allow_default_none (cognitive 18) st2common/st2common/util/schema/__init__.py:233— schema.modify_schema_allow_default_none has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BaseFormatter.format (cognitive 17) st2client/st2client/formatters/doc.py:36— BaseFormatter.format has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, boolean chains 3, if/else 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShellScriptAction._get_script_arguments (cognitive 17) st2common/st2common/models/system/action.py:255— ShellScriptAction._get_script_arguments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
action_param_utils.cast_params (cognitive 17) st2common/st2common/models/utils/action_param_utils.py:91— action_param_utils.cast_params has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, error handling 2, ternaries 2, boolean chains 1, loops 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.
ConnectionRetryWrapper.run (cognitive 17) st2common/st2common/transport/connection_retry_wrapper.py:114— ConnectionRetryWrapper.run has cognitive complexity 17 (threshold 15). Drivers by points: error handling 10, if/else 5, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RuleViewController._append_view_properties (cognitive 16) st2api/st2api/controllers/v1/rule_views.py:110— RuleViewController._append_view_properties has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, ternaries 3, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BaseCLIApp.get_client (cognitive 16) st2client/st2client/base.py:76— BaseCLIApp.get_client has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, error handling 5, boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TraceListCommand.run_and_print (cognitive 16) st2client/st2client/commands/trace.py:173— TraceListCommand.run_and_print has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActionsRegistrar._register_action (cognitive 16) st2common/st2common/bootstrap/actionsregistrar.py:119— ActionsRegistrar._register_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BaseParallelSSHRunner.pre_run (cognitive 16) st2common/st2common/runners/paramiko_ssh_runner.py:83— BaseParallelSSHRunner.pre_run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
BaseParallelSSHRunner._get_result_status (cognitive 16) st2common/st2common/runners/paramiko_ssh_runner.py:214— BaseParallelSSHRunner._get_result_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, ternaries 4, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workflows.inspect_task_contents (cognitive 16) st2common/st2common/services/workflows.py:132— workflows.inspect_task_contents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 5, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workflows.request_rerun (cognitive 16) st2common/st2common/services/workflows.py:469— workflows.request_rerun has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 5, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
action_db.update_liveaction_status (cognitive 16) st2common/st2common/util/action_db.py:180— action_db.update_liveaction_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 4. 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.
visualize_action_chain.main (cognitive 16) tools/visualize_action_chain.py:37— visualize_action_chain.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (21 lines × 2) st2api/st2api/controllers/v1/actionexecutions.py:570— st2api/st2api/controllers/v1/actionexecutions.py:570-591 | st2api/st2api/controllers/v1/actionexecutions.py:655-675 — 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) st2common/st2common/services/action.py:277— st2common/st2common/services/action.py:277-295 | st2common/st2common/services/action.py:317-335 — 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 `st2common/st2common/services/action.py:277` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 6) st2common/st2common/bootstrap/actionsregistrar.py:45— st2common/st2common/bootstrap/actionsregistrar.py:45-64 | st2common/st2common/bootstrap/aliasesregistrar.py:42-61 | st2common/st2common/bootstrap/policiesregistrar.py:47-66 | st2common/st2common/bootstrap/rulesregistrar.py:44-59 | st2common/st2common/bootstrap/sensorsregistrar.py:43-62 | st2common/st2common/bootstrap/triggersregistrar.py:39-58 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `st2common/st2common/bootstrap/rulesregistrar.py:44` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16 lines × 2) st2api/st2api/controllers/v1/keyvalue.py:87— st2api/st2api/controllers/v1/keyvalue.py:87-103 | st2api/st2api/controllers/v1/keyvalue.py:155-170 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15 lines × 6) st2common/st2common/bootstrap/actionsregistrar.py:77— st2common/st2common/bootstrap/actionsregistrar.py:77-91 | st2common/st2common/bootstrap/aliasesregistrar.py:74-88 | st2common/st2common/bootstrap/policiesregistrar.py:79-94 | st2common/st2common/bootstrap/rulesregistrar.py:72-86 | st2common/st2common/bootstrap/sensorsregistrar.py:76-90 | st2common/st2common/bootstrap/triggersregistrar.py:72-86 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) st2common/st2common/cmd/download_pack.py:51— st2common/st2common/cmd/download_pack.py:51-65 | st2common/st2common/cmd/install_pack.py:53-68 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (14 lines × 3) contrib/packs/actions/pack_mgmt/download.py:41— contrib/packs/actions/pack_mgmt/download.py:41-55 | contrib/packs/actions/pack_mgmt/search.py:33-46 | contrib/packs/actions/pack_mgmt/setup_virtualenv.py:53-66 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (13 lines × 3) st2common/st2common/bootstrap/actionsregistrar.py:122— st2common/st2common/bootstrap/actionsregistrar.py:122-136 | st2common/st2common/bootstrap/policiesregistrar.py:138-152 | st2common/st2common/bootstrap/rulesregistrar.py:115-127 — the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once.
Duplicated block (9 lines × 4) st2client/st2client/commands/resource.py:446— st2client/st2client/commands/resource.py:446-454 | st2client/st2client/commands/resource.py:497-505 | st2client/st2client/commands/resource.py:539-547 | st2client/st2client/commands/resource.py:581-589 — 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 `st2client/st2client/commands/resource.py:446` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 4) st2api/st2api/controllers/v1/actionalias.py:171— st2api/st2api/controllers/v1/actionalias.py:171-178 | st2api/st2api/controllers/v1/runnertypes.py:84-91 | st2api/st2api/controllers/v1/triggers.py:116-124 | st2api/st2api/controllers/v1/triggers.py:259-266 — there are 4 copies across 3 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) contrib/packs/actions/pack_mgmt/unload.py:47— contrib/packs/actions/pack_mgmt/unload.py:47-52 | st2reactor/st2reactor/container/sensor_wrapper.py:191-195 — 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.
Low: request-host-used conf/HA/nginx/st2.conf.blueprint.sample:16— '$http_host' and '$host' variables may contain a malicious value from attacker controlled 'Host' request header. Use an explicitly configured host value or a allow list for validation. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Low: request-host-used conf/HA/nginx/st2.conf.controller.sample:21— '$http_host' and '$host' variables may contain a malicious value from attacker controlled 'Host' request header. Use an explicitly configured host value or a allow list for validation. This is a semgrep security-AUDIT rule: it reports that a sensitive construct is present, not that it is exploitable here. Confirm whether this site handles untrusted input or is reachable across a trust boundary — and apply the change where it is; where the construct is required by the platform or protocol it calls into, and carries no untrusted data (a syscall/FFI shim, a build- or debug-gated tool, a fixed local surface), record the review and leave the code as it is.
Low: request-host-used conf/nginx/st2.conf:16— '$http_host' and '$host' variables may contain a malicious value from attacker controlled 'Host' request header. Use an explicitly configured host value or a allow list for validation. This is a semgrep security-AUDIT rule reporting a POLICY that is absent or weaker than its recommendation, not an exploitable defect. Confirm whether the current setting is a deliberate decision for this repository — and apply the change where it is not; where it is (a policy your release process already enforces elsewhere, or one this repository has consciously opted out of), record the decision and leave the configuration as it is.
Low: plaintext-http-link st2api/st2api/templates/index.html:2— This link points to a plaintext HTTP URL. Prefer an encrypted HTTPS URL if possible.
D34 · Knowledge Freshness· Largest orphaned file · ×3
Largest orphaned file st2client/st2client/commands/action.py— One of the largest files with no living knowledge remaining — a reasonable place to start a read-through before the aggregate risk above bites.
Largest orphaned file st2common/st2common/services/workflows.py— One of the largest files with no living knowledge remaining — a reasonable place to start a read-through before the aggregate risk above bites.
Largest orphaned file contrib/runners/action_chain_runner/action_chain_runner/action_chain_runner.py— One of the largest files with no living knowledge remaining — a reasonable place to start a read-through before the aggregate risk above bites.
D11 · Test Reliability· Test reliability not included · ×1
Test reliability not included — Test source is present (.py) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
Rotate the exposed credentials — git history can't be un-committed — Some of these secrets are in git HISTORY: deleting the file does not remove them (the commit persists on every clone, fork and backup). The remediation is to ROTATE each historically-exposed credential and treat it as compromised — not to delete the file. Rewriting history is disruptive and unreliable across existing forks. (Working-tree-only secrets — no commit — can instead be removed from the file and moved to a secret store.)
Dormant codebase — 326 of 326 significant files have no living knowledge — the codebase as a whole is dormant, not 326 separate risks. Re-engage owners or document before change.
No build provenance — No SLSA provenance generation or build attestation found in CI — nothing binds a released artifact to the build that produced it, so a consumer cannot tell your artifact from a substituted one. Emit one from whichever pipeline releases the artifact — `cosign attest` (keyless or with your release key) records the build inputs against the artifact digest and needs nothing forge-specific; publish the attestation as a release asset alongside it.
No artifact signing — No artifact signing found in CI — sign your released artifacts with whatever your ecosystem ships (a GPG/minisign detached signature — or `cosign sign-blob` — over the release archives, or over a checksum file published alongside them, PEP 740 attestations via `pypa/gh-action-pypi-publish` under PyPI Trusted Publishing (OIDC) for wheels/sdists) so consumers can verify what you built.
D36 · Supply-chain Provenance & Signing· No SBOM · ×1
No SBOM — No SBOM generation or committed SBOM found — produce one with what your ecosystem ships (`cyclonedx-py` over the resolved Python environment/lockfile, `syft` (or `anchore/sbom-action` in CI) over the source tree or released image). Publish it as a release asset (`*.spdx.json` / `*.cdx.json`) so consumers can see what they are installing.
Coverage not included — suite not readable by the collector — Coverage NOT READ here — but this repository measures it: a Codecov configuration (.codecov.yml) shows that coverage is collected and tracked in your own CI. The built-in collector has no runner for this ecosystem (.py), so the analyzer could not read the number — a gap in the analyzer's language coverage, not an unmeasured repo. Not scored. To have the real number read, produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored.
Info — 2 finding(s)
D12 · Dependency Hygiene· Dependency hygiene not measured · ×1
Dependency hygiene not measured — dependency manifest found but not parsed for hygiene — This repository's dependency manifest (a Python pyproject.toml/requirements.txt (pip/uv/Poetry)) was found, but this pass cannot parse it for hygiene, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D38 wherever the manifest is OSV-readable.
D22 · Internal API Consistency· No exposed public API · ×1
No exposed public API — No intentionally-exposed types (IsPackable or .Contracts) to evaluate.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
trivy: not applicable — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
0
—
Run 019fcf5b-be23-76a5-8010-08a52c5a427b · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 12 · Warnings: 201 · Recommendations: 14 · Info: 2 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 05-08-2026 @ 00:38 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.