2 * Copyright (C) 2008-2010 Free Software Foundation, Inc.
3 * Written by Eric Blake and Bruno Haible
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>. */
22 #include "signature.h"
23 SIGNATURE_CHECK (memchr, void *, (void const *, int, size_t));
27 #include "zerosize-ptr.h"
30 /* Calculating void * + int is not portable, so this wrapper converts
31 to char * to make the tests easier to write. */
32 #define MEMCHR (char *) memchr
38 char *input = malloc (n);
43 memset (input + 2, 'c', 1024);
44 memset (input + 1026, 'd', n - 1028);
48 /* Basic behavior tests. */
49 ASSERT (MEMCHR (input, 'a', n) == input);
51 ASSERT (MEMCHR (input, 'a', 0) == NULL);
52 ASSERT (MEMCHR (zerosize_ptr (), 'a', 0) == NULL);
54 ASSERT (MEMCHR (input, 'b', n) == input + 1);
55 ASSERT (MEMCHR (input, 'c', n) == input + 2);
56 ASSERT (MEMCHR (input, 'd', n) == input + 1026);
58 ASSERT (MEMCHR (input + 1, 'a', n - 1) == input + n - 1);
59 ASSERT (MEMCHR (input + 1, 'e', n - 1) == input + n - 2);
61 ASSERT (MEMCHR (input, 'f', n) == NULL);
62 ASSERT (MEMCHR (input, '\0', n) == NULL);
64 /* Check that a very long haystack is handled quickly if the byte is
65 found near the beginning. */
67 size_t repeat = 10000;
68 for (; repeat > 0; repeat--)
70 ASSERT (MEMCHR (input, 'c', n) == input + 2);
74 /* Alignment tests. */
77 for (i = 0; i < 32; i++)
79 for (j = 0; j < 256; j++)
81 for (j = 0; j < 256; j++)
83 ASSERT (MEMCHR (input + i, j, 256) == input + i + j);
88 /* Check that memchr() does not read past the first occurrence of the
89 byte being searched. See the Austin Group's clarification
90 <http://www.opengroup.org/austin/docs/austin_454.txt>. */
92 char *page_boundary = (char *) zerosize_ptr ();
94 if (page_boundary != NULL)
96 for (n = 1; n <= 500; n++)
98 char *mem = page_boundary - n;
100 ASSERT (MEMCHR (mem, 'U', n) == NULL);
105 for (i = 0; i < n; i++)
108 ASSERT (MEMCHR (mem, 'U', 4000) == mem + i);