Skip to content

armgit / cindy

Public Imported from GitHub
0

Consider it done. The open-source AI agent that works out of the box · 想到,就能做到。开源、开箱即用的 AI Agent。

test(desktop): decouple lock deadlines and trim purge queue setup

DavidShen254fbf1da0f5
diff --git a/apps/desktop/src/main/device-link/__tests__/crossProcessLock.test.ts b/apps/desktop/src/main/device-link/__tests__/crossProcessLock.test.ts
index 51bfccc7a0..bc01531f59 100644
--- a/apps/desktop/src/main/device-link/__tests__/crossProcessLock.test.ts
+++ b/apps/desktop/src/main/device-link/__tests__/crossProcessLock.test.ts
@@ -570,7 +570,10 @@ describe('接管陈旧锁', () => {
).resolves.toEqual({ held: true });
});
- it('retries when a released lock disappears during stale takeover', async () => {
+ it.each([
+ { takeoverMs: 100, expected: { held: true } },
+ { takeoverMs: 1_001, expected: { held: false, reason: 'busy' } },
+ ])('retries when a released lock disappears during stale takeover ($takeoverMs ms)', async ({ takeoverMs, expected }) => {
const lock = path.join(dir, 'lock');
await fsp.writeFile(
lock,
@@ -586,6 +589,10 @@ describe('接管陈旧锁', () => {
const old = new Date(Date.now() - 60_000);
await fsp.utimes(lock, old, old);
+ // Assert the retry deadline independently of real Windows filesystem latency,
+ // as in the takeover-budget tests below. Keep real filesystem operations.
+ let now = Date.now();
+ const clock = vi.spyOn(Date, 'now').mockImplementation(() => now);
const originalRename = fsp.rename;
let removedByRacingOwner = false;
@@ -601,6 +608,7 @@ describe('接管陈旧锁', () => {
) {
removedByRacingOwner = true;
await fsp.rm(lock, { force: true });
+ now += takeoverMs;
throw Object.assign(new Error('ENOENT'), { code: 'ENOENT' });
}
return (originalRename as (...args: unknown[]) => Promise<unknown>)(from, to);
@@ -608,9 +616,10 @@ describe('接管陈旧锁', () => {
try {
await expect(
withCrossProcessLock(lock, { label: 'waiter', waitMs: 1_000 }, async (s) => s),
- ).resolves.toEqual({ held: true });
+ ).resolves.toEqual(expected);
} finally {
race.mockRestore();
+ clock.mockRestore();
}
expect(removedByRacingOwner).toBe(true);
});
diff --git a/apps/desktop/src/main/device-link/__tests__/mirrorCachePurgeQueue.test.ts b/apps/desktop/src/main/device-link/__tests__/mirrorCachePurgeQueue.test.ts
index d575ccec0c..0a6d0900cc 100644
--- a/apps/desktop/src/main/device-link/__tests__/mirrorCachePurgeQueue.test.ts
+++ b/apps/desktop/src/main/device-link/__tests__/mirrorCachePurgeQueue.test.ts
@@ -580,7 +580,24 @@ describe('条目数超上限', () => {
for (let i = 0; i < 40; i += 1) {
roots.push(await makeOwnerCache(`owner-${i}`));
}
- for (const root of roots) await enqueuePurge(root);
+ // Seed the below-limit state directly; ordinary enqueue persistence is
+ // covered above. Exercise the 32-entry boundary and every overflow write
+ // without 31 redundant lock/read/rewrite cycles on Windows CI.
+ await fsp.writeFile(queueFile(), JSON.stringify({
+ version: 1,
+ entries: roots.slice(0, 31).map((root) => ({ root, since: 1, attempts: 1 })),
+ }), 'utf8');
+ for (const root of roots.slice(31)) await enqueuePurge(root);
+ expect(JSON.parse(await fsp.readFile(queueFile(), 'utf8')).entries).toHaveLength(32);
+ const pendingDir = path.join(userData, __testing.pendingDirName);
+ const overflowRoots = new Set<string>();
+ for (const name of fs.readdirSync(pendingDir).filter((name) => name.endsWith('.json'))) {
+ const pending = JSON.parse(await fsp.readFile(path.join(pendingDir, name), 'utf8')) as {
+ entries: Array<{ root: string }>;
+ };
+ for (const entry of pending.entries) overflowRoots.add(entry.root);
+ }
+ expect([...overflowRoots].sort()).toEqual(roots.slice(32).sort());
__testing.resetMemoryQueue(); // 只看盘上
const persisted = await __testing.readQueue();