gf/net/ghttp/ghttp_server_router_serve.go
2022-05-06 20:25:21 +08:00

263 lines
7.9 KiB
Go

// Copyright GoFrame Author(https://goframe.org). All Rights Reserved.
//
// This Source Code Form is subject to the terms of the MIT License.
// If a copy of the MIT was not distributed with this file,
// You can obtain one at https://github.com/gogf/gf.
package ghttp
import (
"context"
"fmt"
"net/http"
"strings"
"github.com/gogf/gf/v2/container/glist"
"github.com/gogf/gf/v2/errors/gerror"
"github.com/gogf/gf/v2/internal/intlog"
"github.com/gogf/gf/v2/internal/json"
"github.com/gogf/gf/v2/text/gregex"
)
// handlerCacheItem is an item just for internal router searching cache.
type handlerCacheItem struct {
parsedItems []*handlerParsedItem
hasHook bool
hasServe bool
}
// serveHandlerKey creates and returns a handler key for router.
func (s *Server) serveHandlerKey(method, path, domain string) string {
if len(domain) > 0 {
domain = "@" + domain
}
if method == "" {
return path + strings.ToLower(domain)
}
return strings.ToUpper(method) + ":" + path + strings.ToLower(domain)
}
// getHandlersWithCache searches the router item with cache feature for a given request.
func (s *Server) getHandlersWithCache(r *Request) (parsedItems []*handlerParsedItem, hasHook, hasServe bool) {
var (
ctx = r.Context()
method = r.Method
path = r.URL.Path
host = r.GetHost()
)
// Special http method OPTIONS handling.
// It searches the handler with the request method instead of OPTIONS method.
if method == http.MethodOptions {
if v := r.Request.Header.Get("Access-Control-Request-Method"); v != "" {
method = v
}
}
// Search and cache the router handlers.
if xUrlPath := r.Header.Get(HeaderXUrlPath); xUrlPath != "" {
path = xUrlPath
}
var handlerCacheKey = s.serveHandlerKey(method, path, host)
value, err := s.serveCache.GetOrSetFunc(ctx, handlerCacheKey, func(ctx context.Context) (interface{}, error) {
parsedItems, hasHook, hasServe = s.searchHandlers(method, path, host)
if parsedItems != nil {
return &handlerCacheItem{parsedItems, hasHook, hasServe}, nil
}
return nil, nil
}, routeCacheDuration)
if err != nil {
intlog.Errorf(ctx, `%+v`, err)
}
if value != nil {
item := value.Val().(*handlerCacheItem)
return item.parsedItems, item.hasHook, item.hasServe
}
return
}
// searchHandlers retrieve and returns the routers with given parameters.
// Note that the returned routers contain serving handler, middleware handlers and hook handlers.
func (s *Server) searchHandlers(method, path, domain string) (parsedItems []*handlerParsedItem, hasHook, hasServe bool) {
if len(path) == 0 {
return nil, false, false
}
// In case of double '/' URI, for example:
// /user//index, //user/index, //user//index//
var previousIsSep = false
for i := 0; i < len(path); {
if path[i] == '/' {
if previousIsSep {
path = path[:i] + path[i+1:]
continue
} else {
previousIsSep = true
}
} else {
previousIsSep = false
}
i++
}
// Split the URL.path to separate parts.
var array []string
if strings.EqualFold("/", path) {
array = []string{"/"}
} else {
array = strings.Split(path[1:], "/")
}
var (
lastMiddlewareElem *glist.Element
parsedItemList = glist.New()
repeatHandlerCheckMap = make(map[int]struct{}, 16)
)
// The default domain has the most priority when iteration.
for _, domainItem := range []string{DefaultDomainName, domain} {
p, ok := s.serveTree[domainItem]
if !ok {
continue
}
// Make a list array with a capacity of 16.
lists := make([]*glist.List, 0, 16)
for i, part := range array {
// Add all lists of each node to the list array.
if v, ok := p.(map[string]interface{})["*list"]; ok {
lists = append(lists, v.(*glist.List))
}
if v, ok := p.(map[string]interface{})[part]; ok {
// Loop to the next node by certain key name.
p = v
if i == len(array)-1 {
if v, ok := p.(map[string]interface{})["*list"]; ok {
lists = append(lists, v.(*glist.List))
break
}
}
} else if v, ok := p.(map[string]interface{})["*fuzz"]; ok {
// Loop to the next node by fuzzy node item.
p = v
}
if i == len(array)-1 {
// It here also checks the fuzzy item,
// for rule case like: "/user/*action" matches to "/user".
if v, ok := p.(map[string]interface{})["*fuzz"]; ok {
p = v
}
// The leaf must have a list item. It adds the list to the list array.
if v, ok := p.(map[string]interface{})["*list"]; ok {
lists = append(lists, v.(*glist.List))
}
}
}
// OK, let's loop the result list array, adding the handler item to the result handler result array.
// As the tail of the list array has the most priority, it iterates the list array from its tail to head.
for i := len(lists) - 1; i >= 0; i-- {
for e := lists[i].Front(); e != nil; e = e.Next() {
item := e.Value.(*HandlerItem)
// Filter repeated handler items, especially the middleware and hook handlers.
// It is necessary, do not remove this checks logic unless you really know how it is necessary.
if _, ok := repeatHandlerCheckMap[item.Id]; ok {
continue
} else {
repeatHandlerCheckMap[item.Id] = struct{}{}
}
// Serving handler can only be added to the handler array just once.
if hasServe {
switch item.Type {
case HandlerTypeHandler, HandlerTypeObject:
continue
}
}
if item.Router.Method == defaultMethod || item.Router.Method == method {
// Note the rule having no fuzzy rules: len(match) == 1
if match, err := gregex.MatchString(item.Router.RegRule, path); err == nil && len(match) > 0 {
parsedItem := &handlerParsedItem{item, nil}
// If the rule contains fuzzy names,
// it needs paring the URL to retrieve the values for the names.
if len(item.Router.RegNames) > 0 {
if len(match) > len(item.Router.RegNames) {
parsedItem.Values = make(map[string]string)
// It there repeated names, it just overwrites the same one.
for i, name := range item.Router.RegNames {
parsedItem.Values[name] = match[i+1]
}
}
}
switch item.Type {
// The serving handler can be added just once.
case HandlerTypeHandler, HandlerTypeObject:
hasServe = true
parsedItemList.PushBack(parsedItem)
// The middleware is inserted before the serving handler.
// If there are multiple middleware, they're inserted into the result list by their registering order.
// The middleware is also executed by their registered order.
case HandlerTypeMiddleware:
if lastMiddlewareElem == nil {
lastMiddlewareElem = parsedItemList.PushFront(parsedItem)
} else {
lastMiddlewareElem = parsedItemList.InsertAfter(lastMiddlewareElem, parsedItem)
}
// HOOK handler, just push it back to the list.
case HandlerTypeHook:
hasHook = true
parsedItemList.PushBack(parsedItem)
default:
panic(gerror.Newf(`invalid handler type %s`, item.Type))
}
}
}
}
}
}
if parsedItemList.Len() > 0 {
var index = 0
parsedItems = make([]*handlerParsedItem, parsedItemList.Len())
for e := parsedItemList.Front(); e != nil; e = e.Next() {
parsedItems[index] = e.Value.(*handlerParsedItem)
index++
}
}
return
}
// MarshalJSON implements the interface MarshalJSON for json.Marshal.
func (item HandlerItem) MarshalJSON() ([]byte, error) {
switch item.Type {
case HandlerTypeHook:
return json.Marshal(
fmt.Sprintf(
`%s %s:%s (%s)`,
item.Router.Uri,
item.Router.Domain,
item.Router.Method,
item.HookName,
),
)
case HandlerTypeMiddleware:
return json.Marshal(
fmt.Sprintf(
`%s %s:%s (MIDDLEWARE)`,
item.Router.Uri,
item.Router.Domain,
item.Router.Method,
),
)
default:
return json.Marshal(
fmt.Sprintf(
`%s %s:%s`,
item.Router.Uri,
item.Router.Domain,
item.Router.Method,
),
)
}
}
// MarshalJSON implements the interface MarshalJSON for json.Marshal.
func (item handlerParsedItem) MarshalJSON() ([]byte, error) {
return json.Marshal(item.Handler)
}