A gate that does not depend on its machine, on a runner of its own
Test / gate (push) Canceled after 0s

The gate first ran on the server that deploys the site: a slow container
with no C compiler and no ICU. Ten tests failed there on correct code,
and no Mojo program could be built at all.

- The workflows ask for a runner labeled heavy, not the deploy server:
  the gate builds and runs some 300 Mojo programs and fuzzes. docs/ci.md
  says how to register one. With none registered a run waits.
- The pinned environment has a C compiler on Linux (gcc, with its C
  library pinned to glibc 2.34): mojo build links with the C compiler it
  finds, and conda-forge's default links against a C library too old
  for Mojo's runtime. mojo-local reports a program that could not be
  linked as that, and does not keep the answer.
- The pinned Dafny runs without ICU, and dafny-fetch fails when the
  Dafny it fetched does not start.
- A test's time limit is processor time at the machine's pace
  (tests/helpers/pace.mjs).
- The prover's time on the clock is the caller's: provePseudo and
  Workspace.proofBudgetMs take it, the Prove tab's 3 seconds stay the
  default, and the command line, library-check and the tests use none,
  so their answers are the counted budgets' alone.
- The library pointer moves to its workflow change (e5ae090).
This commit is contained in:
alexm committed 2026-11-13 06:13:28 -05:00
1 parent 401084bab3
commit b10a5c87a3
31 files changed
+427 -104

No files matched your search

+6 -4
View File
@@ -12,6 +12,7 @@ import { parseAsm, runAsmProgram } from '../dist/services/asm.js';
import { SERVICES } from '../dist/services/index.js';
import { SyncHub, LINKED, FAULT_ID } from '../dist/sync/hub.js';
import { Workspace } from '../dist/common/workspace.js';
import { within } from './helpers/pace.mjs';
const ids = (r) => r.diagnostics.filter((d) => d.severity === 'error').map((d) => d.id);
/** The app's path for a pane: a workspace opening it, and an edit through the hub. */
@@ -93,10 +94,11 @@ test('matho: an equation nested past 200 levels is matho-too-deep, and one past
test('speco: a claim of 30,000 nested bars reads in linear time (each bar trimmed and searched the whole claim)', { timeout: 10000 }, () => {
const big = '|{ K ∈ [0, X) : '.repeat(30000) + 'TRUE' + ' }|'.repeat(30000);
const t0 = performance.now();
const doc = parseSpec(`SPEC F(X)\n ENSURE result = ${big}`);
assert.equal(doc.units[0].ensures.length, 1);
assert.ok(performance.now() - t0 < 5000);
// processor time at this machine's pace (tests/helpers/pace.mjs)
within(5000, '30,000 nested bars', () => {
const doc = parseSpec(`SPEC F(X)\n ENSURE result = ${big}`);
assert.equal(doc.units[0].ensures.length, 1);
});
toMath(toAscii(big));
// and what it reads is what it read before
assert.equal(toAscii('|{ K ∈ [0, |T|) : T[K] = B }|'), 'LENGTH({ K IN [0, LENGTH(T)) : T[K] == B })');