mirror of
https://github.com/matrix-org/dendrite
synced 2024-12-25 08:13:45 +01:00
f05ce478f0
* Add Pushserver component with Pushers API Co-authored-by: Tommie Gannert <tommie@gannert.se> Co-authored-by: Dan Peleg <dan@globekeeper.com> * Wire Pushserver component Co-authored-by: Neil Alexander <neilalexander@users.noreply.github.com> * Add PushGatewayClient. The full event format is required for Sytest. * Add a pushrules module. * Change user API account creation to use the new pushrules module's defaults. Introduces "scope" as required by client API, and some small field tweaks to make some 61push Sytests pass. * Add push rules query/put API in Pushserver. This manipulates account data over User API, and fires sync messages for changes. Those sync messages should, according to an existing TODO in clientapi, be moved to userapi. Forks clientapi/producers/syncapi.go to pushserver/ for later extension. * Add clientapi routes for push rules to Pushserver. A cleanup would be to move more of the name-splitting logic into pushrules.go, to depollute routing.go. * Output rooms.join.unread_notifications in /sync. This is the read-side. Pushserver will be the write-side. * Implement pushserver/storage for notifications. * Use PushGatewayClient and the pushrules module in Pushserver's room consumer. * Use one goroutine per user to avoid locking up the entire server for one bad push gateway. * Split pushing by format. * Send one device per push. Sytest does not support coalescing multiple devices into one push. Matches Synapse. Either we change Sytest, or remove the group-by-url-and-format logic. * Write OutputNotificationData from push server. Sync API is already the consumer. * Implement read receipt consumers in Pushserver. Supports m.read and m.fully_read receipts. * Add clientapi route for /unstable/notifications. * Rename to UpsertPusher for clarity and handle pusher update * Fix linter errors * Ignore body.Close() error check * Fix push server internal http wiring * Add 40 newly passing 61push tests to whitelist * Add next 12 newly passing 61push tests to whitelist * Send notification data before notifying users in EDU server consumer * NATS JetStream * Goodbye sarama * Fix `NewStreamTokenFromString` * Consume on the correct topic for the roomserver * Don't panic, NAK instead * Move push notifications into the User API * Don't set null values since that apparently causes Element upsetti * Also set omitempty on conditions * Fix bug so that we don't override the push rules unnecessarily * Tweak defaults * Update defaults * More tweaks * Move `/notifications` onto `r0`/`v3` mux * User API will consume events and read/fully read markers from the sync API with stream positions, instead of consuming directly Co-authored-by: Piotr Kozimor <p1996k@gmail.com> Co-authored-by: Tommie Gannert <tommie@gannert.se> Co-authored-by: Neil Alexander <neilalexander@users.noreply.github.com>
125 lines
3.3 KiB
Go
125 lines
3.3 KiB
Go
package pushrules
|
|
|
|
import (
|
|
"fmt"
|
|
"regexp"
|
|
"strconv"
|
|
"strings"
|
|
)
|
|
|
|
// ActionsToTweaks converts a list of actions into a primary action
|
|
// kind and a tweaks map. Returns a nil map if it would have been
|
|
// empty.
|
|
func ActionsToTweaks(as []*Action) (ActionKind, map[string]interface{}, error) {
|
|
var kind ActionKind
|
|
tweaks := map[string]interface{}{}
|
|
|
|
for _, a := range as {
|
|
if a.Kind == SetTweakAction {
|
|
tweaks[string(a.Tweak)] = a.Value
|
|
continue
|
|
}
|
|
if kind != UnknownAction {
|
|
return UnknownAction, nil, fmt.Errorf("got multiple primary actions: already had %q, got %s", kind, a.Kind)
|
|
}
|
|
kind = a.Kind
|
|
}
|
|
|
|
if len(tweaks) == 0 {
|
|
tweaks = nil
|
|
}
|
|
|
|
return kind, tweaks, nil
|
|
}
|
|
|
|
// BoolTweakOr returns the named tweak as a boolean, and returns `def`
|
|
// on failure.
|
|
func BoolTweakOr(tweaks map[string]interface{}, key TweakKey, def bool) bool {
|
|
v, ok := tweaks[string(key)]
|
|
if !ok {
|
|
return def
|
|
}
|
|
b, ok := v.(bool)
|
|
if !ok {
|
|
return def
|
|
}
|
|
return b
|
|
}
|
|
|
|
// globToRegexp converts a Matrix glob-style pattern to a Regular expression.
|
|
func globToRegexp(pattern string) (*regexp.Regexp, error) {
|
|
// TODO: It's unclear which glob characters are supported. The only
|
|
// place this is discussed is for the unrelated "m.policy.rule.*"
|
|
// events. Assuming, the same: /[*?]/
|
|
if !strings.ContainsAny(pattern, "*?") {
|
|
pattern = "*" + pattern + "*"
|
|
}
|
|
|
|
// The defined syntax doesn't allow escaping the glob wildcard
|
|
// characters, which makes this a straight-forward
|
|
// replace-after-quote.
|
|
pattern = globNonMetaRegexp.ReplaceAllStringFunc(pattern, regexp.QuoteMeta)
|
|
pattern = strings.Replace(pattern, "*", ".*", -1)
|
|
pattern = strings.Replace(pattern, "?", ".", -1)
|
|
return regexp.Compile("^(" + pattern + ")$")
|
|
}
|
|
|
|
// globNonMetaRegexp are the characters that are not considered glob
|
|
// meta-characters (i.e. may need escaping).
|
|
var globNonMetaRegexp = regexp.MustCompile("[^*?]+")
|
|
|
|
// lookupMapPath traverses a hierarchical map structure, like the one
|
|
// produced by json.Unmarshal, to return the leaf value. Traversing
|
|
// arrays/slices is not supported, only objects/maps.
|
|
func lookupMapPath(path []string, m map[string]interface{}) (interface{}, error) {
|
|
if len(path) == 0 {
|
|
return nil, fmt.Errorf("empty path")
|
|
}
|
|
|
|
var v interface{} = m
|
|
for i, key := range path {
|
|
m, ok := v.(map[string]interface{})
|
|
if !ok {
|
|
return nil, fmt.Errorf("expected an object for path %q, but got %T", strings.Join(path[:i+1], "."), v)
|
|
}
|
|
|
|
v, ok = m[key]
|
|
if !ok {
|
|
return nil, fmt.Errorf("path not found: %s", strings.Join(path[:i+1], "."))
|
|
}
|
|
}
|
|
|
|
return v, nil
|
|
}
|
|
|
|
// parseRoomMemberCountCondition parses a string like "2", "==2", "<2"
|
|
// into a function that checks if the argument to it fulfils the
|
|
// condition.
|
|
func parseRoomMemberCountCondition(s string) (func(int) bool, error) {
|
|
var b int
|
|
var cmp = func(a int) bool { return a == b }
|
|
switch {
|
|
case strings.HasPrefix(s, "<="):
|
|
cmp = func(a int) bool { return a <= b }
|
|
s = s[2:]
|
|
case strings.HasPrefix(s, ">="):
|
|
cmp = func(a int) bool { return a >= b }
|
|
s = s[2:]
|
|
case strings.HasPrefix(s, "<"):
|
|
cmp = func(a int) bool { return a < b }
|
|
s = s[1:]
|
|
case strings.HasPrefix(s, ">"):
|
|
cmp = func(a int) bool { return a > b }
|
|
s = s[1:]
|
|
case strings.HasPrefix(s, "=="):
|
|
// Same cmp as the default.
|
|
s = s[2:]
|
|
}
|
|
|
|
v, err := strconv.ParseInt(s, 10, 64)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
b = int(v)
|
|
return cmp, nil
|
|
}
|