
The core idea was to take a lot of the stuff from the C unity framework and adapt it a bit here. Each file in the `unit` directory that starts with `test_` is automatically assumed to be a test suite. Within each file, all functions that start with `test_` are assumed to be a test. See unit/README.md for details about the implementation. Instead of compiling basically a net new binary, the way the tests are compiled is that the main valkey server is compiled as a static archive, which we then compile the individual test files against to create a new test executable. This is not all that important now, other than it makes the compilation simpler, but what it will allow us to do is overwrite functions in the archive to enable mocking for cross compilation unit functions. There are also ways to enable mocking from within the same compilation unit, but I don't know how important this is. Tests are also written in one of two styles: 1. Including the header file and directly calling functions from the archive. 2. Importing the original file, and then calling the functions. This second approach is cool because we can call static functions. It won't mess up the archive either. --------- Signed-off-by: Madelyn Olson <madelyneolson@gmail.com>
144 lines
5.7 KiB
C
144 lines
5.7 KiB
C
/* Copyright (c) 2014, Matt Stancliff <matt@genges.com>
|
|
* Copyright (c) 2020, Amazon Web Services
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* * Neither the name of Redis nor the names of its contributors may be used
|
|
* to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE. */
|
|
|
|
#include "crc64.h"
|
|
#include "crcspeed.h"
|
|
#include "serverassert.h"
|
|
static uint64_t crc64_table[8][256] = {{0}};
|
|
|
|
#define POLY UINT64_C(0xad93d23594c935a9)
|
|
/******************** BEGIN GENERATED PYCRC FUNCTIONS ********************/
|
|
/**
|
|
* Generated on Sun Dec 21 14:14:07 2014,
|
|
* by pycrc v0.8.2, https://www.tty1.net/pycrc/
|
|
*
|
|
* LICENSE ON GENERATED CODE:
|
|
* ==========================
|
|
* As of version 0.6, pycrc is released under the terms of the MIT licence.
|
|
* The code generated by pycrc is not considered a substantial portion of the
|
|
* software, therefore the author of pycrc will not claim any copyright on
|
|
* the generated code.
|
|
* ==========================
|
|
*
|
|
* CRC configuration:
|
|
* Width = 64
|
|
* Poly = 0xad93d23594c935a9
|
|
* XorIn = 0xffffffffffffffff
|
|
* ReflectIn = True
|
|
* XorOut = 0x0000000000000000
|
|
* ReflectOut = True
|
|
* Algorithm = bit-by-bit-fast
|
|
*
|
|
* Modifications after generation (by matt):
|
|
* - included finalize step in-line with update for single-call generation
|
|
* - re-worked some inner variable architectures
|
|
* - adjusted function parameters to match expected prototypes.
|
|
*****************************************************************************/
|
|
|
|
/**
|
|
* Reflect all bits of a \a data word of \a data_len bytes.
|
|
*
|
|
* \param data The data word to be reflected.
|
|
* \param data_len The width of \a data expressed in number of bits.
|
|
* \return The reflected data.
|
|
*****************************************************************************/
|
|
static inline uint_fast64_t crc_reflect(uint_fast64_t data, size_t data_len) {
|
|
/* only ever called for data_len == 64 in this codebase
|
|
*
|
|
* Borrowed from bit twiddling hacks, original in the public domain.
|
|
* https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel
|
|
* Extended to 64 bits, and added byteswap for final 3 steps.
|
|
* 16-30x 64-bit operations, no comparisons (16 for native byteswap, 30 for pure C)
|
|
*/
|
|
|
|
assert(data_len <= 64);
|
|
/* swap odd and even bits */
|
|
data = ((data >> 1) & 0x5555555555555555ULL) | ((data & 0x5555555555555555ULL) << 1);
|
|
/* swap consecutive pairs */
|
|
data = ((data >> 2) & 0x3333333333333333ULL) | ((data & 0x3333333333333333ULL) << 2);
|
|
/* swap nibbles ... */
|
|
data = ((data >> 4) & 0x0F0F0F0F0F0F0F0FULL) | ((data & 0x0F0F0F0F0F0F0F0FULL) << 4);
|
|
#if defined(__GNUC__) || defined(__clang__)
|
|
data = __builtin_bswap64(data);
|
|
#else
|
|
/* swap bytes */
|
|
data = ((data >> 8) & 0x00FF00FF00FF00FFULL) | ((data & 0x00FF00FF00FF00FFULL) << 8);
|
|
/* swap 2-byte long pairs */
|
|
data = ( data >> 16 & 0xFFFF0000FFFFULL) | ((data & 0xFFFF0000FFFFULL) << 16);
|
|
/* swap 4-byte quads */
|
|
data = ( data >> 32 & 0xFFFFFFFFULL) | ((data & 0xFFFFFFFFULL) << 32);
|
|
#endif
|
|
/* adjust for non-64-bit reversals */
|
|
return data >> (64 - data_len);
|
|
}
|
|
|
|
/**
|
|
* Update the crc value with new data.
|
|
*
|
|
* \param crc The current crc value.
|
|
* \param data Pointer to a buffer of \a data_len bytes.
|
|
* \param data_len Number of bytes in the \a data buffer.
|
|
* \return The updated crc value.
|
|
******************************************************************************/
|
|
uint64_t _crc64(uint_fast64_t crc, const void *in_data, const uint64_t len) {
|
|
const uint8_t *data = in_data;
|
|
unsigned long long bit;
|
|
|
|
for (uint64_t offset = 0; offset < len; offset++) {
|
|
uint8_t c = data[offset];
|
|
for (uint_fast8_t i = 0x01; i & 0xff; i <<= 1) {
|
|
bit = crc & 0x8000000000000000;
|
|
if (c & i) {
|
|
bit = !bit;
|
|
}
|
|
|
|
crc <<= 1;
|
|
if (bit) {
|
|
crc ^= POLY;
|
|
}
|
|
}
|
|
|
|
crc &= 0xffffffffffffffff;
|
|
}
|
|
|
|
crc = crc & 0xffffffffffffffff;
|
|
return crc_reflect(crc, 64) ^ 0x0000000000000000;
|
|
}
|
|
|
|
/******************** END GENERATED PYCRC FUNCTIONS ********************/
|
|
|
|
/* Initializes the 16KB lookup tables. */
|
|
void crc64_init(void) {
|
|
crcspeed64native_init(_crc64, crc64_table);
|
|
}
|
|
|
|
/* Compute crc64 */
|
|
uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l) {
|
|
return crcspeed64native(crc64_table, crc, (void *) s, l);
|
|
}
|