Files
pad/internal/store/workspaces_test.go
T
xarmian 3c93472613 perf(store): run the store suite in parallel (TASK-2900 deliverable 3) (#1263)
The SQLite leg was CPU-bound and serial: 154.9s of CPU inside 185.6s of wall on
an eight-core box, which is 0.84 cores. Unlike the Postgres leg there was no
setup cost to reclaim — the unattributed gap between package wall-clock and the
sum of its tests measured MINUS 1.4s, so per-binary overhead was already nil —
and no fat test to find beyond one 48s outlier. The only lever left was the
seven idle cores.

t.Parallel() on 844 of 906 tests. Every test in this package builds its own
isolated store (a SQLite file copy, or since 6f8b6eb9 a Postgres clone), so it
shares no database with any other.

Medians on a quiet box, three SQLite repeats and two Postgres:

  SQLite wall     185.6s -> 111.0s   -40%
  Postgres wall   224.4s -> 121.2s   -46%   (495.8s -> 121.2s, -76%, since 6f8b6eb9)
  -race wall     2006.3s -> 1365.0s  -32%

THE COST, stated rather than folded into the win: SQLite CPU rose 154.9s ->
159.9s, +3.2%. That is contention overhead, it is real, and it is paid by
whoever else is on the box — this change moves WALL, it does not remove work.
A pre-registered prediction that CPU would stay within ~1% is falsified by that
number, though only just.

THAT FIGURE IS ITSELF A CORRECTION. An earlier draft of this message reported
the CPU cost as +10.4%, from ONE run taken while another seat was working the
box. Three repeats on a quiet box put the median at +3.2% — the published
number overstated the cost by more than three times. The direction survived the
correction and the magnitude did not, which is the case for repeating a figure
you intend to publish as a cost just as carefully as one you intend to publish
as a win.

Postgres binary CPU is flat to slightly down (63.9s -> 63.1s), which fits the
mechanism rather than contradicting it: that leg was 82% waiting, so parallelism
fills idle time instead of competing for cycles.

VARIANCE, since it changed shape: the parallel SQLite leg's repeat spread is
5.9% (106.7 / 111.0 / 113.2) against 0.7% for the serial leg it replaces.
Parallel runs are genuinely less reproducible than serial ones — scheduling
decides which tests share a core — so a future before/after on this package
needs more than one run per side to say anything, which the serial suite did
not.

The -race figure was measured because it was a RISK, not for completeness. CI's
Go job runs `go test -race -timeout=45m ./...` and already takes ~42 minutes;
the race detector serialises heavily, so parallelism could plausibly have made
that leg slower and pushed CI toward its own timeout. It does not: 2006s ->
1365s on the same box, measured against the template-only tree.

EXCLUSIONS — 62 tests, each for a mechanism rather than caution:

  19  files measuring ALLOCATIONS (runtime.ReadMemStats). Those counters are
      process-global, so a concurrent test's allocations land in the
      measurement. Excluded by FILE, since the hazard is the process.
   7  migration_guard_test.go, every test of which mutates the EXPORTED
      globals store.AllowSchemaAhead or store.BinaryVersion and restores in a
      t.Cleanup. AllowSchemaAhead=true under parallelism disarms the
      schema-ahead guard for every concurrently-running test — which is the
      property two of those very tests exist to assert.
  23  tests measuring ELAPSED TIME. Wall-clock under contention is not the
      wall-clock the assertion was written against.
   1  test mutating a PACKAGE-LEVEL GLOBAL (see below).
   3  the template mechanism tests, which assert on package-level counters.
  16  already had t.Parallel().

Excluding a test is a real remedy here rather than a hope, and the reason is a
Go semantic worth naming: a top-level test that calls t.Parallel() is HELD and
resumed only after the sequential pass finishes. Every excluded test therefore
still runs alone in a quiet process, which is exactly the property its timing or
allocation assertion depends on.

TWO EXCLUSIONS WERE MISSED BY MY OWN SWEEP, and the shape is the same both
times — an instrument whose question was narrower than the claim resting on it.

FIRST (found before shipping, by grepping the package's own `var` lines):


I recorded that this package has "no per-test global setters", having grepped
t.Setenv, os.Setenv and Set*ForTesting — all genuinely zero. The counts were
true and the conclusion was false. That sweep asked whether a test changes the
ENVIRONMENT; the claim it was carrying was whether a test changes anything
GLOBAL, which is wider.

TestUpdateDocument_CascadeExhaustionRollsBackTheWholeRename assigns the
package-level cascadeRewriteAttempts and restores it in a defer. Under
t.Parallel that window stays open while every other cascade test runs. The
mutating test would not flake; the tests AROUND it would, intermittently, which
is the worst shape to debug. Found by a different question — grep the package's
own non-test `var` declarations, then grep the tests for each name.

SECOND (found by codex, P1, NOT by me): that grep was `^var [a-z]`. It finds
UNEXPORTED package vars and silently skips exported ones, so it never saw
store.AllowSchemaAhead or store.BinaryVersion — both mutated by every test in
migration_guard_test.go. The instrument asked "which unexported globals exist"
while the claim it carried was "which globals exist". The fix that caught the
first miss was itself too narrow to catch the second, which is the argument for
enforcing the invariant in code rather than trusting the sweep that produced it.

Both exclusions are now enforced by guards rather than by the exclusion list:
TestCascadeExhaustionStaysSerial (function-scoped) and
TestMigrationGuardTestsStaySerial (file-scoped). Both fail closed on a missing
file or renamed function, strip line comments so an explanatory comment naming
t.Parallel() can neither satisfy nor trip them, carry a positive control that
the scan can SEE a real t.Parallel() elsewhere, and are mutation-controlled in
both directions.

VERIFICATION — 10 runs, zero failures, zero data races:

  SQLite parallel    x4   exit 0
  Postgres parallel  x3   exit 0
  -race -timeout=45m x1   exit 0, zero DATA RACE reports
  baseline -race     x1   exit 0 (the counterfactual above)

A false alarm not filed as a finding: the first -race run exited 1 with zero
`--- FAIL` lines and zero data races — the shape that reads as a pass to
anything counting FAIL lines. The log said `panic: test timed out after 10m0s`.
That was the invocation, not the code: `-timeout` was omitted so Go's default
applied, and ci.yml already carries a comment explaining that the explicit
-timeout exists because the default is too low.

KNOWN BOUND, not a solved problem: the test container's max_connections is 100,
each store sets MaxOpenConns(25), and -parallel defaults to GOMAXPROCS. On an
eight-core box the worst case permits 200. Three Postgres runs showed no
53300 "too many clients", but the arithmetic still allows it on a larger box or
a heavier test, and that belongs here as a bound rather than as an absence of
observed failures.

Claude-Session: https://claude.ai/code/session_01HeChkgZVYb3NTgTcckF5KR
2026-09-06 16:59:31 -04:00

194 lines
7.0 KiB
Go

package store
import (
"database/sql"
"testing"
"time"
"github.com/PerpetualSoftware/pad/internal/models"
)
// TestRestoreWorkspace_ResurfacesIntact proves the core PLAN-1969 fact:
// DeleteWorkspace only soft-deletes the WORKSPACE row — items and
// collections underneath are never touched, just transitively hidden.
// RestoreWorkspace clears deleted_at and everything comes back intact.
func TestRestoreWorkspace_ResurfacesIntact(t *testing.T) {
t.Parallel()
s := testStore(t)
u, err := s.CreateUser(models.UserCreate{Email: "owner@test.com", Name: "Owner", Password: "correct-horse-battery-staple"})
if err != nil {
t.Fatalf("create user: %v", err)
}
ws, err := s.CreateWorkspace(models.WorkspaceCreate{Name: "Recoverable", OwnerID: u.ID})
if err != nil {
t.Fatalf("create workspace: %v", err)
}
coll := createTestCollection(t, s, ws.ID, "Tasks")
item := createTestItem(t, s, ws.ID, coll.ID, "Keep Me", "body")
// Soft-delete the workspace.
if err := s.DeleteWorkspace(ws.Slug); err != nil {
t.Fatalf("DeleteWorkspace: %v", err)
}
// The workspace is now hidden from the normal resolver...
if got, err := s.GetWorkspaceBySlug(ws.Slug); err != nil {
t.Fatalf("GetWorkspaceBySlug after delete: %v", err)
} else if got != nil {
t.Fatalf("expected soft-deleted workspace to be hidden from GetWorkspaceBySlug, got %+v", got)
}
// ...but its collection and item were NEVER soft-deleted — only the
// workspace row carries deleted_at.
if n := s.countRows(t, `SELECT COUNT(*) FROM collections WHERE id = ? AND deleted_at IS NULL`, coll.ID); n != 1 {
t.Errorf("collection should remain live (deleted_at NULL) after workspace delete, got %d", n)
}
if n := s.countRows(t, `SELECT COUNT(*) FROM items WHERE id = ? AND deleted_at IS NULL`, item.ID); n != 1 {
t.Errorf("item should remain live (deleted_at NULL) after workspace delete, got %d", n)
}
// Restore.
if err := s.RestoreWorkspace(ws.Slug); err != nil {
t.Fatalf("RestoreWorkspace: %v", err)
}
restored, err := s.GetWorkspaceBySlug(ws.Slug)
if err != nil {
t.Fatalf("GetWorkspaceBySlug after restore: %v", err)
}
if restored == nil {
t.Fatal("expected workspace to be visible again after restore")
}
if restored.DeletedAt != nil {
t.Errorf("restored workspace deleted_at should be nil, got %v", restored.DeletedAt)
}
// The item is retrievable through the normal getter again.
gotItem, err := s.GetItem(item.ID)
if err != nil {
t.Fatalf("GetItem after restore: %v", err)
}
if gotItem == nil || gotItem.Title != "Keep Me" {
t.Errorf("expected item to re-surface intact, got %+v", gotItem)
}
if n := s.countRows(t, `SELECT COUNT(*) FROM collections WHERE id = ? AND deleted_at IS NULL`, coll.ID); n != 1 {
t.Errorf("collection should still be live after restore, got %d", n)
}
}
// TestRestoreWorkspace_ErrNoRowsWhenNothingToRestore covers the
// idempotent-ish 404 semantics: restoring a live workspace, restoring
// twice, and restoring an unknown slug all return sql.ErrNoRows.
func TestRestoreWorkspace_ErrNoRowsWhenNothingToRestore(t *testing.T) {
t.Parallel()
s := testStore(t)
u, err := s.CreateUser(models.UserCreate{Email: "owner@test.com", Name: "Owner", Password: "correct-horse-battery-staple"})
if err != nil {
t.Fatalf("create user: %v", err)
}
ws, err := s.CreateWorkspace(models.WorkspaceCreate{Name: "Live One", OwnerID: u.ID})
if err != nil {
t.Fatalf("create workspace: %v", err)
}
// Restoring a live (never-deleted) workspace matches no soft-deleted row.
if err := s.RestoreWorkspace(ws.Slug); err != sql.ErrNoRows {
t.Errorf("restore of live workspace: expected sql.ErrNoRows, got %v", err)
}
// Delete, then the first restore succeeds.
if err := s.DeleteWorkspace(ws.Slug); err != nil {
t.Fatalf("DeleteWorkspace: %v", err)
}
if err := s.RestoreWorkspace(ws.Slug); err != nil {
t.Fatalf("first RestoreWorkspace should succeed: %v", err)
}
// A second restore (now live again) is a no-op → ErrNoRows.
if err := s.RestoreWorkspace(ws.Slug); err != sql.ErrNoRows {
t.Errorf("double restore: expected sql.ErrNoRows, got %v", err)
}
// Unknown slug → ErrNoRows.
if err := s.RestoreWorkspace("does-not-exist"); err != sql.ErrNoRows {
t.Errorf("restore of unknown slug: expected sql.ErrNoRows, got %v", err)
}
}
// TestListDeletedWorkspaces_WindowAndOwnerScope pins the 30-day restore
// window boundary (29d IN, 31d OUT — the inverse of the purge boundary),
// owner-scoping, live exclusion, and most-recently-deleted ordering.
func TestListDeletedWorkspaces_WindowAndOwnerScope(t *testing.T) {
t.Parallel()
s := testStore(t)
owner, err := s.CreateUser(models.UserCreate{Email: "owner@test.com", Name: "Owner", Password: "correct-horse-battery-staple"})
if err != nil {
t.Fatalf("create owner: %v", err)
}
other, err := s.CreateUser(models.UserCreate{Email: "other@test.com", Name: "Other", Password: "correct-horse-battery-staple"})
if err != nil {
t.Fatalf("create other: %v", err)
}
// Owner's workspaces.
inRecent := createWSWithDeletedAt(t, s, owner, "In Recent", time.Now().Add(-2*24*time.Hour))
inOld := createWSWithDeletedAt(t, s, owner, "In Old", time.Now().Add(-29*24*time.Hour))
out := createWSWithDeletedAt(t, s, owner, "Out", time.Now().Add(-31*24*time.Hour))
liveWS, err := s.CreateWorkspace(models.WorkspaceCreate{Name: "Live", OwnerID: owner.ID})
if err != nil {
t.Fatalf("create live workspace: %v", err)
}
// Another user's soft-deleted workspace — must never leak into the
// owner's list (owner-scoping; also the account-deleted-no-owner case).
otherWS := createWSWithDeletedAt(t, s, other, "Other Deleted", time.Now().Add(-1*24*time.Hour))
cutoff := time.Now().Add(-30 * 24 * time.Hour)
got, err := s.ListDeletedWorkspaces(owner.ID, cutoff)
if err != nil {
t.Fatalf("ListDeletedWorkspaces(owner): %v", err)
}
ids := map[string]bool{}
for _, w := range got {
ids[w.ID] = true
if w.DeletedAt == nil {
t.Errorf("deleted workspace %s should carry deleted_at", w.Slug)
}
}
if !ids[inRecent] {
t.Errorf("workspace deleted 2d ago should be restorable")
}
if !ids[inOld] {
t.Errorf("workspace deleted 29d ago should be restorable (boundary IN)")
}
if ids[out] {
t.Errorf("workspace deleted 31d ago must NOT be restorable (boundary OUT)")
}
if ids[liveWS.ID] {
t.Errorf("live workspace must NEVER appear in the deleted list")
}
if ids[otherWS] {
t.Errorf("another user's deleted workspace must not leak (owner-scoping)")
}
if len(got) != 2 {
t.Fatalf("expected exactly 2 restorable workspaces for owner, got %d", len(got))
}
// Ordering: most-recently-deleted first.
if got[0].ID != inRecent || got[1].ID != inOld {
t.Errorf("expected DESC deleted_at ordering [inRecent, inOld], got [%s, %s]", got[0].ID, got[1].ID)
}
// The other user sees only their own deleted workspace.
gotOther, err := s.ListDeletedWorkspaces(other.ID, cutoff)
if err != nil {
t.Fatalf("ListDeletedWorkspaces(other): %v", err)
}
if len(gotOther) != 1 || gotOther[0].ID != otherWS {
t.Errorf("other user should see exactly their own deleted workspace, got %+v", gotOther)
}
}