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
|
/* Case-insensitive searching in a string.
Copyright (C) 2005 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 2005.
This program 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, or (at your option)
any later version.
This program 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 this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
/* Specification. */
#include "strcasestr.h"
#include <ctype.h>
#include <stddef.h> /* for NULL */
#if HAVE_MBRTOWC
# include "mbuiter.h"
#endif
#define TOLOWER(Ch) (isupper (Ch) ? tolower (Ch) : (Ch))
/* Find the first occurrence of NEEDLE in HAYSTACK, using case-insensitive
comparison.
Note: This function may, in multibyte locales, return success even if
strlen (haystack) < strlen (needle) ! */
char *
strcasestr (const char *haystack, const char *needle)
{
/* Be careful not to look at the entire extent of haystack or needle
until needed. This is useful because of these two cases:
- haystack may be very long, and a match of needle found early,
- needle may be very long, and not even a short initial segment of
needle may be found in haystack. */
#if HAVE_MBRTOWC
if (MB_CUR_MAX > 1)
{
mbui_iterator_t iter_needle;
mbui_init (iter_needle, needle);
if (mbui_avail (iter_needle))
{
mbchar_t b;
mbui_iterator_t iter_haystack;
mb_copy (&b, &mbui_cur (iter_needle));
if (b.wc_valid)
b.wc = towlower (b.wc);
mbui_init (iter_haystack, haystack);
for (;; mbui_advance (iter_haystack))
{
mbchar_t c;
if (!mbui_avail (iter_haystack))
/* No match. */
return NULL;
mb_copy (&c, &mbui_cur (iter_haystack));
if (c.wc_valid)
c.wc = towlower (c.wc);
if (mb_equal (c, b))
/* The first character matches. */
{
mbui_iterator_t rhaystack;
mbui_iterator_t rneedle;
memcpy (&rhaystack, &iter_haystack, sizeof (mbui_iterator_t));
mbui_advance (rhaystack);
mbui_init (rneedle, needle);
if (!mbui_avail (rneedle))
abort ();
mbui_advance (rneedle);
for (;; mbui_advance (rhaystack), mbui_advance (rneedle))
{
if (!mbui_avail (rneedle))
/* Found a match. */
return (char *) mbui_cur_ptr (iter_haystack);
if (!mbui_avail (rhaystack))
/* No match. */
return NULL;
if (!mb_caseequal (mbui_cur (rhaystack),
mbui_cur (rneedle)))
/* Nothing in this round. */
break;
}
}
}
}
else
return (char *) haystack;
}
else
#endif
{
if (*needle != '\0')
{
/* Speed up the following searches of needle by caching its first
character. */
unsigned char b = TOLOWER ((unsigned char) *needle);
needle++;
for (;; haystack++)
{
if (*haystack == '\0')
/* No match. */
return NULL;
if (TOLOWER ((unsigned char) *haystack) == b)
/* The first character matches. */
{
const char *rhaystack = haystack + 1;
const char *rneedle = needle;
for (;; rhaystack++, rneedle++)
{
if (*rneedle == '\0')
/* Found a match. */
return (char *) haystack;
if (*rhaystack == '\0')
/* No match. */
return NULL;
if (TOLOWER ((unsigned char) *rhaystack)
!= TOLOWER ((unsigned char) *rneedle))
/* Nothing in this round. */
break;
}
}
}
}
else
return (char *) haystack;
}
}
|
