blackteay/gin
3
0
Fork 0
mirror of https://github.com/gin-gonic/gin.git synced 2025-12-13 13:12:17 +08:00
Code Issues Projects Releases Wiki Activity

perf(tree): reduce allocations in findCaseInsensitivePath

Browse Source
This commit is contained in:
Artur Melanchyk 2025-11-01 19:59:30 +01:00
parent 2e22e50859
commit bd2679c647
1 changed files with 1 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
tree.go
View File

@ -671,12 +671,7 @@ walk: // Outer loop for walking the tree
func (n *node) findCaseInsensitivePath(path string, fixTrailingSlash bool) ([]byte, bool) { func (n *node) findCaseInsensitivePath(path string, fixTrailingSlash bool) ([]byte, bool) {
const stackBufSize = 128 const stackBufSize = 128
// Use a static sized buffer on the stack in the common case. buf := make([]byte, 0, max(stackBufSize, len(path)+1))
// If the path is too long, allocate a buffer on the heap instead.
buf := make([]byte, 0, stackBufSize)
if length := len(path) + 1; length > stackBufSize {
buf = make([]byte, 0, length)
}
ciPath := n.findCaseInsensitivePathRec( ciPath := n.findCaseInsensitivePathRec(
path, path,