blob: 0c9d613ef9d2aa06b911c381d1b29610698f4762 [file] [log] [blame]
Michael Mundaycfd89162016-11-04 16:30:12 -04001// Copyright 2016 The Go Authors. All rights reserved.
Ilya Tocar44f18542016-04-28 17:34:24 +03002// Use of this source code is governed by a BSD-style
3// license that can be found in the LICENSE file.
4
5package bytes
6
Martin Möhrmann69972ae2017-04-03 22:38:09 +02007import "internal/cpu"
8
Hiroshi Iokae10286a2016-09-06 08:09:27 +09009//go:noescape
10
Ilya Tocar44f18542016-04-28 17:34:24 +030011// indexShortStr returns the index of the first instance of c in s, or -1 if c is not present in s.
12// indexShortStr requires 2 <= len(c) <= shortStringLen
Martin Möhrmann69972ae2017-04-03 22:38:09 +020013func indexShortStr(s, c []byte) int // ../runtime/asm_amd64.s
14func countByte(s []byte, c byte) int // ../runtime/asm_amd64.s
Ilya Tocar0cff2192016-04-28 17:39:55 +030015
16var shortStringLen int
17
18func init() {
Martin Möhrmann69972ae2017-04-03 22:38:09 +020019 if cpu.X86.HasAVX2 {
Ilya Tocar0cff2192016-04-28 17:39:55 +030020 shortStringLen = 63
21 } else {
22 shortStringLen = 31
23 }
24}
Ilya Tocar44f18542016-04-28 17:34:24 +030025
26// Index returns the index of the first instance of sep in s, or -1 if sep is not present in s.
27func Index(s, sep []byte) int {
28 n := len(sep)
29 switch {
30 case n == 0:
31 return 0
32 case n == 1:
33 return IndexByte(s, sep[0])
Ilya Tocar44f18542016-04-28 17:34:24 +030034 case n == len(s):
35 if Equal(sep, s) {
36 return 0
37 }
38 return -1
39 case n > len(s):
40 return -1
Ilya Tocarf31492f2016-10-21 23:23:48 +030041 case n <= shortStringLen:
42 // Use brute force when s and sep both are small
43 if len(s) <= 64 {
44 return indexShortStr(s, sep)
45 }
46 c := sep[0]
47 i := 0
48 t := s[:len(s)-n+1]
49 fails := 0
50 for i < len(t) {
51 if t[i] != c {
52 // IndexByte skips 16/32 bytes per iteration,
53 // so it's faster than indexShortStr.
54 o := IndexByte(t[i:], c)
55 if o < 0 {
56 return -1
57 }
58 i += o
59 }
60 if Equal(s[i:i+n], sep) {
61 return i
62 }
63 fails++
64 i++
65 // Switch to indexShortStr when IndexByte produces too many false positives.
66 // Too many means more that 1 error per 8 characters.
67 // Allow some errors in the beginning.
68 if fails > (i+16)/8 {
69 r := indexShortStr(s[i:], sep)
70 if r >= 0 {
71 return r + i
72 }
73 return -1
74 }
75 }
76 return -1
Ilya Tocar44f18542016-04-28 17:34:24 +030077 }
Keith Randalla0252772017-11-04 10:19:53 -070078 return indexRabinKarp(s, sep)
Ilya Tocar44f18542016-04-28 17:34:24 +030079}
80
Josselin Costanzi01cd22c2017-03-19 12:18:08 +010081// Count counts the number of non-overlapping instances of sep in s.
Tim Cooperf2af0c12017-09-27 21:44:38 -030082// If sep is an empty slice, Count returns 1 + the number of UTF-8-encoded code points in s.
Josselin Costanzi01cd22c2017-03-19 12:18:08 +010083func Count(s, sep []byte) int {
Martin Möhrmann69972ae2017-04-03 22:38:09 +020084 if len(sep) == 1 && cpu.X86.HasPOPCNT {
Josselin Costanzi01cd22c2017-03-19 12:18:08 +010085 return countByte(s, sep[0])
86 }
87 return countGeneric(s, sep)
88}