1*2fe8fb19SBen Gras /* $NetBSD: strcasestr.c,v 1.3 2005/11/29 03:12:00 christos Exp $ */
2*2fe8fb19SBen Gras
3*2fe8fb19SBen Gras /*-
4*2fe8fb19SBen Gras * Copyright (c) 1990, 1993
5*2fe8fb19SBen Gras * The Regents of the University of California. All rights reserved.
6*2fe8fb19SBen Gras *
7*2fe8fb19SBen Gras * This code is derived from software contributed to Berkeley by
8*2fe8fb19SBen Gras * Chris Torek.
9*2fe8fb19SBen Gras *
10*2fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
11*2fe8fb19SBen Gras * modification, are permitted provided that the following conditions
12*2fe8fb19SBen Gras * are met:
13*2fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
14*2fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
15*2fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
16*2fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
17*2fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
18*2fe8fb19SBen Gras * 3. Neither the name of the University nor the names of its contributors
19*2fe8fb19SBen Gras * may be used to endorse or promote products derived from this software
20*2fe8fb19SBen Gras * without specific prior written permission.
21*2fe8fb19SBen Gras *
22*2fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23*2fe8fb19SBen Gras * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24*2fe8fb19SBen Gras * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25*2fe8fb19SBen Gras * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26*2fe8fb19SBen Gras * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27*2fe8fb19SBen Gras * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28*2fe8fb19SBen Gras * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29*2fe8fb19SBen Gras * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30*2fe8fb19SBen Gras * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31*2fe8fb19SBen Gras * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32*2fe8fb19SBen Gras * SUCH DAMAGE.
33*2fe8fb19SBen Gras */
34*2fe8fb19SBen Gras
35*2fe8fb19SBen Gras #include <sys/cdefs.h>
36*2fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
37*2fe8fb19SBen Gras __RCSID("$NetBSD: strcasestr.c,v 1.3 2005/11/29 03:12:00 christos Exp $");
38*2fe8fb19SBen Gras #endif /* LIBC_SCCS and not lint */
39*2fe8fb19SBen Gras
40*2fe8fb19SBen Gras #include "namespace.h"
41*2fe8fb19SBen Gras #include <assert.h>
42*2fe8fb19SBen Gras #include <ctype.h>
43*2fe8fb19SBen Gras #include <string.h>
44*2fe8fb19SBen Gras
45*2fe8fb19SBen Gras /*
46*2fe8fb19SBen Gras * Find the first occurrence of find in s, ignore case.
47*2fe8fb19SBen Gras */
48*2fe8fb19SBen Gras char *
strcasestr(const char * s,const char * find)49*2fe8fb19SBen Gras strcasestr(const char *s, const char *find)
50*2fe8fb19SBen Gras {
51*2fe8fb19SBen Gras char c, sc;
52*2fe8fb19SBen Gras size_t len;
53*2fe8fb19SBen Gras
54*2fe8fb19SBen Gras _DIAGASSERT(s != NULL);
55*2fe8fb19SBen Gras _DIAGASSERT(find != NULL);
56*2fe8fb19SBen Gras
57*2fe8fb19SBen Gras if ((c = *find++) != 0) {
58*2fe8fb19SBen Gras c = tolower((unsigned char)c);
59*2fe8fb19SBen Gras len = strlen(find);
60*2fe8fb19SBen Gras do {
61*2fe8fb19SBen Gras do {
62*2fe8fb19SBen Gras if ((sc = *s++) == 0)
63*2fe8fb19SBen Gras return (NULL);
64*2fe8fb19SBen Gras } while ((char)tolower((unsigned char)sc) != c);
65*2fe8fb19SBen Gras } while (strncasecmp(s, find, len) != 0);
66*2fe8fb19SBen Gras s--;
67*2fe8fb19SBen Gras }
68*2fe8fb19SBen Gras return __UNCONST(s);
69*2fe8fb19SBen Gras }
70