mirror of
https://github.com/paperclipai/paperclip.git
synced 2026-10-31 14:16:39 +01:00
## Thinking Path > - Paperclip is the open source app people use to manage AI agents for work. > - Its CI must catch regressions without running unrelated work on every pull request. > - The existing task planner selects package lanes, but each selected lane still runs all its test files. > - Vitest can find related imports, but that graph misses tests that read files or launch processes. > - This pull request combines the real Vitest graph with conservative dependency checks before CI allocates test runners. > - The result runs fewer test files and can allocate fewer jobs while retaining tests with unknown dependencies. ## Linked Issues or Issue Description Refs #18214. The repository and PR search found no duplicate file-selection implementation. **What existing behavior does this improve?** The general and serialized Vitest lanes in pull request CI. **Current behavior** An affected package schedules its complete test lane and its fixed shard count. **Proposed behavior** For source-only diffs, select related tests plus conservative filesystem, process, network and opaque consumers. Repartition those files within their existing lane owners. Keep the complete original plan when selection cannot be trusted. **Reason and benefit** Avoid unrelated test execution and allocate fewer runners when the selected workload fits fewer existing job budgets. Report file counts and job counts separately. **Breaking changes** No product or API changes. The set of PR test files and jobs changes for eligible diffs. Full CI and the kill switch retain the original coverage. ## What Changed - Add a separate selection job on the gate-approved test fleet. The metadata gate does not load PR code. - Inspect real Vitest/Vite dependency edges. Retain opaque consumers and unchanged downstream projects. Respect only complete local mock factories. Reject unknown setup dependencies and source mutations during dependency setup. - Declare `oxc-parser` directly for AST inspection. This exact version is already a transitive dependency in the checked-in lockfile; the direct declaration avoids relying on pnpm's internal dependency layout. - Produce a merge-SHA-bound manifest with exact lane ownership and duration-aware partitions. Preserve serialized execution, chat shards and native Runner ownership. - Execute exact Vitest test specifications. Positional substring filters cannot accidentally run a similarly named file from another shard. - Use the original matrix if selection fails or times out. Fail selected jobs if their published artifact is missing or invalid. - Save the uploaded artifact ID in the executable plan. Failed-job retries reuse that artifact even when GitHub increments the attempt number. - Hash selected assignments into Turbo cache inputs. A subset cannot satisfy a full run or another subset. - Add graph, workflow, real-runner and real-Turbo qualification. The regression fixture proves a filesystem contract fails even when raw Vitest selection misses it. - Document selection limits, audit artifacts and `CI_VITEST_SELECTION=off`. ## Verification - All 138 affected routing, sharding, workflow, manifest, real Vitest and real Turbo checks passed under Node 24 on the final implementation. Additional release workflow checks passed. Cases cover opaque setup, remocking, generated inputs, Node's builtin loader, artifact retries, and exact execution of similarly named files. - Repository-wide `pnpm -r typecheck` and `pnpm build` passed before the clean rebase onto current master. The full remote typecheck and build are required on the current head. - `actionlint` passed for both changed workflows. `git diff --check` passed. - The Linux qualification run passed and selected 699 of 911 workspace test files for an Inbox change. UI graph construction took 16.1 seconds. This still uses two jobs. Synthetic partition coverage proves a 15-of-120 selection uses two of twelve jobs without dropping or duplicating files. - Both selected workspace shards passed locally. After tightening execution to exact specifications, the real colliding UI test ran as exactly one file with two passing assertions; the real server auth middleware test ran as exactly one file with 28 passing assertions. - The server probe selected 1,158 of 1,260 general files and 161 of 163 serialized files for an auth middleware change. Those conservative selections retain 12 general and nine serialized jobs. The server's temporary-home setup exception is pinned to reviewed content hashes; changed setup fails closed. - Full `pnpm test:run` has not been run locally. The full PR test matrix is required because this change modifies global CI inputs. Final-head CI is pending at runner allocation, and both qualification jobs are queued. Other recent repository workflows are also queued. Superseded runs of this PR were cancelled; this PR remains in draft until the required checks execute. - Greptile reviewed final commit `31b484fc5b412da245cffb52a8ac8977228c5651` at 5/5 with no unresolved findings. The earlier qualification run passed; it does not replace checks on the final commit. ## Risks - Dependency analysis adds setup and graph time. Fewer files do not guarantee a shorter critical path. CI summaries expose the actual file and job counts. - Static dependency graphs cannot describe all runtime inputs. Unknown inputs retain tests or use the original plan. The pure-package allowlist requires conservative review. - The trusted workflow runs from master. This PR exercises the new selector in the qualification workflow; ordinary PR selection starts after merge. Set `CI_VITEST_SELECTION=off`, use `full-ci`, or select full/shadow mode to disable narrowing. - The lockfile remains managed by the existing repository actions and is not changed here. ## Model Used OpenAI Codex, based on GPT-6, with repository tools and code execution. The exact serving model ID and context window are not exposed in this session. ## Checklist - [x] I have included a thinking path that traces from project context to this change - [x] I have specified the model used (with version and capability details) - [x] I have checked ROADMAP.md and confirmed this PR does not duplicate planned core work - [x] I have searched GitHub for duplicate or related PRs and linked them above - [x] I have either (a) linked existing issues with `Fixes: #` / `Closes #` / `Refs #` OR (b) described the issue in-PR following the relevant issue template - [x] I have not referenced internal/instance-local Paperclip issues or links (only public GitHub `#NNN` / `github.com/paperclipai/paperclip` URLs) - [x] My branch name describes the change (e.g. `docs/...`, `fix/...`) and contains no internal Paperclip ticket id or instance-derived details - [x] I have run tests locally and they pass - [x] I have added or updated tests where applicable - [x] I have updated relevant documentation to reflect my changes - [x] I have considered and documented any risks above - [ ] All Paperclip CI gates are green - [x] Greptile is 5/5 with no open P2s, recommendations, or follow-ups - [x] I will address all Greptile and reviewer comments before requesting merge --------- Co-authored-by: Paperclip <noreply@paperclip.ing>
78 lines
4.0 KiB
JavaScript
78 lines
4.0 KiB
JavaScript
import assert from "node:assert/strict";
|
|
import { loadShardDurations, partitionGeneralServerSuites } from "../general-server-shard.mjs";
|
|
import { selectionHash, validateSelection } from "./test-selection-manifest.mjs";
|
|
|
|
// Preserve the existing per-job budget. Small selections use fewer runners;
|
|
// large selections retain the existing parallelism and serialized ownership.
|
|
export function partitionSelection(inventory, selected, maxShards, durations = {}) {
|
|
const totalWeight = partitionGeneralServerSuites(inventory, 1, durations)[0].totalWeight;
|
|
const selectedWeight = partitionGeneralServerSuites(selected, 1, durations)[0].totalWeight;
|
|
const budget = totalWeight / maxShards || 1;
|
|
const count = Math.min(maxShards, selected.length, Math.max(1, Math.ceil(selectedWeight / budget)));
|
|
return selected.length ? partitionGeneralServerSuites(selected, count, durations).map((shard) => shard.files) : [];
|
|
}
|
|
|
|
export function refineTestPlan({ plan, head, owners, graphs, durations = {} }) {
|
|
const result = structuredClone(plan);
|
|
const manifest = { version: 1, head, lanes: {} };
|
|
const stats = [];
|
|
const byProject = new Map(graphs.map((graph) => [graph.project, graph]));
|
|
for (const job of ["general_tests", "verify_serialized_server"]) {
|
|
if (!plan.jobs[job].run) continue;
|
|
const entries = plan.jobs[job].matrix.include;
|
|
const groups = [...new Set(entries.map((entry) => entry.group ?? "serialized"))];
|
|
const matrix = [];
|
|
for (const group of groups) {
|
|
const original = entries.filter((entry) => (entry.group ?? "serialized") === group);
|
|
if (group === "general-chat") { matrix.push(...original); continue; }
|
|
const owned = owners[group];
|
|
assert.ok(owned, `Missing inventory owner: ${group}`);
|
|
const projectByFile = new Map();
|
|
const selected = [];
|
|
for (const [project, files] of Object.entries(owned)) {
|
|
const graph = byProject.get(project);
|
|
assert.ok(graph, `Missing project graph: ${project}`);
|
|
const inventory = new Set(graph.inventory);
|
|
const affected = new Set(graph.selected);
|
|
for (const file of files) {
|
|
assert.ok(inventory.has(file), `Runner/Vitest inventory disagreement: ${file}`);
|
|
assert.ok(!projectByFile.has(file), `Ambiguous owner: ${file}`);
|
|
projectByFile.set(file, project);
|
|
if (affected.has(file)) selected.push(file);
|
|
}
|
|
}
|
|
const partitions = partitionSelection([...projectByFile.keys()], selected, original.length, durations[group]);
|
|
if (partitions.length) {
|
|
const shards = partitions.map((files) => {
|
|
const shard = {};
|
|
for (const file of files) (shard[projectByFile.get(file)] ??= []).push(file);
|
|
return shard;
|
|
});
|
|
manifest.lanes[group] = { shards };
|
|
for (let index = 0; index < shards.length; index++) {
|
|
const entry = { ...original[0], selection: true };
|
|
if (original[0].shard_count) {
|
|
Object.assign(entry, { shard_index: index, shard_count: shards.length });
|
|
if (entry.shard_label) entry.shard_label = `${index + 1}/${shards.length}`;
|
|
if (entry.group_label) entry.group_label = entry.group_label.replace(/\(\d+\/\d+\)/, `(${index + 1}/${shards.length})`);
|
|
}
|
|
matrix.push(entry);
|
|
}
|
|
}
|
|
stats.push({ group, total: projectByFile.size, selected: selected.length, beforeJobs: original.length, jobs: partitions.length });
|
|
}
|
|
result.jobs[job] = { ...result.jobs[job], run: matrix.length > 0, selected: matrix.length, proposed: matrix.length,
|
|
matrix: { include: matrix.length ? matrix : entries } };
|
|
}
|
|
validateSelection(manifest);
|
|
result.testSelection = { version: 1, head, hash: selectionHash(manifest), stats };
|
|
return { plan: result, manifest };
|
|
}
|
|
|
|
export function selectionDurations() {
|
|
return {
|
|
"general-server-without-chat": loadShardDurations("scripts/general-server-shard-durations.json"),
|
|
serialized: loadShardDurations("scripts/serialized-shard-durations.json"),
|
|
};
|
|
}
|