Path: blob/main/sys/contrib/openzfs/module/icp/algs/blake3/blake3_impl.h
48676 views
// SPDX-License-Identifier: CDDL-1.01/*2* CDDL HEADER START3*4* The contents of this file are subject to the terms of the5* Common Development and Distribution License (the "License").6* You may not use this file except in compliance with the License.7*8* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE9* or https://opensource.org/licenses/CDDL-1.0.10* See the License for the specific language governing permissions11* and limitations under the License.12*13* When distributing Covered Code, include this CDDL HEADER in each14* file and include the License file at usr/src/OPENSOLARIS.LICENSE.15* If applicable, add the following below this CDDL HEADER, with the16* fields enclosed by brackets "[]" replaced with your own identifying17* information: Portions Copyright [yyyy] [name of copyright owner]18*19* CDDL HEADER END20*/2122/*23* Based on BLAKE3 v1.3.1, https://github.com/BLAKE3-team/BLAKE324* Copyright (c) 2019-2020 Samuel Neves and Jack O'Connor25* Copyright (c) 2021-2022 Tino Reichardt <[email protected]>26*/2728#ifndef BLAKE3_IMPL_H29#define BLAKE3_IMPL_H3031#ifdef __cplusplus32extern "C" {33#endif3435#include <sys/blake3.h>36#include <sys/simd.h>37#include <sys/asm_linkage.h>3839/*40* Methods used to define BLAKE3 assembler implementations41*/42typedef void (*blake3_compress_in_place_f)(uint32_t cv[8],43const uint8_t block[BLAKE3_BLOCK_LEN],44uint8_t block_len, uint64_t counter,45uint8_t flags);4647typedef void (*blake3_compress_xof_f)(const uint32_t cv[8],48const uint8_t block[BLAKE3_BLOCK_LEN], uint8_t block_len,49uint64_t counter, uint8_t flags, uint8_t out[64]);5051typedef void (*blake3_hash_many_f)(const uint8_t * const *inputs,52size_t num_inputs, size_t blocks, const uint32_t key[8],53uint64_t counter, boolean_t increment_counter, uint8_t flags,54uint8_t flags_start, uint8_t flags_end, uint8_t *out);5556typedef boolean_t (*blake3_is_supported_f)(void);5758typedef struct {59blake3_compress_in_place_f compress_in_place;60blake3_compress_xof_f compress_xof;61blake3_hash_many_f hash_many;62blake3_is_supported_f is_supported;63int degree;64const char *name;65} blake3_ops_t;6667/* return selected BLAKE3 implementation ops */68extern const blake3_ops_t *blake3_get_ops(void);6970#if defined(__x86_64)71#define MAX_SIMD_DEGREE 1672#else73#define MAX_SIMD_DEGREE 474#endif7576#define MAX_SIMD_DEGREE_OR_2 (MAX_SIMD_DEGREE > 2 ? MAX_SIMD_DEGREE : 2)7778static const uint32_t BLAKE3_IV[8] = {790x6A09E667UL, 0xBB67AE85UL, 0x3C6EF372UL, 0xA54FF53AUL,800x510E527FUL, 0x9B05688CUL, 0x1F83D9ABUL, 0x5BE0CD19UL};8182static const uint8_t BLAKE3_MSG_SCHEDULE[7][16] = {83{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},84{2, 6, 3, 10, 7, 0, 4, 13, 1, 11, 12, 5, 9, 14, 15, 8},85{3, 4, 10, 12, 13, 2, 7, 14, 6, 5, 9, 0, 11, 15, 8, 1},86{10, 7, 12, 9, 14, 3, 13, 15, 4, 0, 11, 2, 5, 8, 1, 6},87{12, 13, 9, 11, 15, 10, 14, 8, 7, 2, 5, 3, 0, 1, 6, 4},88{9, 14, 11, 5, 8, 12, 15, 1, 13, 3, 0, 10, 2, 6, 4, 7},89{11, 15, 5, 0, 1, 9, 8, 6, 14, 10, 2, 12, 3, 4, 7, 13},90};9192/* Find index of the highest set bit */93static inline unsigned int highest_one(uint64_t x) {94#if defined(__GNUC__) || defined(__clang__)95return (63 ^ __builtin_clzll(x));96#elif defined(_MSC_VER) && defined(IS_X86_64)97unsigned long index;98_BitScanReverse64(&index, x);99return (index);100#elif defined(_MSC_VER) && defined(IS_X86_32)101if (x >> 32) {102unsigned long index;103_BitScanReverse(&index, x >> 32);104return (32 + index);105} else {106unsigned long index;107_BitScanReverse(&index, x);108return (index);109}110#else111unsigned int c = 0;112if (x & 0xffffffff00000000ULL) { x >>= 32; c += 32; }113if (x & 0x00000000ffff0000ULL) { x >>= 16; c += 16; }114if (x & 0x000000000000ff00ULL) { x >>= 8; c += 8; }115if (x & 0x00000000000000f0ULL) { x >>= 4; c += 4; }116if (x & 0x000000000000000cULL) { x >>= 2; c += 2; }117if (x & 0x0000000000000002ULL) { c += 1; }118return (c);119#endif120}121122/* Count the number of 1 bits. */123static inline unsigned int popcnt(uint64_t x) {124unsigned int count = 0;125126while (x != 0) {127count += 1;128x &= x - 1;129}130131return (count);132}133134/*135* Largest power of two less than or equal to x.136* As a special case, returns 1 when x is 0.137*/138static inline uint64_t round_down_to_power_of_2(uint64_t x) {139return (1ULL << highest_one(x | 1));140}141142static inline uint32_t counter_low(uint64_t counter) {143return ((uint32_t)counter);144}145146static inline uint32_t counter_high(uint64_t counter) {147return ((uint32_t)(counter >> 32));148}149150static inline uint32_t load32(const void *src) {151const uint8_t *p = (const uint8_t *)src;152return ((uint32_t)(p[0]) << 0) | ((uint32_t)(p[1]) << 8) |153((uint32_t)(p[2]) << 16) | ((uint32_t)(p[3]) << 24);154}155156static inline void load_key_words(const uint8_t key[BLAKE3_KEY_LEN],157uint32_t key_words[8]) {158key_words[0] = load32(&key[0 * 4]);159key_words[1] = load32(&key[1 * 4]);160key_words[2] = load32(&key[2 * 4]);161key_words[3] = load32(&key[3 * 4]);162key_words[4] = load32(&key[4 * 4]);163key_words[5] = load32(&key[5 * 4]);164key_words[6] = load32(&key[6 * 4]);165key_words[7] = load32(&key[7 * 4]);166}167168static inline void store32(void *dst, uint32_t w) {169uint8_t *p = (uint8_t *)dst;170p[0] = (uint8_t)(w >> 0);171p[1] = (uint8_t)(w >> 8);172p[2] = (uint8_t)(w >> 16);173p[3] = (uint8_t)(w >> 24);174}175176static inline void store_cv_words(uint8_t bytes_out[32], uint32_t cv_words[8]) {177store32(&bytes_out[0 * 4], cv_words[0]);178store32(&bytes_out[1 * 4], cv_words[1]);179store32(&bytes_out[2 * 4], cv_words[2]);180store32(&bytes_out[3 * 4], cv_words[3]);181store32(&bytes_out[4 * 4], cv_words[4]);182store32(&bytes_out[5 * 4], cv_words[5]);183store32(&bytes_out[6 * 4], cv_words[6]);184store32(&bytes_out[7 * 4], cv_words[7]);185}186187#ifdef __cplusplus188}189#endif190191#endif /* BLAKE3_IMPL_H */192193194