Compare commits

..
Author SHA1 Message Date
paseo-bot[bot] f0cc911563 test(app): capture Android terminal keyboard frame drops
Retain a real-device diagnostic for #4811 while its cost owner remains unconfirmed. The caller supplies the comparison budget; this does not add a release performance guarantee or a production fix.
2026-10-18 03:10:19 +02:00
6 changed files with 171 additions and 220 deletions
@@ -0,0 +1,16 @@
# Android terminal keyboard diagnostic
This is a device diagnostic for #4811, not a CI test or an established release performance budget. It measures the real native terminal and real software keyboard through agent-device. It does not inject keyboard frames or replace the terminal.
Open a terminal against an isolated daemon, hide its keyboard, and leave Android animations enabled. Use an existing agent-device session bound to the app and device being measured. For example, from the repository root:
```sh
PASEO_AGENT_DEVICE_SESSION=terminal-keyboard-stutter \
node packages/app/e2e/mobile/terminal-keyboard/stutter.android.mjs 20
```
Pass a maximum median janky-frame percentage explicitly. The example's 20% is a diagnostic comparison threshold, not an agreed product requirement. The script warms one complete cycle, measures five opening/closing cycles, saves raw Android frame metrics to `.dev/agent-device-artifacts/terminal-keyboard-stutter/frames.json`, then fails if either median exceeds the supplied threshold. `AGENT_DEVICE_STATE_DIR` and `ANDROID_SERIAL` are honored.
Each opening uses the terminal keyboard toggle, and each closing uses Android Back. Accessibility is read only before opening, because real-IME accessibility snapshots stalled during investigation. The script verifies that the real keyboard changes visibility, waits for three stable samples, and includes another 500 ms for delayed terminal refits. It leaves the keyboard hidden and keeps the caller's session open.
Compare the same app build mode, terminal contents, device, animation settings, and threshold. Development-build and emulator numbers do not establish release or physical-device performance. A failure reproduces frame drops; it does not identify their cause or prove a proposed fix.
@@ -0,0 +1,105 @@
import assert from "node:assert/strict";
import { execFileSync } from "node:child_process";
import { mkdirSync, writeFileSync } from "node:fs";
import { resolve } from "node:path";
import { setTimeout as delay } from "node:timers/promises";
// Start an agent-device Android session on an idle terminal with its keyboard hidden.
// The explicit budget is a diagnostic comparison parameter, not a shipped performance guarantee.
const maxJankPercent = Number(process.argv[2]);
assert(
process.argv[2] &&
Number.isFinite(maxJankPercent) &&
maxJankPercent >= 0 &&
maxJankPercent <= 100,
"Pass the maximum median janky-frame percentage, for example: node stutter.android.mjs 20",
);
const session = process.env.PASEO_AGENT_DEVICE_SESSION ?? "terminal-keyboard-stutter";
const serial = process.env.ANDROID_SERIAL ?? "emulator-5554";
const artifacts = resolve(".dev/agent-device-artifacts/terminal-keyboard-stutter");
mkdirSync(artifacts, { recursive: true });
function ad(...args) {
return execFileSync("agent-device", [...args, "--session", session], {
encoding: "utf8",
timeout: 20_000,
});
}
function keyboardShown() {
return /^ mInputShown=true$/m.test(
execFileSync("adb", ["-s", serial, "shell", "dumpsys", "input_method"], {
encoding: "utf8",
timeout: 10_000,
}),
);
}
async function waitForKeyboard(shown) {
const deadline = Date.now() + 5000;
let stableSamples = 0;
while (Date.now() < deadline) {
stableSamples = keyboardShown() === shown ? stableSamples + 1 : 0;
if (stableSamples === 3) {
// Include the pane's delayed refits after the keyboard animation ends.
await delay(500);
return;
}
await delay(100);
}
throw new Error(`Keyboard did not settle at shown=${shown}`);
}
function frames() {
const result = JSON.parse(ad("perf", "frames", "--json"));
const sample = result.data.metrics.fps;
assert(sample.available, "Android frame metrics must be available");
return sample;
}
function keyboardTogglePoint() {
const { data } = JSON.parse(ad("snapshot", "-i", "--json"));
const toggle = data.nodes.find((node) => node.identifier === "terminal-keyboard-toggle");
const input = data.nodes.find((node) => node.identifier === "terminal-native-input");
assert(input && toggle?.rect, "Open a native terminal before running this diagnostic");
return {
x: String(Math.round(toggle.rect.x + toggle.rect.width / 2)),
y: String(Math.round(toggle.rect.y + toggle.rect.height / 2)),
};
}
async function keyboardCycle(point) {
ad("press", point.x, point.y);
await waitForKeyboard(true);
const open = frames();
ad("back");
await waitForKeyboard(false);
const close = frames();
return { open, close };
}
function median(values) {
const sorted = [...values].sort((a, b) => a - b);
return sorted[Math.floor(sorted.length / 2)];
}
async function captureKeyboardCycles() {
assert.equal(keyboardShown(), false, "Start with the software keyboard hidden");
const point = keyboardTogglePoint();
frames();
await keyboardCycle(point); // Warm the keyboard and terminal before measuring.
const samples = [];
for (let cycle = 0; cycle < 5; cycle += 1) {
samples.push(await keyboardCycle(point));
}
return samples;
}
const samples = await captureKeyboardCycles();
const open = median(samples.map((sample) => sample.open.droppedFramePercent));
const close = median(samples.map((sample) => sample.close.droppedFramePercent));
const result = { maxJankPercent, medianJankPercent: { open, close }, samples };
writeFileSync(resolve(artifacts, "frames.json"), JSON.stringify(result, null, 2));
console.log(JSON.stringify({ maxJankPercent, medianJankPercent: { open, close } }));
assert(open <= maxJankPercent, `Keyboard opening: ${open}% exceeds ${maxJankPercent}%`);
assert(close <= maxJankPercent, `Keyboard closing: ${close}% exceeds ${maxJankPercent}%`);
-43
View File
@@ -1246,49 +1246,6 @@ describe("runAcpProvider streamed chunks without messageId (#4699)", () => {
messageId?: string;
}
it("keeps reasoning separate from a reply sharing its native message ID", async () => {
const harness = connectorHarness({
promptUpdates: () => [
textChunk("private reasoning", "agent_thought_chunk", "shared-id"),
textChunk("public reply", "agent_message_chunk", "shared-id"),
],
});
const registration = runAcpProvider({
id: "chunk-acp",
label: "Chunk ACP",
connector: harness.connector,
});
const connection = await registration.connect({
versions: [1],
capabilities: ["prompt.message"],
});
const events: ProviderEvent[] = [];
connection.onEvent((event) => events.push(event));
try {
await connection.send(openInput());
await waitForEvent(events, (event) => event.type === "session.ready");
await connection.send({
type: "session.prompt",
sessionId: "session-1",
prompt: {
clientMessageId: "same-id",
delivery: "auto",
input: { type: "message", content: [{ type: "text", text: "hello" }] },
},
});
await waitForEvent(
events,
(event) => event.type === "session.turn" && event.state === "completed",
);
const reply = events.findLast(
(event) => event.type === "timeline.item" && event.item.type === "assistant_message",
);
expect(reply).toMatchObject({ item: { text: "public reply" } });
} finally {
await connection.close();
}
});
it("continues one timeline item per turn instead of one per chunk", async () => {
const chunksByPrompt: Record<string, Chunk[]> = {
first: [
@@ -287,45 +287,6 @@ function expectNestedChildren(events: AgentStreamEvent[]) {
}
describe("PluginAgentClientRegistry", () => {
test("returns unavailable when steering a provider without prompt.steer capability", async () => {
const harness = createProviderHarness();
const registry = new PluginAgentClientRegistry(createTestLogger());
registry.replace([harness.registration]);
const session = await registry.clients()[harness.registration.id]!.createSession({
provider: harness.registration.id,
cwd: "/tmp",
});
try {
await expect(
session.steerActiveTurn!("follow up", { expectedTurnId: "turn-1" }),
).resolves.toEqual({ status: "unavailable" });
expect(harness.inputs.filter((input) => input.type === "session.prompt")).toHaveLength(0);
} finally {
await session.close();
registry.replace([]);
}
});
test("resumes a native ACP handle after the same provider ID moves to a plugin", async () => {
const harness = createProviderHarness();
const registry = new PluginAgentClientRegistry(createTestLogger());
registry.replace([harness.registration]);
try {
const session = await registry.clients()[harness.registration.id]!.resumeSession(
{
provider: harness.registration.id,
sessionId: "native-session-id",
nativeHandle: "native-session-id",
metadata: { provider: "acp", cwd: "/tmp" },
},
{ provider: harness.registration.id, cwd: "/tmp" },
);
await session.close();
} finally {
registry.replace([]);
}
});
test("stores only agent options while the plugin receives merged defaults", async () => {
const logger = createTestLogger();
const harness = createProviderHarness();
@@ -1,5 +1,5 @@
import { createHook } from "node:async_hooks";
import { execFileSync, spawn, type ChildProcess } from "node:child_process";
import { execFileSync } from "node:child_process";
import {
mkdtempSync,
mkdirSync,
@@ -1066,16 +1066,6 @@ describe("relative typed-entry configuration", () => {
});
});
interface SearchProcessExit {
code: number | null;
signal: string | null;
}
interface SearchProcess {
child: ChildProcess;
exited: Promise<SearchProcessExit>;
}
// Reading a tree is cheap; re-deriving each entry's path state is not. A scan that asks whether
// every ancestor of every entry is inside the root, or is Git-ignored, costs multiples of the
// read and is what made large home directories exceed the client request timeout.
@@ -1083,7 +1073,6 @@ describe("home-tree scan cost", () => {
const DEPTH = 8;
const CHAINS = 40;
let scanRoot: string;
let searchProcess: SearchProcess | null = null;
beforeEach(() => {
scanRoot = realpathSync.native(mkdtempSync(path.join(tmpdir(), "directory-scan-cost-")));
@@ -1094,16 +1083,8 @@ describe("home-tree scan cost", () => {
}
});
afterEach(async () => {
try {
if (searchProcess) {
searchProcess.child.kill();
await searchProcess.exited;
}
} finally {
searchProcess = null;
rmSync(scanRoot, { recursive: true, force: true });
}
afterEach(() => {
rmSync(scanRoot, { recursive: true, force: true });
});
// Nothing matches, so the scan walks the whole tree instead of stopping at a confident result.
@@ -1121,78 +1102,6 @@ describe("home-tree scan cost", () => {
return stopPathContainmentMetrics();
}
it("finishes overlapping broad-tree searches within a bounded heap", async () => {
const broadRoot = path.join(scanRoot, "broad");
mkdirSync(broadRoot);
for (let branch = 0; branch < 30; branch += 1) {
const branchRoot = path.join(broadRoot, `branch-${branch}`);
mkdirSync(branchRoot);
for (let group = 0; group < 30; group += 1) {
const groupRoot = path.join(branchRoot, `group-${group}`);
mkdirSync(groupRoot);
for (let leaf = 0; leaf < 30; leaf += 1) {
mkdirSync(path.join(groupRoot, `leaf-${leaf}`));
}
}
}
// A smaller real tree and explicit heap budget keep the million-directory repro cheap in CI.
const moduleUrl = new URL("./directory-suggestions.ts", import.meta.url).href;
const source = `
const { searchDirectoryEntries } = await import(${JSON.stringify(moduleUrl)});
const results = await Promise.all(Array.from({ length: 14 }, (_, index) =>
searchDirectoryEntries({
root: ${JSON.stringify(broadRoot)},
query: "z".repeat(index + 1),
pathFormat: "absolute",
includeFiles: false,
includeDirectories: true,
pathQueryPolicy: "rooted",
rootAliases: ["~"],
blankQueryBehavior: "none",
confidentResultScanThreshold: 5000,
maxEntriesScanned: 2000,
limit: 30,
})
));
process.stdout.write(JSON.stringify(results));
`;
const child = spawn(
process.execPath,
[
"--max-old-space-size=128",
"--conditions=source",
"--import",
"tsx",
"--input-type=module",
"--eval",
source,
],
{ stdio: ["ignore", "pipe", "pipe"], timeout: 20_000 },
);
let stdout = "";
let stderr = "";
child.stdout.setEncoding("utf8");
child.stderr.setEncoding("utf8");
child.stdout.on("data", (chunk: string) => {
stdout += chunk;
});
child.stderr.on("data", (chunk: string) => {
stderr += chunk;
});
const exited = new Promise<SearchProcessExit>((resolve, reject) => {
child.on("error", reject);
child.on("close", (code, signal) => resolve({ code, signal }));
});
searchProcess = { child, exited };
const exit = await exited;
expect({ ...exit, outOfMemory: stderr.includes("heap out of memory") }).toEqual({
code: 0,
signal: null,
outOfMemory: false,
});
expect(JSON.parse(stdout)).toEqual(Array.from({ length: 14 }, () => []));
});
it("derives no containment for a tree that cannot leave the root", async () => {
const checks = await countContainmentChecks(scanWholeTree);
@@ -63,13 +63,6 @@ interface WalkStart {
resolvedPath: string;
}
interface WalkChildrenOptions {
parent: WalkStart;
depth: number;
input: SearchInput;
visited: Set<string>;
}
interface TraversedEntry extends ChildEntry {
visiblePath: string;
depth: number;
@@ -325,18 +318,17 @@ async function searchChildren(input: SearchInput): Promise<RankedEntry[]> {
const discoveryInput = isInsideExcludedPath(parent, input)
? { ...input, excludedDiscoveryPaths: new Set<string>() }
: input;
const ranked: RankedEntry[] = [];
for await (const entry of readChildren(parent)) {
const entries = await readChildren(parent);
return entries.flatMap((entry) => {
if (!isPathInsideRoot(input.root, entry.resolvedPath) || !shouldDiscover(entry, discoveryInput))
continue;
return [];
const candidate: TraversedEntry = {
...entry,
visiblePath: path.join(visibleParent, entry.name),
depth: 1,
};
if (shouldSuggest(candidate, input)) ranked.push(rank(candidate, input));
}
return ranked;
return shouldSuggest(candidate, input) ? [rank(candidate, input)] : [];
});
}
async function searchTree(
@@ -344,8 +336,21 @@ async function searchTree(
start: WalkStart = { visiblePath: input.root, resolvedPath: input.root },
): Promise<RankedEntry[]> {
if (!(input.maxEntriesScanned > 0)) return [];
const roots = (await readChildren(start.resolvedPath)).filter((entry) =>
staysInsideRoot(entry, input.root),
);
const visited = new Set<string>([start.resolvedPath]);
const branches = walkChildren({ parent: start, depth: 1, input, visited });
const branches = roots.flatMap((entry) =>
shouldDiscover(entry, input)
? [
walkBranch(
{ ...entry, visiblePath: path.join(start.visiblePath, entry.name), depth: 1 },
input,
visited,
),
]
: [],
);
const ranked: RankedEntry[] = [];
let scanned = 0;
const threshold = input.confidentResultScanThreshold;
@@ -376,39 +381,38 @@ async function* walkBranch(
)
return;
visited.add(entry.resolvedPath);
yield* roundRobin(walkChildren({ parent: entry, depth: entry.depth + 1, input, visited }));
const children = (await readChildren(entry.resolvedPath)).filter((child) =>
staysInsideRoot(child, input.root),
);
const branches = children.flatMap((child) =>
shouldDiscover(child, input)
? [
walkBranch(
{
...child,
visiblePath: path.join(entry.visiblePath, child.name),
depth: entry.depth + 1,
},
input,
visited,
),
]
: [],
);
yield* roundRobin(branches);
}
// Create a child's path and iterator only when its branch gets a turn. Eagerly constructing every
// sibling's subtree retained hundreds of thousands of unvisited children beyond the scan budget.
async function* walkChildren({
parent,
depth,
input,
visited,
}: WalkChildrenOptions): AsyncGenerator<AsyncGenerator<TraversedEntry>> {
for await (const child of readChildren(parent.resolvedPath)) {
if (!staysInsideRoot(child, input.root) || !shouldDiscover(child, input)) continue;
yield walkBranch(
{ ...child, visiblePath: path.join(parent.visiblePath, child.name), depth },
input,
visited,
);
}
}
async function* roundRobin<T>(branches: AsyncIterable<AsyncGenerator<T>>): AsyncGenerator<T> {
let active: AsyncIterable<AsyncGenerator<T>> | Array<AsyncGenerator<T>> = branches;
while (true) {
async function* roundRobin<T>(branches: Array<AsyncGenerator<T>>): AsyncGenerator<T> {
let active = branches;
while (active.length) {
const nextRound: Array<AsyncGenerator<T>> = [];
for await (const branch of active) {
for (const branch of active) {
const next = await branch.next();
if (!next.done) {
nextRound.push(branch);
yield next.value;
}
}
if (!nextRound.length) return;
active = nextRound;
}
}
@@ -738,9 +742,9 @@ async function resolveDirectory(inputPath: string): Promise<string | null> {
return info?.isDirectory() ? resolved : null;
}
async function* readChildren(directory: string): AsyncGenerator<ChildEntry> {
async function readChildren(directory: string): Promise<ChildEntry[]> {
const directoryInfo = await stat(directory).catch(() => null);
if (!directoryInfo?.isDirectory()) return;
if (!directoryInfo?.isDirectory()) return [];
const cached = CAN_VALIDATE_DIRECTORY_CACHE_FROM_METADATA
? directoryListCache.get(directory)
@@ -770,10 +774,9 @@ async function* readChildren(directory: string): AsyncGenerator<ChildEntry> {
}
}
for (const rawEntry of rawEntries) {
const entry = await resolveChild(directory, rawEntry);
if (entry) yield entry;
}
return (await Promise.all(rawEntries.map((entry) => resolveChild(directory, entry))))
.filter((entry): entry is ChildEntry => entry !== null)
.sort((left, right) => left.name.localeCompare(right.name));
}
async function loadGitIgnoredPaths(root: string): Promise<Set<string>> {