|
Packit |
06dd63 |
/*
|
|
Packit |
06dd63 |
* Copyright (C) 2008-2019 Free Software Foundation, Inc.
|
|
Packit |
06dd63 |
* Written by Eric Blake and Bruno Haible
|
|
Packit |
06dd63 |
*
|
|
Packit |
06dd63 |
* This program is free software: you can redistribute it and/or modify
|
|
Packit |
06dd63 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
06dd63 |
* the Free Software Foundation; either version 3 of the License, or
|
|
Packit |
06dd63 |
* (at your option) any later version.
|
|
Packit |
06dd63 |
*
|
|
Packit |
06dd63 |
* This program is distributed in the hope that it will be useful,
|
|
Packit |
06dd63 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
06dd63 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Packit |
06dd63 |
* GNU General Public License for more details.
|
|
Packit |
06dd63 |
*
|
|
Packit |
06dd63 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
06dd63 |
* along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
#include <config.h>
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
#include <string.h>
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
#include "signature.h"
|
|
Packit |
06dd63 |
SIGNATURE_CHECK (memchr, void *, (void const *, int, size_t));
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
#include <stdlib.h>
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
#include "zerosize-ptr.h"
|
|
Packit |
06dd63 |
#include "macros.h"
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
/* Calculating void * + int is not portable, so this wrapper converts
|
|
Packit |
06dd63 |
to char * to make the tests easier to write. */
|
|
Packit |
06dd63 |
#define MEMCHR (char *) memchr
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
int
|
|
Packit |
06dd63 |
main (void)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
size_t n = 0x100000;
|
|
Packit |
06dd63 |
char *input = malloc (n);
|
|
Packit |
06dd63 |
ASSERT (input);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
input[0] = 'a';
|
|
Packit |
06dd63 |
input[1] = 'b';
|
|
Packit |
06dd63 |
memset (input + 2, 'c', 1024);
|
|
Packit |
06dd63 |
memset (input + 1026, 'd', n - 1028);
|
|
Packit |
06dd63 |
input[n - 2] = 'e';
|
|
Packit |
06dd63 |
input[n - 1] = 'a';
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
/* Basic behavior tests. */
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'a', n) == input);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'a', 0) == NULL);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (zerosize_ptr (), 'a', 0) == NULL);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'b', n) == input + 1);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'c', n) == input + 2);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'd', n) == input + 1026);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input + 1, 'a', n - 1) == input + n - 1);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input + 1, 'e', n - 1) == input + n - 2);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input + 1, 0x789abc00 | 'e', n - 1) == input + n - 2);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'f', n) == NULL);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, '\0', n) == NULL);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
/* Check that a very long haystack is handled quickly if the byte is
|
|
Packit |
06dd63 |
found near the beginning. */
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
size_t repeat = 10000;
|
|
Packit |
06dd63 |
for (; repeat > 0; repeat--)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input, 'c', n) == input + 2);
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
/* Alignment tests. */
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
int i, j;
|
|
Packit |
06dd63 |
for (i = 0; i < 32; i++)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
for (j = 0; j < 256; j++)
|
|
Packit |
06dd63 |
input[i + j] = j;
|
|
Packit |
06dd63 |
for (j = 0; j < 256; j++)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (input + i, j, 256) == input + i + j);
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
/* Check that memchr() does not read past the first occurrence of the
|
|
Packit |
06dd63 |
byte being searched. See the Austin Group's clarification
|
|
Packit |
06dd63 |
<http://www.opengroup.org/austin/docs/austin_454.txt>.
|
|
Packit |
06dd63 |
Test both '\0' and something else, since some implementations
|
|
Packit |
06dd63 |
special-case searching for NUL.
|
|
Packit |
06dd63 |
*/
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
char *page_boundary = (char *) zerosize_ptr ();
|
|
Packit |
06dd63 |
/* Too small, and we miss cache line boundary tests; too large,
|
|
Packit |
06dd63 |
and the test takes cubically longer to complete. */
|
|
Packit |
06dd63 |
int limit = 257;
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
if (page_boundary != NULL)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
for (n = 1; n <= limit; n++)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
char *mem = page_boundary - n;
|
|
Packit |
06dd63 |
memset (mem, 'X', n);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (mem, 'U', n) == NULL);
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (mem, 0, n) == NULL);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
size_t i;
|
|
Packit |
06dd63 |
size_t k;
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
for (i = 0; i < n; i++)
|
|
Packit |
06dd63 |
{
|
|
Packit |
06dd63 |
mem[i] = 'U';
|
|
Packit |
06dd63 |
for (k = i + 1; k < n + limit; k++)
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (mem, 'U', k) == mem + i);
|
|
Packit |
06dd63 |
mem[i] = 0;
|
|
Packit |
06dd63 |
for (k = i + 1; k < n + limit; k++)
|
|
Packit |
06dd63 |
ASSERT (MEMCHR (mem, 0, k) == mem + i);
|
|
Packit |
06dd63 |
mem[i] = 'X';
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
}
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
free (input);
|
|
Packit |
06dd63 |
|
|
Packit |
06dd63 |
return 0;
|
|
Packit |
06dd63 |
}
|