Files
fiber/router.go
zeekayandHanzo Dev e70d262d4d router: specificity-based precedence (ServeMux-1.22) — most-specific wins, ambiguous conflicts panic
Upstream fiber v3 matches routes in registration order: the first route on the
per-method stack that matches an incoming path wins. Precedence is therefore a
property of *when* a route was registered, not *how specific* it is, so
`/v1/iam/*` registered before `/v1/iam/keys` silently shadows the static
handler.

This fork fixes precedence natively in the router, with no changes to the
matcher or the tree builder:

- New file router_precedence.go holds the comparator (compareRoutes) and the
  sorted, barrier-aware insertion (sortedInsertIndex, insertRouteSorted).
- addRoute now inserts endpoint routes in most-specific-first order instead of
  appending. Because App.buildTree preserves App.stack order as sub-sequences
  within each prefix bucket and App.next returns the first match, ordering the
  stack by specificity is sufficient — startup or runtime-added routes both land
  in precedence order.
- Middleware (use) and mounted routes keep declaration order and act as
  precedence barriers: endpoints never reorder across one, so
  middleware-before-handler semantics are exact. Middleware is never sorted.
- ensureAutoHeadRoutes inserts auto-HEAD mirrors in the same specificity order.

Comparator (most-specific first), segment by segment on fiber's own parsed
segments: static literal beats :param beats greedy wildcard; more segments
(more structure) wins; a longer literal beats a shorter one at the same
position (so a deeper static route beats a shallower wildcard); structurally
identical patterns (differ only in parameter names) tie.

Conflict handling: re-registering the SAME method+pattern keeps fiber's
documented handler merge (both handler sets run — never shadowing; this is how
app.All after a specific method chains handlers, and it keeps the whole upstream
suite green). Two DISTINCT patterns of EQUAL specificity that overlap
(e.g. /users/:id vs /users/:name) are an ambiguous conflict and panic at
registration, naming both patterns — the same rule Go 1.22 net/http.ServeMux
applies when neither pattern is more specific.

Patch surface is intentionally small (router.go + router_precedence.go + tests)
for trivial upstream rebases.

Co-authored-by: Hanzo Dev <[email protected]>
2026-07-10 13:06:07 -07:00

897 lines
25 KiB
Go

// ⚡️ Fiber is an Express inspired web framework written in Go with ☕️
// 🤖 GitHub Repository: https://github.com/gofiber/fiber
// 📌 API Documentation: https://docs.gofiber.io
package fiber
import (
"fmt"
"slices"
"sync/atomic"
"github.com/gofiber/utils/v2"
utilsstrings "github.com/gofiber/utils/v2/strings"
"github.com/valyala/bytebufferpool"
"github.com/valyala/fasthttp"
)
// Router defines all router handle interface, including app and group router.
type Router interface {
Use(args ...any) Router
Get(path string, handler any, handlers ...any) Router
Head(path string, handler any, handlers ...any) Router
Post(path string, handler any, handlers ...any) Router
Put(path string, handler any, handlers ...any) Router
Delete(path string, handler any, handlers ...any) Router
Connect(path string, handler any, handlers ...any) Router
Options(path string, handler any, handlers ...any) Router
Trace(path string, handler any, handlers ...any) Router
Patch(path string, handler any, handlers ...any) Router
Add(methods []string, path string, handler any, handlers ...any) Router
All(path string, handler any, handlers ...any) Router
Group(prefix string, handlers ...any) Router
Domain(host string) Router
RouteChain(path string) Register
Route(prefix string, fn func(router Router), name ...string) Router
Name(name string) Router
}
// Route is a struct that holds all metadata for each registered handler.
type Route struct {
// ### important: always keep in sync with the copy method "app.copyRoute" and all creations of Route struct ###
group *Group // Group instance. used for routes in groups
path string // Prettified path
// Public fields
Method string `json:"method"` // HTTP method
Name string `json:"name"` // Route's name
//nolint:revive // Having both a Path (uppercase) and a path (lowercase) is fine
Path string `json:"path"` // Original registered route path
Params []string `json:"params"` // Case-sensitive param keys
Handlers []Handler `json:"-"` // Ctx handlers
routeParser routeParser // Parameter parser
// Data for routing
use bool // USE matches path prefixes
mount bool // Indicated a mounted app on a specific route
star bool // Path equals '*'
root bool // Path equals '/'
autoHead bool // Automatically generated HEAD route
caseSensitive bool // Whether parameter matching is case-sensitive
}
var (
defaultGreedyParameterKeys = []string{"*", "+"}
preferredWildcardGreedyParameters = []string{"*", "+"}
preferredPlusGreedyParameters = []string{"+", "*"}
)
// URL generates a URL from the route path and parameters.
// This method fills in the route parameters with the provided values.
// Parameter matching respects the app's CaseSensitive configuration:
// case-insensitive by default, case-sensitive when CaseSensitive is true.
//
// Example:
//
// app.Get("/user/:name/:id", handler).Name("user")
// url, err := app.GetRoute("user").URL(Map{"name": "john", "id": "123"})
// // Returns: "/user/john/123"
//
//nolint:gocritic // hugeParam: app.GetRoute returns a value, so URL must be callable on that value directly.
func (r Route) URL(params Map) (string, error) {
if r.Path == "" {
return "", ErrNotFound
}
return buildRouteURL(&r, params)
}
// buildRouteURL generates a URL from route segments and parameters.
// This shared helper is used by both Route.URL() and DefaultRes.getLocationFromRoute()
// to ensure consistent URL generation behavior across APIs.
//
// Parameter resolution uses a deterministic three-step lookup:
// 1. Exact key match on segment.ParamName
// 2. Case-insensitive fallback picking the lexicographically-smallest matching key (when !caseSensitive)
// 3. Greedy parameter fallback for wildcard (*) and plus (+) parameters
func buildRouteURL(route *Route, params Map) (string, error) {
if len(route.routeParser.segs) == 0 {
return route.Path, nil
}
buf := bytebufferpool.Get()
defer bytebufferpool.Put(buf)
for _, segment := range route.routeParser.segs {
if !segment.IsParam {
_, err := buf.WriteString(segment.Const)
if err != nil {
return "", fmt.Errorf("failed to write string: %w", err)
}
continue
}
var (
val any
found bool
)
// Prefer an exact parameter name match
if val, found = params[segment.ParamName]; !found && !route.caseSensitive {
// Fall back to a case-insensitive match using a deterministic winner
var matchedKey string
foundMatch := false
for key := range params {
if utils.EqualFold(key, segment.ParamName) && (!foundMatch || key < matchedKey) {
matchedKey = key
foundMatch = true
}
}
if foundMatch {
val = params[matchedKey]
found = true
}
}
// For greedy parameters, fall back to generic greedy keys
if !found && segment.IsGreedy {
for _, greedyKey := range preferredGreedyParameters(segment.ParamName) {
if val, found = params[greedyKey]; found {
break
}
}
}
if found {
_, err := buf.WriteString(utils.ToString(val))
if err != nil {
return "", fmt.Errorf("failed to write string: %w", err)
}
}
}
return buf.String(), nil
}
// preferredGreedyParameters returns the generic greedy fallback lookup order
// for a route parameter name.
// Parameter names starting with '+' prefer '+' before '*', names starting with
// '*' prefer '*' before '+', and all other names fall back to the default order.
func preferredGreedyParameters(paramName string) []string {
if paramName != "" {
switch paramName[0] {
case plusParam:
return preferredPlusGreedyParameters
case wildcardParam:
return defaultGreedyParameterKeys
}
}
return defaultGreedyParameterKeys
}
func (r *Route) match(detectionPath, path string, params *[maxParams]string) bool {
// root detectionPath check
if r.root && len(detectionPath) == 1 && detectionPath[0] == '/' {
return true
}
// '*' wildcard matches any detectionPath
if r.star {
if len(path) > 1 {
params[0] = path[1:]
} else {
params[0] = ""
}
return true
}
// Does this route have parameters?
if len(r.Params) > 0 {
// Match params using precomputed routeParser
return r.routeParser.getMatch(detectionPath, path, params, r.use)
}
// Middleware route?
if r.use {
// Single slash or prefix match
plen := len(r.path)
if r.root {
// If r.root is '/', it matches everything starting at '/'
if detectionPath != "" && detectionPath[0] == '/' {
return true
}
} else if len(detectionPath) >= plen && detectionPath[:plen] == r.path {
if hasPartialMatchBoundary(detectionPath, plen) {
return true
}
}
} else if len(r.path) == len(detectionPath) && detectionPath == r.path {
// Check exact match
return true
}
// No match
return false
}
func (app *App) next(c *DefaultCtx) (bool, error) {
methodInt := c.methodInt
treeHash := c.treePathHash
// Get stack length
tree, ok := app.treeStack[methodInt][treeHash]
if !ok {
tree = app.treeStack[methodInt][0]
}
lenr := len(tree) - 1
indexRoute := c.indexRoute
// Loop over the route stack starting from previous index
for indexRoute < lenr {
// Increment route index
indexRoute++
// Get *Route
route := tree[indexRoute]
if route.mount {
continue
}
// Check if it matches the request path
if !route.match(utils.UnsafeString(c.detectionPath), utils.UnsafeString(c.path), &c.values) {
continue
}
if c.skipNonUseRoutes && !route.use {
continue
}
// Pass route reference and param values
c.route = route
// Non use handler matched
if !route.use {
c.matched = true
}
// Execute first handler of route
if len(route.Handlers) > 0 {
c.indexHandler = 0
c.indexRoute = indexRoute
return true, route.Handlers[0](c)
}
return true, nil // Stop scanning the stack
}
// If c.Next() does not match, return 404
// If no match, scan stack again if other methods match the request
// Moved from app.handler because middleware may break the route chain
if c.matched {
return false, ErrNotFound
}
exists := false
methods := app.config.RequestMethods
for i := range methods {
// Skip original method
if methodInt == i {
continue
}
// Reset stack index
indexRoute := -1
tree, ok := app.treeStack[i][treeHash]
if !ok {
tree = app.treeStack[i][0]
}
// Get stack length
lenr := len(tree) - 1
// Loop over the route stack starting from previous index
for indexRoute < lenr {
// Increment route index
indexRoute++
// Get *Route
route := tree[indexRoute]
// Skip use routes
if route.use {
continue
}
// Check if it matches the request path
// No match, next route
if route.match(utils.UnsafeString(c.detectionPath), utils.UnsafeString(c.path), &c.values) {
// We matched
exists = true
// Add method to Allow header
c.Append(HeaderAllow, methods[i])
// Break stack loop
break
}
}
c.indexRoute = indexRoute
}
if exists {
return false, ErrMethodNotAllowed
}
return false, ErrNotFound
}
func (app *App) nextCustom(c CustomCtx) (bool, error) {
methodInt := c.getMethodInt()
treeHash := c.getTreePathHash()
// Get stack length
tree, ok := app.treeStack[methodInt][treeHash]
if !ok {
tree = app.treeStack[methodInt][0]
}
lenr := len(tree) - 1
indexRoute := c.getIndexRoute()
// Loop over the route stack starting from previous index
for indexRoute < lenr {
// Increment route index
indexRoute++
// Get *Route
route := tree[indexRoute]
if route.mount {
continue
}
// Check if it matches the request path
if !route.match(c.getDetectionPath(), c.Path(), c.getValues()) {
continue
}
if c.getSkipNonUseRoutes() && !route.use {
continue
}
// Pass route reference and param values
c.setRoute(route)
// Non use handler matched
if !route.use {
c.setMatched(true)
}
// Execute first handler of route
if len(route.Handlers) > 0 {
c.setIndexHandler(0)
c.setIndexRoute(indexRoute)
return true, route.Handlers[0](c)
}
return true, nil // Stop scanning the stack
}
// If c.Next() does not match, return 404
// If no match, scan stack again if other methods match the request
// Moved from app.handler because middleware may break the route chain
if c.getMatched() {
return false, ErrNotFound
}
exists := false
methods := app.config.RequestMethods
for i := range methods {
// Skip original method
if methodInt == i {
continue
}
// Reset stack index
indexRoute := -1
tree, ok := app.treeStack[i][treeHash]
if !ok {
tree = app.treeStack[i][0]
}
// Get stack length
lenr := len(tree) - 1
// Loop over the route stack starting from previous index
for indexRoute < lenr {
// Increment route index
indexRoute++
// Get *Route
route := tree[indexRoute]
// Skip use routes
if route.use {
continue
}
// Check if it matches the request path
// No match, next route
if route.match(c.getDetectionPath(), c.Path(), c.getValues()) {
// We matched
exists = true
// Add method to Allow header
c.Append(HeaderAllow, methods[i])
// Break stack loop
break
}
}
c.setIndexRoute(indexRoute)
}
if exists {
return false, ErrMethodNotAllowed
}
return false, ErrNotFound
}
func (app *App) requestHandler(rctx *fasthttp.RequestCtx) {
// Acquire context from the pool
ctx := app.AcquireCtx(rctx)
defer app.ReleaseCtx(ctx)
var err error
// Attempt to match a route and execute the chain
if d, isDefault := ctx.(*DefaultCtx); isDefault {
// Check if the HTTP method is valid
if d.methodInt == -1 {
_ = d.SendStatus(StatusNotImplemented) //nolint:errcheck // Always return nil
return
}
// Optional: check flash messages (hot path, see hasFlashCookie).
if hasFlashCookie(&d.Request().Header) {
d.Redirect().parseAndClearFlashMessages()
}
_, err = app.next(d)
} else {
// Check if the HTTP method is valid
if ctx.getMethodInt() == -1 {
_ = ctx.SendStatus(StatusNotImplemented) //nolint:errcheck // Always return nil
return
}
// Optional: check flash messages (hot path, see hasFlashCookie).
if hasFlashCookie(&ctx.Request().Header) {
ctx.Redirect().parseAndClearFlashMessages()
}
_, err = app.nextCustom(ctx)
}
if err != nil {
if catch := ctx.App().ErrorHandler(ctx, err); catch != nil {
_ = ctx.SendStatus(StatusInternalServerError) //nolint:errcheck // Always return nil
}
return
}
}
func (app *App) addPrefixToRoute(prefix string, route *Route) *Route {
prefixedPath := getGroupPath(prefix, route.Path)
prettyPath := prefixedPath
// Case-sensitive routing, all to lowercase
if !app.config.CaseSensitive {
prettyPath = utilsstrings.ToLower(prettyPath)
}
// Strict routing, remove trailing slashes
if !app.config.StrictRouting && len(prettyPath) > 1 {
prettyPath = utils.TrimRight(prettyPath, '/')
}
route.Path = prefixedPath
route.path = RemoveEscapeChar(prettyPath)
route.routeParser = parseRoute(prettyPath, app.customConstraints...)
route.root = false
route.star = false
route.caseSensitive = app.config.CaseSensitive
return route
}
func (*App) copyRoute(route *Route) *Route {
return &Route{
// Router booleans
use: route.use,
mount: route.mount,
star: route.star,
root: route.root,
autoHead: route.autoHead,
caseSensitive: route.caseSensitive,
// Path data
path: route.path,
routeParser: route.routeParser,
// Public data
Path: route.Path,
Params: route.Params,
Name: route.Name,
Method: route.Method,
Handlers: route.Handlers,
}
}
func (app *App) normalizePath(path string) string {
if path == "" {
path = "/"
}
if path[0] != '/' {
path = "/" + path
}
if !app.config.CaseSensitive {
path = utilsstrings.ToLower(path)
}
if !app.config.StrictRouting && len(path) > 1 {
path = utils.TrimRight(path, '/')
}
return RemoveEscapeChar(path)
}
// RemoveRoute is used to remove a route from the stack by path.
// If no methods are specified, it will remove the route for all methods defined in the app.
// You should call RebuildTree after using this to ensure consistency of the tree.
func (app *App) RemoveRoute(path string, methods ...string) {
// Normalize same as register uses
norm := app.normalizePath(path)
pathMatchFunc := func(r *Route) bool {
return r.path == norm // compare private normalized path
}
app.deleteRoute(methods, pathMatchFunc)
}
// RemoveRouteByName is used to remove a route from the stack by name.
// If no methods are specified, it will remove the route for all methods defined in the app.
// You should call RebuildTree after using this to ensure consistency of the tree.
func (app *App) RemoveRouteByName(name string, methods ...string) {
matchFunc := func(r *Route) bool { return r.Name == name }
app.deleteRoute(methods, matchFunc)
}
// RemoveRouteFunc is used to remove a route from the stack by a custom match function.
// If no methods are specified, it will remove the route for all methods defined in the app.
// You should call RebuildTree after using this to ensure consistency of the tree.
// Note: The route.Path is original path, not the normalized path.
func (app *App) RemoveRouteFunc(matchFunc func(r *Route) bool, methods ...string) {
app.deleteRoute(methods, matchFunc)
}
func (app *App) deleteRoute(methods []string, matchFunc func(r *Route) bool) {
if len(methods) == 0 {
methods = app.config.RequestMethods
}
app.mutex.Lock()
defer app.mutex.Unlock()
removedUseRoutes := make(map[string]struct{})
for _, method := range methods {
// Uppercase HTTP methods
method = utilsstrings.ToUpper(method)
// Get unique HTTP method identifier
m := app.methodInt(method)
if m == -1 {
continue // Skip invalid HTTP methods
}
for i := len(app.stack[m]) - 1; i >= 0; i-- {
route := app.stack[m][i]
if !matchFunc(route) {
continue // Skip if route does not match
}
app.stack[m] = append(app.stack[m][:i], app.stack[m][i+1:]...)
app.routesRefreshed = true
// Decrement global handler count. In middleware routes, only decrement once
if _, ok := removedUseRoutes[route.path]; (route.use && slices.Equal(methods, app.config.RequestMethods) && !ok) || !route.use {
if route.use {
removedUseRoutes[route.path] = struct{}{}
}
atomic.AddUint32(&app.handlersCount, ^uint32(len(route.Handlers)-1)) //nolint:gosec // G115 - handler count is always small
}
if method == MethodGet && !route.use && !route.mount {
app.pruneAutoHeadRouteLocked(route.path)
}
}
}
}
// pruneAutoHeadRouteLocked removes an automatically generated HEAD route so a
// later explicit registration can take its place without duplicating handler
// chains. The caller must already hold app.mutex.
func (app *App) pruneAutoHeadRouteLocked(path string) {
headIndex := app.methodInt(MethodHead)
if headIndex == -1 {
return
}
norm := app.normalizePath(path)
headStack := app.stack[headIndex]
for i := len(headStack) - 1; i >= 0; i-- {
headRoute := headStack[i]
if headRoute.path != norm || headRoute.mount || headRoute.use || !headRoute.autoHead {
continue
}
app.stack[headIndex] = append(headStack[:i], headStack[i+1:]...)
app.routesRefreshed = true
atomic.AddUint32(&app.handlersCount, ^uint32(len(headRoute.Handlers)-1)) //nolint:gosec // G115 - handler count is always small
return
}
}
func (app *App) register(methods []string, pathRaw string, group *Group, handlers ...Handler) {
// A regular route requires at least one ctx handler
if len(handlers) == 0 && group == nil {
panic(fmt.Sprintf("missing handler/middleware in route: %s\n", pathRaw))
}
// No nil handlers allowed
for _, h := range handlers {
if h == nil {
panic(fmt.Sprintf("nil handler in route: %s\n", pathRaw))
}
}
// Precompute path normalization ONCE
if pathRaw == "" {
pathRaw = "/"
}
if pathRaw[0] != '/' {
pathRaw = "/" + pathRaw
}
pathPretty := pathRaw
if !app.config.CaseSensitive {
pathPretty = utilsstrings.ToLower(pathPretty)
}
if !app.config.StrictRouting && len(pathPretty) > 1 {
pathPretty = utils.TrimRight(pathPretty, '/')
}
pathClean := RemoveEscapeChar(pathPretty)
parsedRaw := parseRoute(pathRaw, app.customConstraints...)
parsedPretty := parseRoute(pathPretty, app.customConstraints...)
isMount := group != nil && group.app != app
for _, method := range methods {
method = utilsstrings.ToUpper(method)
if method != methodUse && app.methodInt(method) == -1 {
panic(fmt.Sprintf("add: invalid http method %s\n", method))
}
isUse := method == methodUse
isStar := pathClean == "/*"
isRoot := pathClean == "/"
route := Route{
use: isUse,
mount: isMount,
star: isStar,
root: isRoot,
caseSensitive: app.config.CaseSensitive,
path: pathClean,
routeParser: parsedPretty,
Params: parsedRaw.params,
group: group,
Path: pathRaw,
Method: method,
Handlers: handlers,
}
// Increment global handler count
atomic.AddUint32(&app.handlersCount, uint32(len(handlers))) //nolint:gosec // G115 - handler count is always small
// Middleware route matches all HTTP methods
if isUse {
// Add route to all HTTP methods stack
for _, m := range app.config.RequestMethods {
// Create a route copy to avoid duplicates during compression
r := route
app.addRoute(m, &r)
}
} else {
// Add route to stack
app.addRoute(method, &route)
}
}
}
func (app *App) addRoute(method string, route *Route) {
app.mutex.Lock()
defer app.mutex.Unlock()
// Get unique HTTP method identifier
m := app.methodInt(method)
if method == MethodHead && !route.mount && !route.use {
app.pruneAutoHeadRouteLocked(route.path)
}
route.Method = method
if route.use || route.mount {
// Middleware (use) and mounted routes keep declaration order and act as
// precedence barriers; they are never sorted. Preserve fiber's handler
// merge for consecutive identical middleware prefixes (the "use
// expansion" case, e.g. app.Use(a) then app.Use(b) on the same prefix).
// Mounted sub-app placeholders (route.mount) must never merge — they are
// expanded in place by processMount.
l := len(app.stack[m])
if route.use && !route.mount && l > 0 && app.stack[m][l-1].Path == route.Path && app.stack[m][l-1].use && !app.stack[m][l-1].mount {
preRoute := app.stack[m][l-1]
preRoute.Handlers = append(preRoute.Handlers, route.Handlers...)
} else {
// Add route to the stack
app.stack[m] = append(app.stack[m], route)
app.routesRefreshed = true
}
} else {
// Endpoint routes are inserted in most-specific-first order, independent
// of registration order. An identical pattern merges handlers; an
// ambiguous equal-specificity conflict panics instead of silently
// shadowing (see insertRouteSorted).
app.insertRouteSorted(m, route)
}
// Execute onRoute hooks & change latestRoute if not adding mounted route
if !route.mount {
app.latestRoute = route
if err := app.hooks.executeOnRouteHooks(route); err != nil {
panic(err)
}
}
}
func (app *App) ensureAutoHeadRoutes() {
app.mutex.Lock()
defer app.mutex.Unlock()
app.ensureAutoHeadRoutesLocked()
}
func (app *App) ensureAutoHeadRoutesLocked() {
if app.config.DisableHeadAutoRegister {
return
}
headIndex := app.methodInt(MethodHead)
getIndex := app.methodInt(MethodGet)
if headIndex == -1 || getIndex == -1 {
return
}
headStack := app.stack[headIndex]
existing := make(map[string]struct{}, len(headStack))
for _, route := range headStack {
if route.mount || route.use {
continue
}
existing[route.path] = struct{}{}
}
if len(app.stack[getIndex]) == 0 {
return
}
var added bool
for _, route := range app.stack[getIndex] {
if route.mount || route.use {
continue
}
if _, ok := existing[route.path]; ok {
continue
}
headRoute := app.copyRoute(route)
headRoute.group = route.group
headRoute.Method = MethodHead
headRoute.autoHead = true
// Fasthttp automatically omits response bodies when transmitting
// HEAD responses, so the copied GET handler stack can execute
// unchanged while still producing an empty body on the wire.
// Insert in specificity order so auto-generated HEAD routes obey the
// same precedence as explicitly registered ones.
headStack = slices.Insert(headStack, sortedInsertIndex(headStack, headRoute), headRoute)
existing[route.path] = struct{}{}
app.routesRefreshed = true
added = true
atomic.AddUint32(&app.handlersCount, uint32(len(headRoute.Handlers))) //nolint:gosec // G115 - handler count is always small
app.latestRoute = headRoute
if err := app.hooks.executeOnRouteHooks(headRoute); err != nil {
panic(err)
}
}
if added {
app.stack[headIndex] = headStack
}
}
// RebuildTree rebuilds the prefix tree from the previously registered routes.
// This method is useful when you want to register routes dynamically after the app has started.
// It is not recommended to use this method on production environments because rebuilding
// the tree is performance-intensive and not thread-safe in runtime. Since building the tree
// is only done in the startupProcess of the app, this method does not make sure that the
// routeTree is being safely changed, as it would add a great deal of overhead in the request.
// Latest benchmark results showed a degradation from 82.79 ns/op to 94.48 ns/op and can be found in:
// https://github.com/gofiber/fiber/issues/2769#issuecomment-2227385283
func (app *App) RebuildTree() *App {
app.mutex.Lock()
defer app.mutex.Unlock()
return app.buildTree()
}
// buildTree build the prefix tree from the previously registered routes
func (app *App) buildTree() *App {
// If routes haven't been refreshed, nothing to do
if !app.routesRefreshed {
return app
}
// 1) First loop: determine all possible 3-char prefixes ("treePaths") for each method
for method := range app.config.RequestMethods {
routes := app.stack[method]
treePaths := make([]int, len(routes))
globalCount := 0
prefixCounts := make(map[int]int, len(routes))
for i, route := range routes {
if len(route.routeParser.segs) > 0 && len(route.routeParser.segs[0].Const) >= maxDetectionPaths {
treePaths[i] = int(route.routeParser.segs[0].Const[0])<<16 |
int(route.routeParser.segs[0].Const[1])<<8 |
int(route.routeParser.segs[0].Const[2])
}
if treePaths[i] == 0 {
globalCount++
continue
}
prefixCounts[treePaths[i]]++
}
prevBuckets := app.treeStack[method]
tsMap := make(map[int][]*Route, len(prefixCounts)+1)
tsMap[0] = reuseRouteBucket(prevBuckets, 0, globalCount)
for treePath, count := range prefixCounts {
tsMap[treePath] = reuseRouteBucket(prevBuckets, treePath, count+globalCount)
}
for i, route := range routes {
treePath := treePaths[i]
if treePath == 0 {
for bucket := range tsMap {
tsMap[bucket] = append(tsMap[bucket], route)
}
continue
}
tsMap[treePath] = append(tsMap[treePath], route)
}
app.treeStack[method] = tsMap
}
// reset the flag and return
app.routesRefreshed = false
return app
}
func reuseRouteBucket(prev map[int][]*Route, key, capHint int) []*Route {
if bucket, ok := prev[key]; ok && cap(bucket) >= capHint {
return bucket[:0]
}
return make([]*Route, 0, capHint)
}