Searched refs:left_n (Results 1 – 2 of 2) sorted by relevance
311 size_t left_n = blake3_compress_subtree_wide(input, left_input_len, key, in blake3_compress_subtree_wide() local319 if (left_n == 1) { in blake3_compress_subtree_wide()325 size_t num_chaining_values = left_n + right_n; in blake3_compress_subtree_wide()
374 size_t left_n = blake3_compress_subtree_wide(ops, input, left_input_len, in blake3_compress_subtree_wide() local385 if (left_n == 1) { in blake3_compress_subtree_wide()391 size_t num_chaining_values = left_n + right_n; in blake3_compress_subtree_wide()