1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
/* Optimized strstr function.
Copyright (c) 2018 Arm Ltd. All rights reserved.
SPDX-License-Identifier: BSD-3-Clause
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the company may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY ARM LTD ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL ARM LTD BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
/*
Copyright (c) 1994 Cygnus Support.
All rights reserved.
Redistribution and use in source and binary forms are permitted
provided that the above copyright notice and this paragraph are
duplicated in all such forms and that any documentation,
and/or other materials related to such
distribution and use acknowledge that the software was developed
at Cygnus Support, Inc. Cygnus Support, Inc. may not be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
/*
FUNCTION
<<strstr>>---find string segment
INDEX
strstr
SYNOPSIS
#include <string.h>
char *strstr(const char *<[s1]>, const char *<[s2]>);
DESCRIPTION
Locates the first occurrence in the string pointed to by <[s1]> of
the sequence of characters in the string pointed to by <[s2]>
(excluding the terminating null character).
RETURNS
Returns a pointer to the located string segment, or a null
pointer if the string <[s2]> is not found. If <[s2]> points to
a string with zero length, <[s1]> is returned.
PORTABILITY
<<strstr>> is ANSI C.
<<strstr>> requires no supporting OS subroutines.
QUICKREF
strstr ansi pure
*/
#define _DEFAULT_SOURCE
#include <string.h>
#include <limits.h>
#if defined(__PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__) || CHAR_BIT > 8
/* Small and efficient strstr implementation. */
char *
strstr(const char *hs, const char *ne)
{
size_t i;
int c = ne[0];
if (c == 0)
return (char *)hs;
for (; hs[0] != '\0'; hs++) {
if (hs[0] != c)
continue;
for (i = 1; ne[i] != 0; i++)
if (hs[i] != ne[i])
break;
if (ne[i] == '\0')
return (char *)hs;
}
return NULL;
}
#else /* compilation for speed */
#define RETURN_TYPE char *
#define AVAILABLE(h, h_l, j, n_l) \
(((j) <= (h_l) - (n_l)) \
|| ((h_l) += strnlen((const char *)(h) + (h_l), (n_l) | 2048), ((j) <= (h_l) - (n_l))))
#include "str-two-way.h"
/* Number of bits used to index shift table. */
#define SHIFT_TABLE_BITS 6
static inline char *
strstr2(const unsigned char *hs, const unsigned char *ne)
{
uint32_t h1 = ((uint32_t)ne[0] << 16) | ne[1];
uint32_t h2 = 0;
int c;
for (c = hs[0]; h1 != h2 && c != 0; c = *++hs)
h2 = (h2 << 16) | c;
return h1 == h2 ? (char *)hs - 2 : NULL;
}
static inline char *
strstr3(const unsigned char *hs, const unsigned char *ne)
{
uint32_t h1 = ((uint32_t)ne[0] << 24) | ((uint32_t)ne[1] << 16) | ((uint32_t)ne[2] << 8);
uint32_t h2 = 0;
int c;
for (c = hs[0]; h1 != h2 && c != 0; c = *++hs)
h2 = (h2 | c) << 8;
return h1 == h2 ? (char *)hs - 3 : NULL;
}
static inline char *
strstr4(const unsigned char *hs, const unsigned char *ne)
{
uint32_t h1
= ((uint32_t)ne[0] << 24) | ((uint32_t)ne[1] << 16) | ((uint32_t)ne[2] << 8) | ne[3];
uint32_t h2 = 0;
int c;
for (c = hs[0]; c != 0 && h1 != h2; c = *++hs)
h2 = (h2 << 8) | c;
return h1 == h2 ? (char *)hs - 4 : NULL;
}
/* Extremely fast strstr algorithm with guaranteed linear-time performance.
Small needles up to size 4 use a dedicated linear search. Longer needles
up to size 254 use Sunday's Quick-Search algorithm. Due to its simplicity
it has the best average performance of string matching algorithms on almost
all inputs. It uses a bad-character shift table to skip past mismatches.
By limiting the needle length to 254, the shift table can be reduced to 8
bits per entry, lowering preprocessing overhead and minimizing cache effects.
The limit also implies the worst-case performance is linear.
Even larger needles are processed by the linear-time Two-Way algorithm.
*/
char *
strstr(const char *haystack, const char *needle)
{
const unsigned char *hs = (const unsigned char *)haystack;
const unsigned char *ne = (const unsigned char *)needle;
size_t i;
/* Handle short needle special cases first. */
if (ne[0] == '\0')
return (char *)hs;
if (ne[1] == '\0')
return (char *)strchr((const char *)hs, (char)ne[0]);
if (ne[2] == '\0')
return strstr2(hs, ne);
if (ne[3] == '\0')
return strstr3(hs, ne);
if (ne[4] == '\0')
return strstr4(hs, ne);
size_t ne_len = strlen((const char *)ne);
size_t hs_len = strnlen((const char *)hs, ne_len | 512);
/* Ensure haystack length is >= needle length. */
if (hs_len < ne_len)
return NULL;
/* Use the Quick-Search algorithm for needle lengths less than 255. */
if (__builtin_expect(ne_len < 255, 1)) {
uint8_t shift[1 << SHIFT_TABLE_BITS];
const unsigned char *end = hs + hs_len - ne_len;
/* Initialize bad character shift hash table. */
memset(shift, ne_len + 1, sizeof(shift));
for (i = 0; i < ne_len; i++)
shift[ne[i] % sizeof(shift)] = ne_len - i;
do {
hs--;
/* Search by skipping past bad characters. */
size_t tmp = shift[hs[ne_len] % sizeof(shift)];
for (hs += tmp; hs <= end; hs += tmp) {
tmp = shift[hs[ne_len] % sizeof(shift)];
if (memcmp(hs, ne, ne_len) == 0)
return (char *)hs;
}
if (end[ne_len] == 0)
return NULL;
end += strnlen((const char *)(end + ne_len), 2048);
} while (hs <= end);
return NULL;
}
/* Use Two-Way algorithm for very long needles. */
return two_way_long_needle(hs, hs_len, ne, ne_len);
}
#endif /* compilation for speed */