Lines Matching defs:subtree_len

509     size_t subtree_len = round_down_to_power_of_2(input_len);
511     // Shrink the subtree_len until it evenly divides the count so far. We know
512     // that subtree_len itself is a power of 2, so we can use a bitmasking
515     // typical, this loop condition will always fail, and subtree_len will
518     // An aside: We don't have to shrink subtree_len quite this much. For
526     while ((((uint64_t)(subtree_len - 1)) & count_so_far) != 0) {
527       subtree_len /= 2;
529     // The shrunken subtree_len might now be 1 chunk long. If so, hash that one
531     uint64_t subtree_chunks = subtree_len / BLAKE3_CHUNK_LEN;
532     if (subtree_len <= BLAKE3_CHUNK_LEN) {
536       chunk_state_update(&chunk_state, input_bytes, subtree_len);
545       compress_subtree_to_parent_node(input_bytes, subtree_len, self->key,
553     input_bytes += subtree_len;
554     input_len -= subtree_len;