Lines Matching defs:input_len

42                                    const uint8_t *input, size_t input_len) {
44   if (take > input_len) {
45     take = input_len;
120                                size_t input_len) {
122     size_t take = chunk_state_fill_buf(self, input, input_len);
124     input_len -= take;
125     if (input_len > 0) {
135   while (input_len > BLAKE3_BLOCK_LEN) {
141     input_len -= BLAKE3_BLOCK_LEN;
144   chunk_state_fill_buf(self, input, input_len);
173 INLINE size_t compress_chunks_parallel(const uint8_t *input, size_t input_len,
178   assert(0 < input_len);
179   assert(input_len <= MAX_SIMD_DEGREE * BLAKE3_CHUNK_LEN);
185   while (input_len - input_position >= BLAKE3_CHUNK_LEN) {
197   if (input_len > input_position) {
203                        input_len - input_position);
270                                            size_t input_len,
278   if (input_len <= blake3_simd_degree() * BLAKE3_CHUNK_LEN) {
279     return compress_chunks_parallel(input, input_len, key, chunk_counter, flags,
287   size_t left_input_len = left_len(input_len);
288   size_t right_input_len = input_len - left_input_len;
339     const uint8_t *input, size_t input_len, const uint32_t key[8],
342   assert(input_len > BLAKE3_CHUNK_LEN);
346   size_t num_cvs = blake3_compress_subtree_wide(input, input_len, key,
461                           size_t input_len) {
466   if (input_len == 0) {
476     if (take > input_len) {
477       take = input_len;
481     input_len -= take;
484     if (input_len > 0) {
508   while (input_len > BLAKE3_CHUNK_LEN) {
509     size_t subtree_len = round_down_to_power_of_2(input_len);
554     input_len -= subtree_len;
563   if (input_len > 0) {
564     chunk_state_update(&self->chunk, input_bytes, input_len);