@ttsc/unplugin 0.30.2 → 0.30.4

package/lib/core/viteServe.js

@@ -2,136 +2,774 @@
 
 var fs = require('node:fs');
 var path = require('node:path');
+var pathIdentity = require('ttsc/path-identity');
 var transform = require('./transform.js');
 
 /**
- * How often each registered Vite-unsafe input is predicate-polled, in
- * milliseconds.
+ * A bounded recursive filesystem observer shared by all served modules.
  *
- * Polling is the only watch primitive that covers the whole class: the dev
- * server's chokidar watcher ignores every `node_modules` directory, which is
- * exactly where superseding resolution candidates usually live, and `fs.watch`
- * cannot observe a path whose parent directories do not exist yet. One `stat`
- * every half second per unavailable path is negligible against a dev server's
- * baseline. Rich inputs replay only the predicates the compiler recorded.
+ * Vite resolves transform-context addWatchFile as a runtime import, including
+ * type-only .server files and non-module plugin assets. Use a separate watcher
+ * for compiler inputs, including node_modules, which Vite's watcher ignores.
+ * Ordinary files use events after their initial subscription is observed.
+ * Missing spellings and directory predicates use the recursive observer for
+ * their nearest available scope. Inputs a native scope cannot safely cover
+ * share one bounded fallback poll; linked files also share topology checks
+ * because retargeting a junction need not emit events on its old descendants.
  */
-const MISSING_INPUT_POLL_INTERVAL = 500;
-/** Create an empty missing-input watch for one plugin instance. */
-function createViteServeMissingInputWatch() {
+function createViteServeInputWatch(operations = {}) {
     const entries = new Map();
-    let poller;
+    const aliases = new Map();
+    const renameAliases = new Map();
+    const importerInputs = new Map();
+    const pending = new Set();
+    const polled = new Set();
+    const links = new Map();
+    const scopes = new Map();
+    const componentLinks = new Map();
+    const missingComponents = new Set();
+    const changes = new Map();
     let server;
-    const stopPollingIfEmpty = () => {
-        if (entries.size !== 0 || poller === undefined) {
-            return;
+    let projectRoot;
+    let changeSequence = 0;
+    let historyFloor = 0;
+    let linkIterator;
+    let pollIterator;
+    let poller;
+    let flushTimer;
+    const open = operations.watch ?? openRecursiveWatch;
+    const openPoller = operations.poll ?? openWatchPoller;
+    const platform = operations.platform ?? process.platform;
+    const createCaseIdentities = () => pathIdentity.createFilesystemPathIdentityContext({
+        ...(operations.caseSensitive === undefined
+            ? {}
+            : { caseSensitive: operations.caseSensitive }),
+        platform,
+        throwOnRealpathError: false,
+    });
+    let caseIdentities = createCaseIdentities();
+    const directoryCaseSensitivity = new Map();
+    let pathIdentityMemosDirty = false;
+    /** Drop path facts after topology or ownership changes make them stale. */
+    const resetPathIdentityMemos = () => {
+        caseIdentities = createCaseIdentities();
+        directoryCaseSensitivity.clear();
+        pathIdentityMemosDirty = false;
+    };
+    /** Lexical event key under the nearest existing directory's case policy. */
+    const watchPathKey = (file) => {
+        const absolute = path.resolve(file);
+        if (platform !== "win32" && platform !== "darwin") {
+            return absolute;
+        }
+        let current = path.dirname(absolute);
+        const traversed = [];
+        let sensitive;
+        for (;;) {
+            const cacheKey = platform === "win32" ? current.toLowerCase() : current;
+            sensitive = directoryCaseSensitivity.get(cacheKey);
+            if (sensitive !== undefined)
+                break;
+            traversed.push(cacheKey);
+            try {
+                if (fs.statSync(current).isDirectory()) {
+                    sensitive = caseIdentities.caseSensitive(current);
+                    break;
+                }
+            }
+            catch {
+                // A missing suffix inherits the nearest existing ancestor's policy.
+            }
+            const parent = path.dirname(current);
+            if (parent === current) {
+                // The shared identity resolver uses the platform default when even the
+                // volume root cannot answer the read-only case-sensitivity probe.
+                sensitive = caseIdentities.caseSensitive(current);
+                break;
+            }
+            current = parent;
+        }
+        for (const directory of traversed) {
+            directoryCaseSensitivity.set(directory, sensitive);
+        }
+        return sensitive ? absolute : absolute.toLowerCase();
+    };
+    const unbindAlias = (alias, entry) => {
+        const indexed = aliases.get(alias);
+        indexed?.delete(entry);
+        if (indexed?.size === 0)
+            aliases.delete(alias);
+    };
+    const closeScope = (scope) => {
+        scopes.delete(watchPathKey(scope.root));
+        try {
+            scope.watcher?.close();
+        }
+        catch {
+            // The generation no longer trusts this scope, so cleanup is best effort.
+        }
+        scope.watcher = undefined;
+    };
+    const recordChange = (eventType, file) => {
+        const absolute = path.resolve(file);
+        const parent = path.dirname(absolute);
+        const direct = new Set();
+        const parents = new Set();
+        if (eventType === "rename") {
+            // Keep the active identity context until affected entries are removed.
+            // Their alias and scope indexes were built with that context; changing
+            // only the resolver here could make later events unable to reach them.
+            // `check()` resets the memos atomically if this topology change removes
+            // an entry, while unrelated renames leave still-valid indexes intact.
+            componentLinks.clear();
+            missingComponents.clear();
+        }
+        changeSequence += 1;
+        direct.add(watchPathKey(absolute));
+        parents.add(watchPathKey(parent));
+        for (const key of direct) {
+            componentLinks.delete(key);
+            missingComponents.delete(key);
+            changes.set(key, changeSequence);
         }
-        clearInterval(poller);
-        poller = undefined;
+        for (const key of parents)
+            changes.set(key, changeSequence);
+        if (changes.size > MAX_CHANGE_HISTORY) {
+            changes.clear();
+            historyFloor = changeSequence;
+        }
+        return { direct, parent: parents };
     };
-    const poll = () => {
+    const remove = (entry) => {
+        entries.delete(entry.file);
+        pending.delete(entry);
+        polled.delete(entry);
+        for (const alias of entry.aliases)
+            unbindAlias(alias, entry);
+        entry.aliases.clear();
+        for (const alias of entry.renameAliases) {
+            const indexed = renameAliases.get(alias);
+            indexed?.delete(entry);
+            if (indexed?.size === 0)
+                renameAliases.delete(alias);
+        }
+        entry.renameAliases.clear();
+        for (const scope of entry.scopes) {
+            scope.entries.delete(entry);
+            if (scope.entries.size === 0 && !scope.pinned)
+                closeScope(scope);
+        }
+        entry.scopes.clear();
+        for (const file of entry.links) {
+            const link = links.get(file);
+            link?.inputs.delete(entry);
+            if (link?.inputs.size === 0)
+                links.delete(file);
+        }
+        entry.links.clear();
+        // Component resolution is only an observation-time optimization. Entries
+        // can introduce arbitrary missing ancestors, so discard the shared memo
+        // when one leaves rather than retaining its path components indefinitely.
+        componentLinks.clear();
+        missingComponents.clear();
+        if (links.size === 0)
+            linkIterator = undefined;
+        if (polled.size === 0)
+            pollIterator = undefined;
+        pathIdentityMemosDirty = true;
+    };
+    const check = (selected) => {
         const importers = new Set();
-        for (const [identity, entry] of entries) {
-            if (!viteServeInputWatchConditionChanged(entry)) {
+        for (const entry of selected) {
+            if (entries.get(entry.file) !== entry)
                 continue;
+            let baseline;
+            for (const [key, condition] of entry.conditions) {
+                const state = condition.evidence?.state;
+                let changed;
+                if (state?.codec === "predicates") {
+                    changed =
+                        transform.validateGraphInputObservation(entry.file, state.observation)
+                            .length !== 0;
+                }
+                else {
+                    baseline ??= transform.captureWatchInputBaseline(entry.file);
+                    changed =
+                        baseline === undefined ||
+                            (condition.evidence?.state !== undefined
+                                ? !transform.watchInputEvidenceMatchesBaseline(condition.evidence, baseline)
+                                : JSON.stringify(condition.baseline) !==
+                                    JSON.stringify(baseline));
+                }
+                if (!changed)
+                    continue;
+                for (const importer of condition.importers)
+                    importers.add(importer);
+                entry.conditions.delete(key);
+            }
+            if (entry.conditions.size === 0) {
+                remove(entry);
             }
-            entries.delete(identity);
-            for (const importer of entry.importers) {
-                importers.add(importer);
+        }
+        if (pathIdentityMemosDirty)
+            resetPathIdentityMemos();
+        updatePoller();
+        if (server !== undefined && importers.size !== 0) {
+            invalidateImporters(server, importers);
+            sendFullReload(server);
+        }
+    };
+    const enqueue = (eventType, file) => {
+        const absolute = path.resolve(file);
+        const eventKeys = recordChange(eventType, absolute);
+        for (const key of eventKeys.direct) {
+            for (const entry of aliases.get(key) ?? []) {
+                entry.changedAt = changeSequence;
+                pending.add(entry);
             }
         }
-        stopPollingIfEmpty();
-        if (server === undefined || importers.size === 0) {
+        for (const key of eventKeys.parent) {
+            for (const entry of aliases.get(key) ?? []) {
+                entry.changedAt = changeSequence;
+                pending.add(entry);
+            }
+        }
+        if (eventType === "rename") {
+            const exact = new Set();
+            for (const key of eventKeys.direct) {
+                for (const entry of renameAliases.get(key) ?? [])
+                    exact.add(entry);
+            }
+            // Linux may report only the destination spelling of a directory rename.
+            // That spelling cannot be indexed before the move. Fall back to the
+            // renamed entry's parent only when no exact old spelling matched; the
+            // baseline check below still invalidates solely inputs that really moved.
+            const selected = exact;
+            if (selected.size === 0) {
+                for (const key of eventKeys.parent) {
+                    for (const entry of renameAliases.get(key) ?? [])
+                        selected.add(entry);
+                }
+            }
+            for (const entry of selected) {
+                entry.changedAt = changeSequence;
+                pending.add(entry);
+            }
+        }
+        if (pending.size === 0 || flushTimer !== undefined)
             return;
+        flushTimer = setTimeout(() => {
+            flushTimer = undefined;
+            const selected = [...pending];
+            pending.clear();
+            check(selected);
+        }, 0);
+        flushTimer.unref();
+    };
+    const bindAlias = (entry, alias) => {
+        alias = watchPathKey(alias);
+        if (entry.aliases.has(alias))
+            return;
+        entry.aliases.add(alias);
+        let indexed = aliases.get(alias);
+        if (indexed === undefined) {
+            indexed = new Set();
+            aliases.set(alias, indexed);
+        }
+        indexed.add(entry);
+    };
+    const bindRenameAncestors = (entry, file) => {
+        let current = path.dirname(path.resolve(file));
+        for (;;) {
+            const key = watchPathKey(current);
+            if (!entry.renameAliases.has(key)) {
+                entry.renameAliases.add(key);
+                let indexed = renameAliases.get(key);
+                if (indexed === undefined) {
+                    indexed = new Set();
+                    renameAliases.set(key, indexed);
+                }
+                indexed.add(entry);
+            }
+            const parent = path.dirname(current);
+            if (parent === current)
+                return;
+            current = parent;
+        }
+    };
+    const ensureScope = (root, external, pinned = false) => {
+        root = path.resolve(root);
+        const key = watchPathKey(root);
+        let scope = scopes.get(key);
+        if (scope === undefined) {
+            if (external &&
+                [...scopes.values()].filter((candidate) => !candidate.pinned).length >=
+                    MAX_EXTERNAL_WATCH_SCOPES)
+                return undefined;
+            // Opening a scope is itself an observation boundary. Advance the same
+            // sequence returned by begin() so an external scope first discovered
+            // after compilation cannot claim it was already live at that token when
+            // no filesystem event happened in between.
+            changeSequence += 1;
+            scope = {
+                entries: new Set(),
+                failed: false,
+                pinned,
+                root,
+                startedAt: changeSequence,
+            };
+            scopes.set(key, scope);
+            try {
+                const owned = scope;
+                scope.watcher = open(root, (eventType, file) => {
+                    if (scopes.get(key) !== owned)
+                        return;
+                    if (file === null) {
+                        resetPathIdentityMemos();
+                        changeSequence += 1;
+                        historyFloor = changeSequence;
+                        changes.clear();
+                        for (const candidate of owned.entries) {
+                            candidate.changedAt = changeSequence;
+                            pending.add(candidate);
+                        }
+                        scheduleFlush();
+                        return;
+                    }
+                    enqueue(eventType, path.isAbsolute(file) ? file : path.resolve(root, file));
+                }, () => {
+                    if (scopes.get(key) !== owned)
+                        return;
+                    owned.failed = true;
+                    try {
+                        owned.watcher?.close();
+                    }
+                    catch {
+                        // The fallback owns validation now; a failed native handle is no
+                        // longer useful, and cleanup must not replace that recovery.
+                    }
+                    owned.watcher = undefined;
+                    for (const entry of owned.entries)
+                        requirePolling(entry);
+                    updatePoller();
+                });
+                if (scope.failed) {
+                    // An injected or platform watcher may report failure synchronously
+                    // during construction, before its handle can be assigned above.
+                    try {
+                        scope.watcher?.close();
+                    }
+                    catch { }
+                    scope.watcher = undefined;
+                }
+            }
+            catch {
+                scope.failed = true;
+            }
+        }
+        else if (pinned) {
+            scope.pinned = true;
+        }
+        return scope;
+    };
+    const bindScope = (root, entry, external) => {
+        const scope = ensureScope(root, external);
+        if (scope === undefined)
+            return false;
+        scope.entries.add(entry);
+        entry.scopes.add(scope);
+        return !scope.failed;
+    };
+    function requirePolling(entry) {
+        entry.fallback = true;
+        if (polled.size === 0)
+            pollIterator = undefined;
+        polled.add(entry);
+    }
+    const scheduleFlush = () => {
+        if (pending.size === 0 || flushTimer !== undefined)
+            return;
+        flushTimer = setTimeout(() => {
+            flushTimer = undefined;
+            const selected = [...pending];
+            pending.clear();
+            check(selected);
+        }, 0);
+        flushTimer.unref();
+    };
+    function updatePoller() {
+        const needed = links.size !== 0 || polled.size !== 0;
+        if (!needed) {
+            poller?.close();
+            poller = undefined;
+            return;
+        }
+        if (poller !== undefined)
+            return;
+        poller = openPoller(() => {
+            const selected = new Set();
+            for (let count = 0; count < MAX_FALLBACK_PROBES_PER_TICK && polled.size !== 0; count += 1) {
+                pollIterator ??= polled.values();
+                let next = pollIterator.next();
+                if (next.done) {
+                    pollIterator = polled.values();
+                    next = pollIterator.next();
+                }
+                if (next.done)
+                    break;
+                selected.add(next.value);
+            }
+            // Files reached through one linked directory share one topology check.
+            // Content edits remain event-driven; retargeting a junction does not
+            // reliably emit an event on its previously watched descendants. Reconcile
+            // a fixed-size slice as a safety net; ordinary retargets arrive at once
+            // through the project-root observer, while even an enormous dependency
+            // graph has constant idle CPU cost.
+            for (let count = 0; count < MAX_LINK_PROBES_PER_TICK && links.size !== 0; count += 1) {
+                linkIterator ??= links.entries();
+                let next = linkIterator.next();
+                if (next.done) {
+                    linkIterator = links.entries();
+                    next = linkIterator.next();
+                }
+                if (next.done)
+                    break;
+                const [file, link] = next.value;
+                const target = realpath(file);
+                if (target !== link.target) {
+                    link.target = target;
+                    for (const entry of link.inputs) {
+                        selected.add(entry);
+                    }
+                }
+            }
+            check(selected);
+        });
+    }
+    const observe = (entry) => {
+        bindAlias(entry, entry.file);
+        bindRenameAncestors(entry, entry.file);
+        const root = projectRoot;
+        if (root !== undefined && containsPath(root, entry.file)) {
+            if (!bindScope(root, entry, false))
+                requirePolling(entry);
+        }
+        else {
+            const external = nearestExistingDirectory(entry.file);
+            if (external === undefined || !bindScope(external, entry, true))
+                requirePolling(entry);
+        }
+        const target = realpath(entry.file);
+        if (hasMultipleLinks(entry.file))
+            requirePolling(entry);
+        if (target !== undefined) {
+            bindAlias(entry, target);
+            bindRenameAncestors(entry, target);
+            if (!sameSpelling(entry.file, target)) {
+                let link = links.get(entry.file);
+                if (link === undefined) {
+                    link = { target, inputs: new Set() };
+                    if (links.size === 0)
+                        linkIterator = undefined;
+                    links.set(entry.file, link);
+                }
+                link.inputs.add(entry);
+                entry.links.add(entry.file);
+                if (root === undefined || !containsPath(root, target)) {
+                    const targetRoot = nearestExistingDirectory(target);
+                    if (targetRoot === undefined || !bindScope(targetRoot, entry, true))
+                        requirePolling(entry);
+                }
+            }
+        }
+        if (root !== undefined) {
+            for (const linkedFile of linkedComponents(entry.file, root, componentLinks, missingComponents, watchPathKey)) {
+                bindAlias(entry, linkedFile);
+                let link = links.get(linkedFile);
+                if (link === undefined) {
+                    link = { target: realpath(linkedFile), inputs: new Set() };
+                    if (links.size === 0)
+                        linkIterator = undefined;
+                    links.set(linkedFile, link);
+                }
+                link.inputs.add(entry);
+                entry.links.add(linkedFile);
+                if (link.target === undefined)
+                    requirePolling(entry);
+                else if (!containsPath(root, link.target) &&
+                    !bindScope(link.target, entry, true))
+                    requirePolling(entry);
+            }
         }
-        invalidateImporters(server, importers);
-        sendFullReload(server);
     };
     return {
         attach(next) {
             server = next;
+            projectRoot = path.resolve(next.config?.root ?? process.cwd());
+            ensureScope(projectRoot, false, true);
         },
-        dispose() {
+        begin() {
+            return changeSequence;
+        },
+        async dispose() {
             entries.clear();
-            if (poller !== undefined) {
-                clearInterval(poller);
-                poller = undefined;
-            }
-            // The server reference deliberately survives: `vite.restartServer`
-            // configures the replacement server (attach) before it closes the old
-            // one (whose buildEnd runs this dispose), so unsetting it here would
-            // detach the freshly attached replacement and revive the 500 this
-            // module exists to prevent. A same-instance `vite build` after a serve
-            // is instead excluded by the adapter's `config.command` gate.
+            aliases.clear();
+            renameAliases.clear();
+            importerInputs.clear();
+            pending.clear();
+            polled.clear();
+            links.clear();
+            componentLinks.clear();
+            missingComponents.clear();
+            changes.clear();
+            linkIterator = undefined;
+            pollIterator = undefined;
+            poller?.close();
+            if (flushTimer !== undefined)
+                clearTimeout(flushTimer);
+            poller = undefined;
+            flushTimer = undefined;
+            for (const scope of [...scopes.values()])
+                closeScope(scope);
+            resetPathIdentityMemos();
+            // Retain the attached server across overlapping Vite restart containers.
         },
-        serving() {
-            return server !== undefined;
+        forget(importer) {
+            importer = path.resolve(importer);
+            const previous = importerInputs.get(importer);
+            if (previous === undefined)
+                return;
+            importerInputs.delete(importer);
+            for (const [file, key] of previous) {
+                const entry = entries.get(file);
+                const condition = entry?.conditions.get(key);
+                condition?.importers.delete(importer);
+                if (condition?.importers.size === 0)
+                    entry?.conditions.delete(key);
+                if (entry?.conditions.size === 0)
+                    remove(entry);
+            }
+            if (pathIdentityMemosDirty)
+                resetPathIdentityMemos();
+            updatePoller();
         },
-        watch(input, importer, condition) {
-            const spelling = path.resolve(input);
-            const identity = viteServeMissingInputWatchKey(spelling, condition);
-            const existing = entries.get(identity);
-            if (existing !== undefined) {
-                existing.importers.add(path.resolve(importer));
+        replace(importer, inputs, failed = false, startedAt) {
+            if (server === undefined)
                 return;
+            importer = path.resolve(importer);
+            const previous = importerInputs.get(importer) ?? new Map();
+            if (failed) {
+                // An exception can omit the dependency whose deletion caused it.
+                // Keep the last successful spellings until a successful delivery can
+                // replace them, observing their current failed state for recovery.
+                const reported = new Set(inputs.map((input) => path.resolve(input.file)));
+                inputs = [
+                    ...inputs,
+                    ...[...previous.keys()]
+                        .filter((file) => !reported.has(file))
+                        .map((file) => ({ file })),
+                ];
+            }
+            const current = new Map();
+            const added = new Set();
+            const touched = new Set();
+            for (const input of inputs) {
+                const file = path.resolve(input.file);
+                const evidence = input.evidence;
+                const key = JSON.stringify(evidence ?? null);
+                current.set(file, key);
+                let entry = entries.get(file);
+                if (entry === undefined) {
+                    entry = {
+                        aliases: new Set(),
+                        changedAt: 0,
+                        file,
+                        conditions: new Map(),
+                        fallback: false,
+                        links: new Set(),
+                        renameAliases: new Set(),
+                        scopes: new Set(),
+                    };
+                    entries.set(file, entry);
+                    added.add(entry);
+                    observe(entry);
+                }
+                touched.add(entry);
+                let condition = entry.conditions.get(key);
+                if (condition === undefined) {
+                    condition = {
+                        evidence,
+                        baseline: evidence?.state === undefined
+                            ? transform.captureWatchInputBaseline(file)
+                            : undefined,
+                        importers: new Set(),
+                    };
+                    entry.conditions.set(key, condition);
+                }
+                condition.importers.add(importer);
+            }
+            for (const [file, key] of previous) {
+                if (current.get(file) === key)
+                    continue;
+                const entry = entries.get(file);
+                const condition = entry?.conditions.get(key);
+                condition?.importers.delete(importer);
+                if (condition?.importers.size === 0)
+                    entry?.conditions.delete(key);
+                if (entry?.conditions.size === 0 && !current.has(file)) {
+                    remove(entry);
+                }
             }
-            entries.set(identity, {
-                condition,
-                importers: new Set([path.resolve(importer)]),
-                spelling,
-            });
-            if (poller === undefined) {
-                poller = setInterval(poll, MISSING_INPUT_POLL_INTERVAL);
-                // A poller must never keep the dev-server process alive on its own.
-                poller.unref?.();
+            if (pathIdentityMemosDirty)
+                resetPathIdentityMemos();
+            if (current.size === 0)
+                importerInputs.delete(importer);
+            else
+                importerInputs.set(importer, current);
+            // Registration and removal can each touch thousands of compiler inputs.
+            // Decide the one shared poller's state once per atomic replacement,
+            // rather than rescanning the whole graph once per input.
+            updatePoller();
+            // Watchers are live before this proof. It closes the compile-to-subscribe
+            // race without manufacturing one native subscription per input.
+            if (touched.size !== 0) {
+                if (startedAt === undefined || startedAt < historyFloor) {
+                    check(touched);
+                }
+                else {
+                    const raced = [];
+                    for (const entry of touched) {
+                        if (entry.fallback || entry.changedAt > startedAt) {
+                            raced.push(entry);
+                            continue;
+                        }
+                        const observedAfterCompile = added.has(entry) &&
+                            (someSet(entry.aliases, (alias) => (changes.get(alias) ?? 0) > startedAt) ||
+                                someSet(entry.renameAliases, (alias) => (changes.get(alias) ?? 0) > startedAt));
+                        if (someSet(entry.scopes, (scope) => scope.failed ||
+                            scope.startedAt > startedAt ||
+                            observedAfterCompile)) {
+                            raced.push(entry);
+                        }
+                    }
+                    if (raced.length !== 0)
+                        check(raced);
+                }
             }
         },
     };
 }
-/** Key a private poll by predicate and exact lexical spelling. */
-function viteServeMissingInputWatchKey(input, condition) {
-    // Missing aliases can share a physical parent now and later retarget or
-    // diverge. Neither predicate may let one lexical spelling answer for another.
-    const predicate = typeof condition === "string"
-        ? condition
-        : `predicates:${JSON.stringify([
-            condition.accessibleEntries === undefined
-                ? null
-                : [
-                    condition.accessibleEntries.directories,
-                    condition.accessibleEntries.files,
-                ],
-            condition.directoryExists ?? null,
-            condition.fileExists ?? null,
-            condition.readFile === undefined
-                ? null
-                : condition.readFile.ok
-                    ? [true, condition.readFile.hash]
-                    : [false],
-            condition.realpath === undefined
-                ? null
-                : condition.realpath.ok
-                    ? [true, condition.realpath.path]
-                    : [false],
-            condition.stat ?? null,
-        ])}`;
-    return `${predicate}:${path.resolve(input)}`;
+const MAX_EXTERNAL_WATCH_SCOPES = 16;
+const MAX_CHANGE_HISTORY = 100_000;
+const MAX_FALLBACK_PROBES_PER_TICK = 64;
+const MAX_LINK_PROBES_PER_TICK = 64;
+/** Test a set without allocating a transient array on the registration path. */
+function someSet(values, predicate) {
+    for (const value of values)
+        if (predicate(value))
+            return true;
+    return false;
 }
-/** Whether one registered condition no longer describes its lexical path. */
-function viteServeInputWatchConditionChanged(entry) {
-    if (typeof entry.condition !== "string") {
-        return (transform.validateGraphInputObservation(entry.spelling, entry.condition).length !==
-            0);
-    }
+function openWatchPoller(listener) {
+    const timer = setInterval(listener, 500);
+    timer.unref();
+    return { close: () => clearInterval(timer) };
+}
+function openRecursiveWatch(root, listener, onError) {
+    const watcher = fs.watch(root, { persistent: false, recursive: true }, (eventType, file) => listener(eventType, file === null ? null : String(file)));
+    watcher.on("error", onError);
+    return { close: () => watcher.close() };
+}
+function containsPath(root, file) {
+    const relative = path.relative(path.resolve(root), path.resolve(file));
+    return (relative === "" ||
+        (relative !== ".." &&
+            !relative.startsWith(`..${path.sep}`) &&
+            !path.isAbsolute(relative)));
+}
+function nearestExistingDirectory(file) {
+    let current = path.resolve(file);
     try {
-        if (!fs.existsSync(entry.spelling)) {
-            return false;
+        if (!fs.statSync(current).isDirectory())
+            current = path.dirname(current);
+    }
+    catch {
+        current = path.dirname(current);
+    }
+    for (;;) {
+        try {
+            if (fs.statSync(current).isDirectory()) {
+                return path.dirname(current) === current ? undefined : current;
+            }
+        }
+        catch {
+            // Keep climbing to the nearest directory a recursive watch can own.
         }
-        return (entry.condition === "exists" || !fs.statSync(entry.spelling).isDirectory());
+        const parent = path.dirname(current);
+        if (parent === current)
+            return undefined;
+        current = parent;
+    }
+}
+function linkedComponents(file, root, cached, missing, keyOf) {
+    const relative = path.relative(root, file);
+    if (relative === "" ||
+        relative === ".." ||
+        relative.startsWith(`..${path.sep}`) ||
+        path.isAbsolute(relative))
+        return [];
+    const output = [];
+    let current = path.resolve(root);
+    for (const component of relative.split(path.sep).slice(0, -1)) {
+        current = path.join(current, component);
+        const key = keyOf(current);
+        if (missing.has(key))
+            break;
+        const known = cached.get(key);
+        if (known !== undefined) {
+            if (known !== null)
+                output.push(current);
+            continue;
+        }
+        try {
+            if (fs.lstatSync(current).isSymbolicLink()) {
+                cached.set(key, realpath(current) ?? current);
+                output.push(current);
+            }
+            else {
+                cached.set(key, null);
+            }
+        }
+        catch {
+            missing.add(key);
+            break;
+        }
+    }
+    return output;
+}
+function realpath(file) {
+    try {
+        return fs.realpathSync.native(file);
+    }
+    catch {
+        return undefined;
+    }
+}
+/** Whether writes can reach this input through an unobserved hardlink alias. */
+function hasMultipleLinks(file) {
+    try {
+        const stats = fs.statSync(file);
+        return stats.isFile() && stats.nlink > 1;
     }
     catch {
         return false;
     }
 }
+function sameSpelling(left, right) {
+    return process.platform === "win32"
+        ? path.resolve(left).toLowerCase() === path.resolve(right).toLowerCase()
+        : path.resolve(left) === path.resolve(right);
+}
 /**
  * Invalidate every module-graph node of the registered importers so the next
  * request retransforms them. Importers keep their original absolute spelling so
@@ -216,6 +854,5 @@ function sendFullReload(server) {
     }
 }
 
-exports.createViteServeMissingInputWatch = createViteServeMissingInputWatch;
-exports.viteServeMissingInputWatchKey = viteServeMissingInputWatchKey;
+exports.createViteServeInputWatch = createViteServeInputWatch;
 //# sourceMappingURL=viteServe.js.map