@cplieger/deadset-ts 8.0.0-dev.2 → 8.0.0-dev.3

package/src/roots.ts

@@ -9,8 +9,17 @@
  */
 
 import {
+  isArrowFunction,
+  isAssertionExpression,
   isExpressionWithTypeArguments,
   isFunctionLikeDeclaration,
+  isIdentifier,
+  isMethodDeclaration,
+  isObjectLiteralExpression,
+  isParenthesizedExpression,
+  isPropertyAssignment,
+  isReturnStatement,
+  isSatisfiesExpression,
   isPropertyAccessExpression,
   isQualifiedName,
   isTypeQueryNode,
@@ -18,7 +27,10 @@ import {
   isPropertyDeclaration,
   isVariableDeclaration,
   isVariableStatement,
+  SyntaxKind,
+  type Expression,
   type Node,
+  type ObjectLiteralExpression,
   type SourceFile,
 } from "@typescript/native/ast";
 import { aliasChains } from "./alias-chain.ts";
@@ -67,6 +79,8 @@ export type RootKind =
   | "pattern"
   /** A declaration of a function or statement a type error skipped, and what it may have selected. */
   | "type-error"
+  /** An ambient global interface merging into one declared outside the target, and its holders. */
+  | "global-augmentation"
   /** A file a tool or the platform enters by its own convention, and what it exports where the tool reads it. */
   | EntryRule;
 
@@ -446,6 +460,12 @@ export function roots<Brand>(
       published.push(...entryFiles(entry));
     }
   }
+  if (options.publishedAPI) {
+    // A library's bundle hands what its entry exports to every program that loads it.
+    published.push(
+      ...points.filter((point) => point.rule === "bundler-entry").map((point) => point.file),
+    );
+  }
   const publishedNames = new Set(published.map((file) => file.fileName));
   const patterned: { file: SourceFile; pattern: string }[] = [];
   for (const pattern of options.entryFiles) {
@@ -713,17 +733,26 @@ function publishedAPI<Brand>(
       const symbol = byId.get(id);
       return symbol === undefined || symbol.kind === "file" ? [] : nodes.typeNamesOf(symbol);
     });
-    for (const symbol of inferredTypeSymbols(
+    const inferred = inferredTypeSymbols(
       project,
       round.flatMap((id) => {
         const symbol = byId.get(id);
         return symbol === undefined ? [] : nodes.nodesOf(symbol);
       }),
-    )) {
+    );
+    for (const symbol of inferred.types) {
       for (const target of chains.chainOf(symbol)) {
         reach(target.id);
       }
     }
+    for (const symbol of inferred.members) {
+      for (const target of chains.chainOf(symbol)) {
+        const member = byId.get(target.id);
+        if (member?.visibility === "public" || member?.visibility === "protected") {
+          reach(target.id);
+        }
+      }
+    }
     project.symbolsAt(named.map((node) => project.handle(node))).forEach((symbol, index) => {
       if (symbol === UNANSWERED) {
         for (const id of held.byName.get(named[index]?.getText() ?? "") ?? []) {
@@ -783,30 +812,139 @@ function declarationNodes(
 const INFERRED_DEPTH = 4;
 
 /**
- * The declarations of the types the compiler infers where a declaration writes none: the
- * type of a variable or a property with no annotation, and the result of a function or a
- * method with no result annotation, each with the types its type arguments and its union
- * or intersection constituents name, to a fixed depth. A question the checker leaves
- * unanswered names nothing.
+ * The values one function body returns, each through the type assertions around it: the
+ * value a caller receives carries the operand's type whatever type the assertion or the
+ * signature names. A nested function's returns are its own.
+ */
+function returnedValues(body: Node): readonly Expression[] {
+  const found: Expression[] = [];
+  const add = (value: Expression): void => {
+    for (let at: Expression | undefined = value; at !== undefined;) {
+      found.push(at);
+      at =
+        isAssertionExpression(at) || isSatisfiesExpression(at) || isParenthesizedExpression(at)
+          ? at.expression
+          : undefined;
+    }
+  };
+  if (!isFunctionLikeDeclaration(body.parent) || body.parent.body !== body) {
+    return found;
+  }
+  if (isArrowFunction(body.parent) && body.kind !== SyntaxKind.Block) {
+    add(body as Expression);
+    return found;
+  }
+  const visit = (node: Node): void => {
+    if (isFunctionLikeDeclaration(node)) {
+      return;
+    }
+    if (isReturnStatement(node) && node.expression !== undefined) {
+      add(node.expression);
+    }
+    node.forEachChild(visit);
+  };
+  body.forEachChild(visit);
+  return found;
+}
+
+/** The object literal one returned value is, written there or as the initializer of a variable `body` declares. */
+function returnedLiteral(value: Expression, body: Node): ObjectLiteralExpression | undefined {
+  if (isObjectLiteralExpression(value)) {
+    return value;
+  }
+  if (!isIdentifier(value)) {
+    return undefined;
+  }
+  let found: ObjectLiteralExpression | undefined;
+  const visit = (node: Node): void => {
+    if (
+      isVariableDeclaration(node) &&
+      isIdentifier(node.name) &&
+      node.name.text === value.text &&
+      node.initializer !== undefined
+    ) {
+      let at: Expression = node.initializer;
+      while (
+        isAssertionExpression(at) ||
+        isSatisfiesExpression(at) ||
+        isParenthesizedExpression(at)
+      ) {
+        at = at.expression;
+      }
+      found = isObjectLiteralExpression(at) ? at : found;
+    }
+    if (!isFunctionLikeDeclaration(node)) {
+      node.forEachChild(visit);
+    }
+  };
+  body.forEachChild(visit);
+  return found;
+}
+
+/**
+ * The values one function body returns, and those each method of an object literal it
+ * returns returns, to a fixed depth: a caller holding the literal calls its methods, and
+ * receives what they return.
+ */
+function returnedThroughLiterals(body: Node, depth = 0): readonly Expression[] {
+  const values = returnedValues(body);
+  if (depth >= INFERRED_DEPTH) {
+    return values;
+  }
+  const found = [...values];
+  for (const value of values) {
+    for (const property of returnedLiteral(value, body)?.properties ?? []) {
+      const fn = isMethodDeclaration(property)
+        ? property
+        : isPropertyAssignment(property) && isFunctionLikeDeclaration(property.initializer)
+          ? property.initializer
+          : undefined;
+      if (fn?.body !== undefined) {
+        found.push(...returnedThroughLiterals(fn.body, depth + 1));
+      }
+    }
+  }
+  return found;
+}
+
+/**
+ * The declarations of the types the compiler infers where a declaration writes none, and
+ * of the values a function returns: the type of a variable or a property with no
+ * annotation, the result of a function or a method with no result annotation, and the type
+ * of each value its body returns, each with the types its type arguments and its union or
+ * intersection constituents name, to a fixed depth; and as `members` the properties of each
+ * returned value's type. A question the checker leaves unanswered names nothing.
  */
 function inferredTypeSymbols<Brand>(
   project: ProjectView<Brand>,
   declarations: readonly Node[],
-): readonly TSSymbol[] {
+): { readonly types: readonly TSSymbol[]; readonly members: readonly TSSymbol[] } {
   const { queries } = project;
-  const valued = declarations.flatMap((node) =>
+  const valued: Node[] = declarations.flatMap((node) =>
     (isVariableDeclaration(node) || isPropertyDeclaration(node)) &&
     node.type === undefined &&
     !isFunctionLikeDeclaration(node.initializer ?? node)
       ? [node.name]
       : [],
   );
+  const returned = declarations.flatMap((node) => {
+    const signature = isFunctionLikeDeclaration(node)
+      ? node
+      : isVariableDeclaration(node) &&
+          node.initializer !== undefined &&
+          isFunctionLikeDeclaration(node.initializer)
+        ? node.initializer
+        : undefined;
+    return signature?.body === undefined ? [] : returnedThroughLiterals(signature.body);
+  });
   const types: Type[] = [];
-  queries.typesAt(valued).forEach((type) => {
+  const returnedTypes: Type[] = [];
+  queries.typesAt([...valued, ...returned]).forEach((type, at) => {
     if (type !== UNANSWERED && type !== undefined) {
-      types.push(type);
+      (at < valued.length ? types : returnedTypes).push(type);
     }
   });
+  types.push(...returnedTypes);
   for (const node of declarations) {
     const signature = isFunctionLikeDeclaration(node)
       ? node
@@ -849,7 +987,19 @@ function inferredTypeSymbols<Brand>(
   types.forEach((type) => {
     visit(type, 0);
   });
-  return [...found.values()];
+  // A returned value carries each property of its type, one an anonymous type declares or
+  // an intersection merges included, which no type name reaches.
+  const members = new Map<number, TSSymbol>();
+  for (const type of returnedTypes) {
+    const parts = queries.constituents(type);
+    for (const one of [type, ...(parts === UNANSWERED ? [] : parts)]) {
+      const properties = queries.propertiesOf(one);
+      for (const property of properties === UNANSWERED ? [] : properties) {
+        members.set(property.id, property);
+      }
+    }
+  }
+  return { types: [...found.values()], members: [...members.values()] };
 }
 
 /**

package/src/serialization-contract.ts

@@ -17,6 +17,7 @@ import {
   isClassStaticBlockDeclaration,
   isFunctionDeclaration,
   isFunctionExpression,
+  isFunctionLikeDeclaration,
   isGetAccessorDeclaration,
   isIdentifier,
   isInterfaceDeclaration,
@@ -25,6 +26,7 @@ import {
   isNumericLiteral,
   isObjectLiteralExpression,
   isParenthesizedExpression,
+  isForInStatement,
   isPropertyAccessExpression,
   isPropertyDeclaration,
   isSatisfiesExpression,
@@ -307,9 +309,37 @@ function walkProject<Brand>(project: ProjectView<Brand>, held: Inventory): Walke
   return { sites, parameters };
 }
 
+/** The calls of `Object` that read every own property of their argument by name. */
+const ENUMERATIONS: ReadonlySet<string> = new Set([
+  "keys",
+  "entries",
+  "values",
+  "getOwnPropertyNames",
+  "assign",
+]);
+
+/**
+ * Whether a parameter type keeps no member name of the value it is given: `unknown`, `any`,
+ * or an object type of a string index signature and no property.
+ */
+function keepsNoName<Brand>(project: ProjectView<Brand>, type: Type): boolean {
+  if ((type.flags & ERASED) !== 0) {
+    return true;
+  }
+  if (
+    (type.flags & TypeFlags.Object) === 0 ||
+    must(project.queries.propertiesOf(type)).length > 0
+  ) {
+    return false;
+  }
+  return must(project.queries.indexInfosOf(type)).some(
+    (info) => (info.keyType.flags & TypeFlags.String) !== 0,
+  );
+}
+
 /**
- * The parameters that keep nothing of the value they are given: one typed `unknown` or
- * `any`, and a rest parameter whose elements are, each by its symbol.
+ * The parameters that keep no member name of the value they are given, as `keepsNoName`
+ * reads it, and a rest parameter whose elements keep none, each by its symbol.
  */
 function erasedParameters<Brand>(
   project: ProjectView<Brand>,
@@ -325,10 +355,10 @@ function erasedParameters<Brand>(
       return false;
     }
     if (!parameter.rest) {
-      return (type.flags & ERASED) !== 0;
+      return keepsNoName(project, type);
     }
     const [element] = must(project.queries.typeArguments(type));
-    return element !== undefined && (element.flags & ERASED) !== 0;
+    return element !== undefined && keepsNoName(project, element);
   });
   const bySymbol = new Map<number, Parameter>();
   project
@@ -343,6 +373,124 @@ function erasedParameters<Brand>(
   return bySymbol;
 }
 
+/** Whether one node is a function, whose body runs only where something calls it. */
+function isFunctionNode(node: Node): boolean {
+  return (
+    isFunctionDeclaration(node) ||
+    isFunctionExpression(node) ||
+    isArrowFunction(node) ||
+    isMethodDeclaration(node) ||
+    isGetAccessorDeclaration(node) ||
+    isSetAccessorDeclaration(node)
+  );
+}
+
+/** The name a function nested in another is called by: its own, or the variable it initializes. */
+function nestedName(fn: Node): string | undefined {
+  if (isFunctionDeclaration(fn)) {
+    return fn.name?.text;
+  }
+  let at = fn.parent;
+  while (isParenthesizedExpression(at) || isAsExpression(at) || isSatisfiesExpression(at)) {
+    at = at.parent;
+  }
+  return isVariableDeclaration(at) && isIdentifier(at.name) ? at.name.text : undefined;
+}
+
+/** The names one function's body writes as identifiers, other than the names its declarations bind. */
+function namesWritten(fn: Node): ReadonlySet<string> {
+  const found = new Set<string>();
+  const visit = (node: Node): void => {
+    const declares =
+      (isFunctionDeclaration(node.parent) || isVariableDeclaration(node.parent)) &&
+      node.parent.name === node;
+    if (isIdentifier(node) && !declares) {
+      found.add(node.text);
+    }
+    node.forEachChild(visit);
+  };
+  fn.forEachChild(visit);
+  return found;
+}
+
+/**
+ * The erased parameters their own function enumerates: one an `Object.keys`, `entries`,
+ * `values`, `getOwnPropertyNames` or `assign` call takes, `Object` the standard library's,
+ * or a `for…in` statement walks, which reads every property of the value by its name. A
+ * nested function is read as the function's own only where its name is written in it, or
+ * it has none, a callback or a function called where it is written.
+ */
+function enumeratedParameters<Brand>(
+  project: ProjectView<Brand>,
+  erased: ReadonlyMap<number, Parameter>,
+): readonly Parameter[] {
+  const asked: {
+    readonly node: Node;
+    readonly parameter: Parameter;
+    readonly object: Node | undefined;
+  }[] = [];
+  for (const parameter of erased.values()) {
+    const fn = parameter.name.parent.parent;
+    const spelled = parameter.name.getText();
+    const written = namesWritten(fn);
+    const visit = (node: Node): void => {
+      if (isFunctionNode(node)) {
+        const name = nestedName(node);
+        if (name !== undefined && !written.has(name)) {
+          return;
+        }
+      }
+      const read: Expression[] = [];
+      let object: Node | undefined;
+      if (isCallExpression(node)) {
+        const callee = node.expression;
+        if (
+          isPropertyAccessExpression(callee) &&
+          isIdentifier(callee.expression) &&
+          callee.expression.text === "Object" &&
+          ENUMERATIONS.has(callee.name.text)
+        ) {
+          object = callee.expression;
+          // `Object.assign` reads its sources, every argument after the target.
+          read.push(...node.arguments.slice(...(callee.name.text === "assign" ? [1] : [0, 1])));
+        }
+      } else if (isForInStatement(node)) {
+        read.push(node.expression);
+      }
+      for (const value of read.map(evaluated)) {
+        if (isIdentifier(value) && value.text === spelled) {
+          asked.push({ node: value, parameter, object });
+        }
+      }
+      node.forEachChild(visit);
+    };
+    fn.forEachChild(visit);
+  }
+  const symbols = project.symbolsAt(asked.map((one) => project.handle(one.node))).map(must);
+  const objects = asked.flatMap((one) => (one.object === undefined ? [] : [one.object]));
+  const own = project.ownPaths();
+  const standard = new Set(
+    project
+      .symbolsAt(objects.map((node) => project.handle(node)))
+      .map(must)
+      .flatMap((symbol, at) =>
+        symbol?.declarations.every((handle) => !own.has(handle.path)) === true ? [objects[at]] : [],
+      ),
+  );
+  return [
+    ...new Set(
+      asked.flatMap((one, at) => {
+        const symbol = symbols[at];
+        return symbol !== undefined &&
+          erased.get(symbol.id) === one.parameter &&
+          (one.object === undefined || standard.has(one.object))
+          ? [one.parameter]
+          : [];
+      }),
+    ),
+  ];
+}
+
 /** Each place a call's argument passes one of the erased parameters it can see. */
 function handedOn<Brand>(
   project: ProjectView<Brand>,
@@ -452,8 +600,8 @@ interface Destinations {
  * callee is a serializer an entry names; at the arguments its resolved signature types
  * `unknown` or `any` where its callee is declared outside the analysis or only ambiently
  * with no implementation in it; and, where its callee is a function of the project, at each
- * parameter the function hands on to a destination, holding back the widest of what those
- * destinations hold back, which is settled by widening until no parameter moves.
+ * parameter the function enumerates or hands on to a destination, holding back the widest
+ * of what those hold back, settled by widening until no parameter moves.
  */
 function destinations<Brand>(
   input: DetectorInput<Brand>,
@@ -674,6 +822,9 @@ function destinations<Brand>(
     return undefined;
   };
 
+  for (const parameter of enumeratedParameters(project, erased)) {
+    forwards.set(keyOf(parameter), "properties");
+  }
   const forwarded = handedOn(project, walked.sites, erased, invocation);
   for (let moved = true; moved;) {
     moved = false;
@@ -776,6 +927,19 @@ function flowsOf<Brand>(
           },
         ];
   });
+  const generic = typeParameterFlows(
+    project,
+    reach,
+    sites,
+    arguments_.flatMap((one) => {
+      const type = typeOf.get(one.value);
+      const parameters = type === undefined ? [] : typeParametersOf(project, type, 0);
+      const destination = parameters.length === 0 ? undefined : to.at(one.site.call, one.argument);
+      return destination === undefined
+        ? []
+        : parameters.map((parameter) => ({ parameter, to: destination }));
+    }),
+  );
   const left = stores.outside.flatMap((store) => {
     const reached = reach.reachedFrom(store.type);
     return reached.classes.size === 0 && reached.members.length === 0
@@ -790,7 +954,145 @@ function flowsOf<Brand>(
           },
         ];
   });
-  return [...passed, ...left];
+  return [...passed, ...generic, ...left];
+}
+
+/** The type parameters one type names, through constituents and type arguments. */
+function typeParametersOf<Brand>(project: ProjectView<Brand>, type: Type, depth: number): Type[] {
+  if (type.isTypeParameter()) {
+    return [type];
+  }
+  if (depth >= MENTION_DEPTH) {
+    return [];
+  }
+  const { queries } = project;
+  return [
+    ...(type.isUnionType() || type.isIntersectionType() ? must(queries.constituents(type)) : []),
+    ...must(queries.typeArguments(type)),
+  ].flatMap((one) => typeParametersOf(project, one, depth + 1));
+}
+
+/**
+ * The types an instantiated type puts where a declared type names `parameter`: matched
+ * through type arguments, and in a union every constituent the declared union does not
+ * itself name.
+ */
+function bound<Brand>(
+  project: ProjectView<Brand>,
+  declared: Type,
+  instantiated: Type,
+  parameter: Type,
+  depth: number,
+): Type[] {
+  if (declared.id === parameter.id) {
+    return [instantiated];
+  }
+  if (depth >= MENTION_DEPTH) {
+    return [];
+  }
+  const { queries } = project;
+  if (declared.isUnionType()) {
+    const parts = must(queries.constituents(declared));
+    if (parts.some((part) => part.id === parameter.id)) {
+      const kept = new Set(parts.map((part) => part.id));
+      const given = instantiated.isUnionType()
+        ? must(queries.constituents(instantiated))
+        : [instantiated];
+      return given.filter((part) => !kept.has(part.id));
+    }
+  }
+  const declaredArguments = must(queries.typeArguments(declared));
+  const givenArguments = must(queries.typeArguments(instantiated));
+  return declaredArguments.length !== givenArguments.length
+    ? []
+    : declaredArguments.flatMap((one, at) => {
+        const given = givenArguments[at];
+        return given === undefined ? [] : bound(project, one, given, parameter, depth + 1);
+      });
+}
+
+/**
+ * The flows a type parameter of a function of the project carries where a value its type
+ * names reaches a destination: each call of the function passes its type argument there,
+ * written or inferred from the arguments, and a type argument that is a type parameter
+ * of the calling function is followed on to that function's calls, to a fixpoint.
+ */
+function typeParameterFlows<Brand>(
+  project: ProjectView<Brand>,
+  reach: ReturnType<typeof valueReach>,
+  sites: readonly Site[],
+  pending: { readonly parameter: Type; readonly to: Destination }[],
+): readonly Flow[] {
+  const { queries } = project;
+  const byName = new Map<string, Site[]>();
+  for (const site of sites) {
+    const name = calleeName(site.call.expression)?.getText();
+    if (name !== undefined) {
+      byName.set(name, [...(byName.get(name) ?? []), site]);
+    }
+  }
+  const found: Flow[] = [];
+  const seen = new Set<number>();
+  for (let next = pending.pop(); next !== undefined; next = pending.pop()) {
+    const { parameter, to } = next;
+    if (seen.has(parameter.id)) {
+      continue;
+    }
+    seen.add(parameter.id);
+    const symbol = must(queries.symbolOfType(parameter));
+    const [handle] = symbol?.declarations ?? [];
+    const declaration = handle === undefined ? undefined : project.declarationAt(handle)?.node;
+    const fn = declaration?.parent;
+    const index =
+      fn === undefined || !isFunctionLikeDeclaration(fn)
+        ? -1
+        : (fn.typeParameters ?? []).findIndex((one) => one === declaration);
+    const name =
+      fn === undefined
+        ? undefined
+        : isMethodDeclaration(fn) && isIdentifier(fn.name)
+          ? fn.name.text
+          : nestedName(fn);
+    if (symbol === undefined || fn === undefined || index < 0 || name === undefined) {
+      continue;
+    }
+    for (const site of byName.get(name) ?? []) {
+      const resolved = must(queries.resolvedSignature(site.call));
+      const declared = resolved === undefined ? undefined : must(queries.genericOf(resolved));
+      const called =
+        declared?.declaration === undefined
+          ? undefined
+          : project.declarationAt(declared.declaration)?.node;
+      if (resolved === undefined || declared === undefined || called !== fn) {
+        continue;
+      }
+      const written = site.call.typeArguments?.[index];
+      const given =
+        written === undefined
+          ? site.call.arguments.flatMap((_argument, at) => {
+              const from = must(queries.parameterType(declared, at));
+              const into = must(queries.parameterType(resolved, at));
+              return from === undefined || into === undefined
+                ? []
+                : bound(project, from, into, parameter, 0);
+            })
+          : typesAt(project, [written]).filter((type) => type !== undefined);
+      for (const type of given) {
+        const reached = reach.reachedFrom(type);
+        if (reached.classes.size > 0 || reached.members.length > 0) {
+          found.push({
+            site: site.call,
+            classes: reached.classes,
+            members: reached.members,
+            to,
+            detail: `passed to ${to.callee} through the type parameter ${symbol.name}`,
+          });
+        }
+        pending.push(...typeParametersOf(project, type, 0).map((one) => ({ parameter: one, to })));
+      }
+    }
+  }
+  return found;
 }
 
 /**

package/src/sweep.ts

@@ -195,10 +195,14 @@ export function runnerCalls(symbol: InventorySymbol): boolean {
  * That run's roots are the graph's own and, of each test file, its top level and every
  * function it exports, which a test runner may call, and every export of a manual mock,
  * which the runner reads; any other export of a test file, and test-support code, which
- * runs where a test imports it, are judged as any file's are.
- * `held` seeds it as a mark or an exemption seeds a sweep.
+ * runs where a test imports it, are judged as any file's are. `held` seeds it as a mark
+ * seeds a sweep; with `namespaces` false a file read reaches none of the file's exports.
  */
-export function reachedWithTheTests(graph: Graph, held: readonly string[]): readonly boolean[] {
+export function reachedWithTheTests(
+  graph: Graph,
+  held: readonly string[],
+  namespaces = true,
+): readonly boolean[] {
   const tests = graph.symbols.flatMap((symbol, at) => {
     const exported = symbol.exported && graph.symbols[graph.parent[at] ?? OUTSIDE]?.kind === "file";
     const called = exported && runnerCalls(symbol);
@@ -208,9 +212,12 @@ export function reachedWithTheTests(graph: Graph, held: readonly string[]): read
       ? [{ at, kind: "test-runner" as const }]
       : [];
   });
-  return reachable({ ...graph, rooted: [...graph.rooted, ...tests] }, flagged(graph, held), {
-    production: false,
-  });
+  return reachable(
+    { ...graph, rooted: [...graph.rooted, ...tests] },
+    flagged(graph, held),
+    { production: false },
+    namespaces,
+  );
 }
 
 /**
@@ -240,7 +247,12 @@ function flagged(graph: Graph, ids: readonly string[]): boolean[] {
  * included, while a root reaches through the references the mode counts. The held seed
  * runs first, so what it reaches is expanded under the wider rule.
  */
-function reachable(graph: Graph, held: readonly boolean[], mode: Mode): readonly boolean[] {
+function reachable(
+  graph: Graph,
+  held: readonly boolean[],
+  mode: Mode,
+  namespaces = true,
+): readonly boolean[] {
   const reached = graph.symbols.map(() => false);
   const expanded = graph.symbols.map(() => false);
   const queue: number[] = [];
@@ -269,7 +281,7 @@ function reachable(graph: Graph, held: readonly boolean[], mode: Mode): readonly
         if (!holding && mode.production && edge.test) {
           continue;
         }
-        enter(edge.to, !edge.evaluation);
+        enter(edge.to, namespaces && !edge.evaluation);
       }
     }
   };
@@ -285,7 +297,7 @@ function reachable(graph: Graph, held: readonly boolean[], mode: Mode): readonly
   }
   // A consumer's reference reaches what it names as one of the target's own does.
   for (const edge of callsOf(graph, mode)) {
-    enter(edge.to, !edge.evaluation);
+    enter(edge.to, namespaces && !edge.evaluation);
   }
   walk(false);
   return reached;