💾 Archived View for gemini.rmf-dev.com › repo › Vaati › tuimarket › files › 589f81a91b833492b4d1d723… captured on 2023-09-08 at 16:45:37. Gemini links have been rewritten to link to archived content
-=-=-=-=-=-=-
0 /*-
1 * Copyright (c) 2001 Mike Barcroft <mike@FreeBSD.org>
2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Chris Torek.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32
33 #include <string.h>
34
35 #if !HAVE_STRNSTR
36 /*
37 * Find the first occurrence of find in s, where the search is limited to the
38 * first slen characters of s.
39 */
40 char *
41 strnstr(const char *s, const char *find, size_t slen)
42 {
43 char c, sc;
44 size_t len;
45
46 if ((c = *find++) != '\0') {
47 len = strlen(find);
48 do {
49 do {
50 if (slen-- < 1 || (sc = *s++) == '\0')
51 return (NULL);
52 } while (sc != c);
53 if (len > slen)
54 return (NULL);
55 } while (strncmp(s, find, len) != 0);
56 s--;
57 }
58 return ((char *)s);
59 }
60 #endif
61