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
|
/* Return the offset of one string within another.
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
/*
* My personal strstr() implementation that beats most other algorithms.
* Until someone tells me otherwise, I assume that this is the
* fastest implementation of strstr() in C.
* I deliberately chose not to comment it. You should have at least
* as much fun trying to understand it, as I had to write it :-).
*
* Stephen R. van den Berg, berg@pool.informatik.rwth-aachen.de*/
/* Faster looping by precalculating bl, bu, cl, cu before looping.
* 2004 Apr 08 Jose Da Silva, digital@joescat@com */
#include <string.h>
#include <ctype.h>
typedef unsigned chartype;
#if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__)
char* strcasestr (const char* haystack, const char* needle)
{
chartype needle_ch = tolower(*needle++);
chartype needle_upch = toupper(needle_ch);
chartype ch_h;
char* match = (char*)haystack; /* if needle empty return haystack */
if (needle_ch != 0) {
/* find the first matching character */
do {
ch_h = *haystack++;
if (ch_h == 0) /* end of haystack no match.. */
return NULL;
} while (ch_h != needle_ch && ch_h != needle_upch);
match = (char*) haystack - 1;
/* find the first non-matching character */
lcase_match:
while (ch_h == needle_ch) {
ch_h = *haystack++;
needle_ch = tolower(*needle++);
if (needle_ch == 0) /* end of needle, found match.. */
return match;
}
/* lcase or ucase match */
needle_upch = toupper(needle_ch);
while (ch_h == needle_upch || ch_h == needle_ch) {
ch_h = *haystack++;
needle_ch = tolower(*needle++);
if (needle_ch == 0) /* end of needle, found match.. */
return match;
if (ch_h == needle_ch)
goto lcase_match;
needle_upch = toupper(needle_ch);
}
match = NULL;
}
return match;
}
#else
char* strcasestr (const char* phaystack, const char* pneedle)
{
const unsigned char *haystack, *needle;
chartype bl, bu, cl, cu;
haystack = (const unsigned char *) phaystack;
needle = (const unsigned char *) pneedle;
bl = tolower (*needle);
if (bl != '\0')
{
bu = toupper (bl);
haystack--;/* possible ANSI violation */
do
{
cl = *++haystack;
if (cl == '\0')
goto ret0;
}
while ((cl != bl) && (cl != bu));
cl = tolower (*++needle);
if (cl == '\0')
goto foundneedle;
cu = toupper (cl);
++needle;
goto jin;
for (;;)
{
chartype a;
const unsigned char *rhaystack, *rneedle;
do
{
a = *++haystack;
if (a == '\0')
goto ret0;
if ((a == bl) || (a == bu))
break;
a = *++haystack;
if (a == '\0')
goto ret0;
shloop:
;
}
while ((a != bl) && (a != bu));
jin: a = *++haystack;
if (a == '\0')
goto ret0;
if ((a != cl) && (a != cu))
goto shloop;
rhaystack = haystack-- + 1;
rneedle = needle;
a = tolower (*rneedle);
if (tolower (*rhaystack) == (int) a)
do
{
if (a == '\0')
goto foundneedle;
++rhaystack;
a = tolower (*++needle);
if (tolower (*rhaystack) != (int) a)
break;
if (a == '\0')
goto foundneedle;
++rhaystack;
a = tolower (*++needle);
}
while (tolower (*rhaystack) == (int) a);
needle = rneedle;/* took the register-poor approach */
if (a == '\0')
break;
}
}
foundneedle:
return (char*) haystack;
ret0:
return 0;
}
#endif
|
