mirror of
https://github.com/thedotmack/claude-mem.git
synced 2026-09-20 04:23:02 +08:00
29b42186fe
Greptile P1 (security). The Windows start-token cache did not merely
weaken identity revalidation — it made it inert.
captureProcessStartToken caches per-pid for 5s. A snapshot capture
populates that entry and the revalidation reads the SAME entry back, so
inside the TTL isSameProcess compared a value against itself and
returned true 100% of the time. Not a race: a tautology. A reused PID
was therefore certified as the original and handed to
`taskkill /PID <pid> /T /F`, force-terminating an unrelated process AND
its entire descendant tree.
This is round 5's defect on the platform this PR is named after: a guard
that validates the wrong thing is worse than no guard. Three previous
round-ups called it "best-effort on Windows", which framed an incorrect
result as a weaker one. That framing was wrong.
True surface, checked before writing code:
- the cache is Windows-ONLY; POSIX always read fresh, so POSIX was
never exposed;
- round 4's atomic enumeration already fixed descendant CAPTURE (it
comes from the CIM table read, not a cached probe), so the exposure
was the revalidation side — total for the root, partial for a
descendant revalidated twice inside one TTL.
Fix: isSameProcess now reads uncached. Chosen over cache invalidation
because invalidation is action-at-a-distance — correct only if every
present and future call site remembers to invalidate first, which is
precisely the opt-in shape that produced rounds 3, 4 and 5. Reading
uncached is correct by construction at the one place that authorizes a
kill.
Blast radius contained as previously flagged: captureProcessStartToken
keeps its cache for verifyPidFileOwnership (the repeated-validation case
the cache exists for), and the uncached reader is NOT exported — the
only way to obtain a bypassing read is through the predicate that
authorizes kills, so it cannot leak to callers that want the cache. All
nine isSameProcess call sites were audited first: every one authorizes
an irreversible kill, so the change has no non-kill blast radius.
Measured cost: 2.27ms per call on macOS (~9ms for a typical chroma
teardown of one root plus three descendants). POSIX is unchanged in
behaviour since it never cached. Windows pays a CIM query per
authorization (~100-300ms); teardown is not a hot path and the
alternative is force-killing an unrelated process tree.
Tested on every platform, not just Windows: a probe counter asserts
isSameProcess performs a fresh read on every call, so the assertion is
not vacuous off-Windows, and a Windows-gated case asserts the cached
accessor really does still serve from cache (without it, the bypass
could pass on a build where caching silently stopped working). Verified
red-without-fix by restoring a cached read.
Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
146 lines
5.9 KiB
TypeScript
146 lines
5.9 KiB
TypeScript
import { describe, it, expect, afterAll } from 'bun:test';
|
|
import { spawn } from 'child_process';
|
|
import { collectDescendantIdentities } from '../../src/shared/kill-process-tree.js';
|
|
import {
|
|
captureProcessStartToken,
|
|
isSameProcess,
|
|
__identityProbeCountForTesting,
|
|
} from '../../src/shared/process-identity.js';
|
|
|
|
/**
|
|
* Format-agreement guard for the atomic descendant enumeration.
|
|
*
|
|
* collectDescendantIdentities() takes each PID's start token from the SAME
|
|
* process-table read that discovered it — /proc/<pid>/stat on Linux, one
|
|
* `ps -eo pid=,ppid=,lstart=` on macOS/BSD, one CIM query on Windows. Every
|
|
* later revalidation re-reads that token through captureProcessStartToken().
|
|
*
|
|
* If those two ever disagree on FORMAT, the failure is silent and severe: no
|
|
* comparison would ever match, every descendant would be skipped as "reused",
|
|
* and the orphan bug (#2313) comes straight back while the code still looks
|
|
* guarded. That is the one way this design fails closed-but-wrong, so it is
|
|
* asserted rather than assumed — on whatever platform the suite runs.
|
|
*/
|
|
|
|
const strays: number[] = [];
|
|
|
|
function settle(ms = 500): Promise<void> {
|
|
return new Promise(resolve => setTimeout(resolve, ms));
|
|
}
|
|
|
|
afterAll(() => {
|
|
for (const pid of strays) {
|
|
try { process.kill(pid, 'SIGKILL'); } catch { /* already gone */ }
|
|
}
|
|
});
|
|
|
|
describe('descendant enumeration agrees with captureProcessStartToken', () => {
|
|
it('produces tokens identical to an independent re-probe', async () => {
|
|
const command = process.platform === 'win32'
|
|
? spawn('cmd.exe', ['/c', 'ping -n 60 127.0.0.1 > NUL'], { stdio: 'ignore', windowsHide: true })
|
|
: spawn('/bin/sh', ['-c', 'sleep 60 & sleep 60 & wait'], { stdio: 'ignore' });
|
|
|
|
const rootPid = command.pid!;
|
|
strays.push(rootPid);
|
|
await settle();
|
|
|
|
const descendants = await collectDescendantIdentities(rootPid);
|
|
expect(descendants.length).toBeGreaterThan(0);
|
|
|
|
// At least one token must have been readable, or the comparison below is
|
|
// vacuous — every entry would trivially "agree" via the null fallback.
|
|
const withTokens = descendants.filter(entry => entry.startToken !== null);
|
|
expect(withTokens.length).toBeGreaterThan(0);
|
|
|
|
for (const entry of withTokens) {
|
|
const reprobed = captureProcessStartToken(entry.pid);
|
|
// A null re-probe means the process exited between the two reads, which
|
|
// is legitimate; only a NON-null disagreement is a format bug.
|
|
if (reprobed === null) continue;
|
|
expect(reprobed).toBe(entry.startToken);
|
|
}
|
|
|
|
try { process.kill(rootPid, 'SIGKILL'); } catch { /* fine */ }
|
|
}, 30_000);
|
|
|
|
it('returns leaves before their ancestors', async () => {
|
|
if (process.platform === 'win32') return;
|
|
|
|
const command = spawn(
|
|
'/bin/sh',
|
|
['-c', '/bin/sh -c "sleep 60 & wait" & wait'],
|
|
{ stdio: 'ignore' }
|
|
);
|
|
const rootPid = command.pid!;
|
|
strays.push(rootPid);
|
|
await settle();
|
|
|
|
const descendants = await collectDescendantIdentities(rootPid);
|
|
expect(descendants.length).toBeGreaterThanOrEqual(2);
|
|
|
|
// The intermediate shell is a direct child of the root; the innermost
|
|
// sleep is its child. Leaves-first means the deeper one comes first.
|
|
const pids = descendants.map(entry => entry.pid);
|
|
const intermediate = pids[pids.length - 1];
|
|
expect(descendants[0]!.pid).not.toBe(intermediate);
|
|
|
|
try { process.kill(rootPid, 'SIGKILL'); } catch { /* fine */ }
|
|
}, 30_000);
|
|
});
|
|
|
|
/**
|
|
* The identity cache must never authorize a kill.
|
|
*
|
|
* On Windows captureProcessStartToken caches per-pid for 5s. Because a
|
|
* snapshot capture populates that entry and the revalidation reads it back,
|
|
* the check was a TAUTOLOGY there — always true inside the TTL, not a race —
|
|
* so a reused PID was certified as the original and passed to
|
|
* `taskkill /PID <pid> /T /F` along with its whole subtree.
|
|
*
|
|
* The probe counter makes the fix observable on EVERY platform: whatever the
|
|
* caching policy, isSameProcess must perform a fresh read each time it is
|
|
* asked to authorize a kill. The Windows-only half (that the cached accessor
|
|
* really does serve from cache) is asserted separately, and this file runs in
|
|
* the Windows CI job for exactly that reason.
|
|
*/
|
|
describe('identity revalidation never trusts the cache', () => {
|
|
it('isSameProcess performs a fresh read on every call', () => {
|
|
const token = captureProcessStartToken(process.pid);
|
|
expect(token).not.toBeNull();
|
|
|
|
const before = __identityProbeCountForTesting();
|
|
isSameProcess(process.pid, token);
|
|
const afterFirst = __identityProbeCountForTesting();
|
|
isSameProcess(process.pid, token);
|
|
const afterSecond = __identityProbeCountForTesting();
|
|
|
|
// Each authorization re-reads the OS; neither call may be served from a
|
|
// cached verdict.
|
|
expect(afterFirst).toBeGreaterThan(before);
|
|
expect(afterSecond).toBeGreaterThan(afterFirst);
|
|
});
|
|
|
|
it('still returns the correct verdict while bypassing the cache', () => {
|
|
const token = captureProcessStartToken(process.pid);
|
|
|
|
expect(isSameProcess(process.pid, token)).toBe(true);
|
|
expect(isSameProcess(process.pid, 'a-token-from-some-other-process')).toBe(false);
|
|
// Unreadable snapshot token must still mean "proceed" — refusing has to
|
|
// stay strictly narrower than killing, or #2313 comes back.
|
|
expect(isSameProcess(process.pid, null)).toBe(true);
|
|
});
|
|
|
|
it.if(process.platform === 'win32')('the cached accessor DOES serve from cache (Windows)', () => {
|
|
// Establishes that the cache the fix bypasses is real on this platform —
|
|
// without this, the assertion above could pass on a build where caching
|
|
// silently stopped working, and the bypass would be proving nothing.
|
|
captureProcessStartToken(process.pid);
|
|
|
|
const before = __identityProbeCountForTesting();
|
|
captureProcessStartToken(process.pid);
|
|
const after = __identityProbeCountForTesting();
|
|
|
|
expect(after).toBe(before);
|
|
});
|
|
});
|