2 * Copyright (C) 2008-2009 Free Software Foundation
3 * Written by Eric Blake
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/>. */
26 #include "zerosize-ptr.h"
28 #define ASSERT(expr) \
33 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
40 /* Calculating void * + int is not portable, so this wrapper converts
41 to char * to make the tests easier to write. */
42 #define MEMCHR2 (char *) memchr2
48 char *input = malloc (n);
53 memset (input + 2, 'c', 1024);
54 memset (input + 1026, 'd', n - 1028);
58 /* Basic behavior tests. */
59 ASSERT (MEMCHR2 (input, 'a', 'b', n) == input);
60 ASSERT (MEMCHR2 (input, 'b', 'a', n) == input);
62 ASSERT (MEMCHR2 (input, 'a', 'b', 0) == NULL);
63 ASSERT (MEMCHR2 (zerosize_ptr (), 'a', 'b', 0) == NULL);
65 ASSERT (MEMCHR2 (input, 'b', 'd', n) == input + 1);
66 ASSERT (MEMCHR2 (input + 2, 'b', 'd', n - 2) == input + 1026);
68 ASSERT (MEMCHR2 (input, 'd', 'e', n) == input + 1026);
69 ASSERT (MEMCHR2 (input, 'e', 'd', n) == input + 1026);
71 ASSERT (MEMCHR2 (input + 1, 'a', 'e', n - 1) == input + n - 2);
72 ASSERT (MEMCHR2 (input + 1, 'e', 'a', n - 1) == input + n - 2);
74 ASSERT (MEMCHR2 (input, 'f', 'g', n) == NULL);
75 ASSERT (MEMCHR2 (input, 'f', '\0', n) == NULL);
77 ASSERT (MEMCHR2 (input, 'a', 'a', n) == input);
78 ASSERT (MEMCHR2 (input + 1, 'a', 'a', n - 1) == input + n - 1);
79 ASSERT (MEMCHR2 (input, 'f', 'f', n) == NULL);
81 /* Check that a very long haystack is handled quickly if one of the
82 two bytes is found near the beginning. */
84 size_t repeat = 10000;
85 for (; repeat > 0; repeat--)
87 ASSERT (MEMCHR2 (input, 'c', 'e', n) == input + 2);
88 ASSERT (MEMCHR2 (input, 'e', 'c', n) == input + 2);
89 ASSERT (MEMCHR2 (input, 'c', '\0', n) == input + 2);
90 ASSERT (MEMCHR2 (input, '\0', 'c', n) == input + 2);
94 /* Alignment tests. */
97 for (i = 0; i < 32; i++)
99 for (j = 0; j < 256; j++)
101 for (j = 0; j < 256; j++)
103 ASSERT (MEMCHR2 (input + i, j, 0xff, 256) == input + i + j);
104 ASSERT (MEMCHR2 (input + i, 0xff, j, 256) == input + i + j);