* feat(#3415): ship local/no-unbounded-quantifier, burn down ReDoS class Phase 4 of epic #3212 (ADR-3212 §5/§7, the final phase). New rule flags an unbounded */+/{n,} quantifier over a broad character class ([\s\S], dotAll ., or a 1-2-unit negated class like [^\n]/[^)\n] — the exact #2128-fixed shape) applied to a regex whose match target is data-flow-traced to readFileSync content. eslint-rules/lib/readfilesync-trace.cjs extracts the data-flow tracer shared with no-crlf-fragile-split (Phase 2) rather than a second copy — no-crlf-fragile-split refactored onto it with zero behavior change, parity-tested. Real triage, not 798 mechanical edits: the ADR's census (2026-08-08) screened every unbounded quantifier in the tree unscoped. Correctly scoped to readFileSync-derived content (matching Phase 2's own G2/G3 scoping), the rule found 162 real hits across two detection waves — the second wave (93) surfaced only after a genuine off-by-one bug in this rule's own first draft was caught while writing its RuleTester tests and fixed (the bug silently missed every directly-quantified [\s\S]* with no gap before the quantifier — exactly the class this rule exists to catch). 3 hits landed in production src/ (commands.cts, milestone.cts, roadmap.cts) and were each empirically timed against adversarial input (matching #2128's own measured-not-assumed precedent) — all confirmed linear-time/benign, left unbounded with a measured-evidence comment rather than mechanically bounded. The remaining 159 are test-file fixture parsing (test-author-controlled, fixed-size content, not adversarial input) — each suppressed with a specific, non-generic reason. Zero functional behavior changed anywhere in this diff. tests/no-pending-3212-markers.test.cjs locks the epic's own closing invariant (ADR §7: "assert zero pending #3212 markers remain") — ground truth confirmed trivially true today (no phase left any such marker behind), now regression-locked going forward. Design: .gsd/phase/chore-3415-prohibition-with-teeth/40-design.md Test matrix: .gsd/phase/chore-3415-prohibition-with-teeth/50-test-matrix.md Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> * fix(#3415): correct rule category mislabel, add CI test-scope entry An orthogonal Standards-axis review found eslint-rules/no-unbounded-quantifier.cjs mistakenly carried meta.docs.category: 'Portability', copied from a sibling rule without realizing what that implied: docs/contributing/cross-platform- portability-rules.md governs an ADR-1703 rule family under a hard "zero escape hatches" contract (tests/portability-rule-disable-ban.test.cjs's PROTECTED_RULES bans eslint-disable for those rules entirely). This rule is not part of that family — it's ADR-3212 (ReDoS/CWE-1333), a different epic — and its eslint-disable-next-line suppressions (159 of them, added earlier this same phase after empirical benign-verification) are an intentional, correct design, not a bypass. Corrected to category: 'Best Practices', matching the actual precedent (no-adhoc-regex-escape.cjs, Phase 1 of the same epic, which is also correctly outside PROTECTED_RULES), and the rule's own docstring now states this explicitly so a future reader doesn't have to re-derive it. Also registers a new scripts/ci-test-scope.cjs bucket so editing this rule or the shared eslint-rules/lib/readfilesync-trace.cjs helper re-runs their own test suites under targeted CI selection — was previously unregistered and invisible to that fast-path (this PR's own gsd-test checkpoint runs the full suite regardless, so this only affects future narrowly-scoped PRs). Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> * fix(#3415): bound no-unbounded-quantifier's own scanner (CWE-1333, ironic) Security review found the rule meant to catch algorithmic-complexity bugs had one of its own: hasUnboundedBroadQuantifier's negated-class inner scan walked from each `[^` occurrence to the next `]` (or EOF) with no bound, while the outer loop only ever advanced by one character — O(n²) total work on a pattern with many unclosed `[^` runs. Runs unconditionally inside checkPattern on any `new RegExp('literal string')` argument in any linted file, before the (cheap) readFileSync data-flow gate — so a single crafted string literal, no valid regex syntax required, could make `npm run lint` / CI hang. Empirically confirmed both the bug and the fix: pre-fix, n=4000/8000/ 16000/32000 chars took 30.8/115.6/463.8/1874.3ms (~4x work per 2x n, quadratic); extrapolated, the 300000-char repro from the finding would run ~165s. Post-fix (bail the inner scan once units exceeds the rule's own 1-2-unit scope, rather than continuing to hunt for a closing `]`), the same 300000-char input runs in 8.7ms via the real rule module, independently reconfirmed at 18ms via a fresh Linter.verify() call. New regression row in tests/no-unbounded-quantifier.rule.test.cjs asserts the RuleTester run on a 50000-char adversarial pattern completes and returns a defined result — no wall-clock assertion (CLAUDE.md Clock Seams / local/no-elapsed-assertion). Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> * fix(#3415): triage 3 new sites, re-raise ceiling after upstream batch next merged 12 more PRs during this PR's review. Two consequences: - tests/edit-phase.test.cjs (fix #3262, unrelated) added 3 new content.match(/<tag>([\s\S]*?)<\/tag>/) reads of this repo's own workflow .md content — the same Class A pattern as the ~159 sites already triaged elsewhere in this PR. Suppressed with the same established reason. - lint-allow-test-rule-refs' ratchet ceiling needed re-raising again (301 -> 303) for the same reason as the two prior bumps: organic growth from unrelated, already-reviewed PRs landing concurrently, not a defect in this branch's own diff. Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> --------- Co-authored-by: sim <sim@local> Co-authored-by: Claude Sonnet 5 <noreply@anthropic.com>
126 lines
6.1 KiB
JavaScript
126 lines
6.1 KiB
JavaScript
'use strict';
|
|
// allow-test-rule: architectural-invariant (see #1531)
|
|
// writeStateMd's "scan happens INSIDE the lock" property is a concurrency invariant.
|
|
// A single-threaded test cannot observe the difference between scan-before-lock and
|
|
// scan-after-lock unless something mutates the disk in the window between the two.
|
|
// The afterAcquire test hook (fired inside writeStateMd right after the lock is
|
|
// taken) is the deterministic seam that simulates a concurrent writer landing in
|
|
// exactly that window — the only level at which the TOCTOU is observable.
|
|
|
|
/**
|
|
* M8 — writeStateMd scans the disk (syncStateFrontmatter / PLAN-SUMMARY count)
|
|
* BEFORE taking the lock, so a concurrent writer that commits a new PLAN/SUMMARY
|
|
* between our scan and our lock acquisition makes writeStateMd stamp STALE
|
|
* progress counts (a lost-update of the frontmatter progress block).
|
|
* readModifyWriteStateMd (the atomic variant) correctly scans INSIDE its lock —
|
|
* this non-atomic variant was the outlier.
|
|
*
|
|
* Deterministic repro (no wall-clock, no threads): the afterAcquire test hook
|
|
* fires inside writeStateMd immediately after the lock is acquired and adds a
|
|
* second PLAN file to the phase dir — simulating a concurrent writer who landed
|
|
* in the scan→lock window. The written frontmatter's progress.total_plans then
|
|
* reveals whether the scan ran before the hook (stale: 1) or after it (fresh: 2).
|
|
*
|
|
* RED (pre-fix): scan runs BEFORE acquire → before the hook → total_plans = 1.
|
|
* GREEN (post-fix): scan runs AFTER acquire → after the hook → total_plans = 2.
|
|
*
|
|
* Recurring closed family this guards: #500 / #905 / #1230 (STATE.md write
|
|
* corruption). #453 deleted the flaky race tests in favor of seams, so this exact
|
|
* path was under-tested — the hook restores deterministic coverage.
|
|
*/
|
|
|
|
const { test, describe, beforeEach, afterEach } = require('node:test');
|
|
const assert = require('node:assert/strict');
|
|
const fs = require('node:fs');
|
|
const path = require('node:path');
|
|
const os = require('node:os');
|
|
|
|
const stateMod = require('../gsd-core/bin/lib/state.cjs');
|
|
const { writeStateMd } = stateMod;
|
|
const { cleanup } = require('./helpers.cjs');
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
// Helpers
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
const MINIMAL_STATE_MD = [
|
|
'# Project State',
|
|
'',
|
|
'**Status:** Planning',
|
|
'**Current Phase:** 01',
|
|
].join('\n') + '\n';
|
|
|
|
/** Parse progress.total_plans out of the STATE.md frontmatter block. */
|
|
function readTotalPlans(statePath) {
|
|
const written = fs.readFileSync(statePath, 'utf-8');
|
|
// eslint-disable-next-line local/no-unbounded-quantifier -- parses STATE.md this test just wrote via a fixture, fixed-size test-controlled content
|
|
const fmMatch = written.match(/^---\r?\n([\s\S]*?)\r?\n---/);
|
|
assert.ok(fmMatch, 'STATE.md must have a frontmatter block after writeStateMd');
|
|
const m = fmMatch[1].match(/total_plans:\s*(\d+)/);
|
|
assert.ok(m, 'frontmatter must carry a progress.total_plans line');
|
|
return parseInt(m[1], 10);
|
|
}
|
|
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
// M8 — afterAcquire hook proves the scan runs INSIDE the lock
|
|
// ─────────────────────────────────────────────────────────────────────────────
|
|
|
|
describe('M8: writeStateMd scans disk AFTER acquiring the lock (scan-in-lock)', () => {
|
|
let tmpDir;
|
|
let statePath;
|
|
let phaseDir;
|
|
|
|
beforeEach(() => {
|
|
tmpDir = fs.mkdtempSync(path.join(os.tmpdir(), 'gsd-m8-'));
|
|
const planningDir = path.join(tmpDir, '.planning');
|
|
phaseDir = path.join(planningDir, 'phases', '01-init');
|
|
fs.mkdirSync(phaseDir, { recursive: true });
|
|
// Start with exactly ONE plan file on disk.
|
|
fs.writeFileSync(path.join(phaseDir, '01-PLAN.md'), '# Plan 01\n');
|
|
statePath = path.join(planningDir, 'STATE.md');
|
|
fs.writeFileSync(statePath, MINIMAL_STATE_MD);
|
|
});
|
|
|
|
afterEach(() => {
|
|
stateMod._resetStateLockTestHooks();
|
|
try { fs.unlinkSync(statePath + '.lock'); } catch { /* ok */ }
|
|
cleanup(tmpDir);
|
|
});
|
|
|
|
test('a PLAN added in the post-acquire window is reflected in the written progress count', () => {
|
|
// The hook simulates a concurrent writer who commits a second PLAN file in the
|
|
// window between scan and lock. It MUST be observed only if the scan runs after
|
|
// the lock (and therefore after this hook fires).
|
|
let fired = 0;
|
|
stateMod._setStateLockTestHooks({
|
|
afterAcquire() {
|
|
fired++;
|
|
fs.writeFileSync(path.join(phaseDir, '02-PLAN.md'), '# Plan 02\n');
|
|
},
|
|
});
|
|
|
|
writeStateMd(statePath, MINIMAL_STATE_MD, tmpDir);
|
|
|
|
assert.equal(fired, 1, 'afterAcquire hook must fire exactly once inside writeStateMd');
|
|
|
|
const totalPlans = readTotalPlans(statePath);
|
|
// RED pre-fix: scan ran before the hook → counts only 01-PLAN.md → 1.
|
|
// GREEN post-fix: scan ran after the hook → counts both PLANs → 2.
|
|
assert.equal(
|
|
totalPlans, 2,
|
|
'writeStateMd must scan the disk INSIDE the lock (after the concurrent ' +
|
|
'writer landed), stamping total_plans=2 — not the stale pre-lock count of 1'
|
|
);
|
|
});
|
|
|
|
test('single-threaded callers (no hook) are byte-for-behaviour unchanged: count = 1', () => {
|
|
// Regression guard: with no concurrent writer (hook unset), the count must be
|
|
// exactly the on-disk truth — the fix must NOT change the uncontended result.
|
|
writeStateMd(statePath, MINIMAL_STATE_MD, tmpDir);
|
|
assert.equal(
|
|
readTotalPlans(statePath), 1,
|
|
'uncontended writeStateMd must stamp the real on-disk plan count (1)'
|
|
);
|
|
});
|
|
});
|