diff options
author | Richard Maw <richard.maw@codethink.co.uk> | 2012-01-17 14:43:55 +0000 |
---|---|---|
committer | Richard Maw <richard.maw@codethink.co.uk> | 2012-01-17 14:43:55 +0000 |
commit | 2de9abc5c9d40b3c716307d67d16146f823fd554 (patch) | |
tree | 6979db67934ddc8b564150b465846a383b428ff8 /gnulib/lib/wcsstr-impl.h | |
parent | 33cc1c6fda6e72a7bae1401e9b2cec495a4d3ff1 (diff) | |
download | patch-baserock/bootstrap.tar.gz |
add the output of bootstrapbaserock/bootstrap-pass2baserock/bootstrap
Diffstat (limited to 'gnulib/lib/wcsstr-impl.h')
m--------- | gnulib | 0 | ||||
-rw-r--r-- | gnulib/lib/wcsstr-impl.h | 51 |
2 files changed, 51 insertions, 0 deletions
diff --git a/gnulib b/gnulib deleted file mode 160000 -Subproject 443bc5ffcf7429e557f4a371b0661abe98ddbc1 diff --git a/gnulib/lib/wcsstr-impl.h b/gnulib/lib/wcsstr-impl.h new file mode 100644 index 0000000..f3fb3fb --- /dev/null +++ b/gnulib/lib/wcsstr-impl.h @@ -0,0 +1,51 @@ +/* Locate a substring in a wide string. + Copyright (C) 1999, 2011 Free Software Foundation, Inc. + Written by Bruno Haible <bruno@clisp.org>, 1999. + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 3 of the License, 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 General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see <http://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; +} |