Files
msd-core/tests/no-unbounded-quantifier.rule.test.cjs
Tom Boucher 69e7afd0c7 chore(#3212): bounded quantifiers over document content — prohibition with teeth — Phase 4 (#3441)
* 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>
2026-08-14 10:02:28 -04:00

234 lines
7.7 KiB
JavaScript

'use strict';
/**
* no-unbounded-quantifier.rule.test.cjs
*
* RuleTester unit tests for the local/no-unbounded-quantifier ESLint rule
* (ADR-3212 §5/§7, epic #3212 Phase 4, #3415). Rows 1-13 per
* .gsd/phase/chore-3415-prohibition-with-teeth/50-test-matrix.md.
*
* NOTE: Fixture code strings must encode actual regex-literal backslashes
* (e.g. `\s`, `\S`, `\n`, `\d`) as doubled `\\s`/`\\S`/`\\n`/`\\d` inside the
* JavaScript string literals used for RuleTester `code` fields, so that the
* ESLint parser receives the intended source text (mirrors
* tests/no-crlf-fragile-split.rule.test.cjs's convention). For row 10's
* `new RegExp('[\s\S]*')` — the pattern is itself a STRING LITERAL in the
* target source, so its `\s`/`\S` need a further doubling in that source
* text (`\\s`/`\\S`), which then needs doubling AGAIN to survive our own
* JS string literal — four backslashes total before each `s`/`S`.
*/
const { test, describe } = require('node:test');
const assert = require('node:assert/strict');
const { RuleTester } = require('eslint');
const rule = require('../eslint-rules/no-unbounded-quantifier.cjs');
const ruleTester = new RuleTester({
languageOptions: {
ecmaVersion: 2022,
sourceType: 'commonjs',
},
});
// ─── module shape ─────────────────────────────────────────────────────────────
describe('no-unbounded-quantifier rule module', () => {
test('exports meta and create', () => {
assert.strictEqual(typeof rule.meta, 'object');
assert.strictEqual(typeof rule.create, 'function');
assert.strictEqual(rule.meta.type, 'problem');
assert.ok(rule.meta.messages.unboundedQuantifier, 'unboundedQuantifier message must exist');
});
});
// ─── INVALID (happy-path, rule fires) ─────────────────────────────────────────
describe('no-unbounded-quantifier: invalid (unboundedQuantifier fires)', () => {
test('row 1: [\\s\\S]* on readFileSync-derived content', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [],
invalid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[\\s\\S]*/);",
filename: 'tests/foo.test.cjs',
errors: [{ messageId: 'unboundedQuantifier' }],
},
],
});
});
test('row 3: flags the #2128 [^)\\n]* shape', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [],
invalid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[^)\\n]*/);",
filename: 'tests/foo.test.cjs',
errors: [{ messageId: 'unboundedQuantifier' }],
},
],
});
});
test('row 5: flags dotAll . with unbounded *', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [],
invalid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/.*text/s);",
filename: 'tests/foo.test.cjs',
errors: [{ messageId: 'unboundedQuantifier' }],
},
],
});
});
test('row 10: flags new RegExp() built from a literal string', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [],
invalid: [
{
// Source text: new RegExp('[\\s\\S]*').test(fs.readFileSync(p, 'utf8'))
code: "const ok = new RegExp('[\\\\s\\\\S]*').test(fs.readFileSync(p, 'utf8'));",
filename: 'tests/foo.test.cjs',
errors: [{ messageId: 'unboundedQuantifier' }],
},
],
});
});
test('row 12: flags a lazy [\\s\\S]+? as unbounded too', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [],
invalid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[\\s\\S]+?/);",
filename: 'tests/foo.test.cjs',
errors: [{ messageId: 'unboundedQuantifier' }],
},
],
});
});
test('row 13: flags an open-ended {0,} as unbounded', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [],
invalid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[\\s\\S]{0,}/);",
filename: 'tests/foo.test.cjs',
errors: [{ messageId: 'unboundedQuantifier' }],
},
],
});
});
});
// ─── VALID (negative) ──────────────────────────────────────────────────────────
describe('no-unbounded-quantifier: valid cases', () => {
test('row 2: does not flag an already-bounded [\\s\\S]{0,200}', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[\\s\\S]{0,200}/);",
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 4: does not flag the #2128-fixed {0,200} form', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[^)\\n]{0,200}/);",
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 6: does not flag plain . without dotAll', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/.*text/);",
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 7: does not flag a wide (3+ unit) negated class', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/[^abc]*/);",
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 8: does not flag a narrow class like \\d*', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: "const m = fs.readFileSync(p, 'utf8').match(/\\d*/);",
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 9: does not flag a non-readFileSync-derived receiver', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: 'const m = someShortConstant.match(/[\\s\\S]*/);',
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 11: does not attempt to inspect a non-literal new RegExp() pattern', () => {
ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: "const pat = someVar; readFileSync(p, 'utf8').match(new RegExp(pat));",
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
});
test('row 14: does not hang on an adversarial run of unclosed negated classes (quadratic-scan regression)', () => {
// Security review finding: hasUnboundedBroadQuantifier's inner negated-class
// scan previously ran unbounded from every `[^` offset with no closing `]`,
// making this O(n^2). The fix bails once units > 2. This test's only
// assertion is that RuleTester.run() completes at all (a stuck inner scan
// would hang the test rather than fail it) — no wall-clock threshold here.
const adversarialPattern = '[^' + '[^'.repeat(50000);
const result = ruleTester.run('no-unbounded-quantifier', rule, {
valid: [
{
code: `const m = fs.readFileSync(p, 'utf8').match(new RegExp('${adversarialPattern}'));`,
filename: 'tests/foo.test.cjs',
},
],
invalid: [],
});
assert.strictEqual(result, undefined);
});
});