mirror of
https://github.com/MariaDB/server.git
synced 2025-10-20 06:32:11 +02:00
175208a284
Previously, the buffer used to check that long CRC32 produce the right results, was initialized with the same value repeated in every byte. This is subobtimal as it can't detect bugs in which a 8-byte SIMD unit of data is loaded and processed in the wrong endianness. Improve the test by initializing the buffer with a pattern that does not repeat along power-of-two boundaries. 251 was picked as the highest prime number that fits in a byte. |
||
|---|---|---|
| .. | ||
| aes-t.c | ||
| base64-t.c | ||
| bitmap-t.c | ||
| byte_order-t.c | ||
| CMakeLists.txt | ||
| crc32-t.c | ||
| dynstring-t.c | ||
| lf-t.c | ||
| ma_dyncol-t.c | ||
| my_atomic-t.c | ||
| my_delete-t.c | ||
| my_getopt-t.c | ||
| my_malloc-t.c | ||
| my_rdtsc-t.c | ||
| my_vsnprintf-t.c | ||
| queues-t.c | ||
| stack_allocation-t.c | ||
| stacktrace-t.c | ||
| thr_template.c | ||
| waiting_threads-t.c | ||