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
329 lines
9.4 KiB
Go
329 lines
9.4 KiB
Go
package database
|
|
|
|
import (
|
|
"crypto/sha256"
|
|
"strings"
|
|
"testing"
|
|
)
|
|
|
|
// seedExploreRow inserts one explore_index row.
|
|
//
|
|
// The catalog stores an MBID as 16 raw bytes and an entity type as a
|
|
// code (see backend/explore/mbid.go), and the column says so, so the
|
|
// label these tests use as an id is hashed into something the table
|
|
// will accept. What they actually assert on is the FTS text.
|
|
func seedExploreRow(t *testing.T, db *DB, mbid, title, artist string) {
|
|
t.Helper()
|
|
|
|
sum := sha256.Sum256([]byte(mbid))
|
|
|
|
if _, err := db.ExecContext(`
|
|
INSERT INTO explore_index (entity_type, mbid, title, artist_name, artist_mbid)
|
|
VALUES (3 /* recording */, ?, ?, ?, x'')
|
|
`, sum[:16], title, artist); err != nil {
|
|
t.Fatalf("seed %s: %v", mbid, err)
|
|
}
|
|
}
|
|
|
|
// ftsMatches returns how many FTS rows match a query.
|
|
func ftsMatches(t *testing.T, db *DB, query string) int {
|
|
t.Helper()
|
|
|
|
rows, err := db.QueryContext(
|
|
"SELECT COUNT(*) FROM explore_index_fts WHERE explore_index_fts MATCH ?", query,
|
|
)
|
|
if err != nil {
|
|
t.Fatalf("fts query %q: %v", query, err)
|
|
}
|
|
|
|
defer func() { _ = rows.Close() }()
|
|
|
|
n := 0
|
|
|
|
if rows.Next() {
|
|
if err := rows.Scan(&n); err != nil {
|
|
t.Fatalf("scan fts count: %v", err)
|
|
}
|
|
}
|
|
|
|
if err := rows.Err(); err != nil {
|
|
t.Fatalf("fts rows: %v", err)
|
|
}
|
|
|
|
return n
|
|
}
|
|
|
|
// Rows written while FTS sync is suspended are invisible to search
|
|
// until the window closes — and fully searchable afterwards. This is
|
|
// the contract the dump import's bulk-load path depends on.
|
|
func TestExploreFTSSuspendResumeIndexesBulkRows(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
seedExploreRow(t, db, "mbid-before", "Before Suspend", "Artist One")
|
|
|
|
if got := ftsMatches(t, db, "Before"); got != 1 {
|
|
t.Fatalf("matches for pre-suspend row = %d, want 1", got)
|
|
}
|
|
|
|
if err := db.SuspendExploreIndexFTS(); err != nil {
|
|
t.Fatalf("suspend: %v", err)
|
|
}
|
|
|
|
seedExploreRow(t, db, "mbid-during", "During Suspend", "Artist Two")
|
|
|
|
if got := ftsMatches(t, db, "During"); got != 0 {
|
|
t.Errorf("matches while suspended = %d, want 0 (triggers should be off)", got)
|
|
}
|
|
|
|
if err := db.ResumeExploreIndexFTS(); err != nil {
|
|
t.Fatalf("resume: %v", err)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "During"); got != 1 {
|
|
t.Errorf("matches for bulk-loaded row after resume = %d, want 1", got)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Before"); got != 1 {
|
|
t.Errorf("matches for pre-suspend row after resume = %d, want 1", got)
|
|
}
|
|
}
|
|
|
|
// The import wipes explore_index before reassembling it. With the
|
|
// triggers suspended that DELETE writes no FTS delete-markers, so the
|
|
// rebuild must be what clears the old rows out of search.
|
|
func TestExploreFTSResumeDropsDeletedRows(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
seedExploreRow(t, db, "mbid-stale", "Stale Recording", "Old Artist")
|
|
|
|
if err := db.SuspendExploreIndexFTS(); err != nil {
|
|
t.Fatalf("suspend: %v", err)
|
|
}
|
|
|
|
if _, err := db.ExecContext("DELETE FROM explore_index"); err != nil {
|
|
t.Fatalf("wipe: %v", err)
|
|
}
|
|
|
|
seedExploreRow(t, db, "mbid-fresh", "Fresh Recording", "New Artist")
|
|
|
|
if err := db.ResumeExploreIndexFTS(); err != nil {
|
|
t.Fatalf("resume: %v", err)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Stale"); got != 0 {
|
|
t.Errorf("matches for wiped row = %d, want 0", got)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Fresh"); got != 1 {
|
|
t.Errorf("matches for reassembled row = %d, want 1", got)
|
|
}
|
|
}
|
|
|
|
// resumeFTS runs from a defer as well as at its natural point in the
|
|
// pipeline, so a second call must be harmless.
|
|
func TestExploreFTSResumeIsIdempotent(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
if err := db.SuspendExploreIndexFTS(); err != nil {
|
|
t.Fatalf("suspend: %v", err)
|
|
}
|
|
|
|
seedExploreRow(t, db, "mbid-a", "Repeatable Resume", "Artist")
|
|
|
|
if err := db.ResumeExploreIndexFTS(); err != nil {
|
|
t.Fatalf("first resume: %v", err)
|
|
}
|
|
|
|
if err := db.ResumeExploreIndexFTS(); err != nil {
|
|
t.Fatalf("second resume: %v", err)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Repeatable"); got != 1 {
|
|
t.Errorf("matches after repeated resume = %d, want 1", got)
|
|
}
|
|
|
|
// Triggers must still be live for ordinary writes after the window.
|
|
seedExploreRow(t, db, "mbid-b", "Postwindow Row", "Artist")
|
|
|
|
if got := ftsMatches(t, db, "Postwindow"); got != 1 {
|
|
t.Errorf("matches for row written after resume = %d, want 1", got)
|
|
}
|
|
}
|
|
|
|
// Suspending twice must not fail — the triggers are simply already gone.
|
|
func TestExploreFTSSuspendIsIdempotent(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
if err := db.SuspendExploreIndexFTS(); err != nil {
|
|
t.Fatalf("first suspend: %v", err)
|
|
}
|
|
|
|
if err := db.SuspendExploreIndexFTS(); err != nil {
|
|
t.Fatalf("second suspend: %v", err)
|
|
}
|
|
|
|
if err := db.ResumeExploreIndexFTS(); err != nil {
|
|
t.Fatalf("resume: %v", err)
|
|
}
|
|
}
|
|
|
|
// ftsSegmentCount reports how much the FTS index itself has been
|
|
// written to. Every delete + insert the update trigger performs
|
|
// appends to the shadow content table, so this is the observable that
|
|
// tells "the trigger re-indexed the row" from "the trigger declined
|
|
// to". Search results cannot: a no-op re-index leaves the same
|
|
// matches behind.
|
|
func ftsSegmentCount(t *testing.T, db *DB) int {
|
|
t.Helper()
|
|
|
|
rows, err := db.QueryContext("SELECT COUNT(*) FROM explore_index_fts_data")
|
|
if err != nil {
|
|
t.Fatalf("fts data count: %v", err)
|
|
}
|
|
|
|
defer func() { _ = rows.Close() }()
|
|
|
|
n := 0
|
|
|
|
if rows.Next() {
|
|
if err := rows.Scan(&n); err != nil {
|
|
t.Fatalf("scan fts data count: %v", err)
|
|
}
|
|
}
|
|
|
|
return n
|
|
}
|
|
|
|
// The common write in this schema is an upsert whose merge rules keep
|
|
// every existing value — the discography backfill re-browsing a known
|
|
// artist, the incremental dump refreshing popularity. Re-indexing
|
|
// those cost an FTS5 delete against a multi-million row index while
|
|
// holding the single writer connection, which is what starved the
|
|
// playback path. An update that leaves title, artist_name and aliases
|
|
// alone must not touch the FTS index at all.
|
|
func TestExploreFTSUpdateSkipsUnchangedText(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
seedExploreRow(t, db, "mbid-1", "Unchanged Title", "Steady Artist")
|
|
|
|
before := ftsSegmentCount(t, db)
|
|
|
|
// A popularity refresh: an FTS column is not named at all.
|
|
if _, err := db.ExecContext(
|
|
"UPDATE explore_index SET popularity = 42 WHERE title = ?",
|
|
"Unchanged Title",
|
|
); err != nil {
|
|
t.Fatalf("popularity update: %v", err)
|
|
}
|
|
|
|
// An upsert-shaped write that re-states the text identically, which
|
|
// is what the merge rules produce for a row that has not changed.
|
|
if _, err := db.ExecContext(`
|
|
UPDATE explore_index
|
|
SET title = 'Unchanged Title', artist_name = 'Steady Artist', popularity = 43
|
|
WHERE title = ?
|
|
`, "Unchanged Title"); err != nil {
|
|
t.Fatalf("no-op text update: %v", err)
|
|
}
|
|
|
|
if got := ftsSegmentCount(t, db); got != before {
|
|
t.Errorf(
|
|
"FTS index written by an update that changed no text: %d rows, want %d",
|
|
got, before,
|
|
)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Unchanged"); got != 1 {
|
|
t.Errorf("matches after unchanged updates = %d, want 1", got)
|
|
}
|
|
}
|
|
|
|
// The other half of the same guard: a real rename still re-indexes,
|
|
// old term gone and new term found.
|
|
func TestExploreFTSUpdateReindexesChangedText(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
seedExploreRow(t, db, "mbid-2", "Original Title", "Some Artist")
|
|
|
|
if _, err := db.ExecContext(
|
|
"UPDATE explore_index SET title = 'Corrected Title' WHERE title = ?",
|
|
"Original Title",
|
|
); err != nil {
|
|
t.Fatalf("rename: %v", err)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Original"); got != 0 {
|
|
t.Errorf("matches for the old title = %d, want 0", got)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Corrected"); got != 1 {
|
|
t.Errorf("matches for the new title = %d, want 1", got)
|
|
}
|
|
|
|
// The same for the other two indexed columns.
|
|
if _, err := db.ExecContext(
|
|
"UPDATE explore_index SET artist_name = 'Renamed Artist', aliases = 'AKA Thing' WHERE title = ?",
|
|
"Corrected Title",
|
|
); err != nil {
|
|
t.Fatalf("artist rename: %v", err)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "Renamed"); got != 1 {
|
|
t.Errorf("matches for the new artist = %d, want 1", got)
|
|
}
|
|
|
|
if got := ftsMatches(t, db, "AKA"); got != 1 {
|
|
t.Errorf("matches for the new alias = %d, want 1", got)
|
|
}
|
|
}
|
|
|
|
// An existing install already carries the previous, unguarded trigger,
|
|
// and a create that tolerated "already exists" would leave it there
|
|
// forever — so the definition has to be replaced on open, not merely
|
|
// offered.
|
|
func TestExploreFTSTriggersAreReplacedOnOpen(t *testing.T) {
|
|
db := NewTestDB(t)
|
|
|
|
if err := db.SuspendExploreIndexFTS(); err != nil {
|
|
t.Fatalf("suspend: %v", err)
|
|
}
|
|
|
|
// The shape that shipped before: fires on every UPDATE.
|
|
if _, err := db.ExecContext(`
|
|
CREATE TRIGGER explore_index_au AFTER UPDATE ON explore_index BEGIN
|
|
INSERT INTO explore_index_fts(explore_index_fts, rowid, title, artist_name, aliases)
|
|
VALUES ('delete', old.id, old.title, old.artist_name, old.aliases);
|
|
INSERT INTO explore_index_fts(rowid, title, artist_name, aliases)
|
|
VALUES (new.id, new.title, new.artist_name, new.aliases);
|
|
END
|
|
`); err != nil {
|
|
t.Fatalf("install old trigger: %v", err)
|
|
}
|
|
|
|
if err := createExploreIndexFTSTriggers(db.Ctx, db.db); err != nil {
|
|
t.Fatalf("recreate triggers: %v", err)
|
|
}
|
|
|
|
rows, err := db.QueryContext(
|
|
"SELECT sql FROM sqlite_master WHERE type = 'trigger' AND name = 'explore_index_au'",
|
|
)
|
|
if err != nil {
|
|
t.Fatalf("read trigger sql: %v", err)
|
|
}
|
|
|
|
defer func() { _ = rows.Close() }()
|
|
|
|
definition := ""
|
|
|
|
if rows.Next() {
|
|
if err := rows.Scan(&definition); err != nil {
|
|
t.Fatalf("scan trigger sql: %v", err)
|
|
}
|
|
}
|
|
|
|
if !strings.Contains(definition, "UPDATE OF") ||
|
|
!strings.Contains(definition, "WHEN") {
|
|
t.Errorf("explore_index_au was not replaced; definition is:\n%s", definition)
|
|
}
|
|
}
|