| 356 | |
| 357 | |
| 358 | int blake2b_update( blake2b_state *S, const uint8_t *in, size_t inlen ) |
| 359 | { |
| 360 | while( inlen > 0 ) |
| 361 | { |
| 362 | uint32_t left = S->buflen; |
| 363 | uint32_t fill = 2 * BLAKE2B_BLOCKBYTES - left; |
| 364 | |
| 365 | if( inlen > fill ) |
| 366 | { |
| 367 | memcpy( S->buf + left, in, fill ); // Fill buffer |
| 368 | S->buflen += fill; |
| 369 | blake2b_increment_counter( S, BLAKE2B_BLOCKBYTES ); |
| 370 | blake2b_compress( S, S->buf ); // Compress |
| 371 | memcpy( S->buf, S->buf + BLAKE2B_BLOCKBYTES, BLAKE2B_BLOCKBYTES ); // Shift buffer left |
| 372 | S->buflen -= BLAKE2B_BLOCKBYTES; |
| 373 | in += fill; |
| 374 | inlen -= fill; |
| 375 | } |
| 376 | else // inlen <= fill |
| 377 | { |
| 378 | memcpy( S->buf + left, in, inlen ); |
| 379 | S->buflen += ( uint32_t ) inlen; // Be lazy, do not compress |
| 380 | in += inlen; |
| 381 | inlen -= inlen; |
| 382 | } |
| 383 | } |
| 384 | |
| 385 | return 0; |
| 386 | } |
| 387 | |
| 388 | |
| 389 | int blake2b_final( blake2b_state *S, uint8_t *out, size_t outlen ) |
no test coverage detected