Hash :
32a72f45
Author :
Date :
2023-01-01T01:14:21
maint: run 'make update-copyright'
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
/* Locate a substring in a wide string.
Copyright (C) 1999, 2011-2023 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 1999.
This file 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 3 of the
License, or (at your option) any later version.
This file 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, see <https://www.gnu.org/licenses/>. */
wchar_t *
wcsstr (const wchar_t *haystack, const wchar_t *needle)
{
wchar_t n = needle[0];
/* Is needle empty? */
if (n == (wchar_t)'\0')
return (wchar_t *) haystack;
/* Is needle nearly empty? */
if (needle[1] == (wchar_t)'\0')
return wcschr (haystack, n);
/* Search for needle's first character. */
for (; *haystack != (wchar_t)'\0'; haystack++)
{
if (*haystack == n)
{
/* Compare with needle's remaining characters. */
const wchar_t *hptr = haystack + 1;
const wchar_t *nptr = needle + 1;
for (;;)
{
if (*hptr != *nptr)
break;
hptr++; nptr++;
if (*nptr == (wchar_t)'\0')
return (wchar_t *) haystack;
}
}
}
return NULL;
}