summaryrefslogtreecommitdiff
path: root/gl/memmem.c
diff options
context:
space:
mode:
authorSimon Josefsson <simon@josefsson.org>2004-10-05 19:23:32 +0000
committerSimon Josefsson <simon@josefsson.org>2004-10-05 19:23:32 +0000
commit44f36671ed0ea24b60afdf8a033faf3d258a24c3 (patch)
treee69dca84aa9ed595fc218bb536091f2112b875f9 /gl/memmem.c
parentc959c9d135876d62dc00f743c27f23cb4b30f74c (diff)
downloadgnutls-44f36671ed0ea24b60afdf8a033faf3d258a24c3.tar.gz
Update Gnulib.
Replace memstr with memmem, see continued discussion on bug-gnulib.
Diffstat (limited to 'gl/memmem.c')
-rw-r--r--gl/memmem.c57
1 files changed, 57 insertions, 0 deletions
diff --git a/gl/memmem.c b/gl/memmem.c
new file mode 100644
index 0000000000..04e384cf1d
--- /dev/null
+++ b/gl/memmem.c
@@ -0,0 +1,57 @@
+/* Copyright (C) 1991,92,93,94,96,97,98,2000,2004 Free Software Foundation, Inc.
+ This file is part of the GNU C Library.
+
+ 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 2, 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, write to the Free Software Foundation,
+ Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
+
+#include <stddef.h>
+#include <string.h>
+
+#ifndef _LIBC
+# define __builtin_expect(expr, val) (expr)
+#endif
+
+#undef memmem
+
+/* Return the first occurrence of NEEDLE in HAYSTACK. */
+void *
+memmem (haystack, haystack_len, needle, needle_len)
+ const void *haystack;
+ size_t haystack_len;
+ const void *needle;
+ size_t needle_len;
+{
+ const char *begin;
+ const char *const last_possible
+ = (const char *) haystack + haystack_len - needle_len;
+
+ if (needle_len == 0)
+ /* The first occurrence of the empty string is deemed to occur at
+ the beginning of the string. */
+ return (void *) haystack;
+
+ /* Sanity check, otherwise the loop might search through the whole
+ memory. */
+ if (__builtin_expect (haystack_len < needle_len, 0))
+ return NULL;
+
+ for (begin = (const char *) haystack; begin <= last_possible; ++begin)
+ if (begin[0] == ((const char *) needle)[0] &&
+ !memcmp ((const void *) &begin[1],
+ (const void *) ((const char *) needle + 1),
+ needle_len - 1))
+ return (void *) begin;
+
+ return NULL;
+}