Searched refs:subtree_len (Results 1 – 2 of 2) sorted by path
511 size_t subtree_len = round_down_to_power_of_2(input_len); in llvm_blake3_hasher_update() local528 while ((((uint64_t)(subtree_len - 1)) & count_so_far) != 0) { in llvm_blake3_hasher_update()529 subtree_len /= 2; in llvm_blake3_hasher_update()533 uint64_t subtree_chunks = subtree_len / BLAKE3_CHUNK_LEN; in llvm_blake3_hasher_update()534 if (subtree_len <= BLAKE3_CHUNK_LEN) { in llvm_blake3_hasher_update()538 chunk_state_update(&chunk_state, input_bytes, subtree_len); in llvm_blake3_hasher_update()547 compress_subtree_to_parent_node(input_bytes, subtree_len, self->key, in llvm_blake3_hasher_update()555 input_bytes += subtree_len; in llvm_blake3_hasher_update()556 input_len -= subtree_len; in llvm_blake3_hasher_update()
583 size_t subtree_len = round_down_to_power_of_2(input_len); in Blake3_Update2() local606 while ((((uint64_t)(subtree_len - 1)) & count_so_far) != 0) { in Blake3_Update2()607 subtree_len /= 2; in Blake3_Update2()614 uint64_t subtree_chunks = subtree_len / BLAKE3_CHUNK_LEN; in Blake3_Update2()615 if (subtree_len <= BLAKE3_CHUNK_LEN) { in Blake3_Update2()621 subtree_len); in Blake3_Update2()634 subtree_len, ctx->key, ctx-> chunk.chunk_counter, in Blake3_Update2()641 input_bytes += subtree_len; in Blake3_Update2()642 input_len -= subtree_len; in Blake3_Update2()