tamperward 2.24.2 → 2.24.4

package/dist/cli/index.js

@@ -3713,6 +3713,83 @@ var init_lint_suppression = __esm({
   }
 });
 
+// src/detectors/runner-chain.ts
+function readRunnerChain(root, props) {
+  let runner = root;
+  const modifiers = [];
+  let table = null;
+  let skipMarker = null;
+  let skipIndex = -1;
+  for (let i = 0; i < props.length; i++) {
+    const p = props[i];
+    if (table) return null;
+    if (RUNNER_NAMES.has(p) && modifiers.length === 0) {
+      runner = p;
+      continue;
+    }
+    if (CHAIN_MODIFIERS.has(p)) {
+      modifiers.push(p);
+      const marker = skipMarkerOf(p);
+      if (marker && !skipMarker) {
+        skipMarker = marker;
+        skipIndex = i;
+      }
+      continue;
+    }
+    const t = tableOf(p);
+    if (t) {
+      table = t;
+      continue;
+    }
+    return null;
+  }
+  return { runner, modifiers, table, skipMarker, skipIndex };
+}
+function readCallee(expr) {
+  const props = [];
+  let cur = expr;
+  while (ts.isPropertyAccessExpression(cur) || ts.isElementAccessExpression(cur)) {
+    if (ts.isPropertyAccessExpression(cur)) {
+      props.unshift(cur.name.text);
+    } else {
+      const arg = cur.argumentExpression;
+      if (!ts.isStringLiteralLike(arg)) return null;
+      props.unshift(arg.text);
+    }
+    cur = cur.expression;
+  }
+  if (!ts.isIdentifier(cur)) return null;
+  return readRunnerChain(cur.text, props);
+}
+function readTableCallee(expr) {
+  const head = ts.isCallExpression(expr) ? expr.expression : ts.isTaggedTemplateExpression(expr) ? expr.tag : null;
+  if (!head) return null;
+  const chain = readCallee(head);
+  return chain?.table ? chain : null;
+}
+var RUNNER_NAMES, CHAIN_MODIFIERS, skipMarkerOf, tableOf;
+var init_runner_chain = __esm({
+  "src/detectors/runner-chain.ts"() {
+    "use strict";
+    init_ts_lazy();
+    RUNNER_NAMES = /* @__PURE__ */ new Set(["it", "test", "describe", "suite"]);
+    CHAIN_MODIFIERS = /* @__PURE__ */ new Set([
+      "concurrent",
+      "sequential",
+      "shuffle",
+      "serial",
+      "parallel",
+      "skip",
+      "only",
+      "todo",
+      "fails",
+      "failing"
+    ]);
+    skipMarkerOf = (name) => name === "skip" || name === "only" || name === "todo" ? name : null;
+    tableOf = (name) => name === "each" || name === "for" ? name : null;
+  }
+});
+
 // src/detectors/test-skip.ts
 import { posix as posix2 } from "node:path";
 function pyMarkAliases(source) {
@@ -3742,6 +3819,47 @@ function matchesOutsideString(p, content, lang) {
   }
   return false;
 }
+function afterLinesOf(c) {
+  const out3 = /* @__PURE__ */ new Map();
+  if (c.after != null) {
+    c.after.split("\n").forEach((l, i) => out3.set(i + 1, l));
+    return out3;
+  }
+  for (const h of c.hunks) for (const l of h.lines) if (l.newLine != null && l.type !== "del") out3.set(l.newLine, l.content);
+  return out3;
+}
+function contextSkipHits(c, lang) {
+  if (lang !== "go" && lang !== "rs") return [];
+  const lines = afterLinesOf(c);
+  const hits = [];
+  for (const l of addedLines(c)) {
+    if (l.newLine == null) continue;
+    if (lang === "go") {
+      const m = GO_TEST_MAIN.exec(l.content);
+      if (!m) continue;
+      const runs = new RegExp("\\b" + m[1] + "\\.Run\\(\\)");
+      let ran = false;
+      for (const [, text] of lines) if (runs.test(text) && !isCommentLine(text.trim(), lang)) ran = true;
+      if (!ran) hits.push({ line: l.newLine, why: `a TestMain that never calls ${m[1]}.Run() (no test in the package runs)`, evidence: l.content.trim() });
+      continue;
+    }
+    const cfg = RS_CFG.exec(l.content);
+    if (!cfg || cfg[1].trim() === "test") continue;
+    let first = l.newLine;
+    while (RS_ATTR.test(lines.get(first - 1) ?? "")) first--;
+    let at = l.newLine + 1;
+    while (RS_ATTR.test(lines.get(at) ?? "") || lines.has(at) && !/\S/.test(lines.get(at) ?? "")) at++;
+    const item = lines.get(at) ?? "";
+    let besideTest = false;
+    for (let i = first; i < at; i++) if (RS_TEST_ATTR.test(lines.get(i) ?? "")) besideTest = true;
+    if (RS_MOD.test(item)) {
+      hits.push({ line: l.newLine, why: "a #[cfg(\u2026)] on the test module (the tests are compiled out under every ordinary configuration)", evidence: l.content.trim() });
+    } else if (besideTest && RS_FN.test(item)) {
+      hits.push({ line: l.newLine, why: "a #[cfg(\u2026)] beside #[test] (the test is compiled out under every ordinary configuration)", evidence: l.content.trim() });
+    }
+  }
+  return hits;
+}
 function scriptKind2(path) {
   if (/\.tsx$/i.test(path)) return ts.ScriptKind.TSX;
   if (/\.jsx$/i.test(path)) return ts.ScriptKind.JSX;
@@ -3886,12 +4004,14 @@ function staticPropertyName(expr, ctx, strings) {
 }
 function runnerChain(expr, ctx, binder, strings) {
   const props = [];
+  const propNodes = [];
   const causes = [];
   let cur = expr;
   let terminalNode = expr;
   while (ts.isPropertyAccessExpression(cur) || ts.isElementAccessExpression(cur)) {
     if (ts.isPropertyAccessExpression(cur)) {
       props.unshift(cur.name.text);
+      propNodes.unshift(cur.name);
       if (props.length === 1) terminalNode = cur.name;
       cur = cur.expression;
       continue;
@@ -3900,6 +4020,7 @@ function runnerChain(expr, ctx, binder, strings) {
     const property = staticPropertyName(cur.argumentExpression, ctx, strings);
     if (!property) return null;
     props.unshift(property.name);
+    propNodes.unshift(cur.argumentExpression);
     causes.push(...property.causes);
     if (props.length === 1) terminalNode = cur.argumentExpression;
     cur = cur.expression;
@@ -3916,17 +4037,21 @@ function runnerChain(expr, ctx, binder, strings) {
     }
   } else {
     namespace = requiredModule(cur);
+    if (namespace == null && readTableCallee(cur)) return null;
     verdict2 = namespace == null ? UNKNOWN : NON_RUNNER;
   }
   let root = ts.isIdentifier(cur) ? cur.text : "";
   if (namespace != null && props.length > 0) {
     verdict2 = withCause(binder.memberOf(namespace, props[0]), cur);
-    if (verdict2.kind === "runner") root = props.shift() ?? root;
+    if (verdict2.kind === "runner") {
+      root = props.shift() ?? root;
+      propNodes.shift();
+    }
   }
   if (verdict2.kind === "unknown") return "unknown";
   if (verdict2.kind === "non-runner") return null;
   causes.push(...verdict2.causes);
-  return { root, props, terminalNode, causes };
+  return { root, props, propNodes, terminalNode, causes };
 }
 function optionDisables(value) {
   return !(value.kind === ts.SyntaxKind.FalseKeyword || ts.isNumericLiteral(value) && Number(value.text) === 0);
@@ -3965,8 +4090,9 @@ function semanticSkipHits(ctx, binder) {
         const last = lineOf(callee.getEnd());
         for (let line = first; line <= last; line++) unowned.add(line);
       } else if (chain) {
-        const { props, terminalNode, causes } = chain;
+        const { root, props, propNodes, terminalNode, causes } = chain;
         const terminal = props.at(-1);
+        const shape = readRunnerChain(root, props);
         const push = (target, extraCauses, why) => {
           hits.push({
             semanticKey: `${callKey}\0${why}`,
@@ -3976,13 +4102,13 @@ function semanticSkipHits(ctx, binder) {
             evidence: callText
           });
         };
-        if (terminal && (terminal === "skip" || terminal === "only" || terminal === "todo") && props.slice(0, -1).every((p) => JS_CHAIN_MODIFIERS.has(p) || JS_RUNNERS.has(p))) {
-          push(terminalNode, [], "a .skip/.only/.todo marker");
+        if (shape?.skipMarker) {
+          push(propNodes[shape.skipIndex] ?? terminalNode, [], "a .skip/.only/.todo marker");
         } else if (terminal && ["skipIf", "runIf"].includes(terminal) && props.length === 1) {
           push(terminalNode, [], "a .skipIf()/.runIf() condition (the test runs only when the condition allows)");
         } else if (terminal && ["fails", "failing"].includes(terminal) && props.length === 1) {
           push(terminalNode, [], "a .fails/.failing marker (the test now passes by failing)");
-        } else if (terminal === "each" && props.length === 1 && node.arguments.length > 0 && ts.isArrayLiteralExpression(node.arguments[0]) && node.arguments[0].elements.length === 0) {
+        } else if (shape?.table === "each" && node.arguments.length > 0 && ts.isArrayLiteralExpression(node.arguments[0]) && node.arguments[0].elements.length === 0) {
           push(terminalNode, [], "an empty .each table (no case ever runs)");
         }
         if (props.length === 0) {
@@ -4062,11 +4188,12 @@ function astSkipHits(c, resolvers) {
   }
   return { hits, authoritative: true, unowned: analysis.unowned };
 }
-var RULE4, acc, JS_RUNNER, JS_MOD, GO_SKIP_PATTERNS, PY_MARK, PY_CONFTEST_PATTERNS, PY_MARK_ALIAS, PY_DECORATOR, PATTERNS2, JS_RUNNERS, JS_CHAIN_MODIFIERS, JS_DEFAULT_RUNNER_MODULES, JS_TEST_MODULES, RUNNER2, NON_RUNNER, UNKNOWN, withCause, MODULE_EXTENSIONS, RunnerResolver, ModuleBinder, NO_AST, testSkip;
+var RULE4, acc, JS_RUNNER, JS_MOD, JVM_CONDITIONAL, GO_SKIP_PATTERNS, PY_MARK, PY_CONFTEST_PATTERNS, PY_MARK_ALIAS, PY_DECORATOR, PATTERNS2, JS_RUNNERS, JS_DEFAULT_RUNNER_MODULES, JS_TEST_MODULES, GO_TEST_MAIN, RS_CFG, RS_ATTR, RS_TEST_ATTR, RS_MOD, RS_FN, RUNNER2, NON_RUNNER, UNKNOWN, withCause, MODULE_EXTENSIONS, RunnerResolver, ModuleBinder, NO_AST, testSkip;
 var init_test_skip = __esm({
   "src/detectors/test-skip.ts"() {
     "use strict";
     init_ts_lazy();
+    init_runner_chain();
     init_select();
     init_policy();
     init_repo();
@@ -4076,6 +4203,7 @@ var init_test_skip = __esm({
     acc = (names) => `(?:\\s*\\.\\s*(?:${names})(?![\\w$])|\\s*\\[\\s*['"\`](?:${names})['"\`]\\s*\\])`;
     JS_RUNNER = "\\b(?:it|test|describe|suite)";
     JS_MOD = "concurrent|sequential|shuffle|serial|parallel";
+    JVM_CONDITIONAL = /@(?:[\w.]+\.)?(?:EnabledIf|DisabledIf)\w*\b/;
     GO_SKIP_PATTERNS = [
       { re: /\b\w+\.Skip(?:f|Now)?\(/, why: "a runtime t.Skip()/Skipf()/SkipNow() call" },
       { re: /\bT\(\)\.Skip(?:f|Now)?\(/, why: "a runtime T().Skip()/Skipf()/SkipNow() call (testify suite)" }
@@ -4142,7 +4270,10 @@ var init_test_skip = __esm({
         ...GO_SKIP_PATTERNS,
         // #441: any receiver, and testify's T()
         { re: /\bif\s+testing\.Short\(\)/, why: "a testing.Short() guard (the body is skipped under -short)" },
-        { re: /^\s*\/\/\s*(?:go:build|\+build)\s+ignore\b/, why: "a build-ignore constraint (the file is excluded from the test run)", comment: true }
+        // Any constraint on a `_test.go` — `ignore`, `integration`, `never`, `!ci` — takes
+        // the file out of the default `go test ./...` run; the tag's name is the agent's
+        // to choose (#431).
+        { re: /^\s*\/\/\s*(?:go:build|\+build)\b/, why: "a build constraint on a test file (the file is excluded from the default test run)", comment: true }
       ],
       rs: [
         { re: /#\[ignore\b/, why: "an #[ignore] attribute (the test no longer runs by default)" },
@@ -4153,14 +4284,19 @@ var init_test_skip = __esm({
         { re: /(?:^|[\s;{(])x(?:it|describe|context|specify|example)\s*[('"]/, why: "an x-prefixed disabled example" },
         { re: /(?:^|[\s;{(])f(?:it|describe|context)\s*[('"]/, why: "an f-prefixed focused example (narrows the suite)" },
         { re: /\b(?:skip|pending):\s*(?:true|['"])/, why: "a skip/pending metadata flag" },
-        { re: /^\s*(?:it|specify|example)\s+(['"])(?:(?!\1).)*\1\s*$/, why: "an example with no block (RSpec reports it as pending)" }
+        { re: /^\s*(?:it|specify|example)\s+(['"])(?:(?!\1).)*\1\s*$/, why: "an example with no block (RSpec reports it as pending)" },
+        // `it 'x', if: false do` — RSpec's conditional filter with a constant that never
+        // lets the example run (#431). `if: ENV['SLOW']` is a real condition and passes.
+        { re: /(?:^|[\s;{(])(?:it|specify|example|describe|context|scenario|feature)\s*[('"].*(?:\bif:\s*false\b|\bunless:\s*true\b|:if\s*=>\s*false\b|:unless\s*=>\s*true\b)/, why: "a constant-false if:/unless: filter (the example never runs)" }
       ],
       java: [
         { re: /@(?:[\w.]+\.)?(?:Ignore|Disabled)\b/, why: "an @Ignore/@Disabled annotation" },
+        { re: JVM_CONDITIONAL, why: "a conditional-execution annotation (@EnabledIf\u2026 / @DisabledIf\u2026: the test runs only when the condition allows)" },
         { re: /\bassume(?:True\(\s*false|False\(\s*true)\s*[,)]/, why: "an assumption that never holds (the test aborts as skipped)" }
       ],
       kt: [
         { re: /@(?:[\w.]+\.)?(?:Ignore|Disabled)\b/, why: "an @Ignore/@Disabled annotation" },
+        { re: JVM_CONDITIONAL, why: "a conditional-execution annotation (@EnabledIf\u2026 / @DisabledIf\u2026: the test runs only when the condition allows)" },
         { re: /\bassume(?:True\(\s*false|False\(\s*true)\s*[,)]/, why: "an assumption that never holds (the test aborts as skipped)" }
       ],
       php: [{ re: /\bmarkTest(?:Skipped|Incomplete)\(/, why: "a markTestSkipped()/markTestIncomplete() call" }],
@@ -4172,7 +4308,6 @@ var init_test_skip = __esm({
       ]
     };
     JS_RUNNERS = /* @__PURE__ */ new Set(["it", "test", "describe", "suite"]);
-    JS_CHAIN_MODIFIERS = /* @__PURE__ */ new Set(["concurrent", "sequential", "shuffle", "serial", "parallel"]);
     JS_DEFAULT_RUNNER_MODULES = /* @__PURE__ */ new Set(["node:test", "node:test/promises", "@playwright/test"]);
     JS_TEST_MODULES = /* @__PURE__ */ new Set([
       "vitest",
@@ -4183,6 +4318,12 @@ var init_test_skip = __esm({
       "bun:test",
       "@playwright/test"
     ]);
+    GO_TEST_MAIN = /^func\s+TestMain\s*\(\s*(\w+)\s+\*testing\.M\s*\)/;
+    RS_CFG = /^\s*#\[cfg\((.*)\)\]\s*$/;
+    RS_ATTR = /^\s*#!?\[/;
+    RS_TEST_ATTR = /^\s*#\[[\w:]*test\b/;
+    RS_MOD = /^\s*(?:pub(?:\([^)]*\))?\s+)?mod\s+\w+/;
+    RS_FN = /^\s*(?:pub(?:\([^)]*\))?\s+)?(?:async\s+)?(?:unsafe\s+)?fn\s+\w+/;
     RUNNER2 = { kind: "runner", causes: [] };
     NON_RUNNER = { kind: "non-runner" };
     UNKNOWN = { kind: "unknown" };
@@ -4474,6 +4615,18 @@ var init_test_skip = __esm({
               );
             }
           }
+          for (const hit of contextSkipHits(c, lang)) {
+            astHitLines.add(hit.line);
+            out3.push(
+              makeFinding(RULE4, policy, {
+                file: c.path,
+                line: hit.line,
+                message: `Test skipped or narrowed: ${hit.why}.`,
+                evidence: hit.evidence,
+                remediation: "Make the test pass rather than skipping it. If it is genuinely obsolete, a human must sign off."
+              })
+            );
+          }
           if (lang === "py") {
             for (const hit of pyAliasDecoratorHits(c)) {
               if (hit.line != null) astHitLines.add(hit.line);
@@ -7872,12 +8025,297 @@ They WILL FAIL in v10.0.0
   }
 });
 
+// src/detectors/reachability.ts
+function constTruth(expr) {
+  const v = constValue(expr);
+  if (v === null) return null;
+  return v.kind === "unknown" ? v.truthy : Boolean(v.value);
+}
+function constValue(expr) {
+  if (ts.isParenthesizedExpression(expr)) return constValue(expr.expression);
+  if (expr.kind === ts.SyntaxKind.TrueKeyword) return { kind: "value", value: true };
+  if (expr.kind === ts.SyntaxKind.FalseKeyword) return { kind: "value", value: false };
+  if (expr.kind === ts.SyntaxKind.NullKeyword) return { kind: "value", value: null };
+  if (ts.isIdentifier(expr)) {
+    if (expr.text === "undefined") return { kind: "value", value: void 0 };
+    if (expr.text === "NaN") return { kind: "value", value: NaN };
+    return null;
+  }
+  if (ts.isNumericLiteral(expr)) return { kind: "value", value: Number(expr.text) };
+  if (ts.isBigIntLiteral(expr)) return { kind: "unknown", truthy: !/^0+n$/.test(expr.text) };
+  if (ts.isStringLiteralLike(expr)) return { kind: "value", value: expr.text };
+  if (ts.isVoidExpression(expr)) return { kind: "value", value: void 0 };
+  if (ts.isPrefixUnaryExpression(expr)) {
+    if (expr.operator === ts.SyntaxKind.ExclamationToken) {
+      const inner = constTruth(expr.operand);
+      return inner === null ? null : { kind: "value", value: !inner };
+    }
+    if (expr.operator === ts.SyntaxKind.MinusToken || expr.operator === ts.SyntaxKind.PlusToken) {
+      const inner = constValue(expr.operand);
+      if (inner === null || inner.kind !== "value" || typeof inner.value !== "number") return null;
+      return { kind: "value", value: expr.operator === ts.SyntaxKind.MinusToken ? -inner.value : inner.value };
+    }
+    return null;
+  }
+  if (ts.isBinaryExpression(expr)) {
+    const op = expr.operatorToken.kind;
+    if (op === ts.SyntaxKind.AmpersandAmpersandToken || op === ts.SyntaxKind.BarBarToken) {
+      const l2 = constTruth(expr.left);
+      const r2 = constTruth(expr.right);
+      const and = op === ts.SyntaxKind.AmpersandAmpersandToken;
+      if (and) {
+        if (l2 === false || r2 === false) return { kind: "unknown", truthy: false };
+        if (l2 === true) return r2 === null ? null : { kind: "unknown", truthy: r2 };
+        if (r2 === true) return l2 === null ? null : { kind: "unknown", truthy: l2 };
+        return null;
+      }
+      if (l2 === true || r2 === true) return { kind: "unknown", truthy: true };
+      if (l2 === false) return r2 === null ? null : { kind: "unknown", truthy: r2 };
+      if (r2 === false) return l2 === null ? null : { kind: "unknown", truthy: l2 };
+      return null;
+    }
+    const l = constValue(expr.left);
+    const r = constValue(expr.right);
+    if (l === null || r === null || l.kind !== "value" || r.kind !== "value") return null;
+    const a = l.value;
+    const b = r.value;
+    switch (op) {
+      case ts.SyntaxKind.EqualsEqualsEqualsToken:
+        return { kind: "value", value: a === b };
+      case ts.SyntaxKind.ExclamationEqualsEqualsToken:
+        return { kind: "value", value: a !== b };
+      case ts.SyntaxKind.EqualsEqualsToken:
+        return { kind: "value", value: a == b };
+      case ts.SyntaxKind.ExclamationEqualsToken:
+        return { kind: "value", value: a != b };
+      default:
+        break;
+    }
+    if (typeof a === "number" && typeof b === "number") {
+      switch (op) {
+        case ts.SyntaxKind.LessThanToken:
+          return { kind: "value", value: a < b };
+        case ts.SyntaxKind.LessThanEqualsToken:
+          return { kind: "value", value: a <= b };
+        case ts.SyntaxKind.GreaterThanToken:
+          return { kind: "value", value: a > b };
+        case ts.SyntaxKind.GreaterThanEqualsToken:
+          return { kind: "value", value: a >= b };
+        default:
+          break;
+      }
+    }
+    return null;
+  }
+  return null;
+}
+function isTerminal(stmt) {
+  return ts.isReturnStatement(stmt) || ts.isThrowStatement(stmt) || ts.isBreakStatement(stmt) || ts.isContinueStatement(stmt);
+}
+function namedFunctionBody(node) {
+  if (ts.isFunctionDeclaration(node) && node.name && node.body) return { name: node.name.text, body: node.body, owner: node };
+  if (ts.isVariableDeclaration(node) && ts.isIdentifier(node.name) && node.initializer) {
+    let init = node.initializer;
+    while (ts.isParenthesizedExpression(init) || ts.isAsExpression(init) || ts.isSatisfiesExpression(init)) init = init.expression;
+    if (ts.isFunctionExpression(init) || ts.isArrowFunction(init)) return { name: node.name.text, body: init.body, owner: node };
+  }
+  return null;
+}
+function isExportedDeclaration(node) {
+  const stmt = ts.isVariableDeclaration(node) ? node.parent.parent : node;
+  if (ts.isExportAssignment(stmt)) return true;
+  return ts.canHaveModifiers(stmt) && (ts.getModifiers(stmt) ?? []).some((m) => m.kind === ts.SyntaxKind.ExportKeyword);
+}
+function unreachableNodes(sf) {
+  const dead = /* @__PURE__ */ new Set();
+  const markBranches = (node) => {
+    if (ts.isIfStatement(node)) {
+      const t = constTruth(node.expression);
+      if (t === false) dead.add(node.thenStatement);
+      else if (t === true && node.elseStatement) dead.add(node.elseStatement);
+    } else if (ts.isWhileStatement(node) || ts.isForStatement(node)) {
+      const cond = ts.isWhileStatement(node) ? node.expression : node.condition;
+      if (cond && constTruth(cond) === false) dead.add(node.statement);
+    } else if (ts.isConditionalExpression(node)) {
+      const t = constTruth(node.condition);
+      if (t === false) dead.add(node.whenTrue);
+      else if (t === true) dead.add(node.whenFalse);
+    } else if (ts.isBinaryExpression(node)) {
+      const op = node.operatorToken.kind;
+      const l = constTruth(node.left);
+      if (op === ts.SyntaxKind.AmpersandAmpersandToken && l === false || op === ts.SyntaxKind.BarBarToken && l === true) {
+        dead.add(node.right);
+      }
+    }
+    if (ts.isSourceFile(node) || ts.isBlock(node) || ts.isModuleBlock(node) || ts.isCaseClause(node) || ts.isDefaultClause(node)) {
+      let ended = false;
+      for (const stmt of node.statements) {
+        if (ended && !ts.isFunctionDeclaration(stmt)) dead.add(stmt);
+        if (isTerminal(stmt)) ended = true;
+      }
+    }
+    ts.forEachChild(node, markBranches);
+  };
+  markBranches(sf);
+  const candidates = [];
+  const collect2 = (node) => {
+    const fn = namedFunctionBody(node);
+    if (fn && !isExportedDeclaration(fn.owner)) candidates.push(fn);
+    ts.forEachChild(node, collect2);
+  };
+  collect2(sf);
+  if (candidates.length === 0) return dead;
+  const inDead = (node) => {
+    for (let n = node; n; n = n.parent) if (dead.has(n)) return true;
+    return false;
+  };
+  const within2 = (node, owner) => node.pos >= owner.pos && node.end <= owner.end;
+  for (let round = 0; round < MAX_ROUNDS; round++) {
+    const live = /* @__PURE__ */ new Map();
+    const gather = (node) => {
+      if (dead.has(node)) return;
+      if (ts.isIdentifier(node)) {
+        const list3 = live.get(node.text);
+        if (list3) list3.push(node);
+        else live.set(node.text, [node]);
+      }
+      ts.forEachChild(node, gather);
+    };
+    gather(sf);
+    let changed = false;
+    for (const fn of candidates) {
+      if (dead.has(fn.body) || inDead(fn.owner)) continue;
+      const refs = (live.get(fn.name) ?? []).filter((id) => !within2(id, fn.owner));
+      if (refs.length === 0) {
+        dead.add(fn.body);
+        changed = true;
+      }
+    }
+    if (!changed) break;
+  }
+  return dead;
+}
+function literalInteriors(sf) {
+  const out3 = [];
+  const visit = (node) => {
+    if (ts.isStringLiteral(node) || ts.isNoSubstitutionTemplateLiteral(node)) {
+      out3.push([node.getStart(sf) + 1, Math.max(node.getStart(sf) + 1, node.getEnd() - 1)]);
+    } else if (ts.isTemplateHead(node) || ts.isTemplateMiddle(node)) {
+      out3.push([node.getStart(sf) + 1, Math.max(node.getStart(sf) + 1, node.getEnd() - 2)]);
+    } else if (ts.isTemplateTail(node)) {
+      out3.push([node.getStart(sf) + 1, Math.max(node.getStart(sf) + 1, node.getEnd() - 1)]);
+    }
+    ts.forEachChild(node, visit);
+  };
+  visit(sf);
+  return out3;
+}
+function partitionJs(src) {
+  const sf = parseSource("spec.ts", src);
+  if (!sf) return null;
+  const dead = unreachableNodes(sf);
+  const deadRanges = [];
+  for (const n of dead) deadRanges.push([n.getStart(sf), n.getEnd()]);
+  const literals3 = literalInteriors(sf);
+  const mask = new Uint8Array(src.length);
+  for (const [s, e] of deadRanges) for (let i = s; i < e; i++) mask[i] = 1;
+  for (const [s, e] of literals3) for (let i = s; i < e; i++) if (mask[i] === 0) mask[i] = 2;
+  const live = src.split("");
+  const hidden = src.split("");
+  const inLiteral = new Uint8Array(src.length);
+  for (let i = 0; i < src.length; i++) {
+    if (mask[i] === 1) {
+      if (live[i] !== "\n") live[i] = " ";
+    } else if (mask[i] === 2) {
+      inLiteral[i] = 1;
+    } else if (hidden[i] !== "\n") hidden[i] = " ";
+  }
+  let lineStart = 0;
+  for (let i = 0; i <= src.length; i++) {
+    if (i === src.length || src[i] === "\n") {
+      let all = i > lineStart;
+      for (let j = lineStart; j < i && all; j++) if (mask[j] !== 2 && /\S/.test(src[j])) all = false;
+      if (all) blankRange(live, lineStart, i);
+      lineStart = i + 1;
+    }
+  }
+  return { live: live.join(""), hidden: hidden.join(""), inLiteral };
+}
+function partitionPy(src) {
+  const lines = src.split("\n");
+  const dead = new Array(lines.length).fill(false);
+  let killIndent = null;
+  let suiteIndent = null;
+  for (let i = 0; i < lines.length; i++) {
+    const l = lines[i];
+    if (!/\S/.test(l) || /^\s*#/.test(l)) continue;
+    const indent = PY_INDENT(l);
+    if (killIndent !== null && indent < killIndent) killIndent = null;
+    if (suiteIndent !== null && indent <= suiteIndent) suiteIndent = null;
+    if (killIndent !== null && indent >= killIndent || suiteIndent !== null && indent > suiteIndent) {
+      dead[i] = true;
+      continue;
+    }
+    if (PY_TERMINAL.test(l)) killIndent = indent;
+    else if (PY_CONST_FALSE.test(l)) suiteIndent = indent;
+  }
+  const live = lines.map((l, i) => dead[i] ? "" : l).join("\n");
+  const hidden = lines.map((l, i) => dead[i] ? l : "").join("\n");
+  return { live, hidden, inLiteral: new Uint8Array(live.length) };
+}
+function partition(src, path) {
+  const lang = langOf(path);
+  if (lang === "js" || lang === null) {
+    const p = partitionJs(src);
+    if (p) return p;
+  } else if (lang === "py") {
+    return partitionPy(src);
+  }
+  return { live: src, hidden: "", inLiteral: new Uint8Array(src.length) };
+}
+function pytestCollectedDefs(src) {
+  let n = 0;
+  const stack = [];
+  for (const line of src.split("\n")) {
+    if (!/\S/.test(line) || /^\s*#/.test(line)) continue;
+    const indent = PY_INDENT(line);
+    while (stack.length && indent <= stack[stack.length - 1].indent) stack.pop();
+    const cls = PY_CLASS.exec(line);
+    if (cls) {
+      stack.push({ indent, collected: PY_COLLECTED_CLASS(cls[1], cls[2] ?? "") });
+      continue;
+    }
+    if (PY_TEST_DEF.test(line) && stack.every((c) => c.collected)) n++;
+  }
+  return n;
+}
+var MAX_ROUNDS, blankRange, PY_INDENT, PY_TERMINAL, PY_CONST_FALSE, PY_CLASS, PY_TEST_DEF, PY_COLLECTED_CLASS;
+var init_reachability = __esm({
+  "src/detectors/reachability.ts"() {
+    "use strict";
+    init_ts_lazy();
+    init_files();
+    MAX_ROUNDS = 8;
+    blankRange = (chars, start, end) => {
+      for (let i = start; i < end && i < chars.length; i++) if (chars[i] !== "\n") chars[i] = " ";
+    };
+    PY_INDENT = (line) => line.length - line.trimStart().length;
+    PY_TERMINAL = /^\s*(?:return\b|raise\b)/;
+    PY_CONST_FALSE = /^\s*(?:if|while)\s+(?:False|0|None|not\s+True)\s*:/;
+    PY_CLASS = /^\s*class\s+(\w+)\s*(?:\(([^)]*)\))?\s*:/;
+    PY_TEST_DEF = /^\s*(?:async\s+)?def\s+test\w*\s*\(/;
+    PY_COLLECTED_CLASS = (name, bases) => /^Test/.test(name) || /Test/.test(bases);
+  }
+});
+
 // src/detectors/test-deletion.ts
 function calleeName(expr) {
   if (ts.isIdentifier(expr)) return expr.text;
   if (ts.isPropertyAccessExpression(expr) && ts.isIdentifier(expr.expression)) {
     return expr.expression.text;
   }
+  const chain = readCallee(expr);
+  if (chain && !chain.table) return chain.runner;
   return null;
 }
 function loopRows(iterable) {
@@ -7919,6 +8357,7 @@ function eachRows(call) {
 }
 function countTests(src, path = "spec.ts", substantiveOnly = false) {
   const lang = langOf(path);
+  if (lang === "py") return { min: pytestCollectedDefs(src), open: false };
   if (lang && lang !== "js") {
     const re = TEST_DEFS[lang];
     let n2 = 0;
@@ -7929,7 +8368,9 @@ function countTests(src, path = "spec.ts", substantiveOnly = false) {
   if (!sf) return { min: 0, open: true };
   let n = 0;
   let open = false;
+  const dead = unreachableNodes(sf);
   const visit = (node, mult) => {
+    if (dead.has(node)) return;
     if (ts.isForOfStatement(node)) {
       const r = loopRows(node.expression);
       if (r.open) open = true;
@@ -8098,7 +8539,7 @@ function pytestPrecedenceFindings(changes, policy, ctx) {
     })
   );
 }
-var RULE9, JVM_TEST, TEST_DEFS, TABLE_METHOD, isEachOf, isDescribeEach, OTHER_RUNNER_DIR, WHOLE_SUITE_SCRIPT, SLICE_SCRIPT, SED_INPLACE, testDeletion;
+var RULE9, JVM_TEST, TEST_DEFS, isTableOf, isEachOf, isDescribeEach, OTHER_RUNNER_DIR, WHOLE_SUITE_SCRIPT, SLICE_SCRIPT, SED_INPLACE, testDeletion;
 var init_test_deletion = __esm({
   "src/detectors/test-deletion.ts"() {
     "use strict";
@@ -8111,6 +8552,8 @@ var init_test_deletion = __esm({
     init_suite_config();
     init_invocation();
     init_narrow();
+    init_reachability();
+    init_runner_chain();
     RULE9 = "test-deletion";
     JVM_TEST = /^\s*(?:@\w+(?:\([^)]*\))?\s+)*@(?:Test|ParameterizedTest|RepeatedTest|TestFactory|TestTemplate)\b/;
     TEST_DEFS = {
@@ -8123,9 +8566,12 @@ var init_test_deletion = __esm({
       php: /^\s*(?:(?:public\s+)?function\s+test\w*\s*\(|#\[Test\]|\*\s*@test\b)/,
       cs: /^\s*\[(?:Fact|Theory|Test|TestMethod|TestCase|DataTestMethod)\b/
     };
-    TABLE_METHOD = /^(?:each|for)$/;
-    isEachOf = (expr) => ts.isPropertyAccessExpression(expr) && ts.isIdentifier(expr.expression) && (expr.expression.text === "it" || expr.expression.text === "test") && TABLE_METHOD.test(expr.name.text);
-    isDescribeEach = (expr) => ts.isPropertyAccessExpression(expr) && ts.isIdentifier(expr.expression) && expr.expression.text === "describe" && TABLE_METHOD.test(expr.name.text);
+    isTableOf = (expr, runners) => {
+      const chain = readCallee(expr);
+      return chain != null && chain.table != null && runners.includes(chain.runner);
+    };
+    isEachOf = (expr) => isTableOf(expr, ["it", "test"]);
+    isDescribeEach = (expr) => isTableOf(expr, ["describe"]);
     OTHER_RUNNER_DIR = /(?:^|\/)(?:e2e|cypress|playwright|fixtures|__fixtures__|__mocks__)\//;
     WHOLE_SUITE_SCRIPT = /^(?:test|test:ci|check|pretest)$/;
     SLICE_SCRIPT = /^test:(?:unit|integration)$/;
@@ -8373,7 +8819,10 @@ function significantLinesOrdered(src, path) {
   }
   return out3;
 }
-var RULE10, MIN_REMOVED_LINES, MIN_REMOVED_ROWS, ws, TEST_DIR_FILE, testContentRemoval;
+function liveSignificantLines(src, path) {
+  return significantLinesOrdered(partition(src, path).live, path);
+}
+var RULE10, MIN_REMOVED_LINES, MIN_REMOVED_ROWS, ws, TEST_DIR_FILE, KeptPool, testContentRemoval;
 var init_test_content_removal = __esm({
   "src/detectors/test-content-removal.ts"() {
     "use strict";
@@ -8382,22 +8831,58 @@ var init_test_content_removal = __esm({
     init_finding();
     init_test_deletion();
     init_files();
+    init_reachability();
     RULE10 = "test-content-removal";
     MIN_REMOVED_LINES = 3;
     MIN_REMOVED_ROWS = 2;
     ws = (s) => s.replace(/\s+/g, "");
     TEST_DIR_FILE = /(?:^|\/)(?:test|tests|__tests__|spec|specs)\//;
+    KeptPool = class {
+      text = "";
+      inLiteral = [];
+      addLive(src, path) {
+        const p = partition(src, path);
+        const lang = langOf(path);
+        let lineStart = 0;
+        for (let i = 0; i <= p.live.length; i++) {
+          if (i < p.live.length && p.live[i] !== "\n") continue;
+          const line = p.live.slice(lineStart, i);
+          if (isSignificantLine(line.trim(), lang)) {
+            for (let j = lineStart; j < i; j++) {
+              if (/\s/.test(p.live[j])) continue;
+              this.text += p.live[j];
+              this.inLiteral.push(p.inLiteral[j]);
+            }
+          }
+          lineStart = i + 1;
+        }
+      }
+      /** Text added outside any spec (a case table moved to `test/fixtures/`): code. */
+      addCode(ws2) {
+        this.text += ws2;
+        for (let i = 0; i < ws2.length; i++) this.inLiteral.push(0);
+      }
+      keeps(wsLine) {
+        if (wsLine.length === 0) return true;
+        let at = this.text.indexOf(wsLine);
+        while (at !== -1) {
+          if (this.inLiteral[at] === 0) return true;
+          at = this.text.indexOf(wsLine, at + 1);
+        }
+        return false;
+      }
+    };
     testContentRemoval = {
       id: RULE10,
       surface: ["file"],
       certainty: "mechanical",
       run(changes, policy) {
         const out3 = [];
-        let keptPool = "";
+        const keptPool = new KeptPool();
         let addedPool = "";
         for (const c of changes) {
           if (c.kind !== "file" || c.after == null) continue;
-          if (isProtected(c.path, policy, "tests")) keptPool += ws(significantLinesOrdered(c.after, c.path).join("\n"));
+          if (isProtected(c.path, policy, "tests")) keptPool.addLive(c.after, c.path);
           let addedHere = "";
           if (c.op === "add") addedHere = ws(c.after);
           else if (c.before != null) {
@@ -8405,7 +8890,7 @@ var init_test_content_removal = __esm({
             addedHere = ws(c.after.split("\n").filter((l) => !had.has(l.trim())).join("\n"));
           }
           addedPool += addedHere;
-          if (!isProtected(c.path, policy, "tests") && TEST_DIR_FILE.test(c.path) && langOf(c.path) === "js") keptPool += addedHere;
+          if (!isProtected(c.path, policy, "tests") && TEST_DIR_FILE.test(c.path) && langOf(c.path) === "js") keptPool.addCode(addedHere);
         }
         for (const c of changes) {
           if (c.kind !== "file" || c.op !== "modify" && c.op !== "rename" || c.before == null || c.after == null) continue;
@@ -8414,16 +8899,18 @@ var init_test_content_removal = __esm({
           const blocksBefore = countTests(c.before, c.path);
           const blocksAfter = countTests(c.after, c.path);
           if (blocksAfter.min < blocksBefore.min && !blocksAfter.open) continue;
-          const beforeSig = significantLinesOrdered(c.before, c.path);
-          const afterSig = significantLinesOrdered(c.after, c.path);
+          const beforeSig = liveSignificantLines(c.before, c.path);
+          const afterSig = liveSignificantLines(c.after, c.path);
           const netDrop = beforeSig.length - afterSig.length;
           const afterSet = new Set(afterSig);
           const gone = [];
           for (const line of new Set(beforeSig)) {
             if (afterSet.has(line)) continue;
-            if (keptPool.includes(ws(line))) continue;
+            if (keptPool.keeps(ws(line))) continue;
             gone.push(line);
           }
+          const hiddenPool = ws(partition(c.after, c.path).hidden);
+          const hidden = gone.filter((line) => hiddenPool.includes(ws(line)));
           const table = eachTables(c.before, c.path);
           const tableAfter = eachTables(c.after, c.path);
           const goneRows = table.rows.size && tableAfter.open ? [...table.rows].filter(([k]) => !tableAfter.rows.has(k) && !addedPool.includes(k)).map(([, text]) => text) : [];
@@ -8438,6 +8925,17 @@ var init_test_content_removal = __esm({
             );
             continue;
           }
+          if (hidden.length >= MIN_REMOVED_LINES) {
+            out3.push(
+              makeFinding(RULE10, policy, {
+                file: c.path,
+                message: `Test content made unreachable in a surviving spec: ${hidden.length} significant line(s) kept only where they cannot run (a string, a template literal, a dead branch, after a return).`,
+                evidence: hidden.slice(0, 3).map((l) => l.slice(0, 80)).join(" | "),
+                remediation: "Fix the code under test. Assertions parked in a string or behind a constant-false branch or an early return no longer execute; the spec is weakened exactly as if they were deleted."
+              })
+            );
+            continue;
+          }
           if (gone.length >= MIN_REMOVED_LINES && netDrop >= MIN_REMOVED_LINES) {
             out3.push(
               makeFinding(RULE10, policy, {
@@ -8635,7 +9133,11 @@ function expectAssertion(node, sf) {
   };
 }
 function simpleCallName(node) {
-  return ts.isIdentifier(node.expression) ? node.expression.text : null;
+  if (ts.isIdentifier(node.expression)) return node.expression.text;
+  const chain = readCallee(node.expression) ?? readTableCallee(node.expression);
+  if (!chain) return null;
+  if (chain.table && !ts.isCallExpression(node.expression) && !ts.isTaggedTemplateExpression(node.expression)) return null;
+  return chain.runner;
 }
 function callbackFor(node) {
   const cb = node.arguments[1];
@@ -8755,6 +9257,7 @@ var init_assertion_weakening = __esm({
     init_policy();
     init_finding();
     init_files();
+    init_runner_chain();
     RULE13 = "assertion-weakening";
     TEST_CALLS = /* @__PURE__ */ new Set(["it", "test"]);
     SUITE_CALLS = /* @__PURE__ */ new Set(["describe", "suite", "context"]);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tamperward",
-  "version": "2.24.2",
+  "version": "2.24.4",
   "description": "The deterministic agent-integrity gate. One ruleset, evaluated on the actual diff/commands as a verdict, enforced everywhere a change can be made.",
   "license": "Apache-2.0",
   "author": "hexrift",