0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-11-04 21:08:57 +01:00
construct/modules/client/sync
2020-05-28 21:55:07 -07:00
..
rooms modules/client/sync/rooms/state: Implement prefetch on initial phased polylog. 2020-05-28 21:32:54 -07:00
account_data.cc modules/client/sync/account_data: Fix return value from push_rules handler when no rules. 2020-04-14 19:25:48 -07:00
device_lists.cc modules/client/sync: Minor cleanup; 2019-09-09 12:08:07 -07:00
device_one_time_keys_count.cc modules/client/sync/device_one_time_keys_count: Fix result placement in /sync response. 2020-05-07 14:14:24 -07:00
presence.cc modules/client/sync/presence: Assert content.user_id made it to presence linear. 2020-04-08 20:16:02 -07:00
README.md modules/client/sync: Update readme. 2019-07-16 11:36:03 -07:00
rooms.cc ircd:Ⓜ️:sync: Assume no to bypass should_ignore() query on rooms prefetch iteration. 2020-05-28 21:55:07 -07:00
to_device.cc modules/client/sync/to_device: Fix to_device linear sync handler. 2020-04-24 15:24:37 -07:00

Client Sync

Organization

This directory contains modules which compose the /sync endpoint content.

Each module in this directory creates content within some property of the /sync JSON response to fulfill a certain feature (refer to the matrix c2s spec).

sync::item's register themselves at different locations of the /sync response tree. Items then implement two functions to provide the data at that location in the /sync tree. The /sync/ GET handler will iterate all of the items and call one of these functions to build the response.

First note that even though this is a directory of modules, the /sync resource itself is a single endpoint and not a directory. The ../sync.cc module alone services the /sync resource and invokes the modular functionality in this directory.

There are at least two ways to organize these modules, and this directory represents one of those ways. Another way is to disperse them throughout /client/ near the endpoints related to their feature suite. That still remains a viable option for debate as this system further matures.

Methodology

As documented elsewhere, events processed by the server receive a unique monotonic sequence integer (or index number, type: m::event::idx). The next_batch and since tokens are these sequence integers. This single number is fundamental for the /sync to achieve stateless and stable operation:

  • Nothing is saved about a request being made. The since token alone has enough information to fulfill a /sync request without hidden server-side state.
  • The same request (same since token) produces a similar result each time, again without any server-side state describing that token.

When a /sync request is made, the since token is compared with the server's current sequence number. The since token can be between 0 and 1 greater than the server's sequence number. The since token and the server's sequence number form the "range" to be sync'ed. Adding 1 to the server's sequence number becomes the next_batch field returned to the client.

The properties of the sync range determine what happens next as there are large ranges, small ranges, a null ranges. For large ranges, a polylog sync is conducted; for small ranges a linear sync is used instead, and for null ranges a longpoll sync.

Sync Modes

  • Polylog: When the since token's "delta" exceeds the threshold for a linear sync the client enters polylog sync. This is common when no since token is supplied at all (equal to 0) which is known as an initial sync. In this mode, a series of point-lookups are made to compose the response content. This involves iterating the rooms relevant to a user and checking if the sequence numbers for events in the timeline fall within the since window so they can be included. This requires a lot of random access in contrast to linear sync; each room has to be queried at least once for every invocation of polylog sync. The goal for the threshold between polylog and linear is to invoke the cheaper mode: Even though polylog usually involves a minimum of many queries, it is more efficient than a linear iteration of all events on the server.

  • Linear: When the since token's "delta" from the current sequence number ranges from 0 to some configurable limit (i.e 1024 or 4096), the client enters linear sync: an iteration of events between the since token and the current sequence is made where each event is tested for relevance to the client and a response is then made. If nothing was found for the client in this iteration, it falls back to longpoll sync until an event comes through or timeout.

  • Longpoll: When the since token is 1 greater than the current sequence number, the client enters longpoll sync: It waits for the next appropriate event which is then sent immediately. The next_batch will then be 1 greater than the sequence number of that event. The implementation of longpoll sync is a specialization of linear sync, using the same handlers.

Implementation

Each /sync module implements two primary functions:

  • A complex composer for a response in polylog mode. This requires the handler itself to find all the events to include for a satisfying response. This handler is invoked once for a since token during the single pass and is responsible for building JSON inside the object the handler is responsible for in the larger /sync tree.

  • A simple composer for a response in linear mode. This requires the handler to evaluate the event argument being passed. If the event is to be included in the /sync response, the linear handler builds a complete /sync JSON object tree around this event, which indicates where it is placed in the /sync tree.