1 /*
2 * Copyright (C) 2008-2018 Free Software Foundation, Inc.
3 * Written by Eric Blake
4 *
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.
9 *
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.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <https://www.gnu.org/licenses/>. */
17
18 #include <config.h>
19
20 #include "memchr2.h"
21
22 #include <stdlib.h>
23 #include <string.h>
24
25 #include "zerosize-ptr.h"
26 #include "macros.h"
27
28 /* Calculating void * + int is not portable, so this wrapper converts
29 to char * to make the tests easier to write. */
30 #define MEMCHR2 (char *) memchr2
31
32 int
main(void)33 main (void)
34 {
35 size_t n = 0x100000;
36 char *input = malloc (n);
37 ASSERT (input);
38
39 input[0] = 'a';
40 input[1] = 'b';
41 memset (input + 2, 'c', 1024);
42 memset (input + 1026, 'd', n - 1028);
43 input[n - 2] = 'e';
44 input[n - 1] = 'a';
45
46 /* Basic behavior tests. */
47 ASSERT (MEMCHR2 (input, 'a', 'b', n) == input);
48 ASSERT (MEMCHR2 (input, 'b', 'a', n) == input);
49
50 ASSERT (MEMCHR2 (input, 'a', 'b', 0) == NULL);
51 ASSERT (MEMCHR2 (zerosize_ptr (), 'a', 'b', 0) == NULL);
52
53 ASSERT (MEMCHR2 (input, 'b', 'd', n) == input + 1);
54 ASSERT (MEMCHR2 (input + 2, 'b', 'd', n - 2) == input + 1026);
55
56 ASSERT (MEMCHR2 (input, 'd', 'e', n) == input + 1026);
57 ASSERT (MEMCHR2 (input, 'e', 'd', n) == input + 1026);
58
59 ASSERT (MEMCHR2 (input + 1, 'a', 'e', n - 1) == input + n - 2);
60 ASSERT (MEMCHR2 (input + 1, 'e', 'a', n - 1) == input + n - 2);
61
62 ASSERT (MEMCHR2 (input, 'f', 'g', n) == NULL);
63 ASSERT (MEMCHR2 (input, 'f', '\0', n) == NULL);
64
65 ASSERT (MEMCHR2 (input, 'a', 'a', n) == input);
66 ASSERT (MEMCHR2 (input + 1, 'a', 'a', n - 1) == input + n - 1);
67 ASSERT (MEMCHR2 (input, 'f', 'f', n) == NULL);
68
69 /* Check that a very long haystack is handled quickly if one of the
70 two bytes is found near the beginning. */
71 {
72 size_t repeat = 10000;
73 for (; repeat > 0; repeat--)
74 {
75 ASSERT (MEMCHR2 (input, 'c', 'e', n) == input + 2);
76 ASSERT (MEMCHR2 (input, 'e', 'c', n) == input + 2);
77 ASSERT (MEMCHR2 (input, 'c', '\0', n) == input + 2);
78 ASSERT (MEMCHR2 (input, '\0', 'c', n) == input + 2);
79 }
80 }
81
82 /* Alignment tests. */
83 {
84 int i, j;
85 for (i = 0; i < 32; i++)
86 {
87 for (j = 0; j < 256; j++)
88 input[i + j] = j;
89 for (j = 0; j < 256; j++)
90 {
91 ASSERT (MEMCHR2 (input + i, j, 0xff, 256) == input + i + j);
92 ASSERT (MEMCHR2 (input + i, 0xff, j, 256) == input + i + j);
93 }
94 }
95 }
96
97 free (input);
98
99 return 0;
100 }
101