flate: Simplify matchlen (remove asm)

With unsafe, there is no benefit from matchlen assembly. Remove it.

flate/fast_encoder.go

@@ -7,6 +7,7 @@ package flate
 
 import (
 	"fmt"
+	"math/bits"
 
 	"github.com/klauspost/compress/internal/le"
 )
@@ -150,13 +151,33 @@ func (e *fastGen) matchlen(s, t int32, src []byte) int32 {
 			panic(fmt.Sprint(s, "-", t, "(", s-t, ") > maxMatchLength (", maxMatchOffset, ")"))
 		}
 	}
-	s1 := int(s) + maxMatchLength - 4
-	if s1 > len(src) {
-		s1 = len(src)
+	s1 := int32(s) + maxMatchLength - 4
+	if s1 > int32(len(src)) {
+		s1 = int32(len(src))
 	}
 
+	left := s1 - s
+	n := 0
+	for left >= 8 {
+		diff := le.Load64(src, s) ^ le.Load64(src, t)
+		if diff != 0 {
+			return int32(n + bits.TrailingZeros64(diff)>>3)
+		}
+		s += 8
+		t += 8
+		left -= 8
+	}
+
+	a := src[s:s1]
+	b := src[t:]
+	for i := range a {
+		if a[i] != b[i] {
+			break
+		}
+		n++
+	}
+	return int32(n)
 	// Extend the match to be as long as possible.
-	return int32(matchLen(src[s:s1], src[t:]))
 }
 
 // matchlenLong will return the match length between offsets and t in src.
@@ -177,7 +198,28 @@ func (e *fastGen) matchlenLong(s, t int32, src []byte) int32 {
 		}
 	}
 	// Extend the match to be as long as possible.
-	return int32(matchLen(src[s:], src[t:]))
+	left := int32(len(src)) - s
+	n := int32(0)
+	for left >= 8 {
+		diff := le.Load64(src, s) ^ le.Load64(src, t)
+		if diff != 0 {
+			return n + int32(bits.TrailingZeros64(diff)>>3)
+		}
+		s += 8
+		t += 8
+		n += 8
+		left -= 8
+	}
+
+	a := src[s:]
+	b := src[t:]
+	for i := range a {
+		if a[i] != b[i] {
+			break
+		}
+		n++
+	}
+	return n
 }
 
 // Reset the encoding table.

flate/level1.go

@@ -2,9 +2,6 @@ package flate
 
 import (
 	"fmt"
-	"math/bits"
-
-	"github.com/klauspost/compress/internal/le"
 )
 
 // fastGen maintains the table for matches,
@@ -122,32 +119,7 @@ func (e *fastEncL1) Encode(dst *tokens, src []byte) {
 
 			// Extend the 4-byte match as long as possible.
 			t := candidate.offset - e.cur
-			var l = int32(4)
-			if false {
-				l = e.matchlenLong(s+4, t+4, src) + 4
-			} else {
-				// inlined:
-				a := src[s:]
-				b := src[t:]
-				left := len(a) - 4
-				for left >= 8 {
-					if diff := le.Load64(a, l) ^ le.Load64(b, l); diff != 0 {
-						l += int32(bits.TrailingZeros64(diff) >> 3)
-						goto endMatch
-					}
-					l += 8
-					left -= 8
-				}
-				a = a[l:]
-				b = b[l:]
-				for i := range a {
-					if a[i] != b[i] {
-						break
-					}
-					l++
-				}
-			endMatch:
-			}
+			l := e.matchlenLong(s+4, t+4, src) + 4
 
 			// Extend backwards
 			for t > 0 && s > nextEmit && src[t-1] == src[s-1] {

flate/matchlen_generic.go

@@ -1,6 +1,3 @@
-//go:build !amd64 || appengine || !gc || noasm
-// +build !amd64 appengine !gc noasm
-
 // Copyright 2019+ Klaus Post. All rights reserved.
 // License information can be found in the LICENSE file.