Lines Matching +full:0 +full:- +full:9 +full:a +full:- +full:b
1 // SPDX-License-Identifier: GPL-2.0 OR MIT
3 * Copyright (C) 2015-2019 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
20 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
21 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
22 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
23 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
24 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
25 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
26 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
27 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
28 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
29 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
35 state->t[0] += inc; in blake2s_increment_counter()
36 state->t[1] += (state->t[0] < inc); in blake2s_increment_counter()
50 while (nblocks > 0) { in blake2s_compress_generic()
54 memcpy(v, state->h, 32); in blake2s_compress_generic()
56 v[ 9] = BLAKE2S_IV1; in blake2s_compress_generic()
59 v[12] = BLAKE2S_IV4 ^ state->t[0]; in blake2s_compress_generic()
60 v[13] = BLAKE2S_IV5 ^ state->t[1]; in blake2s_compress_generic()
61 v[14] = BLAKE2S_IV6 ^ state->f[0]; in blake2s_compress_generic()
62 v[15] = BLAKE2S_IV7 ^ state->f[1]; in blake2s_compress_generic()
64 #define G(r, i, a, b, c, d) do { \ in blake2s_compress_generic() argument
65 a += b + m[blake2s_sigma[r][2 * i + 0]]; \ in blake2s_compress_generic()
66 d = ror32(d ^ a, 16); \ in blake2s_compress_generic()
68 b = ror32(b ^ c, 12); \ in blake2s_compress_generic()
69 a += b + m[blake2s_sigma[r][2 * i + 1]]; \ in blake2s_compress_generic()
70 d = ror32(d ^ a, 8); \ in blake2s_compress_generic()
72 b = ror32(b ^ c, 7); \ in blake2s_compress_generic()
73 } while (0) in blake2s_compress_generic()
76 G(r, 0, v[0], v[ 4], v[ 8], v[12]); \ in blake2s_compress_generic()
77 G(r, 1, v[1], v[ 5], v[ 9], v[13]); \ in blake2s_compress_generic()
80 G(r, 4, v[0], v[ 5], v[10], v[15]); \ in blake2s_compress_generic()
83 G(r, 7, v[3], v[ 4], v[ 9], v[14]); \ in blake2s_compress_generic()
84 } while (0) in blake2s_compress_generic()
85 ROUND(0); in blake2s_compress_generic()
94 ROUND(9); in blake2s_compress_generic()
99 for (i = 0; i < 8; ++i) in blake2s_compress_generic()
100 state->h[i] ^= v[i] ^ v[i + 8]; in blake2s_compress_generic()
103 --nblocks; in blake2s_compress_generic()
115 state->f[0] = -1; in blake2s_set_lastblock()
120 const size_t fill = BLAKE2S_BLOCK_SIZE - state->buflen; in blake2s_update()
125 memcpy(state->buf + state->buflen, in, fill); in blake2s_update()
126 blake2s_compress(state, state->buf, 1, BLAKE2S_BLOCK_SIZE); in blake2s_update()
127 state->buflen = 0; in blake2s_update()
129 inlen -= fill; in blake2s_update()
133 blake2s_compress(state, in, nblocks - 1, BLAKE2S_BLOCK_SIZE); in blake2s_update()
134 in += BLAKE2S_BLOCK_SIZE * (nblocks - 1); in blake2s_update()
135 inlen -= BLAKE2S_BLOCK_SIZE * (nblocks - 1); in blake2s_update()
137 memcpy(state->buf + state->buflen, in, inlen); in blake2s_update()
138 state->buflen += inlen; in blake2s_update()
146 memset(state->buf + state->buflen, 0, in blake2s_final()
147 BLAKE2S_BLOCK_SIZE - state->buflen); /* Padding */ in blake2s_final()
148 blake2s_compress(state, state->buf, 1, state->buflen); in blake2s_final()
149 cpu_to_le32_array(state->h, ARRAY_SIZE(state->h)); in blake2s_final()
150 memcpy(out, state->h, state->outlen); in blake2s_final()
159 return 0; in blake2s_mod_init()
165 MODULE_AUTHOR("Jason A. Donenfeld <Jason@zx2c4.com>");