Plans 013 and 014, the album page that prompted them, and the smaller fixes they turned up. Changelog, largest first. ## The local library is shaped like files, not like MusicBrainz `audio_files` carries its own tags and points at `albums` and `artists`; `file_genres` is the one real many-to-many. `recordings`, `release_group_recordings`, `artist_credit`, `artist_credit_artist`, `recording_genres`, `release_groups` and `release_to_rg` are gone from the local side, and with them a six-way join in every read, a `MIN(release_group_id)` subquery in eleven queries and a first-credited-artist subquery in nine. Measured on a real 25,966-file library, every many-to-many that model expressed was 1:1 in the data. - Ownership is a file. `GetFilePathsByRecordingMBIDs`, `LibraryMBIDIndex.CheckMBIDs`, `collectLibraryEntities` and `pruneStaleLocalCrossReferences` all join `audio_files`, so the 812 orphaned recordings, 216 release groups and 260 artists that library carried are now structurally impossible. - One projection: every track query selects from the `track_metadata` view, one row type, one mapper. Nine hand-rolled copies had drifted far enough to report different years on different screens. - `library_id = 0` means every library, so each list query exists once instead of scoped and unscoped with a branch at every call site. - No migration chain. `sql/schemas/` is the one description of the shape; `sql/migrations/`, `applyMigrations` and `schema_migrations` are squashed away, along with the drift between them that had sqlc generating against a stale schema. - `database.InsertTestTrack` is the one test seeder; twenty test files had been assembling the old FK chain each in its own order. ## The catalog stores its ids as bytes `explore_index`'s three 36-char MBID columns and its entity-type text are 16 raw bytes and a small integer. The table and its six indexes go 780 MB to 405 MB on a real 2,052,200-row catalog, which is why a fresh install is ~0.6 GB rather than ~1.0 GB. - `backend/explore/mbid.go` is the only place the encoding is known; everything above it speaks dashed strings. - `CHECK(length(mbid) = 16)` makes a stringly write fail at the insert rather than silently returning no rows, since SQLite does not coerce between TEXT and BLOB. - The importer asks the artifact what encoding it carries and converts on the way in, so the artifact already published keeps working and no format bump is needed. - `indexRowColumns`/`scanIndexRow` replace four copies of a 22-column list, and `TestStoredEncodingRoundTrips` sweeps every read path. ## An album page that says how much of the album is yours - One question, asked once: is there a file. `filePaths` is filled by a single batched lookup when the tracklist settles, and the badge, the Play count, the dimmed rows and every menu item read it — replacing four claims of decreasing confidence that could show a green tick on an album whose every action did nothing. - Play, Play 7 of 12, or no play button at all. - `total_tracks` on `explore_index` (~2 bytes over 400,677 release groups) and on `audio_files` from tags that have always carried it: a complete MBID-matched album now makes no catalog call at all, where it used to spend the most expensive request the app makes. - A merged cluster shows the running order the most releases agree on, and the version list marks the release you own rather than standing a synthetic entry in for it. - `AlbumReleasesFailed`: a slow fetch is no longer reported as a failed one by a 12-second timer. - Rows not in the library are dimmed in place (with `aria-disabled`) instead of the owned ones wearing a green tick and a legend. ## Caches and cover art get ceilings - Only the three tiers of a cover are stored; the full-resolution copy nothing rendered was 1,134 MB of a 1.4 GB covers directory. - One artist portrait is downloaded and the rest are remembered as URLs — 4.1 GB of a 5.3 GB cache was candidates no code path reads. - `browsedArtBudget` and `httpCacheBudget` bound what an age cannot: the same install held art for 5,770 artists in a 1,301-artist library. - `OrphanedArtistImagesJob` joined a bare MBID onto a sharded directory, so it deleted the rows that were the only record of the files it left behind. `explore.ArtistImageDir` is that layout's one definition now. ## The autotag queue asks whether there is work `tagging_items` was a row per album folder, not a queue, and no query read the `tag_status` column that held the answer. The four queue queries ask the files, which matters most where it is least visible: `startPrefetch` was scoring every album in a tagged library against MusicBrainz. ## Phantom playlist tracks resolve in place An M3U8 imported before its files leaves phantom rows; they now match by path and fall back to position, keep their place in the playlist when resolved, and pair best-first so two phantoms cannot claim the same file. ## Playing a track plays the list it is in Double-click, and Play on a single row's menu, queue the list as displayed with `startIndex` on that row — the album page and the track list used to queue one track and discard the album around it. A multi-row selection still plays exactly itself. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01AfVYUVExXsx1nSWrXN8mAh
195 lines
5.1 KiB
Go
195 lines
5.1 KiB
Go
//go:build dev
|
|
|
|
package testctl
|
|
|
|
import (
|
|
"context"
|
|
"log/slog"
|
|
"net/http"
|
|
"net/http/httptest"
|
|
"net/url"
|
|
"os"
|
|
"testing"
|
|
|
|
"yellowjacket/backend/database"
|
|
)
|
|
|
|
// newDeps wires the control surface to an in-memory database and a
|
|
// throwaway YJ_HOME, so snapshots land somewhere the test owns.
|
|
func newDeps(t *testing.T) Deps {
|
|
t.Helper()
|
|
|
|
t.Setenv("YJ_HOME", t.TempDir())
|
|
|
|
return Deps{
|
|
Logger: slog.New(slog.DiscardHandler),
|
|
DB: database.NewTestDB(t),
|
|
Context: context.Background,
|
|
}
|
|
}
|
|
|
|
// TestRestoreRoundTrip is the regression test for the failure this
|
|
// endpoint shipped with first: copying tables in *name* order deletes a
|
|
// parent row whose ON DELETE CASCADE then wipes a child table already
|
|
// restored earlier in the loop, and the commit fails with a bare
|
|
// "FOREIGN KEY constraint failed (787)" naming nothing. Deferring the
|
|
// check is not enough — the cascade still fires — so the copy runs with
|
|
// foreign keys off and is verified afterwards.
|
|
func TestRestoreRoundTrip(t *testing.T) {
|
|
// No t.Parallel: newDeps uses t.Setenv (YJ_HOME), which the testing
|
|
// package forbids in parallel tests because the environment is
|
|
// process-wide.
|
|
d := newDeps(t)
|
|
|
|
if _, err := d.DB.ExecContext(
|
|
`INSERT INTO libraries (id, name, path) VALUES (1, 'fixtures', '/music')`,
|
|
); err != nil {
|
|
t.Fatalf("seed library: %v", err)
|
|
}
|
|
|
|
database.InsertTestTrack(t, d.DB, database.TestTrack{
|
|
FilePath: "/music/a.mp3",
|
|
Title: "A",
|
|
Artist: "Fixture Artist",
|
|
LengthMs: 2000,
|
|
LibraryID: 1,
|
|
})
|
|
|
|
snapReq := httptest.NewRequest(http.MethodPost, "/__test/db/snapshot?name=unit", nil)
|
|
|
|
if _, err := handleSnapshot(d, snapReq); err != nil {
|
|
t.Fatalf("snapshot: %v", err)
|
|
}
|
|
|
|
if _, err := d.DB.ExecContext(`DELETE FROM audio_files`); err != nil {
|
|
t.Fatalf("mutate: %v", err)
|
|
}
|
|
|
|
if got := countTracks(t, d); got != 0 {
|
|
t.Fatalf("after delete: got %d tracks, want 0", got)
|
|
}
|
|
|
|
restoreReq := httptest.NewRequest(http.MethodPost, "/__test/db/restore?name=unit", nil)
|
|
|
|
if _, err := handleRestore(d, restoreReq); err != nil {
|
|
t.Fatalf("restore: %v", err)
|
|
}
|
|
|
|
if got := countTracks(t, d); got != 1 {
|
|
t.Fatalf("after restore: got %d tracks, want 1", got)
|
|
}
|
|
|
|
// Enforcement must be back on afterwards; leaving it off would let
|
|
// every later test — and the running app — write garbage silently.
|
|
var fk int
|
|
if err := d.DB.QueryRowWriter("PRAGMA foreign_keys").Scan(&fk); err != nil {
|
|
t.Fatalf("read pragma: %v", err)
|
|
}
|
|
|
|
if fk != 1 {
|
|
t.Fatal("foreign keys left disabled after restore")
|
|
}
|
|
}
|
|
|
|
// TestRestorableTablesSkipsFTSInternals guards the other half of the
|
|
// copy: FTS5 virtual tables cannot be written with SELECT *, and their
|
|
// shadow tables (_data, _idx, _docsize, _config) are storage details
|
|
// that must be rebuilt rather than copied.
|
|
func TestRestorableTablesSkipsFTSInternals(t *testing.T) {
|
|
tables, err := restorableTables(newDeps(t))
|
|
if err != nil {
|
|
t.Fatalf("restorableTables: %v", err)
|
|
}
|
|
|
|
if len(tables) == 0 {
|
|
t.Fatal("no restorable tables found")
|
|
}
|
|
|
|
for _, name := range tables {
|
|
switch name {
|
|
case "search_index", "lyrics_index", "explore_index_fts",
|
|
"explore_champion_fts":
|
|
t.Errorf("virtual table %q must not be copied", name)
|
|
case "search_index_data", "lyrics_index_idx",
|
|
"explore_index_fts_config":
|
|
t.Errorf("shadow table %q must not be copied", name)
|
|
}
|
|
}
|
|
|
|
// explore_index is an ordinary table whose name is a prefix of two
|
|
// virtual ones; excluding it would silently drop the catalog.
|
|
if !contains(tables, "explore_index") {
|
|
t.Error("explore_index was wrongly treated as an FTS internal")
|
|
}
|
|
}
|
|
|
|
func TestSnapshotNameIsValidated(t *testing.T) {
|
|
d := newDeps(t)
|
|
|
|
for _, name := range []string{"", "../escape", "has space", "a/b"} {
|
|
req := httptest.NewRequest(
|
|
http.MethodPost,
|
|
"/__test/db/snapshot?name="+url.QueryEscape(name),
|
|
nil,
|
|
)
|
|
|
|
if _, err := handleSnapshot(d, req); err == nil {
|
|
t.Errorf("snapshot(%q) was accepted", name)
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestRegisterRequiresOptIn pins the second gate: a dev build alone must
|
|
// not expose the surface, because `make dev` is something a human runs.
|
|
func TestRegisterRequiresOptIn(t *testing.T) {
|
|
_ = os.Unsetenv(EnvEnable)
|
|
|
|
var r recordingRegistrar
|
|
|
|
Register(&r, Deps{Logger: slog.New(slog.DiscardHandler)})
|
|
|
|
if len(r.patterns) != 0 {
|
|
t.Fatalf("registered %v without %s=1", r.patterns, EnvEnable)
|
|
}
|
|
|
|
t.Setenv(EnvEnable, "1")
|
|
Register(&r, Deps{Logger: slog.New(slog.DiscardHandler)})
|
|
|
|
if len(r.patterns) != 1 || r.patterns[0] != Prefix {
|
|
t.Fatalf("got patterns %v, want [%s]", r.patterns, Prefix)
|
|
}
|
|
}
|
|
|
|
// recordingRegistrar stands in for *assets.Handler and remembers what
|
|
// was mounted.
|
|
type recordingRegistrar struct {
|
|
patterns []string
|
|
}
|
|
|
|
func (r *recordingRegistrar) RegisterHandler(pattern string, _ http.Handler) {
|
|
r.patterns = append(r.patterns, pattern)
|
|
}
|
|
|
|
func countTracks(t *testing.T, d Deps) int {
|
|
t.Helper()
|
|
|
|
var n int
|
|
if err := d.DB.QueryRowWriter(
|
|
"SELECT COUNT(*) FROM audio_files",
|
|
).Scan(&n); err != nil {
|
|
t.Fatalf("count: %v", err)
|
|
}
|
|
|
|
return n
|
|
}
|
|
|
|
func contains(haystack []string, needle string) bool {
|
|
for _, s := range haystack {
|
|
if s == needle {
|
|
return true
|
|
}
|
|
}
|
|
|
|
return false
|
|
}
|