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 5: the Server-Server API. Warp joins rooms on other servers and lets their users join its rooms, invites across servers with the invitee's server countersigning, rejects remote invites (locally if the inviter is unreachable), and exchanges events, typing, receipts and to-device messages with other homeservers — all behind the runtime switch, which now starts and stops real outbound traffic. The protocol lives in internal/federation with no knowledge of rooms: X-Matrix signing (fuzzed parser), the spec's discovery algorithm keeping the dial address and the TLS name apart, a signed client that refuses every request while the switch is off or the policy denies the destination, and a key ring that caches other servers' keys for at most a week, with optional notaries. The roomserver takes events from elsewhere through the spec's intake: signatures and hashes (a hash mismatch keeps the redacted form), the rules against the event's own auth events, against the state before it — with /get_missing_events for small gaps and /state_ids for wide ones — and against the current state, where a failure is a soft failure. Events held without their state are outliers: a column on roomserver_events, because the current state of a room joined over federation is almost all outliers, and excluded from every timeline query. Forks are resolved at the room's head. Membership across servers is make_join/send_join, make_leave/send_leave and countersigned invites, in both directions; m.room.server_acl is enforced on everything another server sends. History before a remote join is backfilled when /messages pages past it, stored at negative stream positions. internal/federationapi is the running component: the inbound endpoints, and an outbound queue that persists what it owes each destination, sends it in transactions of 50 PDUs and 100 EDUs, backs off from ten seconds to six hours, survives restarts, and drops events persisted while federation is off rather than delivering a backlog in one burst. Its Module is what the switch starts and stops. Also: a TLS listener for port 8448, trusted key servers, key validity and an outbound CA bundle in the config; per-destination health and backoff reset in the admin API; remote profiles, aliases and directories in the Client-Server API; a Complement federation profile. See docs/federation.md, including its known gaps (no partial-state joins, no key rotation). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
71 lines
2.7 KiB
Go
71 lines
2.7 KiB
Go
package sqlstore
|
|
|
|
import (
|
|
"context"
|
|
"database/sql"
|
|
"fmt"
|
|
)
|
|
|
|
// The sequence tables. Each component owns its own, so that a component
|
|
// added later does not need a migration to a table another one is already
|
|
// writing.
|
|
const (
|
|
roomSequences = "roomserver_sequences"
|
|
syncSequences = "sync_sequences"
|
|
)
|
|
|
|
// The counters in sync_sequences.
|
|
const (
|
|
seqReceipt = "receipt"
|
|
seqToDevice = "to_device"
|
|
seqAccountData = "account_data"
|
|
seqPresence = "presence"
|
|
)
|
|
|
|
// execQuerier is the part of *sql.Tx and *sql.DB that the sequence helpers
|
|
// need, so that a counter can be read outside a transaction and bumped
|
|
// inside one.
|
|
type execQuerier interface {
|
|
ExecContext(ctx context.Context, query string, args ...any) (sql.Result, error)
|
|
QueryRowContext(ctx context.Context, query string, args ...any) *sql.Row
|
|
}
|
|
|
|
// nextSequence hands out the next value of a counter.
|
|
//
|
|
// The UPDATE takes a row lock that both engines hold until the transaction
|
|
// ends, so two concurrent writers queue rather than collide, and a value
|
|
// handed out by a transaction that then rolls back is never used — which is
|
|
// what keeps a stream gapless. A database sequence would be faster and
|
|
// would not have that property: PostgreSQL's are explicitly not
|
|
// transactional, so a rolled-back write would leave a hole that every
|
|
// reader of the stream would have to be taught to skip.
|
|
//
|
|
// It must be called inside a transaction. Called on a bare *sql.DB the two
|
|
// statements are two transactions, and two callers can then be handed the
|
|
// same value.
|
|
func nextSequence(ctx context.Context, db execQuerier, q func(string) string, table, name string) (int64, error) {
|
|
return advanceSequence(ctx, db, q, table, name, 1)
|
|
}
|
|
|
|
// advanceSequence hands out a block of n values and returns the last of
|
|
// them; the block is the n values ending there. Like nextSequence it must
|
|
// be called inside a transaction.
|
|
func advanceSequence(ctx context.Context, db execQuerier, q func(string) string, table, name string, n int64) (int64, error) {
|
|
bump := fmt.Sprintf(`UPDATE %s SET value = value + ? WHERE name = ?`, table)
|
|
if _, err := db.ExecContext(ctx, q(bump), n, name); err != nil {
|
|
return 0, fmt.Errorf("advance the %s counter: %w", name, err)
|
|
}
|
|
return currentSequence(ctx, db, q, table, name)
|
|
}
|
|
|
|
// currentSequence reads a counter without advancing it: the top of a stream
|
|
// as a sync token has to name it.
|
|
func currentSequence(ctx context.Context, db execQuerier, q func(string) string, table, name string) (int64, error) {
|
|
query := fmt.Sprintf(`SELECT value FROM %s WHERE name = ?`, table)
|
|
var value int64
|
|
if err := db.QueryRowContext(ctx, q(query), name).Scan(&value); err != nil {
|
|
return 0, fmt.Errorf("read the %s counter: %w", name, err)
|
|
}
|
|
return value, nil
|
|
}
|