2 * Copyright (C) 2008-2009 Free Software Foundation
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/>. */
25 #include "zerosize-ptr.h"
27 #define ASSERT(expr) \
32 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
39 /* Calculating void * + int is not portable, so this wrapper converts
40 to char * to make the tests easier to write. */
41 #define MEMCHR (char *) memchr
47 char *input = malloc (n);
52 memset (input + 2, 'c', 1024);
53 memset (input + 1026, 'd', n - 1028);
57 /* Basic behavior tests. */
58 ASSERT (MEMCHR (input, 'a', n) == input);
60 ASSERT (MEMCHR (input, 'a', 0) == NULL);
61 ASSERT (MEMCHR (zerosize_ptr (), 'a', 0) == NULL);
63 ASSERT (MEMCHR (input, 'b', n) == input + 1);
64 ASSERT (MEMCHR (input, 'c', n) == input + 2);
65 ASSERT (MEMCHR (input, 'd', n) == input + 1026);
67 ASSERT (MEMCHR (input + 1, 'a', n - 1) == input + n - 1);
68 ASSERT (MEMCHR (input + 1, 'e', n - 1) == input + n - 2);
70 ASSERT (MEMCHR (input, 'f', n) == NULL);
71 ASSERT (MEMCHR (input, '\0', n) == NULL);
73 /* Check that a very long haystack is handled quickly if the byte is
74 found near the beginning. */
76 size_t repeat = 10000;
77 for (; repeat > 0; repeat--)
79 ASSERT (MEMCHR (input, 'c', n) == input + 2);
83 /* Alignment tests. */
86 for (i = 0; i < 32; i++)
88 for (j = 0; j < 256; j++)
90 for (j = 0; j < 256; j++)
92 ASSERT (MEMCHR (input + i, j, 256) == input + i + j);
97 /* Check that memchr() does not read past the first occurrence of the
98 byte being searched. See the Austin Group's clarification
99 <http://www.opengroup.org/austin/docs/austin_454.txt>. */
101 char *page_boundary = (char *) zerosize_ptr ();
103 if (page_boundary != NULL)
107 for (n = 1; n <= 500; n++)
109 char *mem = page_boundary - n;
110 memset (mem, 'X', n);
111 ASSERT (MEMCHR (mem, 'U', n) == NULL);
116 for (i = 0; i < n; i++)
119 ASSERT (MEMCHR (mem, 'U', 4000) == mem + i);