2019-04-12 10:42:55 +08:00
|
|
|
package caddyhttp
|
|
|
|
|
|
|
|
import (
|
|
|
|
"encoding/json"
|
|
|
|
"fmt"
|
|
|
|
"net/http"
|
|
|
|
|
|
|
|
"bitbucket.org/lightcodelabs/caddy2"
|
|
|
|
)
|
|
|
|
|
2019-05-15 04:14:05 +08:00
|
|
|
// ServerRoute represents a set of matching rules,
|
|
|
|
// middlewares, and a responder for handling HTTP
|
|
|
|
// requests.
|
|
|
|
type ServerRoute struct {
|
2019-05-23 03:13:39 +08:00
|
|
|
Group string `json:"group,omitempty"`
|
|
|
|
MatcherSets []map[string]json.RawMessage `json:"match,omitempty"`
|
|
|
|
Apply []json.RawMessage `json:"apply,omitempty"`
|
|
|
|
Respond json.RawMessage `json:"respond,omitempty"`
|
2019-04-12 10:42:55 +08:00
|
|
|
|
2019-05-23 02:32:36 +08:00
|
|
|
Terminal bool `json:"terminal,omitempty"`
|
2019-04-12 10:42:55 +08:00
|
|
|
|
|
|
|
// decoded values
|
2019-05-23 03:13:39 +08:00
|
|
|
matcherSets []MatcherSet
|
|
|
|
middleware []MiddlewareHandler
|
|
|
|
responder Handler
|
|
|
|
}
|
|
|
|
|
|
|
|
func (sr ServerRoute) anyMatcherSetMatches(r *http.Request) bool {
|
|
|
|
for _, ms := range sr.matcherSets {
|
|
|
|
if ms.Match(r) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// MatcherSet is a set of matchers which
|
|
|
|
// must all match in order for the request
|
|
|
|
// to be matched successfully.
|
|
|
|
type MatcherSet []RequestMatcher
|
|
|
|
|
|
|
|
// Match returns true if the request matches all
|
|
|
|
// matchers in mset.
|
|
|
|
func (mset MatcherSet) Match(r *http.Request) bool {
|
|
|
|
for _, m := range mset {
|
|
|
|
if !m.Match(r) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
2019-04-12 10:42:55 +08:00
|
|
|
}
|
|
|
|
|
2019-05-15 04:14:05 +08:00
|
|
|
// RouteList is a list of server routes that can
|
|
|
|
// create a middleware chain.
|
|
|
|
type RouteList []ServerRoute
|
2019-04-12 10:42:55 +08:00
|
|
|
|
2019-05-15 04:14:05 +08:00
|
|
|
// Provision sets up all the routes by loading the modules.
|
2019-05-17 06:05:38 +08:00
|
|
|
func (routes RouteList) Provision(ctx caddy2.Context) error {
|
2019-05-15 04:14:05 +08:00
|
|
|
for i, route := range routes {
|
|
|
|
// matchers
|
2019-05-23 03:13:39 +08:00
|
|
|
for _, matcherSet := range route.MatcherSets {
|
|
|
|
var matchers MatcherSet
|
|
|
|
for modName, rawMsg := range matcherSet {
|
|
|
|
val, err := ctx.LoadModule("http.matchers."+modName, rawMsg)
|
|
|
|
if err != nil {
|
|
|
|
return fmt.Errorf("loading matcher module '%s': %v", modName, err)
|
|
|
|
}
|
|
|
|
matchers = append(matchers, val.(RequestMatcher))
|
2019-05-15 04:14:05 +08:00
|
|
|
}
|
2019-05-23 03:13:39 +08:00
|
|
|
routes[i].matcherSets = append(routes[i].matcherSets, matchers)
|
2019-05-15 04:14:05 +08:00
|
|
|
}
|
2019-05-23 03:13:39 +08:00
|
|
|
routes[i].MatcherSets = nil // allow GC to deallocate - TODO: Does this help?
|
2019-05-15 04:14:05 +08:00
|
|
|
|
|
|
|
// middleware
|
|
|
|
for j, rawMsg := range route.Apply {
|
2019-05-17 06:05:38 +08:00
|
|
|
mid, err := ctx.LoadModuleInline("middleware", "http.middleware", rawMsg)
|
2019-05-15 04:14:05 +08:00
|
|
|
if err != nil {
|
|
|
|
return fmt.Errorf("loading middleware module in position %d: %v", j, err)
|
|
|
|
}
|
|
|
|
routes[i].middleware = append(routes[i].middleware, mid.(MiddlewareHandler))
|
|
|
|
}
|
|
|
|
routes[i].Apply = nil // allow GC to deallocate - TODO: Does this help?
|
|
|
|
|
|
|
|
// responder
|
|
|
|
if route.Respond != nil {
|
2019-05-17 06:05:38 +08:00
|
|
|
resp, err := ctx.LoadModuleInline("responder", "http.responders", route.Respond)
|
2019-05-15 04:14:05 +08:00
|
|
|
if err != nil {
|
|
|
|
return fmt.Errorf("loading responder module: %v", err)
|
|
|
|
}
|
|
|
|
routes[i].responder = resp.(Handler)
|
|
|
|
}
|
|
|
|
routes[i].Respond = nil // allow GC to deallocate - TODO: Does this help?
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2019-05-21 13:48:43 +08:00
|
|
|
// BuildCompositeRoute creates a chain of handlers by applying all the matching
|
|
|
|
// routes. The returned ResponseWriter should be used instead of rw.
|
|
|
|
func (routes RouteList) BuildCompositeRoute(rw http.ResponseWriter, req *http.Request) (Handler, http.ResponseWriter) {
|
|
|
|
mrw := &middlewareResponseWriter{ResponseWriterWrapper: &ResponseWriterWrapper{rw}}
|
|
|
|
|
2019-04-12 10:42:55 +08:00
|
|
|
if len(routes) == 0 {
|
2019-05-21 13:48:43 +08:00
|
|
|
return emptyHandler, mrw
|
2019-04-12 10:42:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
var mid []Middleware
|
|
|
|
var responder Handler
|
2019-05-21 00:59:20 +08:00
|
|
|
groups := make(map[string]struct{})
|
2019-04-12 10:42:55 +08:00
|
|
|
|
|
|
|
for _, route := range routes {
|
2019-05-23 03:13:39 +08:00
|
|
|
// route must match at least one of the matcher sets
|
|
|
|
if !route.anyMatcherSetMatches(req) {
|
|
|
|
continue
|
2019-04-12 10:42:55 +08:00
|
|
|
}
|
2019-05-21 00:59:20 +08:00
|
|
|
|
|
|
|
// if route is part of a group, ensure only
|
|
|
|
// the first matching route in the group is
|
|
|
|
// applied
|
|
|
|
if route.Group != "" {
|
|
|
|
_, ok := groups[route.Group]
|
|
|
|
if ok {
|
|
|
|
// this group has already been satisfied
|
|
|
|
// by a matching route
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
// this matching route satisfies the group
|
|
|
|
groups[route.Group] = struct{}{}
|
|
|
|
}
|
|
|
|
|
|
|
|
// apply the rest of the route
|
2019-04-12 10:42:55 +08:00
|
|
|
for _, m := range route.middleware {
|
2019-05-21 13:48:43 +08:00
|
|
|
// we have to be sure to wrap m outside
|
|
|
|
// of our current scope so that the
|
|
|
|
// reference to this m isn't overwritten
|
|
|
|
// on the next iteration, leaving only
|
|
|
|
// the last middleware in the chain as
|
|
|
|
// the ONLY middleware in the chain!
|
|
|
|
mid = append(mid, wrapMiddleware(m))
|
2019-04-12 10:42:55 +08:00
|
|
|
}
|
|
|
|
if responder == nil {
|
|
|
|
responder = route.responder
|
|
|
|
}
|
2019-05-11 11:07:02 +08:00
|
|
|
if route.Terminal {
|
2019-04-12 10:42:55 +08:00
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// build the middleware stack, with the responder at the end
|
|
|
|
stack := HandlerFunc(func(w http.ResponseWriter, r *http.Request) error {
|
|
|
|
if responder == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
mrw.allowWrites = true
|
|
|
|
return responder.ServeHTTP(w, r)
|
|
|
|
})
|
|
|
|
for i := len(mid) - 1; i >= 0; i-- {
|
|
|
|
stack = mid[i](stack)
|
|
|
|
}
|
|
|
|
|
2019-05-21 13:48:43 +08:00
|
|
|
return stack, mrw
|
|
|
|
}
|
|
|
|
|
|
|
|
// wrapMiddleware wraps m such that it can be correctly
|
|
|
|
// appended to a list of middleware. This is necessary
|
|
|
|
// so that only the last middleware in a loop does not
|
|
|
|
// become the only middleware of the stack, repeatedly
|
|
|
|
// executed (i.e. it is necessary to keep a reference
|
|
|
|
// to this m outside of the scope of a loop)!
|
|
|
|
func wrapMiddleware(m MiddlewareHandler) Middleware {
|
|
|
|
return func(next HandlerFunc) HandlerFunc {
|
|
|
|
return func(w http.ResponseWriter, r *http.Request) error {
|
|
|
|
// TODO: This is where request tracing could be implemented; also
|
|
|
|
// see below to trace the responder as well
|
|
|
|
// TODO: Trace a diff of the request, would be cool too! see what changed since the last middleware (host, headers, URI...)
|
|
|
|
// TODO: see what the std lib gives us in terms of stack tracing too
|
|
|
|
return m.ServeHTTP(w, r, next)
|
|
|
|
}
|
|
|
|
}
|
2019-04-12 10:42:55 +08:00
|
|
|
}
|
2019-05-21 00:59:20 +08:00
|
|
|
|
|
|
|
type middlewareResponseWriter struct {
|
|
|
|
*ResponseWriterWrapper
|
|
|
|
allowWrites bool
|
|
|
|
}
|
|
|
|
|
|
|
|
func (mrw middlewareResponseWriter) WriteHeader(statusCode int) {
|
|
|
|
if !mrw.allowWrites {
|
|
|
|
panic("WriteHeader: middleware cannot write to the response")
|
|
|
|
}
|
|
|
|
mrw.ResponseWriterWrapper.WriteHeader(statusCode)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (mrw middlewareResponseWriter) Write(b []byte) (int, error) {
|
|
|
|
if !mrw.allowWrites {
|
|
|
|
panic("Write: middleware cannot write to the response")
|
|
|
|
}
|
|
|
|
return mrw.ResponseWriterWrapper.Write(b)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Interface guard
|
|
|
|
var _ HTTPInterfaces = middlewareResponseWriter{}
|