2019-08-09 13:05:47 -05:00
|
|
|
// Copyright 2015 Matthew Holt and The Caddy Authors
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
package fileserver
|
|
|
|
|
|
|
|
import (
|
2019-12-12 17:27:09 -05:00
|
|
|
"strings"
|
|
|
|
|
2019-12-10 15:36:46 -05:00
|
|
|
"github.com/caddyserver/caddy/v2"
|
2019-08-09 13:19:56 -05:00
|
|
|
"github.com/caddyserver/caddy/v2/caddyconfig/httpcaddyfile"
|
2019-08-21 11:46:35 -05:00
|
|
|
"github.com/caddyserver/caddy/v2/modules/caddyhttp"
|
2019-08-27 15:38:24 -05:00
|
|
|
"github.com/caddyserver/caddy/v2/modules/caddyhttp/rewrite"
|
2019-08-09 13:05:47 -05:00
|
|
|
)
|
|
|
|
|
2019-08-21 11:46:35 -05:00
|
|
|
func init() {
|
|
|
|
httpcaddyfile.RegisterHandlerDirective("file_server", parseCaddyfile)
|
|
|
|
httpcaddyfile.RegisterDirective("try_files", parseTryFiles)
|
|
|
|
}
|
|
|
|
|
2019-11-27 13:51:32 -05:00
|
|
|
// parseCaddyfile parses the file_server directive. It enables the static file
|
|
|
|
// server and configures it with this syntax:
|
|
|
|
//
|
|
|
|
// file_server [<matcher>] [browse] {
|
|
|
|
// root <path>
|
|
|
|
// hide <files...>
|
|
|
|
// index <files...>
|
|
|
|
// browse [<template_file>]
|
|
|
|
// }
|
|
|
|
//
|
2019-08-21 11:46:35 -05:00
|
|
|
func parseCaddyfile(h httpcaddyfile.Helper) (caddyhttp.MiddlewareHandler, error) {
|
|
|
|
var fsrv FileServer
|
|
|
|
|
|
|
|
for h.Next() {
|
|
|
|
args := h.RemainingArgs()
|
2019-08-09 13:05:47 -05:00
|
|
|
switch len(args) {
|
|
|
|
case 0:
|
|
|
|
case 1:
|
|
|
|
if args[0] != "browse" {
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.ArgErr()
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
fsrv.Browse = new(Browse)
|
|
|
|
default:
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.ArgErr()
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
|
2019-09-10 20:21:52 -05:00
|
|
|
for h.NextBlock(0) {
|
2019-08-21 11:46:35 -05:00
|
|
|
switch h.Val() {
|
2019-08-09 13:05:47 -05:00
|
|
|
case "hide":
|
2019-08-21 11:46:35 -05:00
|
|
|
fsrv.Hide = h.RemainingArgs()
|
2019-08-09 13:05:47 -05:00
|
|
|
if len(fsrv.Hide) == 0 {
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.ArgErr()
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
case "index":
|
2019-08-21 11:46:35 -05:00
|
|
|
fsrv.IndexNames = h.RemainingArgs()
|
2019-08-09 13:05:47 -05:00
|
|
|
if len(fsrv.Hide) == 0 {
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.ArgErr()
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
case "root":
|
2019-08-21 11:46:35 -05:00
|
|
|
if !h.Args(&fsrv.Root) {
|
|
|
|
return nil, h.ArgErr()
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
case "browse":
|
|
|
|
if fsrv.Browse != nil {
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.Err("browsing is already configured")
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
fsrv.Browse = new(Browse)
|
2019-08-21 11:46:35 -05:00
|
|
|
h.Args(&fsrv.Browse.TemplateFile)
|
2019-08-09 13:05:47 -05:00
|
|
|
default:
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.Errf("unknown subdirective '%s'", h.Val())
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-21 16:50:02 -05:00
|
|
|
// hide the Caddyfile (and any imported Caddyfiles)
|
|
|
|
if configFiles := h.Caddyfiles(); len(configFiles) > 0 {
|
|
|
|
for _, file := range configFiles {
|
|
|
|
if !fileHidden(file, fsrv.Hide) {
|
|
|
|
fsrv.Hide = append(fsrv.Hide, file)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-21 11:46:35 -05:00
|
|
|
return &fsrv, nil
|
2019-08-09 13:05:47 -05:00
|
|
|
}
|
|
|
|
|
2019-11-15 14:47:38 -05:00
|
|
|
// parseTryFiles parses the try_files directive. It combines a file matcher
|
|
|
|
// with a rewrite directive, so this is not a standard handler directive.
|
|
|
|
// A try_files directive has this syntax (notice no matcher tokens accepted):
|
|
|
|
//
|
|
|
|
// try_files <files...>
|
|
|
|
//
|
2019-12-12 17:27:09 -05:00
|
|
|
// and is basically shorthand for:
|
2019-11-15 14:47:38 -05:00
|
|
|
//
|
|
|
|
// matcher:try_files {
|
|
|
|
// file {
|
|
|
|
// try_files <files...>
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
// rewrite match:try_files {http.matchers.file.relative}{http.request.uri.query_string}
|
|
|
|
//
|
2019-12-12 17:27:09 -05:00
|
|
|
// If any of the files in the list have a query string, the query string will
|
|
|
|
// be ignored when checking for file existence, but will be augmented into
|
|
|
|
// the request's URI when rewriting the request.
|
2019-08-21 11:46:35 -05:00
|
|
|
func parseTryFiles(h httpcaddyfile.Helper) ([]httpcaddyfile.ConfigValue, error) {
|
|
|
|
if !h.Next() {
|
|
|
|
return nil, h.ArgErr()
|
|
|
|
}
|
|
|
|
|
2019-12-12 17:27:09 -05:00
|
|
|
tryFiles := h.RemainingArgs()
|
|
|
|
if len(tryFiles) == 0 {
|
2019-08-21 11:46:35 -05:00
|
|
|
return nil, h.ArgErr()
|
|
|
|
}
|
|
|
|
|
2019-12-12 17:27:09 -05:00
|
|
|
// makeRoute returns a route that tries the files listed in try
|
|
|
|
// and then rewrites to the matched file, and appends writeURIAppend
|
|
|
|
// to the end of the query string.
|
|
|
|
makeRoute := func(try []string, writeURIAppend string) []httpcaddyfile.ConfigValue {
|
|
|
|
handler := rewrite.Rewrite{
|
http: Change routes to sequential matcher evaluation (#2967)
Previously, all matchers in a route would be evaluated before any
handlers were executed, and a composite route of the matching routes
would be created. This made rewrites especially tricky, since the only
way to defer later matchers' evaluation was to wrap them in a subroute,
or to invoke a "rehandle" which often caused bugs.
Instead, this new sequential design evaluates each route's matchers then
its handlers in lock-step; matcher-handlers-matcher-handlers...
If the first matching route consists of a rewrite, then the second route
will be evaluated against the rewritten request, rather than the original
one, and so on.
This should do away with any need for rehandling.
I've also taken this opportunity to avoid adding new values to the
request context in the handler chain, as this creates a copy of the
Request struct, which may possibly lead to bugs like it has in the past
(see PR #1542, PR #1481, and maybe issue #2463). We now add all the
expected context values in the top-level handler at the server, then
any new values can be added to the variable table via the VarsCtxKey
context key, or just the GetVar/SetVar functions. In particular, we are
using this facility to convey dial information in the reverse proxy.
Had to be careful in one place as the middleware compilation logic has
changed, and moved a bit. We no longer compile a middleware chain per-
request; instead, we can compile it at provision-time, and defer only the
evaluation of matchers to request-time, which should slightly improve
performance. Doing this, however, we take advantage of multiple function
closures, and we also changed the use of HandlerFunc (function pointer)
to Handler (interface)... this led to a situation where, if we aren't
careful, allows one request routed a certain way to permanently change
the "next" handler for all/most other requests! We avoid this by making
a copy of the interface value (which is a lightweight pointer copy) and
using exclusively that within our wrapped handlers. This way, the
original stack frame is preserved in a "read-only" fashion. The comments
in the code describe this phenomenon.
This may very well be a breaking change for some configurations, however
I do not expect it to impact many people. I will make it clear in the
release notes that this change has occurred.
2020-01-09 12:00:13 -05:00
|
|
|
URI: "{http.matchers.file.relative}{http.request.uri.query_string}" + writeURIAppend,
|
2019-12-12 17:27:09 -05:00
|
|
|
}
|
|
|
|
matcherSet := caddy.ModuleMap{
|
|
|
|
"file": h.JSON(MatchFile{
|
|
|
|
TryFiles: try,
|
|
|
|
}),
|
|
|
|
}
|
|
|
|
return h.NewRoute(matcherSet, handler)
|
2019-08-21 11:46:35 -05:00
|
|
|
}
|
2019-08-09 13:05:47 -05:00
|
|
|
|
2019-12-12 17:27:09 -05:00
|
|
|
var result []httpcaddyfile.ConfigValue
|
|
|
|
|
|
|
|
// if there are query strings in the list, we have to split into
|
|
|
|
// a separate route for each item with a query string, because
|
|
|
|
// the rewrite is different for that item
|
|
|
|
var try []string
|
|
|
|
for _, item := range tryFiles {
|
|
|
|
if idx := strings.Index(item, "?"); idx >= 0 {
|
|
|
|
if len(try) > 0 {
|
|
|
|
result = append(result, makeRoute(try, "")...)
|
|
|
|
try = []string{}
|
|
|
|
}
|
|
|
|
result = append(result, makeRoute([]string{item[:idx]}, "&"+item[idx+1:])...)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
// accumulate consecutive non-query-string parameters
|
|
|
|
try = append(try, item)
|
|
|
|
}
|
|
|
|
if len(try) > 0 {
|
|
|
|
result = append(result, makeRoute(try, "")...)
|
2019-08-21 11:46:35 -05:00
|
|
|
}
|
|
|
|
|
2019-12-12 17:27:09 -05:00
|
|
|
return result, nil
|
2019-08-21 11:46:35 -05:00
|
|
|
}
|