Searched refs:subtree_len (Results 1 - 2 of 2) sorted by relevance

/freebsd-current/contrib/llvm-project/llvm/lib/Support/BLAKE3/
H A Dblake3.c511 size_t subtree_len = round_down_to_power_of_2(input_len); local
513 // Shrink the subtree_len until it evenly divides the count so far. We know
514 // that subtree_len itself is a power of 2, so we can use a bitmasking
517 // typical, this loop condition will always fail, and subtree_len will
520 // An aside: We don't have to shrink subtree_len quite this much. For
528 while ((((uint64_t)(subtree_len - 1)) & count_so_far) != 0) {
529 subtree_len /= 2;
531 // The shrunken subtree_len might now be 1 chunk long. If so, hash that one
533 uint64_t subtree_chunks = subtree_len / BLAKE3_CHUNK_LEN;
534 if (subtree_len <
[all...]
/freebsd-current/sys/contrib/openzfs/module/icp/algs/blake3/
H A Dblake3.c583 size_t subtree_len = round_down_to_power_of_2(input_len); local
587 * Shrink the subtree_len until it evenly divides the count so
588 * far. We know that subtree_len itself is a power of 2, so we
593 * subtree_len will always be the full length of the input.)
595 * An aside: We don't have to shrink subtree_len quite this
606 while ((((uint64_t)(subtree_len - 1)) & count_so_far) != 0) {
607 subtree_len /= 2;
610 * The shrunken subtree_len might now be 1 chunk long. If so,
614 uint64_t subtree_chunks = subtree_len / BLAKE3_CHUNK_LEN;
615 if (subtree_len <
[all...]

Completed in 146 milliseconds