mirror of https://github.com/fatedier/frp
fatedier
8 years ago
7 changed files with 1501 additions and 0 deletions
@ -0,0 +1,11 @@
|
||||
sudo: false |
||||
language: go |
||||
go: |
||||
- 1.1 |
||||
- 1.2 |
||||
- 1.3 |
||||
- 1.4 |
||||
- 1.5 |
||||
- 1.6 |
||||
- 1.7 |
||||
- tip |
||||
@ -0,0 +1,24 @@
|
||||
Copyright (c) 2013 Julien Schmidt. All rights reserved. |
||||
|
||||
|
||||
Redistribution and use in source and binary forms, with or without |
||||
modification, are permitted provided that the following conditions are met: |
||||
* Redistributions of source code must retain the above copyright |
||||
notice, this list of conditions and the following disclaimer. |
||||
* Redistributions in binary form must reproduce the above copyright |
||||
notice, this list of conditions and the following disclaimer in the |
||||
documentation and/or other materials provided with the distribution. |
||||
* The names of the contributors may not be used to endorse or promote |
||||
products derived from this software without specific prior written |
||||
permission. |
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||||
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||||
DISCLAIMED. IN NO EVENT SHALL JULIEN SCHMIDT BE LIABLE FOR ANY |
||||
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||||
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||||
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||||
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||
@ -0,0 +1,276 @@
|
||||
# HttpRouter [](https://travis-ci.org/julienschmidt/httprouter) [](http://godoc.org/github.com/julienschmidt/httprouter) |
||||
|
||||
HttpRouter is a lightweight high performance HTTP request router (also called *multiplexer* or just *mux* for short) for [Go](https://golang.org/). |
||||
|
||||
In contrast to the [default mux][http.ServeMux] of Go's `net/http` package, this router supports variables in the routing pattern and matches against the request method. It also scales better. |
||||
|
||||
The router is optimized for high performance and a small memory footprint. It scales well even with very long paths and a large number of routes. A compressing dynamic trie (radix tree) structure is used for efficient matching. |
||||
|
||||
## Features |
||||
|
||||
**Only explicit matches:** With other routers, like [`http.ServeMux`][http.ServeMux], a requested URL path could match multiple patterns. Therefore they have some awkward pattern priority rules, like *longest match* or *first registered, first matched*. By design of this router, a request can only match exactly one or no route. As a result, there are also no unintended matches, which makes it great for SEO and improves the user experience. |
||||
|
||||
**Stop caring about trailing slashes:** Choose the URL style you like, the router automatically redirects the client if a trailing slash is missing or if there is one extra. Of course it only does so, if the new path has a handler. If you don't like it, you can [turn off this behavior](https://godoc.org/github.com/julienschmidt/httprouter#Router.RedirectTrailingSlash). |
||||
|
||||
**Path auto-correction:** Besides detecting the missing or additional trailing slash at no extra cost, the router can also fix wrong cases and remove superfluous path elements (like `../` or `//`). Is [CAPTAIN CAPS LOCK](http://www.urbandictionary.com/define.php?term=Captain+Caps+Lock) one of your users? HttpRouter can help him by making a case-insensitive look-up and redirecting him to the correct URL. |
||||
|
||||
**Parameters in your routing pattern:** Stop parsing the requested URL path, just give the path segment a name and the router delivers the dynamic value to you. Because of the design of the router, path parameters are very cheap. |
||||
|
||||
**Zero Garbage:** The matching and dispatching process generates zero bytes of garbage. In fact, the only heap allocations that are made, is by building the slice of the key-value pairs for path parameters. If the request path contains no parameters, not a single heap allocation is necessary. |
||||
|
||||
**Best Performance:** [Benchmarks speak for themselves][benchmark]. See below for technical details of the implementation. |
||||
|
||||
**No more server crashes:** You can set a [Panic handler][Router.PanicHandler] to deal with panics occurring during handling a HTTP request. The router then recovers and lets the `PanicHandler` log what happened and deliver a nice error page. |
||||
|
||||
**Perfect for APIs:** The router design encourages to build sensible, hierarchical RESTful APIs. Moreover it has builtin native support for [OPTIONS requests](http://zacstewart.com/2012/04/14/http-options-method.html) and `405 Method Not Allowed` replies. |
||||
|
||||
Of course you can also set **custom [`NotFound`][Router.NotFound] and [`MethodNotAllowed`](https://godoc.org/github.com/julienschmidt/httprouter#Router.MethodNotAllowed) handlers** and [**serve static files**][Router.ServeFiles]. |
||||
|
||||
## Usage |
||||
|
||||
This is just a quick introduction, view the [GoDoc](http://godoc.org/github.com/julienschmidt/httprouter) for details. |
||||
|
||||
Let's start with a trivial example: |
||||
|
||||
```go |
||||
package main |
||||
|
||||
import ( |
||||
"fmt" |
||||
"github.com/julienschmidt/httprouter" |
||||
"net/http" |
||||
"log" |
||||
) |
||||
|
||||
func Index(w http.ResponseWriter, r *http.Request, _ httprouter.Params) { |
||||
fmt.Fprint(w, "Welcome!\n") |
||||
} |
||||
|
||||
func Hello(w http.ResponseWriter, r *http.Request, ps httprouter.Params) { |
||||
fmt.Fprintf(w, "hello, %s!\n", ps.ByName("name")) |
||||
} |
||||
|
||||
func main() { |
||||
router := httprouter.New() |
||||
router.GET("/", Index) |
||||
router.GET("/hello/:name", Hello) |
||||
|
||||
log.Fatal(http.ListenAndServe(":8080", router)) |
||||
} |
||||
``` |
||||
|
||||
### Named parameters |
||||
|
||||
As you can see, `:name` is a *named parameter*. The values are accessible via `httprouter.Params`, which is just a slice of `httprouter.Param`s. You can get the value of a parameter either by its index in the slice, or by using the `ByName(name)` method: `:name` can be retrived by `ByName("name")`. |
||||
|
||||
Named parameters only match a single path segment: |
||||
|
||||
``` |
||||
Pattern: /user/:user |
||||
|
||||
/user/gordon match |
||||
/user/you match |
||||
/user/gordon/profile no match |
||||
/user/ no match |
||||
``` |
||||
|
||||
**Note:** Since this router has only explicit matches, you can not register static routes and parameters for the same path segment. For example you can not register the patterns `/user/new` and `/user/:user` for the same request method at the same time. The routing of different request methods is independent from each other. |
||||
|
||||
### Catch-All parameters |
||||
|
||||
The second type are *catch-all* parameters and have the form `*name`. Like the name suggests, they match everything. Therefore they must always be at the **end** of the pattern: |
||||
|
||||
``` |
||||
Pattern: /src/*filepath |
||||
|
||||
/src/ match |
||||
/src/somefile.go match |
||||
/src/subdir/somefile.go match |
||||
``` |
||||
|
||||
## How does it work? |
||||
|
||||
The router relies on a tree structure which makes heavy use of *common prefixes*, it is basically a *compact* [*prefix tree*](https://en.wikipedia.org/wiki/Trie) (or just [*Radix tree*](https://en.wikipedia.org/wiki/Radix_tree)). Nodes with a common prefix also share a common parent. Here is a short example what the routing tree for the `GET` request method could look like: |
||||
|
||||
``` |
||||
Priority Path Handle |
||||
9 \ *<1> |
||||
3 ├s nil |
||||
2 |├earch\ *<2> |
||||
1 |└upport\ *<3> |
||||
2 ├blog\ *<4> |
||||
1 | └:post nil |
||||
1 | └\ *<5> |
||||
2 ├about-us\ *<6> |
||||
1 | └team\ *<7> |
||||
1 └contact\ *<8> |
||||
``` |
||||
|
||||
Every `*<num>` represents the memory address of a handler function (a pointer). If you follow a path trough the tree from the root to the leaf, you get the complete route path, e.g `\blog\:post\`, where `:post` is just a placeholder ([*parameter*](#named-parameters)) for an actual post name. Unlike hash-maps, a tree structure also allows us to use dynamic parts like the `:post` parameter, since we actually match against the routing patterns instead of just comparing hashes. [As benchmarks show][benchmark], this works very well and efficient. |
||||
|
||||
Since URL paths have a hierarchical structure and make use only of a limited set of characters (byte values), it is very likely that there are a lot of common prefixes. This allows us to easily reduce the routing into ever smaller problems. Moreover the router manages a separate tree for every request method. For one thing it is more space efficient than holding a method->handle map in every single node, for another thing is also allows us to greatly reduce the routing problem before even starting the look-up in the prefix-tree. |
||||
|
||||
For even better scalability, the child nodes on each tree level are ordered by priority, where the priority is just the number of handles registered in sub nodes (children, grandchildren, and so on..). This helps in two ways: |
||||
|
||||
1. Nodes which are part of the most routing paths are evaluated first. This helps to make as much routes as possible to be reachable as fast as possible. |
||||
2. It is some sort of cost compensation. The longest reachable path (highest cost) can always be evaluated first. The following scheme visualizes the tree structure. Nodes are evaluated from top to bottom and from left to right. |
||||
|
||||
``` |
||||
├------------ |
||||
├--------- |
||||
├----- |
||||
├---- |
||||
├-- |
||||
├-- |
||||
└- |
||||
``` |
||||
|
||||
## Why doesn't this work with `http.Handler`? |
||||
|
||||
**It does!** The router itself implements the `http.Handler` interface. Moreover the router provides convenient [adapters for `http.Handler`][Router.Handler]s and [`http.HandlerFunc`][Router.HandlerFunc]s which allows them to be used as a [`httprouter.Handle`][Router.Handle] when registering a route. The only disadvantage is, that no parameter values can be retrieved when a `http.Handler` or `http.HandlerFunc` is used, since there is no efficient way to pass the values with the existing function parameters. Therefore [`httprouter.Handle`][Router.Handle] has a third function parameter. |
||||
|
||||
Just try it out for yourself, the usage of HttpRouter is very straightforward. The package is compact and minimalistic, but also probably one of the easiest routers to set up. |
||||
|
||||
## Where can I find Middleware *X*? |
||||
|
||||
This package just provides a very efficient request router with a few extra features. The router is just a [`http.Handler`][http.Handler], you can chain any http.Handler compatible middleware before the router, for example the [Gorilla handlers](http://www.gorillatoolkit.org/pkg/handlers). Or you could [just write your own](https://justinas.org/writing-http-middleware-in-go/), it's very easy! |
||||
|
||||
Alternatively, you could try [a web framework based on HttpRouter](#web-frameworks-based-on-httprouter). |
||||
|
||||
### Multi-domain / Sub-domains |
||||
|
||||
Here is a quick example: Does your server serve multiple domains / hosts? |
||||
You want to use sub-domains? |
||||
Define a router per host! |
||||
|
||||
```go |
||||
// We need an object that implements the http.Handler interface. |
||||
// Therefore we need a type for which we implement the ServeHTTP method. |
||||
// We just use a map here, in which we map host names (with port) to http.Handlers |
||||
type HostSwitch map[string]http.Handler |
||||
|
||||
// Implement the ServerHTTP method on our new type |
||||
func (hs HostSwitch) ServeHTTP(w http.ResponseWriter, r *http.Request) { |
||||
// Check if a http.Handler is registered for the given host. |
||||
// If yes, use it to handle the request. |
||||
if handler := hs[r.Host]; handler != nil { |
||||
handler.ServeHTTP(w, r) |
||||
} else { |
||||
// Handle host names for wich no handler is registered |
||||
http.Error(w, "Forbidden", 403) // Or Redirect? |
||||
} |
||||
} |
||||
|
||||
func main() { |
||||
// Initialize a router as usual |
||||
router := httprouter.New() |
||||
router.GET("/", Index) |
||||
router.GET("/hello/:name", Hello) |
||||
|
||||
// Make a new HostSwitch and insert the router (our http handler) |
||||
// for example.com and port 12345 |
||||
hs := make(HostSwitch) |
||||
hs["example.com:12345"] = router |
||||
|
||||
// Use the HostSwitch to listen and serve on port 12345 |
||||
log.Fatal(http.ListenAndServe(":12345", hs)) |
||||
} |
||||
``` |
||||
|
||||
### Basic Authentication |
||||
|
||||
Another quick example: Basic Authentication (RFC 2617) for handles: |
||||
|
||||
```go |
||||
package main |
||||
|
||||
import ( |
||||
"fmt" |
||||
"log" |
||||
"net/http" |
||||
|
||||
"github.com/julienschmidt/httprouter" |
||||
) |
||||
|
||||
func BasicAuth(h httprouter.Handle, requiredUser, requiredPassword string) httprouter.Handle { |
||||
return func(w http.ResponseWriter, r *http.Request, ps httprouter.Params) { |
||||
// Get the Basic Authentication credentials |
||||
user, password, hasAuth := r.BasicAuth() |
||||
|
||||
if hasAuth && user == requiredUser && password == requiredPassword { |
||||
// Delegate request to the given handle |
||||
h(w, r, ps) |
||||
} else { |
||||
// Request Basic Authentication otherwise |
||||
w.Header().Set("WWW-Authenticate", "Basic realm=Restricted") |
||||
http.Error(w, http.StatusText(http.StatusUnauthorized), http.StatusUnauthorized) |
||||
} |
||||
} |
||||
} |
||||
|
||||
func Index(w http.ResponseWriter, r *http.Request, _ httprouter.Params) { |
||||
fmt.Fprint(w, "Not protected!\n") |
||||
} |
||||
|
||||
func Protected(w http.ResponseWriter, r *http.Request, _ httprouter.Params) { |
||||
fmt.Fprint(w, "Protected!\n") |
||||
} |
||||
|
||||
func main() { |
||||
user := "gordon" |
||||
pass := "secret!" |
||||
|
||||
router := httprouter.New() |
||||
router.GET("/", Index) |
||||
router.GET("/protected/", BasicAuth(Protected, user, pass)) |
||||
|
||||
log.Fatal(http.ListenAndServe(":8080", router)) |
||||
} |
||||
``` |
||||
|
||||
## Chaining with the NotFound handler |
||||
|
||||
**NOTE: It might be required to set [`Router.HandleMethodNotAllowed`][Router.HandleMethodNotAllowed] to `false` to avoid problems.** |
||||
|
||||
You can use another [`http.Handler`][http.Handler], for example another router, to handle requests which could not be matched by this router by using the [`Router.NotFound`][Router.NotFound] handler. This allows chaining. |
||||
|
||||
### Static files |
||||
|
||||
The `NotFound` handler can for example be used to serve static files from the root path `/` (like an `index.html` file along with other assets): |
||||
|
||||
```go |
||||
// Serve static files from the ./public directory |
||||
router.NotFound = http.FileServer(http.Dir("public")) |
||||
``` |
||||
|
||||
But this approach sidesteps the strict core rules of this router to avoid routing problems. A cleaner approach is to use a distinct sub-path for serving files, like `/static/*filepath` or `/files/*filepath`. |
||||
|
||||
## Web Frameworks based on HttpRouter |
||||
|
||||
If the HttpRouter is a bit too minimalistic for you, you might try one of the following more high-level 3rd-party web frameworks building upon the HttpRouter package: |
||||
|
||||
* [Ace](https://github.com/plimble/ace): Blazing fast Go Web Framework |
||||
* [api2go](https://github.com/manyminds/api2go): A JSON API Implementation for Go |
||||
* [Gin](https://github.com/gin-gonic/gin): Features a martini-like API with much better performance |
||||
* [Goat](https://github.com/bahlo/goat): A minimalistic REST API server in Go |
||||
* [Hikaru](https://github.com/najeira/hikaru): Supports standalone and Google AppEngine |
||||
* [Hitch](https://github.com/nbio/hitch): Hitch ties httprouter, [httpcontext](https://github.com/nbio/httpcontext), and middleware up in a bow |
||||
* [httpway](https://github.com/corneldamian/httpway): Simple middleware extension with context for httprouter and a server with gracefully shutdown support |
||||
* [kami](https://github.com/guregu/kami): A tiny web framework using x/net/context |
||||
* [Medeina](https://github.com/imdario/medeina): Inspired by Ruby's Roda and Cuba |
||||
* [Neko](https://github.com/rocwong/neko): A lightweight web application framework for Golang |
||||
* [River](https://github.com/abiosoft/river): River is a simple and lightweight REST server |
||||
* [Roxanna](https://github.com/iamthemuffinman/Roxanna): An amalgamation of httprouter, better logging, and hot reload |
||||
* [siesta](https://github.com/VividCortex/siesta): Composable HTTP handlers with contexts |
||||
* [xmux](https://github.com/rs/xmux): xmux is a httprouter fork on top of xhandler (net/context aware) |
||||
|
||||
[benchmark]: <https://github.com/julienschmidt/go-http-routing-benchmark> |
||||
[http.Handler]: <https://golang.org/pkg/net/http/#Handler |
||||
[http.ServeMux]: <https://golang.org/pkg/net/http/#ServeMux> |
||||
[Router.Handle]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.Handle> |
||||
[Router.HandleMethodNotAllowed]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.HandleMethodNotAllowed> |
||||
[Router.Handler]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.Handler> |
||||
[Router.HandlerFunc]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.HandlerFunc> |
||||
[Router.NotFound]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.NotFound> |
||||
[Router.PanicHandler]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.PanicHandler> |
||||
[Router.ServeFiles]: <https://godoc.org/github.com/julienschmidt/httprouter#Router.ServeFiles> |
||||
@ -0,0 +1,123 @@
|
||||
// Copyright 2013 Julien Schmidt. All rights reserved.
|
||||
// Based on the path package, Copyright 2009 The Go Authors.
|
||||
// Use of this source code is governed by a BSD-style license that can be found
|
||||
// in the LICENSE file.
|
||||
|
||||
package httprouter |
||||
|
||||
// CleanPath is the URL version of path.Clean, it returns a canonical URL path
|
||||
// for p, eliminating . and .. elements.
|
||||
//
|
||||
// The following rules are applied iteratively until no further processing can
|
||||
// be done:
|
||||
// 1. Replace multiple slashes with a single slash.
|
||||
// 2. Eliminate each . path name element (the current directory).
|
||||
// 3. Eliminate each inner .. path name element (the parent directory)
|
||||
// along with the non-.. element that precedes it.
|
||||
// 4. Eliminate .. elements that begin a rooted path:
|
||||
// that is, replace "/.." by "/" at the beginning of a path.
|
||||
//
|
||||
// If the result of this process is an empty string, "/" is returned
|
||||
func CleanPath(p string) string { |
||||
// Turn empty string into "/"
|
||||
if p == "" { |
||||
return "/" |
||||
} |
||||
|
||||
n := len(p) |
||||
var buf []byte |
||||
|
||||
// Invariants:
|
||||
// reading from path; r is index of next byte to process.
|
||||
// writing to buf; w is index of next byte to write.
|
||||
|
||||
// path must start with '/'
|
||||
r := 1 |
||||
w := 1 |
||||
|
||||
if p[0] != '/' { |
||||
r = 0 |
||||
buf = make([]byte, n+1) |
||||
buf[0] = '/' |
||||
} |
||||
|
||||
trailing := n > 2 && p[n-1] == '/' |
||||
|
||||
// A bit more clunky without a 'lazybuf' like the path package, but the loop
|
||||
// gets completely inlined (bufApp). So in contrast to the path package this
|
||||
// loop has no expensive function calls (except 1x make)
|
||||
|
||||
for r < n { |
||||
switch { |
||||
case p[r] == '/': |
||||
// empty path element, trailing slash is added after the end
|
||||
r++ |
||||
|
||||
case p[r] == '.' && r+1 == n: |
||||
trailing = true |
||||
r++ |
||||
|
||||
case p[r] == '.' && p[r+1] == '/': |
||||
// . element
|
||||
r++ |
||||
|
||||
case p[r] == '.' && p[r+1] == '.' && (r+2 == n || p[r+2] == '/'): |
||||
// .. element: remove to last /
|
||||
r += 2 |
||||
|
||||
if w > 1 { |
||||
// can backtrack
|
||||
w-- |
||||
|
||||
if buf == nil { |
||||
for w > 1 && p[w] != '/' { |
||||
w-- |
||||
} |
||||
} else { |
||||
for w > 1 && buf[w] != '/' { |
||||
w-- |
||||
} |
||||
} |
||||
} |
||||
|
||||
default: |
||||
// real path element.
|
||||
// add slash if needed
|
||||
if w > 1 { |
||||
bufApp(&buf, p, w, '/') |
||||
w++ |
||||
} |
||||
|
||||
// copy element
|
||||
for r < n && p[r] != '/' { |
||||
bufApp(&buf, p, w, p[r]) |
||||
w++ |
||||
r++ |
||||
} |
||||
} |
||||
} |
||||
|
||||
// re-append trailing slash
|
||||
if trailing && w > 1 { |
||||
bufApp(&buf, p, w, '/') |
||||
w++ |
||||
} |
||||
|
||||
if buf == nil { |
||||
return p[:w] |
||||
} |
||||
return string(buf[:w]) |
||||
} |
||||
|
||||
// internal helper to lazily create a buffer if necessary
|
||||
func bufApp(buf *[]byte, s string, w int, c byte) { |
||||
if *buf == nil { |
||||
if s[w] == c { |
||||
return |
||||
} |
||||
|
||||
*buf = make([]byte, len(s)) |
||||
copy(*buf, s[:w]) |
||||
} |
||||
(*buf)[w] = c |
||||
} |
||||
@ -0,0 +1,411 @@
|
||||
// Copyright 2013 Julien Schmidt. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style license that can be found
|
||||
// in the LICENSE file.
|
||||
|
||||
// Package httprouter is a trie based high performance HTTP request router.
|
||||
//
|
||||
// A trivial example is:
|
||||
//
|
||||
// package main
|
||||
//
|
||||
// import (
|
||||
// "fmt"
|
||||
// "github.com/julienschmidt/httprouter"
|
||||
// "net/http"
|
||||
// "log"
|
||||
// )
|
||||
//
|
||||
// func Index(w http.ResponseWriter, r *http.Request, _ httprouter.Params) {
|
||||
// fmt.Fprint(w, "Welcome!\n")
|
||||
// }
|
||||
//
|
||||
// func Hello(w http.ResponseWriter, r *http.Request, ps httprouter.Params) {
|
||||
// fmt.Fprintf(w, "hello, %s!\n", ps.ByName("name"))
|
||||
// }
|
||||
//
|
||||
// func main() {
|
||||
// router := httprouter.New()
|
||||
// router.GET("/", Index)
|
||||
// router.GET("/hello/:name", Hello)
|
||||
//
|
||||
// log.Fatal(http.ListenAndServe(":8080", router))
|
||||
// }
|
||||
//
|
||||
// The router matches incoming requests by the request method and the path.
|
||||
// If a handle is registered for this path and method, the router delegates the
|
||||
// request to that function.
|
||||
// For the methods GET, POST, PUT, PATCH and DELETE shortcut functions exist to
|
||||
// register handles, for all other methods router.Handle can be used.
|
||||
//
|
||||
// The registered path, against which the router matches incoming requests, can
|
||||
// contain two types of parameters:
|
||||
// Syntax Type
|
||||
// :name named parameter
|
||||
// *name catch-all parameter
|
||||
//
|
||||
// Named parameters are dynamic path segments. They match anything until the
|
||||
// next '/' or the path end:
|
||||
// Path: /blog/:category/:post
|
||||
//
|
||||
// Requests:
|
||||
// /blog/go/request-routers match: category="go", post="request-routers"
|
||||
// /blog/go/request-routers/ no match, but the router would redirect
|
||||
// /blog/go/ no match
|
||||
// /blog/go/request-routers/comments no match
|
||||
//
|
||||
// Catch-all parameters match anything until the path end, including the
|
||||
// directory index (the '/' before the catch-all). Since they match anything
|
||||
// until the end, catch-all parameters must always be the final path element.
|
||||
// Path: /files/*filepath
|
||||
//
|
||||
// Requests:
|
||||
// /files/ match: filepath="/"
|
||||
// /files/LICENSE match: filepath="/LICENSE"
|
||||
// /files/templates/article.html match: filepath="/templates/article.html"
|
||||
// /files no match, but the router would redirect
|
||||
//
|
||||
// The value of parameters is saved as a slice of the Param struct, consisting
|
||||
// each of a key and a value. The slice is passed to the Handle func as a third
|
||||
// parameter.
|
||||
// There are two ways to retrieve the value of a parameter:
|
||||
// // by the name of the parameter
|
||||
// user := ps.ByName("user") // defined by :user or *user
|
||||
//
|
||||
// // by the index of the parameter. This way you can also get the name (key)
|
||||
// thirdKey := ps[2].Key // the name of the 3rd parameter
|
||||
// thirdValue := ps[2].Value // the value of the 3rd parameter
|
||||
package httprouter |
||||
|
||||
import ( |
||||
"net/http" |
||||
) |
||||
|
||||
// Handle is a function that can be registered to a route to handle HTTP
|
||||
// requests. Like http.HandlerFunc, but has a third parameter for the values of
|
||||
// wildcards (variables).
|
||||
type Handle func(http.ResponseWriter, *http.Request, Params) |
||||
|
||||
// Param is a single URL parameter, consisting of a key and a value.
|
||||
type Param struct { |
||||
Key string |
||||
Value string |
||||
} |
||||
|
||||
// Params is a Param-slice, as returned by the router.
|
||||
// The slice is ordered, the first URL parameter is also the first slice value.
|
||||
// It is therefore safe to read values by the index.
|
||||
type Params []Param |
||||
|
||||
// ByName returns the value of the first Param which key matches the given name.
|
||||
// If no matching Param is found, an empty string is returned.
|
||||
func (ps Params) ByName(name string) string { |
||||
for i := range ps { |
||||
if ps[i].Key == name { |
||||
return ps[i].Value |
||||
} |
||||
} |
||||
return "" |
||||
} |
||||
|
||||
// Router is a http.Handler which can be used to dispatch requests to different
|
||||
// handler functions via configurable routes
|
||||
type Router struct { |
||||
trees map[string]*node |
||||
|
||||
// Enables automatic redirection if the current route can't be matched but a
|
||||
// handler for the path with (without) the trailing slash exists.
|
||||
// For example if /foo/ is requested but a route only exists for /foo, the
|
||||
// client is redirected to /foo with http status code 301 for GET requests
|
||||
// and 307 for all other request methods.
|
||||
RedirectTrailingSlash bool |
||||
|
||||
// If enabled, the router tries to fix the current request path, if no
|
||||
// handle is registered for it.
|
||||
// First superfluous path elements like ../ or // are removed.
|
||||
// Afterwards the router does a case-insensitive lookup of the cleaned path.
|
||||
// If a handle can be found for this route, the router makes a redirection
|
||||
// to the corrected path with status code 301 for GET requests and 307 for
|
||||
// all other request methods.
|
||||
// For example /FOO and /..//Foo could be redirected to /foo.
|
||||
// RedirectTrailingSlash is independent of this option.
|
||||
RedirectFixedPath bool |
||||
|
||||
// If enabled, the router checks if another method is allowed for the
|
||||
// current route, if the current request can not be routed.
|
||||
// If this is the case, the request is answered with 'Method Not Allowed'
|
||||
// and HTTP status code 405.
|
||||
// If no other Method is allowed, the request is delegated to the NotFound
|
||||
// handler.
|
||||
HandleMethodNotAllowed bool |
||||
|
||||
// If enabled, the router automatically replies to OPTIONS requests.
|
||||
// Custom OPTIONS handlers take priority over automatic replies.
|
||||
HandleOPTIONS bool |
||||
|
||||
// Configurable http.Handler which is called when no matching route is
|
||||
// found. If it is not set, http.NotFound is used.
|
||||
NotFound http.Handler |
||||
|
||||
// Configurable http.Handler which is called when a request
|
||||
// cannot be routed and HandleMethodNotAllowed is true.
|
||||
// If it is not set, http.Error with http.StatusMethodNotAllowed is used.
|
||||
// The "Allow" header with allowed request methods is set before the handler
|
||||
// is called.
|
||||
MethodNotAllowed http.Handler |
||||
|
||||
// Function to handle panics recovered from http handlers.
|
||||
// It should be used to generate a error page and return the http error code
|
||||
// 500 (Internal Server Error).
|
||||
// The handler can be used to keep your server from crashing because of
|
||||
// unrecovered panics.
|
||||
PanicHandler func(http.ResponseWriter, *http.Request, interface{}) |
||||
} |
||||
|
||||
// Make sure the Router conforms with the http.Handler interface
|
||||
var _ http.Handler = New() |
||||
|
||||
// New returns a new initialized Router.
|
||||
// Path auto-correction, including trailing slashes, is enabled by default.
|
||||
func New() *Router { |
||||
return &Router{ |
||||
RedirectTrailingSlash: true, |
||||
RedirectFixedPath: true, |
||||
HandleMethodNotAllowed: true, |
||||
HandleOPTIONS: true, |
||||
} |
||||
} |
||||
|
||||
// GET is a shortcut for router.Handle("GET", path, handle)
|
||||
func (r *Router) GET(path string, handle Handle) { |
||||
r.Handle("GET", path, handle) |
||||
} |
||||
|
||||
// HEAD is a shortcut for router.Handle("HEAD", path, handle)
|
||||
func (r *Router) HEAD(path string, handle Handle) { |
||||
r.Handle("HEAD", path, handle) |
||||
} |
||||
|
||||
// OPTIONS is a shortcut for router.Handle("OPTIONS", path, handle)
|
||||
func (r *Router) OPTIONS(path string, handle Handle) { |
||||
r.Handle("OPTIONS", path, handle) |
||||
} |
||||
|
||||
// POST is a shortcut for router.Handle("POST", path, handle)
|
||||
func (r *Router) POST(path string, handle Handle) { |
||||
r.Handle("POST", path, handle) |
||||
} |
||||
|
||||
// PUT is a shortcut for router.Handle("PUT", path, handle)
|
||||
func (r *Router) PUT(path string, handle Handle) { |
||||
r.Handle("PUT", path, handle) |
||||
} |
||||
|
||||
// PATCH is a shortcut for router.Handle("PATCH", path, handle)
|
||||
func (r *Router) PATCH(path string, handle Handle) { |
||||
r.Handle("PATCH", path, handle) |
||||
} |
||||
|
||||
// DELETE is a shortcut for router.Handle("DELETE", path, handle)
|
||||
func (r *Router) DELETE(path string, handle Handle) { |
||||
r.Handle("DELETE", path, handle) |
||||
} |
||||
|
||||
// Handle registers a new request handle with the given path and method.
|
||||
//
|
||||
// For GET, POST, PUT, PATCH and DELETE requests the respective shortcut
|
||||
// functions can be used.
|
||||
//
|
||||
// This function is intended for bulk loading and to allow the usage of less
|
||||
// frequently used, non-standardized or custom methods (e.g. for internal
|
||||
// communication with a proxy).
|
||||
func (r *Router) Handle(method, path string, handle Handle) { |
||||
if path[0] != '/' { |
||||
panic("path must begin with '/' in path '" + path + "'") |
||||
} |
||||
|
||||
if r.trees == nil { |
||||
r.trees = make(map[string]*node) |
||||
} |
||||
|
||||
root := r.trees[method] |
||||
if root == nil { |
||||
root = new(node) |
||||
r.trees[method] = root |
||||
} |
||||
|
||||
root.addRoute(path, handle) |
||||
} |
||||
|
||||
// Handler is an adapter which allows the usage of an http.Handler as a
|
||||
// request handle.
|
||||
func (r *Router) Handler(method, path string, handler http.Handler) { |
||||
r.Handle(method, path, |
||||
func(w http.ResponseWriter, req *http.Request, _ Params) { |
||||
handler.ServeHTTP(w, req) |
||||
}, |
||||
) |
||||
} |
||||
|
||||
// HandlerFunc is an adapter which allows the usage of an http.HandlerFunc as a
|
||||
// request handle.
|
||||
func (r *Router) HandlerFunc(method, path string, handler http.HandlerFunc) { |
||||
r.Handler(method, path, handler) |
||||
} |
||||
|
||||
// ServeFiles serves files from the given file system root.
|
||||
// The path must end with "/*filepath", files are then served from the local
|
||||
// path /defined/root/dir/*filepath.
|
||||
// For example if root is "/etc" and *filepath is "passwd", the local file
|
||||
// "/etc/passwd" would be served.
|
||||
// Internally a http.FileServer is used, therefore http.NotFound is used instead
|
||||
// of the Router's NotFound handler.
|
||||
// To use the operating system's file system implementation,
|
||||
// use http.Dir:
|
||||
// router.ServeFiles("/src/*filepath", http.Dir("/var/www"))
|
||||
func (r *Router) ServeFiles(path string, root http.FileSystem) { |
||||
if len(path) < 10 || path[len(path)-10:] != "/*filepath" { |
||||
panic("path must end with /*filepath in path '" + path + "'") |
||||
} |
||||
|
||||
fileServer := http.FileServer(root) |
||||
|
||||
r.GET(path, func(w http.ResponseWriter, req *http.Request, ps Params) { |
||||
req.URL.Path = ps.ByName("filepath") |
||||
fileServer.ServeHTTP(w, req) |
||||
}) |
||||
} |
||||
|
||||
func (r *Router) recv(w http.ResponseWriter, req *http.Request) { |
||||
if rcv := recover(); rcv != nil { |
||||
r.PanicHandler(w, req, rcv) |
||||
} |
||||
} |
||||
|
||||
// Lookup allows the manual lookup of a method + path combo.
|
||||
// This is e.g. useful to build a framework around this router.
|
||||
// If the path was found, it returns the handle function and the path parameter
|
||||
// values. Otherwise the third return value indicates whether a redirection to
|
||||
// the same path with an extra / without the trailing slash should be performed.
|
||||
func (r *Router) Lookup(method, path string) (Handle, Params, bool) { |
||||
if root := r.trees[method]; root != nil { |
||||
return root.getValue(path) |
||||
} |
||||
return nil, nil, false |
||||
} |
||||
|
||||
func (r *Router) allowed(path, reqMethod string) (allow string) { |
||||
if path == "*" { // server-wide
|
||||
for method := range r.trees { |
||||
if method == "OPTIONS" { |
||||
continue |
||||
} |
||||
|
||||
// add request method to list of allowed methods
|
||||
if len(allow) == 0 { |
||||
allow = method |
||||
} else { |
||||
allow += ", " + method |
||||
} |
||||
} |
||||
} else { // specific path
|
||||
for method := range r.trees { |
||||
// Skip the requested method - we already tried this one
|
||||
if method == reqMethod || method == "OPTIONS" { |
||||
continue |
||||
} |
||||
|
||||
handle, _, _ := r.trees[method].getValue(path) |
||||
if handle != nil { |
||||
// add request method to list of allowed methods
|
||||
if len(allow) == 0 { |
||||
allow = method |
||||
} else { |
||||
allow += ", " + method |
||||
} |
||||
} |
||||
} |
||||
} |
||||
if len(allow) > 0 { |
||||
allow += ", OPTIONS" |
||||
} |
||||
return |
||||
} |
||||
|
||||
// ServeHTTP makes the router implement the http.Handler interface.
|
||||
func (r *Router) ServeHTTP(w http.ResponseWriter, req *http.Request) { |
||||
if r.PanicHandler != nil { |
||||
defer r.recv(w, req) |
||||
} |
||||
|
||||
path := req.URL.Path |
||||
|
||||
if root := r.trees[req.Method]; root != nil { |
||||
if handle, ps, tsr := root.getValue(path); handle != nil { |
||||
handle(w, req, ps) |
||||
return |
||||
} else if req.Method != "CONNECT" && path != "/" { |
||||
code := 301 // Permanent redirect, request with GET method
|
||||
if req.Method != "GET" { |
||||
// Temporary redirect, request with same method
|
||||
// As of Go 1.3, Go does not support status code 308.
|
||||
code = 307 |
||||
} |
||||
|
||||
if tsr && r.RedirectTrailingSlash { |
||||
if len(path) > 1 && path[len(path)-1] == '/' { |
||||
req.URL.Path = path[:len(path)-1] |
||||
} else { |
||||
req.URL.Path = path + "/" |
||||
} |
||||
http.Redirect(w, req, req.URL.String(), code) |
||||
return |
||||
} |
||||
|
||||
// Try to fix the request path
|
||||
if r.RedirectFixedPath { |
||||
fixedPath, found := root.findCaseInsensitivePath( |
||||
CleanPath(path), |
||||
r.RedirectTrailingSlash, |
||||
) |
||||
if found { |
||||
req.URL.Path = string(fixedPath) |
||||
http.Redirect(w, req, req.URL.String(), code) |
||||
return |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
if req.Method == "OPTIONS" { |
||||
// Handle OPTIONS requests
|
||||
if r.HandleOPTIONS { |
||||
if allow := r.allowed(path, req.Method); len(allow) > 0 { |
||||
w.Header().Set("Allow", allow) |
||||
return |
||||
} |
||||
} |
||||
} else { |
||||
// Handle 405
|
||||
if r.HandleMethodNotAllowed { |
||||
if allow := r.allowed(path, req.Method); len(allow) > 0 { |
||||
w.Header().Set("Allow", allow) |
||||
if r.MethodNotAllowed != nil { |
||||
r.MethodNotAllowed.ServeHTTP(w, req) |
||||
} else { |
||||
http.Error(w, |
||||
http.StatusText(http.StatusMethodNotAllowed), |
||||
http.StatusMethodNotAllowed, |
||||
) |
||||
} |
||||
return |
||||
} |
||||
} |
||||
} |
||||
|
||||
// Handle 404
|
||||
if r.NotFound != nil { |
||||
r.NotFound.ServeHTTP(w, req) |
||||
} else { |
||||
http.NotFound(w, req) |
||||
} |
||||
} |
||||
@ -0,0 +1,651 @@
|
||||
// Copyright 2013 Julien Schmidt. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style license that can be found
|
||||
// in the LICENSE file.
|
||||
|
||||
package httprouter |
||||
|
||||
import ( |
||||
"strings" |
||||
"unicode" |
||||
"unicode/utf8" |
||||
) |
||||
|
||||
func min(a, b int) int { |
||||
if a <= b { |
||||
return a |
||||
} |
||||
return b |
||||
} |
||||
|
||||
func countParams(path string) uint8 { |
||||
var n uint |
||||
for i := 0; i < len(path); i++ { |
||||
if path[i] != ':' && path[i] != '*' { |
||||
continue |
||||
} |
||||
n++ |
||||
} |
||||
if n >= 255 { |
||||
return 255 |
||||
} |
||||
return uint8(n) |
||||
} |
||||
|
||||
type nodeType uint8 |
||||
|
||||
const ( |
||||
static nodeType = iota // default
|
||||
root |
||||
param |
||||
catchAll |
||||
) |
||||
|
||||
type node struct { |
||||
path string |
||||
wildChild bool |
||||
nType nodeType |
||||
maxParams uint8 |
||||
indices string |
||||
children []*node |
||||
handle Handle |
||||
priority uint32 |
||||
} |
||||
|
||||
// increments priority of the given child and reorders if necessary
|
||||
func (n *node) incrementChildPrio(pos int) int { |
||||
n.children[pos].priority++ |
||||
prio := n.children[pos].priority |
||||
|
||||
// adjust position (move to front)
|
||||
newPos := pos |
||||
for newPos > 0 && n.children[newPos-1].priority < prio { |
||||
// swap node positions
|
||||
n.children[newPos-1], n.children[newPos] = n.children[newPos], n.children[newPos-1] |
||||
|
||||
newPos-- |
||||
} |
||||
|
||||
// build new index char string
|
||||
if newPos != pos { |
||||
n.indices = n.indices[:newPos] + // unchanged prefix, might be empty
|
||||
n.indices[pos:pos+1] + // the index char we move
|
||||
n.indices[newPos:pos] + n.indices[pos+1:] // rest without char at 'pos'
|
||||
} |
||||
|
||||
return newPos |
||||
} |
||||
|
||||
// addRoute adds a node with the given handle to the path.
|
||||
// Not concurrency-safe!
|
||||
func (n *node) addRoute(path string, handle Handle) { |
||||
fullPath := path |
||||
n.priority++ |
||||
numParams := countParams(path) |
||||
|
||||
// non-empty tree
|
||||
if len(n.path) > 0 || len(n.children) > 0 { |
||||
walk: |
||||
for { |
||||
// Update maxParams of the current node
|
||||
if numParams > n.maxParams { |
||||
n.maxParams = numParams |
||||
} |
||||
|
||||
// Find the longest common prefix.
|
||||
// This also implies that the common prefix contains no ':' or '*'
|
||||
// since the existing key can't contain those chars.
|
||||
i := 0 |
||||
max := min(len(path), len(n.path)) |
||||
for i < max && path[i] == n.path[i] { |
||||
i++ |
||||
} |
||||
|
||||
// Split edge
|
||||
if i < len(n.path) { |
||||
child := node{ |
||||
path: n.path[i:], |
||||
wildChild: n.wildChild, |
||||
nType: static, |
||||
indices: n.indices, |
||||
children: n.children, |
||||
handle: n.handle, |
||||
priority: n.priority - 1, |
||||
} |
||||
|
||||
// Update maxParams (max of all children)
|
||||
for i := range child.children { |
||||
if child.children[i].maxParams > child.maxParams { |
||||
child.maxParams = child.children[i].maxParams |
||||
} |
||||
} |
||||
|
||||
n.children = []*node{&child} |
||||
// []byte for proper unicode char conversion, see #65
|
||||
n.indices = string([]byte{n.path[i]}) |
||||
n.path = path[:i] |
||||
n.handle = nil |
||||
n.wildChild = false |
||||
} |
||||
|
||||
// Make new node a child of this node
|
||||
if i < len(path) { |
||||
path = path[i:] |
||||
|
||||
if n.wildChild { |
||||
n = n.children[0] |
||||
n.priority++ |
||||
|
||||
// Update maxParams of the child node
|
||||
if numParams > n.maxParams { |
||||
n.maxParams = numParams |
||||
} |
||||
numParams-- |
||||
|
||||
// Check if the wildcard matches
|
||||
if len(path) >= len(n.path) && n.path == path[:len(n.path)] && |
||||
// Check for longer wildcard, e.g. :name and :names
|
||||
(len(n.path) >= len(path) || path[len(n.path)] == '/') { |
||||
continue walk |
||||
} else { |
||||
// Wildcard conflict
|
||||
pathSeg := strings.SplitN(path, "/", 2)[0] |
||||
prefix := fullPath[:strings.Index(fullPath, pathSeg)] + n.path |
||||
panic("'" + pathSeg + |
||||
"' in new path '" + fullPath + |
||||
"' conflicts with existing wildcard '" + n.path + |
||||
"' in existing prefix '" + prefix + |
||||
"'") |
||||
} |
||||
} |
||||
|
||||
c := path[0] |
||||
|
||||
// slash after param
|
||||
if n.nType == param && c == '/' && len(n.children) == 1 { |
||||
n = n.children[0] |
||||
n.priority++ |
||||
continue walk |
||||
} |
||||
|
||||
// Check if a child with the next path byte exists
|
||||
for i := 0; i < len(n.indices); i++ { |
||||
if c == n.indices[i] { |
||||
i = n.incrementChildPrio(i) |
||||
n = n.children[i] |
||||
continue walk |
||||
} |
||||
} |
||||
|
||||
// Otherwise insert it
|
||||
if c != ':' && c != '*' { |
||||
// []byte for proper unicode char conversion, see #65
|
||||
n.indices += string([]byte{c}) |
||||
child := &node{ |
||||
maxParams: numParams, |
||||
} |
||||
n.children = append(n.children, child) |
||||
n.incrementChildPrio(len(n.indices) - 1) |
||||
n = child |
||||
} |
||||
n.insertChild(numParams, path, fullPath, handle) |
||||
return |
||||
|
||||
} else if i == len(path) { // Make node a (in-path) leaf
|
||||
if n.handle != nil { |
||||
panic("a handle is already registered for path '" + fullPath + "'") |
||||
} |
||||
n.handle = handle |
||||
} |
||||
return |
||||
} |
||||
} else { // Empty tree
|
||||
n.insertChild(numParams, path, fullPath, handle) |
||||
n.nType = root |
||||
} |
||||
} |
||||
|
||||
func (n *node) insertChild(numParams uint8, path, fullPath string, handle Handle) { |
||||
var offset int // already handled bytes of the path
|
||||
|
||||
// find prefix until first wildcard (beginning with ':'' or '*'')
|
||||
for i, max := 0, len(path); numParams > 0; i++ { |
||||
c := path[i] |
||||
if c != ':' && c != '*' { |
||||
continue |
||||
} |
||||
|
||||
// find wildcard end (either '/' or path end)
|
||||
end := i + 1 |
||||
for end < max && path[end] != '/' { |
||||
switch path[end] { |
||||
// the wildcard name must not contain ':' and '*'
|
||||
case ':', '*': |
||||
panic("only one wildcard per path segment is allowed, has: '" + |
||||
path[i:] + "' in path '" + fullPath + "'") |
||||
default: |
||||
end++ |
||||
} |
||||
} |
||||
|
||||
// check if this Node existing children which would be
|
||||
// unreachable if we insert the wildcard here
|
||||
if len(n.children) > 0 { |
||||
panic("wildcard route '" + path[i:end] + |
||||
"' conflicts with existing children in path '" + fullPath + "'") |
||||
} |
||||
|
||||
// check if the wildcard has a name
|
||||
if end-i < 2 { |
||||
panic("wildcards must be named with a non-empty name in path '" + fullPath + "'") |
||||
} |
||||
|
||||
if c == ':' { // param
|
||||
// split path at the beginning of the wildcard
|
||||
if i > 0 { |
||||
n.path = path[offset:i] |
||||
offset = i |
||||
} |
||||
|
||||
child := &node{ |
||||
nType: param, |
||||
maxParams: numParams, |
||||
} |
||||
n.children = []*node{child} |
||||
n.wildChild = true |
||||
n = child |
||||
n.priority++ |
||||
numParams-- |
||||
|
||||
// if the path doesn't end with the wildcard, then there
|
||||
// will be another non-wildcard subpath starting with '/'
|
||||
if end < max { |
||||
n.path = path[offset:end] |
||||
offset = end |
||||
|
||||
child := &node{ |
||||
maxParams: numParams, |
||||
priority: 1, |
||||
} |
||||
n.children = []*node{child} |
||||
n = child |
||||
} |
||||
|
||||
} else { // catchAll
|
||||
if end != max || numParams > 1 { |
||||
panic("catch-all routes are only allowed at the end of the path in path '" + fullPath + "'") |
||||
} |
||||
|
||||
if len(n.path) > 0 && n.path[len(n.path)-1] == '/' { |
||||
panic("catch-all conflicts with existing handle for the path segment root in path '" + fullPath + "'") |
||||
} |
||||
|
||||
// currently fixed width 1 for '/'
|
||||
i-- |
||||
if path[i] != '/' { |
||||
panic("no / before catch-all in path '" + fullPath + "'") |
||||
} |
||||
|
||||
n.path = path[offset:i] |
||||
|
||||
// first node: catchAll node with empty path
|
||||
child := &node{ |
||||
wildChild: true, |
||||
nType: catchAll, |
||||
maxParams: 1, |
||||
} |
||||
n.children = []*node{child} |
||||
n.indices = string(path[i]) |
||||
n = child |
||||
n.priority++ |
||||
|
||||
// second node: node holding the variable
|
||||
child = &node{ |
||||
path: path[i:], |
||||
nType: catchAll, |
||||
maxParams: 1, |
||||
handle: handle, |
||||
priority: 1, |
||||
} |
||||
n.children = []*node{child} |
||||
|
||||
return |
||||
} |
||||
} |
||||
|
||||
// insert remaining path part and handle to the leaf
|
||||
n.path = path[offset:] |
||||
n.handle = handle |
||||
} |
||||
|
||||
// Returns the handle registered with the given path (key). The values of
|
||||
// wildcards are saved to a map.
|
||||
// If no handle can be found, a TSR (trailing slash redirect) recommendation is
|
||||
// made if a handle exists with an extra (without the) trailing slash for the
|
||||
// given path.
|
||||
func (n *node) getValue(path string) (handle Handle, p Params, tsr bool) { |
||||
walk: // outer loop for walking the tree
|
||||
for { |
||||
if len(path) > len(n.path) { |
||||
if path[:len(n.path)] == n.path { |
||||
path = path[len(n.path):] |
||||
// If this node does not have a wildcard (param or catchAll)
|
||||
// child, we can just look up the next child node and continue
|
||||
// to walk down the tree
|
||||
if !n.wildChild { |
||||
c := path[0] |
||||
for i := 0; i < len(n.indices); i++ { |
||||
if c == n.indices[i] { |
||||
n = n.children[i] |
||||
continue walk |
||||
} |
||||
} |
||||
|
||||
// Nothing found.
|
||||
// We can recommend to redirect to the same URL without a
|
||||
// trailing slash if a leaf exists for that path.
|
||||
tsr = (path == "/" && n.handle != nil) |
||||
return |
||||
|
||||
} |
||||
|
||||
// handle wildcard child
|
||||
n = n.children[0] |
||||
switch n.nType { |
||||
case param: |
||||
// find param end (either '/' or path end)
|
||||
end := 0 |
||||
for end < len(path) && path[end] != '/' { |
||||
end++ |
||||
} |
||||
|
||||
// save param value
|
||||
if p == nil { |
||||
// lazy allocation
|
||||
p = make(Params, 0, n.maxParams) |
||||
} |
||||
i := len(p) |
||||
p = p[:i+1] // expand slice within preallocated capacity
|
||||
p[i].Key = n.path[1:] |
||||
p[i].Value = path[:end] |
||||
|
||||
// we need to go deeper!
|
||||
if end < len(path) { |
||||
if len(n.children) > 0 { |
||||
path = path[end:] |
||||
n = n.children[0] |
||||
continue walk |
||||
} |
||||
|
||||
// ... but we can't
|
||||
tsr = (len(path) == end+1) |
||||
return |
||||
} |
||||
|
||||
if handle = n.handle; handle != nil { |
||||
return |
||||
} else if len(n.children) == 1 { |
||||
// No handle found. Check if a handle for this path + a
|
||||
// trailing slash exists for TSR recommendation
|
||||
n = n.children[0] |
||||
tsr = (n.path == "/" && n.handle != nil) |
||||
} |
||||
|
||||
return |
||||
|
||||
case catchAll: |
||||
// save param value
|
||||
if p == nil { |
||||
// lazy allocation
|
||||
p = make(Params, 0, n.maxParams) |
||||
} |
||||
i := len(p) |
||||
p = p[:i+1] // expand slice within preallocated capacity
|
||||
p[i].Key = n.path[2:] |
||||
p[i].Value = path |
||||
|
||||
handle = n.handle |
||||
return |
||||
|
||||
default: |
||||
panic("invalid node type") |
||||
} |
||||
} |
||||
} else if path == n.path { |
||||
// We should have reached the node containing the handle.
|
||||
// Check if this node has a handle registered.
|
||||
if handle = n.handle; handle != nil { |
||||
return |
||||
} |
||||
|
||||
if path == "/" && n.wildChild && n.nType != root { |
||||
tsr = true |
||||
return |
||||
} |
||||
|
||||
// No handle found. Check if a handle for this path + a
|
||||
// trailing slash exists for trailing slash recommendation
|
||||
for i := 0; i < len(n.indices); i++ { |
||||
if n.indices[i] == '/' { |
||||
n = n.children[i] |
||||
tsr = (len(n.path) == 1 && n.handle != nil) || |
||||
(n.nType == catchAll && n.children[0].handle != nil) |
||||
return |
||||
} |
||||
} |
||||
|
||||
return |
||||
} |
||||
|
||||
// Nothing found. We can recommend to redirect to the same URL with an
|
||||
// extra trailing slash if a leaf exists for that path
|
||||
tsr = (path == "/") || |
||||
(len(n.path) == len(path)+1 && n.path[len(path)] == '/' && |
||||
path == n.path[:len(n.path)-1] && n.handle != nil) |
||||
return |
||||
} |
||||
} |
||||
|
||||
// Makes a case-insensitive lookup of the given path and tries to find a handler.
|
||||
// It can optionally also fix trailing slashes.
|
||||
// It returns the case-corrected path and a bool indicating whether the lookup
|
||||
// was successful.
|
||||
func (n *node) findCaseInsensitivePath(path string, fixTrailingSlash bool) (ciPath []byte, found bool) { |
||||
return n.findCaseInsensitivePathRec( |
||||
path, |
||||
strings.ToLower(path), |
||||
make([]byte, 0, len(path)+1), // preallocate enough memory for new path
|
||||
[4]byte{}, // empty rune buffer
|
||||
fixTrailingSlash, |
||||
) |
||||
} |
||||
|
||||
// shift bytes in array by n bytes left
|
||||
func shiftNRuneBytes(rb [4]byte, n int) [4]byte { |
||||
switch n { |
||||
case 0: |
||||
return rb |
||||
case 1: |
||||
return [4]byte{rb[1], rb[2], rb[3], 0} |
||||
case 2: |
||||
return [4]byte{rb[2], rb[3]} |
||||
case 3: |
||||
return [4]byte{rb[3]} |
||||
default: |
||||
return [4]byte{} |
||||
} |
||||
} |
||||
|
||||
// recursive case-insensitive lookup function used by n.findCaseInsensitivePath
|
||||
func (n *node) findCaseInsensitivePathRec(path, loPath string, ciPath []byte, rb [4]byte, fixTrailingSlash bool) ([]byte, bool) { |
||||
loNPath := strings.ToLower(n.path) |
||||
|
||||
walk: // outer loop for walking the tree
|
||||
for len(loPath) >= len(loNPath) && (len(loNPath) == 0 || loPath[1:len(loNPath)] == loNPath[1:]) { |
||||
// add common path to result
|
||||
ciPath = append(ciPath, n.path...) |
||||
|
||||
if path = path[len(n.path):]; len(path) > 0 { |
||||
loOld := loPath |
||||
loPath = loPath[len(loNPath):] |
||||
|
||||
// If this node does not have a wildcard (param or catchAll) child,
|
||||
// we can just look up the next child node and continue to walk down
|
||||
// the tree
|
||||
if !n.wildChild { |
||||
// skip rune bytes already processed
|
||||
rb = shiftNRuneBytes(rb, len(loNPath)) |
||||
|
||||
if rb[0] != 0 { |
||||
// old rune not finished
|
||||
for i := 0; i < len(n.indices); i++ { |
||||
if n.indices[i] == rb[0] { |
||||
// continue with child node
|
||||
n = n.children[i] |
||||
loNPath = strings.ToLower(n.path) |
||||
continue walk |
||||
} |
||||
} |
||||
} else { |
||||
// process a new rune
|
||||
var rv rune |
||||
|
||||
// find rune start
|
||||
// runes are up to 4 byte long,
|
||||
// -4 would definitely be another rune
|
||||
var off int |
||||
for max := min(len(loNPath), 3); off < max; off++ { |
||||
if i := len(loNPath) - off; utf8.RuneStart(loOld[i]) { |
||||
// read rune from cached lowercase path
|
||||
rv, _ = utf8.DecodeRuneInString(loOld[i:]) |
||||
break |
||||
} |
||||
} |
||||
|
||||
// calculate lowercase bytes of current rune
|
||||
utf8.EncodeRune(rb[:], rv) |
||||
// skipp already processed bytes
|
||||
rb = shiftNRuneBytes(rb, off) |
||||
|
||||
for i := 0; i < len(n.indices); i++ { |
||||
// lowercase matches
|
||||
if n.indices[i] == rb[0] { |
||||
// must use a recursive approach since both the
|
||||
// uppercase byte and the lowercase byte might exist
|
||||
// as an index
|
||||
if out, found := n.children[i].findCaseInsensitivePathRec( |
||||
path, loPath, ciPath, rb, fixTrailingSlash, |
||||
); found { |
||||
return out, true |
||||
} |
||||
break |
||||
} |
||||
} |
||||
|
||||
// same for uppercase rune, if it differs
|
||||
if up := unicode.ToUpper(rv); up != rv { |
||||
utf8.EncodeRune(rb[:], up) |
||||
rb = shiftNRuneBytes(rb, off) |
||||
|
||||
for i := 0; i < len(n.indices); i++ { |
||||
// uppercase matches
|
||||
if n.indices[i] == rb[0] { |
||||
// continue with child node
|
||||
n = n.children[i] |
||||
loNPath = strings.ToLower(n.path) |
||||
continue walk |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
// Nothing found. We can recommend to redirect to the same URL
|
||||
// without a trailing slash if a leaf exists for that path
|
||||
return ciPath, (fixTrailingSlash && path == "/" && n.handle != nil) |
||||
} |
||||
|
||||
n = n.children[0] |
||||
switch n.nType { |
||||
case param: |
||||
// find param end (either '/' or path end)
|
||||
k := 0 |
||||
for k < len(path) && path[k] != '/' { |
||||
k++ |
||||
} |
||||
|
||||
// add param value to case insensitive path
|
||||
ciPath = append(ciPath, path[:k]...) |
||||
|
||||
// we need to go deeper!
|
||||
if k < len(path) { |
||||
if len(n.children) > 0 { |
||||
// continue with child node
|
||||
n = n.children[0] |
||||
loNPath = strings.ToLower(n.path) |
||||
loPath = loPath[k:] |
||||
path = path[k:] |
||||
continue |
||||
} |
||||
|
||||
// ... but we can't
|
||||
if fixTrailingSlash && len(path) == k+1 { |
||||
return ciPath, true |
||||
} |
||||
return ciPath, false |
||||
} |
||||
|
||||
if n.handle != nil { |
||||
return ciPath, true |
||||
} else if fixTrailingSlash && len(n.children) == 1 { |
||||
// No handle found. Check if a handle for this path + a
|
||||
// trailing slash exists
|
||||
n = n.children[0] |
||||
if n.path == "/" && n.handle != nil { |
||||
return append(ciPath, '/'), true |
||||
} |
||||
} |
||||
return ciPath, false |
||||
|
||||
case catchAll: |
||||
return append(ciPath, path...), true |
||||
|
||||
default: |
||||
panic("invalid node type") |
||||
} |
||||
} else { |
||||
// We should have reached the node containing the handle.
|
||||
// Check if this node has a handle registered.
|
||||
if n.handle != nil { |
||||
return ciPath, true |
||||
} |
||||
|
||||
// No handle found.
|
||||
// Try to fix the path by adding a trailing slash
|
||||
if fixTrailingSlash { |
||||
for i := 0; i < len(n.indices); i++ { |
||||
if n.indices[i] == '/' { |
||||
n = n.children[i] |
||||
if (len(n.path) == 1 && n.handle != nil) || |
||||
(n.nType == catchAll && n.children[0].handle != nil) { |
||||
return append(ciPath, '/'), true |
||||
} |
||||
return ciPath, false |
||||
} |
||||
} |
||||
} |
||||
return ciPath, false |
||||
} |
||||
} |
||||
|
||||
// Nothing found.
|
||||
// Try to fix the path by adding / removing a trailing slash
|
||||
if fixTrailingSlash { |
||||
if path == "/" { |
||||
return ciPath, true |
||||
} |
||||
if len(loPath)+1 == len(loNPath) && loNPath[len(loPath)] == '/' && |
||||
loPath[1:] == loNPath[1:len(loPath)] && n.handle != nil { |
||||
return append(ciPath, n.path...), true |
||||
} |
||||
} |
||||
return ciPath, false |
||||
} |
||||
Loading…
Reference in new issue