CI / Test (ubuntu-latest) (push) Canceled after 0s
CI / Test (windows-latest) (push) Canceled after 0s
CI / Storage tests on PostgreSQL (push) Canceled after 0s
CI / Complement (federation off) (push) Canceled after 0s
CI / golangci-lint (push) Canceled after 0s
CI / Smoke test the binary (push) Canceled after 0s
Implements PLAN.md Phase 10. Simplified Sliding Sync (MSC4186) is served at the unstable org.matrix.simplified_msc3575 endpoint and advertised in /versions. Lists are sorted by activity and filtered by DM, invite, encryption, room type, space and tag; room subscriptions, required_state with wildcards, $ME and $LAZY, and the to_device, e2ee, account_data, receipts and typing extensions are supported. Per-connection state is kept in memory and an unknown pos answers M_UNKNOWN_POS. Threads and relations: m.relates_to is indexed on roomserver_events (migration 0012), /relations (with recursion) and /threads are served, and every event a timeline read returns carries its m.thread, m.replace and m.reference summaries in unsigned.m.relations. Notifications carry a thread ID (migration 0013): threaded receipts clear only their thread, and sync reports unread_thread_notifications when the filter asks. Spaces: /hierarchy walks a space breadth first, asking other servers about rooms this one is not in through the new federation hierarchy endpoint; room_summary describes one room. /search runs on FTS5 (sqlite, pocketbase) or tsvector (postgres), bounded to what each user may see, with context, profiles, state, grouping and paging. The PocketBase driver is real: the sqlite schema and store on an embedded PocketBase app's database, with media in its filesystem, local or S3 (database.pocketbase.s3). It runs the full storage test suite. Ops: OpenTelemetry tracing over OTLP/HTTP (tracing.*), with server spans per route, component spans, and trace propagation on federation, push and application service calls. New metrics for persisted events, waiting syncs, sliding sync connections and the database pool, with a Grafana dashboard. deploy/ adds a Compose setup (PostgreSQL, Prometheus, Grafana, Jaeger) and a Helm chart; cmd/warp-loadtest loads a server and reports request and delivery latencies. The load tester found a long-standing bug, fixed here: on a server where no account data had been written, every incremental /sync re-sent the push rules and returned at once, and an all-zero token was taken for an initial sync, so long polls became busy loops. The PostgreSQL migrations and search dialect compile but were not run against a live PostgreSQL in this change. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
123 lines
3.0 KiB
Go
123 lines
3.0 KiB
Go
package roomserver
|
|
|
|
import (
|
|
"context"
|
|
"slices"
|
|
|
|
"github.com/dariuszjaniak/warp/server/internal/matrix/event"
|
|
"github.com/dariuszjaniak/warp/server/internal/storage"
|
|
"github.com/dariuszjaniak/warp/server/internal/tracing"
|
|
)
|
|
|
|
// Full-text search: the part of /search that decides where a user may
|
|
// look.
|
|
//
|
|
// The index holds every searchable event of every room on the server, and
|
|
// the query against it is the store's. What is decided here is the set of
|
|
// rooms, each bounded to what the user may read of it — the same visible
|
|
// range a timeline read is clamped to, so a user who left a room finds what
|
|
// was said while they were in it and nothing since, and a user who joined a
|
|
// `joined` room finds nothing from before they came.
|
|
|
|
// SearchRequest is one page of a search.
|
|
type SearchRequest struct {
|
|
User string
|
|
Term string
|
|
|
|
// Keys are the fields to match; empty means all three.
|
|
Keys []string
|
|
|
|
// Rooms and NotRooms narrow the rooms searched, as a filter's rooms
|
|
// and not_rooms do.
|
|
Rooms []string
|
|
NotRooms []string
|
|
|
|
// Filter narrows by type and sender.
|
|
Filter storage.TimelineFilter
|
|
|
|
Order storage.SearchOrder
|
|
Offset int
|
|
Before int64
|
|
Limit int
|
|
}
|
|
|
|
// SearchResult is one event a search found.
|
|
type SearchResult struct {
|
|
Event ClientEvent
|
|
|
|
// Position is the event's stream position, which a search by recency
|
|
// pages by.
|
|
Position int64
|
|
|
|
Rank float64
|
|
}
|
|
|
|
// Search runs one page of a search.
|
|
func (r *API) Search(ctx context.Context, req SearchRequest) (_ []SearchResult, _ int, err error) {
|
|
ctx, span := tracing.Start(ctx, "roomserver.search")
|
|
defer func() { tracing.End(span, err) }()
|
|
|
|
memberships, err := r.UserMemberships(ctx, req.User,
|
|
[]string{event.MembershipJoin, event.MembershipLeave, event.MembershipBan})
|
|
if err != nil {
|
|
return nil, 0, err
|
|
}
|
|
|
|
ranges := make([]storage.SearchRange, 0, len(memberships))
|
|
for _, m := range memberships {
|
|
if len(req.Rooms) > 0 && !slices.Contains(req.Rooms, m.RoomID) {
|
|
continue
|
|
}
|
|
if slices.Contains(req.NotRooms, m.RoomID) {
|
|
continue
|
|
}
|
|
visible, err := r.VisibleRange(ctx, m.RoomID, req.User)
|
|
if err != nil {
|
|
return nil, 0, err
|
|
}
|
|
if !visible.Allowed {
|
|
continue
|
|
}
|
|
ranges = append(ranges, storage.SearchRange{RoomID: m.RoomID, Low: visible.From, High: visible.To})
|
|
}
|
|
if len(ranges) == 0 {
|
|
return nil, 0, nil
|
|
}
|
|
|
|
found, total, err := r.store.Search(ctx, storage.SearchRequest{
|
|
Term: req.Term,
|
|
Rooms: ranges,
|
|
Keys: req.Keys,
|
|
Filter: req.Filter,
|
|
Order: req.Order,
|
|
Offset: req.Offset,
|
|
Before: req.Before,
|
|
Limit: req.Limit,
|
|
})
|
|
if err != nil {
|
|
return nil, 0, err
|
|
}
|
|
|
|
out := make([]SearchResult, 0, len(found))
|
|
for _, f := range found {
|
|
room, err := r.store.Room(ctx, f.Event.RoomID)
|
|
if err != nil {
|
|
return nil, 0, err
|
|
}
|
|
rules, err := r.rules(room)
|
|
if err != nil {
|
|
return nil, 0, err
|
|
}
|
|
e, err := parseEvent(f.Event, rules)
|
|
if err != nil {
|
|
return nil, 0, err
|
|
}
|
|
out = append(out, SearchResult{
|
|
Event: r.clientEvent(f.Event, e, f.Event.RoomID),
|
|
Position: f.Event.StreamOrdering,
|
|
Rank: f.Rank,
|
|
})
|
|
}
|
|
return out, total, nil
|
|
}
|