226a5691 |
1 | /* Copyright (C) 2010-2020 The RetroArch team |
2 | * |
3 | * --------------------------------------------------------------------------------------- |
4 | * The following license statement only applies to this file (compat_strcasestr.c). |
5 | * --------------------------------------------------------------------------------------- |
6 | * |
7 | * Permission is hereby granted, free of charge, |
8 | * to any person obtaining a copy of this software and associated documentation files (the "Software"), |
9 | * to deal in the Software without restriction, including without limitation the rights to |
10 | * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, |
11 | * and to permit persons to whom the Software is furnished to do so, subject to the following conditions: |
12 | * |
13 | * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. |
14 | * |
15 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, |
16 | * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
17 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
18 | * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |
19 | * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
20 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
21 | */ |
22 | |
23 | #include <ctype.h> |
24 | |
25 | #include <compat/strcasestr.h> |
26 | |
27 | /* Pretty much strncasecmp. */ |
28 | static int casencmp(const char *a, const char *b, size_t n) |
29 | { |
30 | size_t i; |
31 | |
32 | for (i = 0; i < n; i++) |
33 | { |
34 | int a_lower = tolower(a[i]); |
35 | int b_lower = tolower(b[i]); |
36 | if (a_lower != b_lower) |
37 | return a_lower - b_lower; |
38 | } |
39 | |
40 | return 0; |
41 | } |
42 | |
43 | char *strcasestr_retro__(const char *haystack, const char *needle) |
44 | { |
45 | size_t i, search_off; |
46 | size_t hay_len = strlen(haystack); |
47 | size_t needle_len = strlen(needle); |
48 | |
49 | if (needle_len > hay_len) |
50 | return NULL; |
51 | |
52 | search_off = hay_len - needle_len; |
53 | for (i = 0; i <= search_off; i++) |
54 | if (!casencmp(haystack + i, needle, needle_len)) |
55 | return (char*)haystack + i; |
56 | |
57 | return NULL; |
58 | } |