! * @internal * @brief Consumes a block of data for XXH32(). * * @return the end input pointer. */

! * @internal * @brief Processes a large input for XXH3_update() and XXH3_digest_long(). * * Unlike XXH3_hashLong_internal_loop(), this can proces

! * @brief Calculates a 64-bit to 128-bit multiply, then XOR folds it. * * The reason for the separate function is to prevent passing too many stru

! * @internal * @brief Consumes a block of data for XXH64(). * * @return the end input pointer. */

! * Performs an unaligned vector load and byte swaps it on big endian. */

Performs "x[] /= y" bulk memory operation

IterateNextColumn() This implements a very light PRNG (Weyl function) to quickly generate a set of random-looking columns without replacement

! * @internal * @brief The implementation for @ref XXH32(). * * @param input , len , seed Directly passed from @ref XXH32(). * @param align Wheth

! * @internal * @brief Processes the last 0-15 bytes of @p ptr. * * There may be up to 15 bytes remaining to consume from the input. * This final

! * @internal * @brief Sets up the initial accumulator state for XXH32(). */

! * @internal * @brief Merges the accumulator lanes together for XXH32() */

! * @internal * @brief Scalar round for @ref XXH3_accumulate_512_scalar(). * * This is extracted to its own function because the NEON path uses a

! * @internal * @brief The implementation for @ref XXH64(). * * @param input , len , seed Directly passed from @ref XXH64(). * @param align Wheth

! * @internal * @brief Processes the last 0-31 bytes of @p ptr. * * There may be up to 31 bytes remaining to consume from the input. * This final

! * @internal * @brief Sets up the initial accumulator state for XXH64(). */

! * @internal * @brief Merges the accumulator lanes together for XXH64() */

gcc needs inline assembly */ Adapted from https://github.com/google/highwayhash/blob/master/highwayhash/hh_vsx.h. */

Interpolate between two values of N and corresponding counts. It works for Count1 < Count0

Returns first position with set bit (LSB = 0) Precondition: x != 0

====== Canonical representation ======*/ ! @ingroup XXH3_family */

* Assumption: `secret` size is >= XXH3_SECRET_SIZE_MIN */

For mid range keys, XXH3 uses a Mum-hash variant. */

* At very short lengths, there isn't enough input to fully hide secrets, or use * the entire secret. * * There is also only a limited amount of mix

* This is a stronger avalanche, * inspired by Pelle Evensen's rrmxmx * preferable when input has not been previously mixed */

* Frees an aligned pointer allocated by XXH_alignedMalloc(). Don't pass * normal malloc'd pointers, XXH_alignedMalloc has a specific data layout. */

* Malloc's a pointer that is always aligned to @align. * * This must be freed with `XXH_alignedFree()`. * * malloc typically guarantees 16 byte al

* In XXH3_scalarRound(), GCC and Clang have a similar codegen issue, where they * emit an excess mask and a full 64-bit multiply-add (MADD X-form).

! * A polyfill for POWER9's vec_revb(). */