Phase 4: sync
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
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 4: the read model. /sync, /messages and /context, the filters that narrow them, and the streams a response carries that are not room events — typing, receipts, presence and to-device messages. With this a client can be used against Warp, which is milestone M1. The one architectural choice is that the syncapi has no copy of the rooms: it reads them through the roomserver. Dendrite gives its syncapi its own tables and feeds them from the output stream, which is right for a design where the two can be separate processes, and Dendrite's could be. Warp is one process by decision, and there the copy buys nothing and costs the hardest class of bug a homeserver has — a read model that disagrees with the room, where a client is shown a message that was rejected and the only way to find out is to compare two tables. So the roomserver grew a read model (stream.go, roomsync.go, visibility.go) rather than exporting its store: reading an event means parsing it under its room's version, and a second copy of the version registry, the parser and the client projection would be a second place for them to disagree. syncapi: stream tokens naming a position in each of five independent streams, so a client that has seen receipt 7 but only event 4 can say so in one opaque string. A token with fewer positions than this build writes is accepted and the rest read as zero, which is what lets a token stored before a stream existed go on working. The PDU position comes from MAX(stream_ordering) and not from the counter row the other four use: the counter is advanced inside the writing transaction, so a token taken from it would name a position whose event no reader can see yet, and the event would be skipped for good once that transaction committed. Long polling goes through a notifier that wakes by room and by user rather than globally — an event wakes the listeners of its room, a membership event also wakes the user it names, so an invite reaches a client that is not in the room yet. A wake-up is only ever a hint: the listener re-reads the streams and decides for itself what changed, which is what makes it safe for the notifier to hold no state about what each client has seen. The listener registers before the read, so an event landing in between leaves the channel signalled and the sync reads again rather than blocking on a change it just missed. EventPersisted must not block, because it is called with the room's write lock still held. "Something happened" is not "a token moved". A stream can move without this user being concerned by it, and returning on every such move would turn a long poll back into a busy loop. The same trap caught presence twice over: a client says it is still online by syncing, so ?set_presence= makes every sync a presence write, and a stream that moved each time would wake every peer, which would sync, which would move it again. SetPresence therefore reports whether anything a peer would notice actually changed, and a write that only refreshes the last-active timestamp leaves the stream alone. Timeline windows are named by their two ends and a direction, Low exclusive and High inclusive in both directions, rather than by "from" and "to" as the wire format spells them. Each of those would otherwise be the low bound in one direction and the high bound in the other, which is exactly the off-by-one every pagination bug is made of; the handlers translate once and nothing below them thinks about it again. A sync's timeline is read backwards and reported forwards, because a client wants the newest events of the window it missed — a forward read with a limit hands it the oldest and then calls the rest a gap. visibility: history visibility is now a span rather than a yes or no, which is what Phase 3 deferred here. A user who has left a room is served the room as it was when they left — their state reads, their members and their timeline — instead of being refused, and is bounded above at their own membership event so a kicked client cannot go on streaming. Their span is found from their own member events, so a user who joined, left and rejoined sees their latest span. ?at= on /members is honoured for the same reason. What is left is that the span is computed from the room's current history_visibility where the spec judges each event by the one in force when it was sent; that is a state read per event and belongs with open question 1. Typing is held in memory and nowhere else: notifications expire in seconds, are worthless across a restart, and arrive one per keystroke-burst per room, so persisting them would be the busiest table in the database holding the least valuable data in it. Receipts only ever advance, compared on the position of the event acknowledged rather than on arrival, because two of a user's clients read at different speeds and the slower one must not drag the marker backwards. To-device queues are per device and drained by the next sync rather than by the one that delivered them, so a client that crashes in between gets the batch again — the right way round, since a lost key share leaves a message permanently undecryptable and a duplicate is ignored. A wildcard addressee is expanded when sent, not stored, because "every device" means the ones that existed then. Presence is off by default, which answers PLAN.md open question 3. It is the noisiest thing in Matrix and the one genuinely fan-out notification here; a private homeserver gains little from it. With it off the endpoints refuse rather than disappearing, because a client that gets a 404 from /presence concludes the server is too old to have it and stops asking. storage: one migration per driver adding the receipt, to-device, presence and filter tables with a counter row each, and a stream position on the existing account data table rather than a parallel one — there is exactly one current value per (user, room, type), and a second table would be a second thing to keep in step. Account data is reported in an event list but is not an event, so it gets its own response type: a room event with an empty sender and no timestamp would make a client decide what that meant. Deliberately missing, each named in docs/sync.md: notification counts (they need push rules, Phase 8), device lists (the keyserver, Phase 7), anything remote (Phase 5), threads (Phase 10). device_lists is sent as two empty lists because a client reads a missing one as malformed; the notification counts are left out entirely, because a zero there is a claim and an absent field is not. Tested through HTTP rather than against the builder, because what is worth pinning down is the response a client sees — which section a room lands in, whether a token handed back can be handed in again, whether paging terminates and loses nothing. The storage tests run against both SQL drivers; the notifier has its own tests for the concurrent case. A live server was driven end to end, which is what caught the two bugs the unit tests had missed: a backwards /messages page must be in reverse chronological order, and `start` must name where the page began rather than position zero when ?from= was omitted. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
This commit is contained in:
1 parent
c96f88e994
commit
d187ad0d17
60 files changed
+10196
-264
No files matched your search
@@ -0,0 +1,251 @@
|
||||
package syncapi
|
||||
|
||||
import (
|
||||
"context"
|
||||
"encoding/json"
|
||||
"errors"
|
||||
"fmt"
|
||||
"maps"
|
||||
"slices"
|
||||
|
||||
"github.com/dariuszjaniak/warp/server/internal/storage"
|
||||
)
|
||||
|
||||
// Presence: who is online, and the status message they set.
|
||||
//
|
||||
// It is off by default (PLAN.md open question 3). Presence is the single
|
||||
// noisiest thing in Matrix — every user's state change is sent to everybody
|
||||
// who shares a room with them, which over federation is quadratic in the
|
||||
// worst case, and Synapse deployments routinely turn it off for exactly
|
||||
// that reason. A private homeserver with a dozen users has no such problem,
|
||||
// so it is a switch rather than a decision.
|
||||
//
|
||||
// With it off, the endpoints answer M_FORBIDDEN and the presence section of
|
||||
// a sync response is empty. They are not unregistered: a client that gets
|
||||
// a 404 from /presence concludes the server is too old to have it and
|
||||
// stops asking, whereas a refusal says this server has it switched off.
|
||||
|
||||
// The presence states the spec defines.
|
||||
const (
|
||||
PresenceOnline = "online"
|
||||
PresenceOffline = "offline"
|
||||
PresenceUnavailable = "unavailable"
|
||||
)
|
||||
|
||||
// maxStatusMsgLength caps a status message. The spec sets no limit; this is
|
||||
// long enough for a sentence and short enough that it cannot be used as
|
||||
// storage.
|
||||
const maxStatusMsgLength = 512
|
||||
|
||||
// PresenceRequest is PUT /presence/{userID}/status.
|
||||
type PresenceRequest struct {
|
||||
// User is the full user ID whose presence is being set, which the
|
||||
// handler has already checked is the caller.
|
||||
User string
|
||||
|
||||
Presence string
|
||||
|
||||
// StatusMsg is the free-text status. An explicitly empty string
|
||||
// clears it, which is why this is a pointer: a request that does not
|
||||
// mention it leaves it alone.
|
||||
StatusMsg *string
|
||||
}
|
||||
|
||||
// SetPresence records a user's presence.
|
||||
func (s *API) SetPresence(ctx context.Context, req PresenceRequest) error {
|
||||
if !s.presenceEnabled {
|
||||
return ErrPresenceDisabled
|
||||
}
|
||||
switch req.Presence {
|
||||
case PresenceOnline, PresenceOffline, PresenceUnavailable:
|
||||
default:
|
||||
return errInvalidParamf("%q is not a presence state", req.Presence)
|
||||
}
|
||||
if req.StatusMsg != nil && len(*req.StatusMsg) > maxStatusMsgLength {
|
||||
return errInvalidParamf("a status message may be at most %d bytes", maxStatusMsgLength)
|
||||
}
|
||||
|
||||
state := storage.PresenceState{
|
||||
UserID: req.User,
|
||||
Presence: req.Presence,
|
||||
LastActiveMS: s.nowMS(),
|
||||
}
|
||||
// Keep the status message a request did not mention.
|
||||
if req.StatusMsg != nil {
|
||||
state.StatusMsg = *req.StatusMsg
|
||||
} else {
|
||||
switch existing, err := s.store.Presence(ctx, req.User); {
|
||||
case err == nil:
|
||||
state.StatusMsg = existing.StatusMsg
|
||||
case !errors.Is(err, storage.ErrNoSuchUser):
|
||||
return err
|
||||
}
|
||||
}
|
||||
|
||||
_, moved, err := s.store.SetPresence(ctx, state)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
// Nothing a peer would notice changed, so there is nobody to wake.
|
||||
if !moved {
|
||||
return nil
|
||||
}
|
||||
return s.notifyPresence(ctx, req.User)
|
||||
}
|
||||
|
||||
// Presence reads a user's presence, which GET /presence/{userID}/status
|
||||
// answers.
|
||||
//
|
||||
// A user nothing has ever been recorded for is offline rather than unknown.
|
||||
// That is what the spec says to report and it is also the truth: a user who
|
||||
// has never told the server they were online is not online.
|
||||
func (s *API) Presence(ctx context.Context, userID string) (storage.PresenceState, error) {
|
||||
if !s.presenceEnabled {
|
||||
return storage.PresenceState{}, ErrPresenceDisabled
|
||||
}
|
||||
if !s.isLocal(userID) {
|
||||
// Remote presence needs federation (Phase 5). Reporting offline
|
||||
// would be a guess; saying so is not.
|
||||
return storage.PresenceState{}, errForbiddenf(
|
||||
"%s belongs to another server and federation is required to ask it", userID)
|
||||
}
|
||||
|
||||
switch state, err := s.store.Presence(ctx, userID); {
|
||||
case err == nil:
|
||||
return state, nil
|
||||
case errors.Is(err, storage.ErrNoSuchUser):
|
||||
return storage.PresenceState{UserID: userID, Presence: PresenceOffline}, nil
|
||||
default:
|
||||
return storage.PresenceState{}, err
|
||||
}
|
||||
}
|
||||
|
||||
// notifyPresence wakes the users who share a room with this one.
|
||||
//
|
||||
// Presence is published to everybody a user shares a room with, which is
|
||||
// the set this walks: their rooms, and the members of each. It is the one
|
||||
// genuinely fan-out notification in the component, and the reason presence
|
||||
// is a switch.
|
||||
func (s *API) notifyPresence(ctx context.Context, userID string) error {
|
||||
rooms, err := s.rooms.JoinedRooms(ctx, userID)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
|
||||
peers := map[string]struct{}{}
|
||||
for _, roomID := range rooms {
|
||||
members, err := s.rooms.JoinedMembers(ctx, roomID, userID)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
for member := range members {
|
||||
peers[member] = struct{}{}
|
||||
}
|
||||
}
|
||||
delete(peers, userID)
|
||||
|
||||
s.notifier.NotifyUsers(slices.Sorted(maps.Keys(peers)))
|
||||
// Their own other devices want it too.
|
||||
s.notifier.NotifyUser(userID)
|
||||
return nil
|
||||
}
|
||||
|
||||
// presenceEvents reads the presence of everybody the user shares a room
|
||||
// with, between two positions.
|
||||
func (s *API) presenceEvents(ctx context.Context, userID string, rooms []string, from, to int64, filter storage.TimelineFilter) ([]presenceEvent, error) {
|
||||
if !s.presenceEnabled || len(rooms) == 0 {
|
||||
return nil, nil
|
||||
}
|
||||
|
||||
peers := map[string]struct{}{userID: {}}
|
||||
for _, roomID := range rooms {
|
||||
entries, err := s.rooms.JoinedMembers(ctx, roomID, userID)
|
||||
if err != nil {
|
||||
// A room the user is no longer joined to is not an error here:
|
||||
// their presence section simply does not include its members.
|
||||
if errors.Is(err, ErrForbidden) {
|
||||
continue
|
||||
}
|
||||
return nil, err
|
||||
}
|
||||
for member := range entries {
|
||||
peers[member] = struct{}{}
|
||||
}
|
||||
}
|
||||
|
||||
states, err := s.store.PresenceForUsers(ctx, slices.Sorted(maps.Keys(peers)), from, to)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
|
||||
out := make([]presenceEvent, 0, len(states))
|
||||
for _, state := range states {
|
||||
e, err := newPresenceEvent(state, s.nowMS())
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
if !matchesEventFilter(e.Type, e.Sender, filter) {
|
||||
continue
|
||||
}
|
||||
out = append(out, e)
|
||||
}
|
||||
return out, nil
|
||||
}
|
||||
|
||||
// presenceEvent is the m.presence EDU of one user.
|
||||
type presenceEvent struct {
|
||||
Type string `json:"type"`
|
||||
Sender string `json:"sender"`
|
||||
Content json.RawMessage `json:"content"`
|
||||
}
|
||||
|
||||
// newPresenceEvent builds the EDU for one user's state.
|
||||
//
|
||||
// `last_active_ago` is computed on the way out rather than stored, for the
|
||||
// same reason `age` is on an event: a value written down at write time
|
||||
// would be wrong by however long the row sat in the database.
|
||||
func newPresenceEvent(state storage.PresenceState, nowMS int64) (presenceEvent, error) {
|
||||
content := map[string]any{
|
||||
"presence": state.Presence,
|
||||
"currently_active": state.Presence == PresenceOnline,
|
||||
}
|
||||
if state.StatusMsg != "" {
|
||||
content["status_msg"] = state.StatusMsg
|
||||
}
|
||||
if state.LastActiveMS > 0 {
|
||||
content["last_active_ago"] = max(nowMS-state.LastActiveMS, 0)
|
||||
}
|
||||
|
||||
body, err := json.Marshal(content)
|
||||
if err != nil {
|
||||
return presenceEvent{}, fmt.Errorf("marshalling the presence of %s: %w", state.UserID, err)
|
||||
}
|
||||
return presenceEvent{Type: "m.presence", Sender: state.UserID, Content: body}, nil
|
||||
}
|
||||
|
||||
// matchesEventFilter is the filter check for the streams whose events are
|
||||
// not room events: presence and global account data. Their filters have the
|
||||
// same types and senders fields, and exclusions win the same way.
|
||||
func matchesEventFilter(eventType, sender string, filter storage.TimelineFilter) bool {
|
||||
switch {
|
||||
case anyMatch(eventType, filter.NotTypes):
|
||||
return false
|
||||
case sender != "" && anyMatch(sender, filter.NotSenders):
|
||||
return false
|
||||
case len(filter.Types) > 0 && !anyMatch(eventType, filter.Types):
|
||||
return false
|
||||
case len(filter.Senders) > 0 && sender != "" && !anyMatch(sender, filter.Senders):
|
||||
return false
|
||||
}
|
||||
return true
|
||||
}
|
||||
|
||||
// anyMatch applies a list of filter patterns.
|
||||
func anyMatch(value string, patterns []string) bool {
|
||||
for _, pattern := range patterns {
|
||||
if matches(value, pattern) {
|
||||
return true
|
||||
}
|
||||
}
|
||||
return false
|
||||
}
|
||||
Reference in new issue
Block a user