ci: shard extension fast checks

This commit is contained in:
Peter Steinberger
2026-04-03 18:26:14 +01:00
parent 230c61885d
commit ebdade0efc
5 changed files with 321 additions and 9 deletions

View File

@@ -2,8 +2,10 @@ import fs from "node:fs";
import path from "node:path";
import { channelTestRoots } from "../../vitest.channel-paths.mjs";
import { BUNDLED_PLUGIN_PATH_PREFIX, BUNDLED_PLUGIN_ROOT_DIR } from "./bundled-plugin-paths.mjs";
import { listAvailableExtensionIds } from "./changed-extensions.mjs";
const repoRoot = path.resolve(import.meta.dirname, "..", "..");
export const DEFAULT_EXTENSION_TEST_SHARD_COUNT = 6;
function normalizeRelative(inputPath) {
return inputPath.split(path.sep).join("/");
@@ -102,3 +104,100 @@ export function resolveExtensionTestPlan(params = {}) {
testFileCount,
};
}
function mergeTestPlans(plans) {
const groupsByConfig = new Map();
for (const plan of plans) {
const current = groupsByConfig.get(plan.config) ?? {
config: plan.config,
extensionIds: [],
roots: [],
testFileCount: 0,
};
current.extensionIds.push(plan.extensionId);
current.roots.push(...plan.roots);
current.testFileCount += plan.testFileCount;
groupsByConfig.set(plan.config, current);
}
const planGroups = [...groupsByConfig.values()]
.map((group) => ({
...group,
extensionIds: group.extensionIds.toSorted((left, right) => left.localeCompare(right)),
roots: [...new Set(group.roots)],
}))
.toSorted((left, right) => left.config.localeCompare(right.config));
return {
extensionCount: plans.length,
extensionIds: plans
.map((plan) => plan.extensionId)
.toSorted((left, right) => left.localeCompare(right)),
hasTests: plans.length > 0,
planGroups,
testFileCount: plans.reduce((sum, plan) => sum + plan.testFileCount, 0),
};
}
export function resolveExtensionBatchPlan(params = {}) {
const cwd = params.cwd ?? process.cwd();
const extensionIds = params.extensionIds ?? listAvailableExtensionIds();
const plans = extensionIds
.map((extensionId) => resolveExtensionTestPlan({ cwd, targetArg: extensionId }))
.filter((plan) => plan.hasTests);
return mergeTestPlans(plans);
}
function pickLeastLoadedShard(shards) {
return shards.reduce((bestIndex, shard, index) => {
if (bestIndex === -1) {
return index;
}
const best = shards[bestIndex];
if (shard.testFileCount !== best.testFileCount) {
return shard.testFileCount < best.testFileCount ? index : bestIndex;
}
if (shard.plans.length !== best.plans.length) {
return shard.plans.length < best.plans.length ? index : bestIndex;
}
return index < bestIndex ? index : bestIndex;
}, -1);
}
export function createExtensionTestShards(params = {}) {
const cwd = params.cwd ?? process.cwd();
const extensionIds = params.extensionIds ?? listAvailableExtensionIds();
const shardCount = Math.max(1, Number.parseInt(String(params.shardCount ?? ""), 10) || 1);
const plans = extensionIds
.map((extensionId) => resolveExtensionTestPlan({ cwd, targetArg: extensionId }))
.filter((plan) => plan.hasTests)
.toSorted((left, right) => {
if (left.testFileCount !== right.testFileCount) {
return right.testFileCount - left.testFileCount;
}
return left.extensionId.localeCompare(right.extensionId);
});
const effectiveShardCount = Math.min(shardCount, Math.max(1, plans.length));
const shards = Array.from({ length: effectiveShardCount }, () => ({
plans: [],
testFileCount: 0,
}));
for (const plan of plans) {
const targetIndex = pickLeastLoadedShard(shards);
shards[targetIndex].plans.push(plan);
shards[targetIndex].testFileCount += plan.testFileCount;
}
return shards
.map((shard, index) => ({
index,
checkName: `checks-fast-extensions-shard-${index + 1}`,
...mergeTestPlans(shard.plans),
}))
.filter((shard) => shard.hasTests);
}