package handler import ( "bytes" "context" "encoding/json" "testing" "time" ) // TestModelListStore_RunningRequestTimesOut pins the escape hatch for // requests that were claimed (PopPending → Running) but whose result was // never reported — usually because the heartbeat response carrying the // `pending_model_list` field was lost in transit. Before this, the only // way out of Running was the 2-minute memory GC, which exceeded the UI // polling window and surfaced as a silent "discovery failed" (MUL-1397). func TestModelListStore_RunningRequestTimesOut(t *testing.T) { ctx := context.Background() store := NewInMemoryModelListStore() req, err := store.Create(ctx, "runtime-xyz") if err != nil { t.Fatalf("create: %v", err) } claimed, err := store.PopPending(ctx, "runtime-xyz") if err != nil { t.Fatalf("pop: %v", err) } if claimed == nil { t.Fatal("expected PopPending to claim the pending request") } if claimed.Status != ModelListRunning { t.Fatalf("expected Running after PopPending, got %s", claimed.Status) } if claimed.RunStartedAt == nil { t.Fatal("expected RunStartedAt to be set on PopPending") } // Age the running record past the threshold without the daemon ever // reporting a result. Get() must flip it to Timeout so the UI can // terminate polling instead of waiting for the retention sweep. aged := time.Now().Add(-(modelListRunningTimeout + time.Second)) claimed.RunStartedAt = &aged got, err := store.Get(ctx, req.ID) if err != nil { t.Fatalf("get: %v", err) } if got == nil { t.Fatal("expected stored request") } if got.Status != ModelListTimeout { t.Fatalf("expected Timeout after running threshold, got %s", got.Status) } if got.Error == "" { t.Fatal("expected timeout error message") } } // TestReportModelListResult_PreservesDefault guards the daemon → server // → UI wire format for the model-discovery result. The `default` bool // on each ModelEntry lights up the UI's "default" badge; if it gets // dropped here (e.g. by going through a map[string]string), the badge // silently disappears. func TestReportModelListResult_PreservesDefault(t *testing.T) { ctx := context.Background() store := NewInMemoryModelListStore() req, err := store.Create(ctx, "runtime-xyz") if err != nil { t.Fatalf("create: %v", err) } // Report a completed result with one default entry and one not. body := map[string]any{ "status": "completed", "supported": true, "models": []map[string]any{ {"id": "foo-default", "label": "Foo", "provider": "p", "default": true, "supports_explicit_standard_service_tier": true}, {"id": "bar", "label": "Bar", "provider": "p"}, }, } raw, _ := json.Marshal(body) // Use the store's Complete directly — we're verifying the wire // shape, not HTTP auth. The handler itself unmarshals into // []ModelEntry and forwards verbatim, which is the path we care // about here. var parsed struct { Models []ModelEntry `json:"models"` } if err := json.Unmarshal(raw, &parsed); err != nil { t.Fatalf("unmarshal report body: %v", err) } if err := store.Complete(ctx, req.ID, parsed.Models, nil, true); err != nil { t.Fatalf("complete: %v", err) } got, err := store.Get(ctx, req.ID) if err != nil { t.Fatalf("get: %v", err) } if got == nil { t.Fatal("expected stored result") } if len(got.Models) != 2 { t.Fatalf("expected 2 models, got %d: %+v", len(got.Models), got.Models) } if !got.Models[0].Default { t.Errorf("first model should carry Default=true, got %+v", got.Models[0]) } if !got.Models[0].SupportsExplicitStandardServiceTier { t.Errorf("first model should carry explicit-standard capability, got %+v", got.Models[0]) } if got.Models[1].Default { t.Errorf("second model should carry Default=false, got %+v", got.Models[1]) } // Serialise the stored request back out (what UI actually sees) // and confirm `default: true` survives. out, _ := json.Marshal(got) if !bytes.Contains(out, []byte(`"default":true`)) { t.Errorf(`expected "default":true in JSON response, got: %s`, out) } if !bytes.Contains(out, []byte(`"supports_explicit_standard_service_tier":true`)) { t.Errorf("expected explicit-standard capability in JSON response, got: %s", out) } } // TestInMemoryModelListStore_HasPending pins the cheap probe used by the // heartbeat hot path. Empty queue → false; pending request → true; after // PopPending claims the record → false again. func TestInMemoryModelListStore_HasPending(t *testing.T) { ctx := context.Background() store := NewInMemoryModelListStore() if has, err := store.HasPending(ctx, "rt-1"); err != nil || has { t.Fatalf("empty store should not report pending: has=%v err=%v", has, err) } if _, err := store.Create(ctx, "rt-1"); err != nil { t.Fatalf("create: %v", err) } if has, err := store.HasPending(ctx, "rt-1"); err != nil || !has { t.Fatalf("expected pending=true after Create: has=%v err=%v", has, err) } // Other runtimes don't see this runtime's queue. if has, err := store.HasPending(ctx, "rt-2"); err != nil || has { t.Fatalf("expected pending=false for unrelated runtime: has=%v err=%v", has, err) } if _, err := store.PopPending(ctx, "rt-1"); err != nil { t.Fatalf("pop: %v", err) } if has, err := store.HasPending(ctx, "rt-1"); err != nil || has { t.Fatalf("expected pending=false after PopPending: has=%v err=%v", has, err) } } // TestInMemoryModelListStore_PopPendingPicksOldest documents the FIFO // ordering so a daemon that handles one request per heartbeat doesn't // starve early queue entries. func TestInMemoryModelListStore_PopPendingPicksOldest(t *testing.T) { ctx := context.Background() store := NewInMemoryModelListStore() first, _ := store.Create(ctx, "rt-1") // Force a measurable gap so the FIFO comparison isn't on equal // CreatedAt values (possible on platforms with coarse clocks). time.Sleep(2 * time.Millisecond) second, _ := store.Create(ctx, "rt-1") got, err := store.PopPending(ctx, "rt-1") if err != nil { t.Fatalf("pop: %v", err) } if got == nil || got.ID != first.ID { t.Fatalf("expected first request, got %+v (second was %s)", got, second.ID) } }