2019-06-18 14:28:30 +00:00
|
|
|
package xmpp
|
2019-06-13 15:22:39 +00:00
|
|
|
|
|
|
|
import (
|
|
|
|
"strings"
|
|
|
|
)
|
|
|
|
|
|
|
|
/*
|
2019-06-14 07:37:38 +00:00
|
|
|
The XMPP router helps client and component developers select which XMPP they would like to process,
|
2019-06-13 15:22:39 +00:00
|
|
|
and associate processing code depending on the router configuration.
|
|
|
|
|
2019-06-17 09:59:39 +00:00
|
|
|
Here are important rules to keep in mind while setting your routes and matchers:
|
|
|
|
- Routes are evaluated in the order they are set.
|
|
|
|
- When a route matches, it is executed and all others routes are ignored. For each packet, only a single
|
|
|
|
route is executed.
|
2019-06-21 14:48:13 +00:00
|
|
|
- An empty route will match everything. Adding an empty route as the last route in your router will
|
|
|
|
allow you to get all stanzas that did not match any previous route. You can for example use this to
|
|
|
|
log all unexpected stanza received by your client or component.
|
2019-06-17 09:59:39 +00:00
|
|
|
|
2019-06-13 15:22:39 +00:00
|
|
|
TODO: Automatically reply to IQ that do not match any route, to comply to XMPP standard.
|
|
|
|
*/
|
|
|
|
|
|
|
|
type Router struct {
|
|
|
|
// Routes to be matched, in order.
|
|
|
|
routes []*Route
|
|
|
|
}
|
|
|
|
|
|
|
|
// NewRouter returns a new router instance.
|
|
|
|
func NewRouter() *Router {
|
|
|
|
return &Router{}
|
|
|
|
}
|
|
|
|
|
2019-06-14 07:37:38 +00:00
|
|
|
func (r *Router) Route(s Sender, p Packet) {
|
2019-06-13 15:22:39 +00:00
|
|
|
var match RouteMatch
|
|
|
|
if r.Match(p, &match) {
|
2019-06-14 07:37:38 +00:00
|
|
|
match.Handler.HandlePacket(s, p)
|
2019-06-13 15:22:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// NewRoute registers an empty routes
|
|
|
|
func (r *Router) NewRoute() *Route {
|
|
|
|
route := &Route{}
|
|
|
|
r.routes = append(r.routes, route)
|
|
|
|
return route
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Router) Match(p Packet, match *RouteMatch) bool {
|
|
|
|
for _, route := range r.routes {
|
|
|
|
if route.Match(p, match) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle registers a new route with a matcher for a given packet name (iq, message, presence)
|
|
|
|
// See Route.Packet() and Route.Handler().
|
|
|
|
func (r *Router) Handle(name string, handler Handler) *Route {
|
|
|
|
return r.NewRoute().Packet(name).Handler(handler)
|
|
|
|
}
|
|
|
|
|
|
|
|
// HandleFunc registers a new route with a matcher for for a given packet name (iq, message, presence)
|
|
|
|
// See Route.Path() and Route.HandlerFunc().
|
2019-06-14 07:37:38 +00:00
|
|
|
func (r *Router) HandleFunc(name string, f func(s Sender, p Packet)) *Route {
|
2019-06-13 15:22:39 +00:00
|
|
|
return r.NewRoute().Packet(name).HandlerFunc(f)
|
|
|
|
}
|
|
|
|
|
|
|
|
// ============================================================================
|
|
|
|
// Route
|
|
|
|
type Handler interface {
|
2019-06-14 07:37:38 +00:00
|
|
|
HandlePacket(s Sender, p Packet)
|
2019-06-13 15:22:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
type Route struct {
|
|
|
|
handler Handler
|
|
|
|
// Matchers are used to "specialize" routes and focus on specific packet features
|
|
|
|
matchers []matcher
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Route) Handler(handler Handler) *Route {
|
|
|
|
r.handler = handler
|
|
|
|
return r
|
|
|
|
}
|
|
|
|
|
|
|
|
// The HandlerFunc type is an adapter to allow the use of
|
|
|
|
// ordinary functions as XMPP handlers. If f is a function
|
|
|
|
// with the appropriate signature, HandlerFunc(f) is a
|
|
|
|
// Handler that calls f.
|
2019-06-14 07:37:38 +00:00
|
|
|
type HandlerFunc func(s Sender, p Packet)
|
2019-06-13 15:22:39 +00:00
|
|
|
|
2019-06-14 07:37:38 +00:00
|
|
|
// HandlePacket calls f(s, p)
|
|
|
|
func (f HandlerFunc) HandlePacket(s Sender, p Packet) {
|
|
|
|
f(s, p)
|
2019-06-13 15:22:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// HandlerFunc sets a handler function for the route
|
|
|
|
func (r *Route) HandlerFunc(f HandlerFunc) *Route {
|
|
|
|
return r.Handler(f)
|
|
|
|
}
|
|
|
|
|
|
|
|
// addMatcher adds a matcher to the route
|
|
|
|
func (r *Route) addMatcher(m matcher) *Route {
|
|
|
|
r.matchers = append(r.matchers, m)
|
|
|
|
return r
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Route) Match(p Packet, match *RouteMatch) bool {
|
|
|
|
for _, m := range r.matchers {
|
|
|
|
if matched := m.Match(p, match); !matched {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// We have a match, let's pass info route match info
|
|
|
|
match.Route = r
|
|
|
|
match.Handler = r.handler
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
// --------------------
|
|
|
|
// Match on packet name
|
|
|
|
|
|
|
|
type nameMatcher string
|
|
|
|
|
|
|
|
func (n nameMatcher) Match(p Packet, match *RouteMatch) bool {
|
|
|
|
var name string
|
|
|
|
// TODO: To avoid type switch everywhere in matching, I think we will need to have
|
|
|
|
// to move to a concrete type for packets, to make matching and comparison more natural.
|
|
|
|
// Current code structure is probably too rigid.
|
|
|
|
// Maybe packet types should even be from an enum.
|
|
|
|
switch p.(type) {
|
|
|
|
case Message:
|
|
|
|
name = "message"
|
|
|
|
case IQ:
|
|
|
|
name = "iq"
|
|
|
|
case Presence:
|
|
|
|
name = "presence"
|
|
|
|
}
|
|
|
|
if name == string(n) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// Packet matches on a packet name (iq, message, presence, ...)
|
|
|
|
// It matches on the Local part of the xml.Name
|
|
|
|
func (r *Route) Packet(name string) *Route {
|
|
|
|
name = strings.ToLower(name)
|
|
|
|
return r.addMatcher(nameMatcher(name))
|
|
|
|
}
|
|
|
|
|
2019-06-21 14:48:13 +00:00
|
|
|
// -------------------------
|
|
|
|
// Match on stanza type
|
|
|
|
|
|
|
|
// nsTypeMather matches on a list of IQ payload namespaces
|
|
|
|
type nsTypeMatcher []string
|
|
|
|
|
|
|
|
func (m nsTypeMatcher) Match(p Packet, match *RouteMatch) bool {
|
|
|
|
// TODO: Rework after merge of #62
|
|
|
|
var stanzaType string
|
|
|
|
switch packet := p.(type) {
|
|
|
|
case IQ:
|
|
|
|
stanzaType = packet.Type
|
|
|
|
case Presence:
|
|
|
|
stanzaType = packet.Type
|
|
|
|
case Message:
|
|
|
|
if packet.Type == "" {
|
|
|
|
// optional on message, normal is the default type
|
|
|
|
stanzaType = "normal"
|
|
|
|
} else {
|
|
|
|
stanzaType = packet.Type
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return matchInArray(m, stanzaType)
|
|
|
|
}
|
|
|
|
|
|
|
|
// IQNamespaces adds an IQ matcher, expecting both an IQ and a
|
|
|
|
func (r *Route) StanzaType(types ...string) *Route {
|
|
|
|
for k, v := range types {
|
|
|
|
types[k] = strings.ToLower(v)
|
|
|
|
}
|
|
|
|
return r.addMatcher(nsTypeMatcher(types))
|
|
|
|
}
|
|
|
|
|
2019-06-13 15:22:39 +00:00
|
|
|
// -------------------------
|
|
|
|
// Match on IQ and namespace
|
|
|
|
|
|
|
|
// nsIqMather matches on a list of IQ payload namespaces
|
|
|
|
type nsIQMatcher []string
|
|
|
|
|
|
|
|
func (m nsIQMatcher) Match(p Packet, match *RouteMatch) bool {
|
|
|
|
iq, ok := p.(IQ)
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
2019-06-19 08:21:57 +00:00
|
|
|
if iq.Payload == nil {
|
2019-06-13 15:22:39 +00:00
|
|
|
return false
|
|
|
|
}
|
2019-06-19 08:21:57 +00:00
|
|
|
return matchInArray(m, iq.Payload.Namespace())
|
2019-06-13 15:22:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// IQNamespaces adds an IQ matcher, expecting both an IQ and a
|
|
|
|
func (r *Route) IQNamespaces(namespaces ...string) *Route {
|
|
|
|
for k, v := range namespaces {
|
|
|
|
namespaces[k] = strings.ToLower(v)
|
|
|
|
}
|
|
|
|
return r.addMatcher(nsIQMatcher(namespaces))
|
|
|
|
}
|
|
|
|
|
|
|
|
// ============================================================================
|
|
|
|
// Matchers
|
|
|
|
|
|
|
|
// Matchers are used to "specialize" routes and focus on specific packet features
|
|
|
|
type matcher interface {
|
|
|
|
Match(Packet, *RouteMatch) bool
|
|
|
|
}
|
|
|
|
|
|
|
|
// RouteMatch extracts and gather match information
|
|
|
|
type RouteMatch struct {
|
|
|
|
Route *Route
|
|
|
|
Handler Handler
|
|
|
|
}
|
|
|
|
|
|
|
|
// matchInArray is a generic matching function to check if a string is a list
|
|
|
|
// of specific function
|
|
|
|
func matchInArray(arr []string, value string) bool {
|
|
|
|
for _, str := range arr {
|
|
|
|
if str == value {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|