Branch
Hash :
7b089321
Author :
Date :
2025-01-01T09:24:36
maint: run 'make update-copyright'
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162
/* Test of uN_strchr() functions.
Copyright (C) 2008-2025 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
/* Written by Paolo Bonzini <bonzini@gnu.org>, 2010.
Based on test-chr.h, by Eric Blake and Bruno Haible. */
static void
test_strchr (void)
{
size_t size = 0x100000;
size_t length;
UNIT *input;
uint32_t *input32 = (uint32_t *) malloc ((size + 1) * sizeof (uint32_t));
ASSERT (input32);
input32[0] = 'a';
input32[1] = 'b';
u32_set (input32 + 2, 'c', 1024);
for (size_t i = 1026; i < size - 2; i += 63)
{
size_t last = i + 63 < size - 2 ? i + 63 : size - 2;
ucs4_t uc = 'd' | (i - 1026);
if (uc >= 0xd800 && uc <= 0xdfff)
uc |= 0x100000;
u32_set (input32 + i, uc, last - i);
}
input32[size - 2] = 'e';
input32[size - 1] = 'a';
input32[size] = 0;
input = U32_TO_U (input32, size + 1, NULL, &length);
ASSERT (input);
/* Basic behavior tests. */
ASSERT (U_STRCHR (input, 'a') == input);
ASSERT (U_STRCHR (input, 'b') == input + 1);
ASSERT (U_STRCHR (input, 'c') == input + 2);
{
UNIT *exp = input + 1026;
UNIT *prev = input + 2;
for (size_t i = 1026; i < size - 2; i += 63)
{
UNIT c[6];
size_t n;
ucs4_t uc = 'd' | (i - 1026);
if (uc >= 0xd800 && uc <= 0xdfff)
uc |= 0x100000;
n = U_UCTOMB (c, uc, 6);
ASSERT (exp < input + length - 2);
ASSERT (U_STRCHR (prev, uc) == exp);
ASSERT (memcmp (exp, c, n * sizeof (UNIT)) == 0);
prev = exp;
exp += n * 63;
}
}
ASSERT (U_STRCHR (input + 1, 'a') == input + length - 2);
ASSERT (U_STRCHR (input + 1, 'e') == input + length - 3);
ASSERT (U_STRCHR (input, 'f') == NULL);
ASSERT (U_STRCHR (input, '\0') == input + length - 1);
/* Check that a very long haystack is handled quickly if the byte is
found near the beginning. */
{
size_t repeat = 10000;
for (; repeat > 0; repeat--)
{
ASSERT (U_STRCHR (input, 'c') == input + 2);
}
}
/* Alignment tests. */
{
int i, j;
for (i = 0; i < 32; i++)
{
for (j = 0; j < 127; j++)
input[i + j] = j + 1;
input[i + 128] = 0;
for (j = 0; j < 127; j++)
{
ASSERT (U_STRCHR (input + i, j + 1) == input + i + j);
}
}
}
/* Check that uN_strchr() does not read past the end of the string. */
{
char *page_boundary = (char *) zerosize_ptr ();
size_t n;
if (page_boundary != NULL)
{
for (n = 2; n <= 500 / sizeof (UNIT); n++)
{
UNIT *mem = (UNIT *) (page_boundary - n * sizeof (UNIT));
U_SET (mem, 'X', n - 2);
mem[n - 2] = 0;
ASSERT (U_STRCHR (mem, 'U') == NULL);
mem[n - 2] = 'X';
mem[n - 1] = 0;
ASSERT (U_STRCHR (mem, 'U') == NULL);
}
}
}
#if 0
/* This check is disabled, because uN_strchr() is allowed to read past the
first occurrence of the byte being searched. In fact, u8_strchr() does
so, on i586 glibc systems: u8_strchr calls strchr, which in
glibc/sysdeps/i386/i586/strchr.S loads the second word before the
handling of the first word has been completed. */
/* Check that uN_strchr() does not read past the first occurrence of the
byte being searched. */
{
char *page_boundary = (char *) zerosize_ptr ();
size_t n;
if (page_boundary != NULL)
{
for (n = 2; n <= 500 / sizeof (UNIT); n++)
{
UNIT *mem = (UNIT *) (page_boundary - n * sizeof (UNIT));
U_SET (mem, 'X', n - 1);
mem[n - 1] = 0;
ASSERT (U_STRCHR (mem, 'U') == NULL);
{
size_t i;
for (i = 0; i < n; i++)
{
mem[i] = 'U';
ASSERT (U_STRCHR (mem, 'U') == mem + i);
mem[i] = 'X';
}
}
}
}
}
#endif
free (input);
if (sizeof (UNIT) != sizeof (uint32_t))
free (input32);
}