summaryrefslogtreecommitdiff
path: root/tests/test-memchr.c
diff options
context:
space:
mode:
authorManuel A. Fernandez Montecelo <manuel.montezelo@gmail.com>2016-05-27 14:28:30 +0100
committerManuel A. Fernandez Montecelo <manuel.montezelo@gmail.com>2016-05-27 14:28:30 +0100
commita9a31b1de5776a3b08a82101a4fa711294f0dd1d (patch)
tree159134a624e51509f40ed8823249f09a70d1dda3 /tests/test-memchr.c
parent5f2b09982312c98863eb9a8dfe2c608b81f58259 (diff)
Imported Upstream version 0.9.6+really0.9.3upstream/0.9.6+really0.9.3
Diffstat (limited to 'tests/test-memchr.c')
-rw-r--r--tests/test-memchr.c21
1 files changed, 4 insertions, 17 deletions
diff --git a/tests/test-memchr.c b/tests/test-memchr.c
index bc1acf9f..a8016140 100644
--- a/tests/test-memchr.c
+++ b/tests/test-memchr.c
@@ -1,5 +1,5 @@
/*
- * Copyright (C) 2008-2015 Free Software Foundation, Inc.
+ * Copyright (C) 2008-2010 Free Software Foundation, Inc.
* Written by Eric Blake and Bruno Haible
*
* This program is free software: you can redistribute it and/or modify
@@ -57,7 +57,6 @@ main (void)
ASSERT (MEMCHR (input + 1, 'a', n - 1) == input + n - 1);
ASSERT (MEMCHR (input + 1, 'e', n - 1) == input + n - 2);
- ASSERT (MEMCHR (input + 1, 0x789abc00 | 'e', n - 1) == input + n - 2);
ASSERT (MEMCHR (input, 'f', n) == NULL);
ASSERT (MEMCHR (input, '\0', n) == NULL);
@@ -88,37 +87,25 @@ main (void)
/* Check that memchr() does not read past the first occurrence of the
byte being searched. See the Austin Group's clarification
- <http://www.opengroup.org/austin/docs/austin_454.txt>.
- Test both '\0' and something else, since some implementations
- special-case searching for NUL.
- */
+ <http://www.opengroup.org/austin/docs/austin_454.txt>. */
{
char *page_boundary = (char *) zerosize_ptr ();
- /* Too small, and we miss cache line boundary tests; too large,
- and the test takes cubically longer to complete. */
- int limit = 257;
if (page_boundary != NULL)
{
- for (n = 1; n <= limit; n++)
+ for (n = 1; n <= 500; n++)
{
char *mem = page_boundary - n;
memset (mem, 'X', n);
ASSERT (MEMCHR (mem, 'U', n) == NULL);
- ASSERT (MEMCHR (mem, 0, n) == NULL);
{
size_t i;
- size_t k;
for (i = 0; i < n; i++)
{
mem[i] = 'U';
- for (k = i + 1; k < n + limit; k++)
- ASSERT (MEMCHR (mem, 'U', k) == mem + i);
- mem[i] = 0;
- for (k = i + 1; k < n + limit; k++)
- ASSERT (MEMCHR (mem, 0, k) == mem + i);
+ ASSERT (MEMCHR (mem, 'U', 4000) == mem + i);
mem[i] = 'X';
}
}