chore: improve countParams performance

tree.go

@@ -5,13 +5,20 @@
 package gin
 
 import (
+	"bytes"
 	"net/url"
+	"reflect"
 	"strings"
 	"unicode"
 	"unicode/utf8"
 	"unsafe"
 )
 
+var (
+	strColon = []byte(":")
+	strStar  = []byte("*")
+)
+
 // Param is a single URL parameter, consisting of a key and a value.
 type Param struct {
 	Key   string
@@ -41,10 +48,6 @@ func (ps Params) ByName(name string) (va string) {
 	return
 }
 
-func bytesToStr(b []byte) string {
-	return *(*string)(unsafe.Pointer(&b))
-}
-
 type methodTree struct {
 	method string
 	root   *node
@@ -77,14 +80,26 @@ func longestCommonPrefix(a, b string) int {
 	return i
 }
 
+func bytesToStr(b []byte) string {
+	return *(*string)(unsafe.Pointer(&b))
+}
+
+func strToBytes(s string) (b []byte) {
+	/* #nosec G103 */
+	bh := (*reflect.SliceHeader)(unsafe.Pointer(&b))
+	/* #nosec G103 */
+	sh := *(*reflect.StringHeader)(unsafe.Pointer(&s))
+	bh.Data = sh.Data
+	bh.Len = sh.Len
+	bh.Cap = sh.Len
+	return b
+}
+
 func countParams(path string) uint16 {
 	var n uint
-	for i := range []byte(path) {
+	s := strToBytes(path)
-		switch path[i] {
+	n += uint(bytes.Count(s, strColon))
-		case ':', '*':
+	n += uint(bytes.Count(s, strStar))
-			n++
-		}
-	}
 	return uint16(n)
 }
 

tree_test.go

@@ -93,6 +93,20 @@ func TestCountParams(t *testing.T) {
 	}
 }
 
+var s = strings.Repeat("/:param", 5)
+
+func BenchmarkCountParamsOld(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		countParamsOld(s)
+	}
+}
+
+func BenchmarkCountParams(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		countParamsNew(s)
+	}
+}
+
 func TestTreeAddAndGet(t *testing.T) {
 	tree := &node{}