Home
last modified time | relevance | path

Searched refs:hlen (Results 1 – 25 of 1708) sorted by relevance

12345678910>>...69

/dports/math/e-antic/flint2-ae7ec89/fmpz_poly/
H A Dcompose_divconquer.c102 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _fmpz_poly_compose_divconquer()
121 hlen[i] = 0; in _fmpz_poly_compose_divconquer()
140 hlen[i] = 1; in _fmpz_poly_compose_divconquer()
148 hlen[i] = 1; in _fmpz_poly_compose_divconquer()
157 if (hlen[1] > 0) in _fmpz_poly_compose_divconquer()
162 hlen[0] = FLINT_MAX(hlen[0], templen); in _fmpz_poly_compose_divconquer()
170 hlen[i] = hlen[2*i + 1] + powlen - 1; in _fmpz_poly_compose_divconquer()
173 _fmpz_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i]); in _fmpz_poly_compose_divconquer()
174 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _fmpz_poly_compose_divconquer()
179 hlen[i] = hlen[2*i]; in _fmpz_poly_compose_divconquer()
[all …]
H A Dgcd_modular.c29 slong i, n, n0, unlucky, hlen, bound; in _fmpz_poly_gcd_modular() local
164 if (hlen == 1) /* gcd is 1 */ in _fmpz_poly_gcd_modular()
171 if (hlen > n + 1) /* discard this prime */ in _fmpz_poly_gcd_modular()
181 h_inv = n_invmod(h[hlen - 1], mod.n); in _fmpz_poly_gcd_modular()
191 _fmpz_vec_zero(res + hlen, len2 - hlen); in _fmpz_poly_gcd_modular()
204 _fmpz_vec_content(hc, res, hlen); in _fmpz_poly_gcd_modular()
238 _fmpz_poly_CRT_ui(res, res, hlen, modulus, h, hlen, mod.n, mod.ninv, 1); in _fmpz_poly_gcd_modular()
241 new_bits = _fmpz_vec_max_bits(res, hlen); in _fmpz_poly_gcd_modular()
248 _fmpz_vec_content(hc, res, hlen); in _fmpz_poly_gcd_modular()
251 if (fmpz_sgn(res + hlen - 1) < 0) in _fmpz_poly_gcd_modular()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/
H A Dcompose_divconquer.c107 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _nmod_poly_compose_divconquer()
126 hlen[i] = 0; in _nmod_poly_compose_divconquer()
145 hlen[i] = 1; in _nmod_poly_compose_divconquer()
153 hlen[i] = 1; in _nmod_poly_compose_divconquer()
162 if (hlen[1] > 0) in _nmod_poly_compose_divconquer()
167 hlen[0] = FLINT_MAX(hlen[0], templen); in _nmod_poly_compose_divconquer()
175 hlen[i] = hlen[2*i + 1] + powlen - 1; in _nmod_poly_compose_divconquer()
178 _nmod_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], mod); in _nmod_poly_compose_divconquer()
179 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _nmod_poly_compose_divconquer()
184 hlen[i] = hlen[2*i]; in _nmod_poly_compose_divconquer()
[all …]
H A Dcompose_series_divconquer.c57 hlen[0] = hlen[1] = FLINT_MIN(N, ((1 << k) - 1) * (len2 - 1) + 1); in _nmod_poly_compose_series_divconquer()
63 hlen[n] = t; in _nmod_poly_compose_series_divconquer()
77 hlen[i] = 0; in _nmod_poly_compose_series_divconquer()
96 hlen[i] = 1; in _nmod_poly_compose_series_divconquer()
104 hlen[i] = 1; in _nmod_poly_compose_series_divconquer()
118 hlen[0] = FLINT_MAX(hlen[0], templen); in _nmod_poly_compose_series_divconquer()
125 hlen[i] = FLINT_MIN(N, hlen[2*i + 1] + powlen - 1); in _nmod_poly_compose_series_divconquer()
133 _nmod_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], mod); in _nmod_poly_compose_series_divconquer()
134 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _nmod_poly_compose_series_divconquer()
138 hlen[i] = FLINT_MIN(N, hlen[2*i]); in _nmod_poly_compose_series_divconquer()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_poly/
H A Dcompose_divconquer.c102 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _fmpz_poly_compose_divconquer()
121 hlen[i] = 0; in _fmpz_poly_compose_divconquer()
140 hlen[i] = 1; in _fmpz_poly_compose_divconquer()
148 hlen[i] = 1; in _fmpz_poly_compose_divconquer()
157 if (hlen[1] > 0) in _fmpz_poly_compose_divconquer()
162 hlen[0] = FLINT_MAX(hlen[0], templen); in _fmpz_poly_compose_divconquer()
170 hlen[i] = hlen[2*i + 1] + powlen - 1; in _fmpz_poly_compose_divconquer()
173 _fmpz_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i]); in _fmpz_poly_compose_divconquer()
174 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _fmpz_poly_compose_divconquer()
179 hlen[i] = hlen[2*i]; in _fmpz_poly_compose_divconquer()
[all …]
/dports/math/e-antic/flint2-ae7ec89/nmod_poly/
H A Dcompose_divconquer.c107 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _nmod_poly_compose_divconquer()
126 hlen[i] = 0; in _nmod_poly_compose_divconquer()
145 hlen[i] = 1; in _nmod_poly_compose_divconquer()
153 hlen[i] = 1; in _nmod_poly_compose_divconquer()
162 if (hlen[1] > 0) in _nmod_poly_compose_divconquer()
167 hlen[0] = FLINT_MAX(hlen[0], templen); in _nmod_poly_compose_divconquer()
175 hlen[i] = hlen[2*i + 1] + powlen - 1; in _nmod_poly_compose_divconquer()
178 _nmod_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], mod); in _nmod_poly_compose_divconquer()
179 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _nmod_poly_compose_divconquer()
184 hlen[i] = hlen[2*i]; in _nmod_poly_compose_divconquer()
[all …]
H A Dcompose_series_divconquer.c57 hlen[0] = hlen[1] = FLINT_MIN(N, ((1 << k) - 1) * (len2 - 1) + 1); in _nmod_poly_compose_series_divconquer()
63 hlen[n] = t; in _nmod_poly_compose_series_divconquer()
77 hlen[i] = 0; in _nmod_poly_compose_series_divconquer()
96 hlen[i] = 1; in _nmod_poly_compose_series_divconquer()
104 hlen[i] = 1; in _nmod_poly_compose_series_divconquer()
118 hlen[0] = FLINT_MAX(hlen[0], templen); in _nmod_poly_compose_series_divconquer()
125 hlen[i] = FLINT_MIN(N, hlen[2*i + 1] + powlen - 1); in _nmod_poly_compose_series_divconquer()
133 _nmod_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], mod); in _nmod_poly_compose_series_divconquer()
134 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _nmod_poly_compose_series_divconquer()
138 hlen[i] = FLINT_MIN(N, hlen[2*i]); in _nmod_poly_compose_series_divconquer()
[all …]
/dports/math/flint2/flint-2.8.4/nmod_poly/
H A Dcompose_divconquer.c107 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _nmod_poly_compose_divconquer()
126 hlen[i] = 0; in _nmod_poly_compose_divconquer()
145 hlen[i] = 1; in _nmod_poly_compose_divconquer()
153 hlen[i] = 1; in _nmod_poly_compose_divconquer()
162 if (hlen[1] > 0) in _nmod_poly_compose_divconquer()
167 hlen[0] = FLINT_MAX(hlen[0], templen); in _nmod_poly_compose_divconquer()
175 hlen[i] = hlen[2*i + 1] + powlen - 1; in _nmod_poly_compose_divconquer()
178 _nmod_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], mod); in _nmod_poly_compose_divconquer()
179 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _nmod_poly_compose_divconquer()
184 hlen[i] = hlen[2*i]; in _nmod_poly_compose_divconquer()
[all …]
H A Dcompose_series_divconquer.c57 hlen[0] = hlen[1] = FLINT_MIN(N, ((1 << k) - 1) * (len2 - 1) + 1); in _nmod_poly_compose_series_divconquer()
63 hlen[n] = t; in _nmod_poly_compose_series_divconquer()
77 hlen[i] = 0; in _nmod_poly_compose_series_divconquer()
96 hlen[i] = 1; in _nmod_poly_compose_series_divconquer()
104 hlen[i] = 1; in _nmod_poly_compose_series_divconquer()
118 hlen[0] = FLINT_MAX(hlen[0], templen); in _nmod_poly_compose_series_divconquer()
125 hlen[i] = FLINT_MIN(N, hlen[2*i + 1] + powlen - 1); in _nmod_poly_compose_series_divconquer()
133 _nmod_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], mod); in _nmod_poly_compose_series_divconquer()
134 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _nmod_poly_compose_series_divconquer()
138 hlen[i] = FLINT_MIN(N, hlen[2*i]); in _nmod_poly_compose_series_divconquer()
[all …]
H A Dexp_series.c62 hlen = FLINT_MIN(hlen, n); in _nmod_poly_exp_series_newton()
65 hprime = _nmod_vec_init(hlen - 1); in _nmod_poly_exp_series_newton()
82 l = FLINT_MIN(hlen, n) - 1; in _nmod_poly_exp_series_newton()
110 hlen = FLINT_MIN(hlen, n); in _nmod_poly_exp_series()
112 if (hlen >= 2 && n > 2 && _nmod_vec_is_zero(h + 1, hlen - 2)) in _nmod_poly_exp_series()
113 _nmod_poly_exp_series_monomial_ui(f, h[hlen - 1], hlen - 1, n, mod); in _nmod_poly_exp_series()
123 hlen = FLINT_MIN(hlen, n); in _nmod_poly_exp_expinv_series()
125 if (hlen < NMOD_POLY_NEWTON_EXP_CUTOFF) in _nmod_poly_exp_expinv_series()
139 slong hlen = h->length; in nmod_poly_exp_series() local
141 if (hlen > 0 && h->coeffs[0] != UWORD(0)) in nmod_poly_exp_series()
[all …]
/dports/math/flint2/flint-2.8.4/fmpz_poly/
H A Dcompose_divconquer.c102 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _fmpz_poly_compose_divconquer()
121 hlen[i] = 0; in _fmpz_poly_compose_divconquer()
140 hlen[i] = 1; in _fmpz_poly_compose_divconquer()
148 hlen[i] = 1; in _fmpz_poly_compose_divconquer()
157 if (hlen[1] > 0) in _fmpz_poly_compose_divconquer()
162 hlen[0] = FLINT_MAX(hlen[0], templen); in _fmpz_poly_compose_divconquer()
170 hlen[i] = hlen[2*i + 1] + powlen - 1; in _fmpz_poly_compose_divconquer()
173 _fmpz_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i]); in _fmpz_poly_compose_divconquer()
174 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _fmpz_poly_compose_divconquer()
179 hlen[i] = hlen[2*i]; in _fmpz_poly_compose_divconquer()
[all …]
/dports/math/arb/arb-2.21.1/arb_poly/
H A Dcompose_divconquer.c47 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _arb_poly_compose_divconquer()
58 alloc += hlen[i]; in _arb_poly_compose_divconquer()
66 hlen[i] = 0; in _arb_poly_compose_divconquer()
85 hlen[i] = 1; in _arb_poly_compose_divconquer()
93 hlen[i] = 1; in _arb_poly_compose_divconquer()
107 hlen[0] = FLINT_MAX(hlen[0], templen); in _arb_poly_compose_divconquer()
115 hlen[i] = hlen[2*i + 1] + powlen - 1; in _arb_poly_compose_divconquer()
118 _arb_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], prec); in _arb_poly_compose_divconquer()
119 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _arb_poly_compose_divconquer()
124 hlen[i] = hlen[2*i]; in _arb_poly_compose_divconquer()
[all …]
H A Dsinc_series.c17 hlen = FLINT_MIN(hlen, n); in _arb_poly_sinc_series()
19 if (hlen == 1) in _arb_poly_sinc_series()
29 u = _arb_vec_init(hlen); in _arb_poly_sinc_series()
31 _arb_vec_set(u, h, hlen); in _arb_poly_sinc_series()
35 _arb_poly_sin_series(t, u, hlen, n + 1, prec); in _arb_poly_sinc_series()
40 _arb_poly_sin_series(t, u, hlen, n, prec); in _arb_poly_sinc_series()
41 _arb_poly_div_series(g, t, n, u, hlen, n, prec); in _arb_poly_sinc_series()
45 _arb_vec_clear(u, hlen); in _arb_poly_sinc_series()
52 slong hlen = h->length; in arb_poly_sinc_series() local
60 if (hlen == 0) in arb_poly_sinc_series()
[all …]
/dports/math/arb/arb-2.21.1/acb_poly/
H A Dcompose_divconquer.c47 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _acb_poly_compose_divconquer()
58 alloc += hlen[i]; in _acb_poly_compose_divconquer()
66 hlen[i] = 0; in _acb_poly_compose_divconquer()
85 hlen[i] = 1; in _acb_poly_compose_divconquer()
93 hlen[i] = 1; in _acb_poly_compose_divconquer()
107 hlen[0] = FLINT_MAX(hlen[0], templen); in _acb_poly_compose_divconquer()
115 hlen[i] = hlen[2*i + 1] + powlen - 1; in _acb_poly_compose_divconquer()
118 _acb_poly_add(h[i], h[i], hlen[i], h[2*i], hlen[2*i], prec); in _acb_poly_compose_divconquer()
119 hlen[i] = FLINT_MAX(hlen[i], hlen[2*i]); in _acb_poly_compose_divconquer()
124 hlen[i] = hlen[2*i]; in _acb_poly_compose_divconquer()
[all …]
H A Dsinc_series.c17 hlen = FLINT_MIN(hlen, n); in _acb_poly_sinc_series()
19 if (hlen == 1) in _acb_poly_sinc_series()
29 u = _acb_vec_init(hlen); in _acb_poly_sinc_series()
31 _acb_vec_set(u, h, hlen); in _acb_poly_sinc_series()
35 _acb_poly_sin_series(t, u, hlen, n + 1, prec); in _acb_poly_sinc_series()
40 _acb_poly_sin_series(t, u, hlen, n, prec); in _acb_poly_sinc_series()
41 _acb_poly_div_series(g, t, n, u, hlen, n, prec); in _acb_poly_sinc_series()
45 _acb_vec_clear(u, hlen); in _acb_poly_sinc_series()
52 slong hlen = h->length; in acb_poly_sinc_series() local
60 if (hlen == 0) in acb_poly_sinc_series()
[all …]
/dports/net/tcpdump/tcpdump-4.99.1/
H A Dprint-mobility.c247 hlen = IP6M_MINLEN; in mobility_print()
258 hlen += 8; in mobility_print()
270 hlen += 8; in mobility_print()
277 hlen += 8; in mobility_print()
293 hlen += 1; in mobility_print()
295 hlen += 1; in mobility_print()
298 hlen += 2; in mobility_print()
308 hlen += 2; in mobility_print()
311 hlen += 2; in mobility_print()
318 hlen += 16; in mobility_print()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq_poly_templates/
H A Dcompose_divconquer.c46 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _TEMPLATE()
57 alloc += hlen[i]; in _TEMPLATE()
66 hlen[i] = 0; in _TEMPLATE()
86 hlen[i] = 1; in _TEMPLATE()
94 hlen[i] = 1; in _TEMPLATE()
108 hlen[0] = FLINT_MAX(hlen[0], templen); in _TEMPLATE()
117 hlen[i] = hlen[2 * i + 1] + powlen - 1; in _TEMPLATE()
123 hlen[i] = FLINT_MAX(hlen[i], hlen[2 * i]); in _TEMPLATE()
128 hlen[i] = hlen[2 * i]; in _TEMPLATE()
141 _TEMPLATE(T, poly_add) (rop, rop, hlen[0], h[0], hlen[0], ctx); in _TEMPLATE()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fq_poly_templates/
H A Dcompose_divconquer.c46 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _TEMPLATE()
57 alloc += hlen[i]; in _TEMPLATE()
66 hlen[i] = 0; in _TEMPLATE()
86 hlen[i] = 1; in _TEMPLATE()
94 hlen[i] = 1; in _TEMPLATE()
108 hlen[0] = FLINT_MAX(hlen[0], templen); in _TEMPLATE()
117 hlen[i] = hlen[2 * i + 1] + powlen - 1; in _TEMPLATE()
123 hlen[i] = FLINT_MAX(hlen[i], hlen[2 * i]); in _TEMPLATE()
128 hlen[i] = hlen[2 * i]; in _TEMPLATE()
141 _TEMPLATE(T, poly_add) (rop, rop, hlen[0], h[0], hlen[0], ctx); in _TEMPLATE()
[all …]
/dports/math/flint2/flint-2.8.4/fq_poly_templates/
H A Dcompose_divconquer.c46 hlen[0] = hlen[1] = ((1 << k) - 1) * (len2 - 1) + 1; in _TEMPLATE()
57 alloc += hlen[i]; in _TEMPLATE()
66 hlen[i] = 0; in _TEMPLATE()
86 hlen[i] = 1; in _TEMPLATE()
94 hlen[i] = 1; in _TEMPLATE()
108 hlen[0] = FLINT_MAX(hlen[0], templen); in _TEMPLATE()
117 hlen[i] = hlen[2 * i + 1] + powlen - 1; in _TEMPLATE()
123 hlen[i] = FLINT_MAX(hlen[i], hlen[2 * i]); in _TEMPLATE()
128 hlen[i] = hlen[2 * i]; in _TEMPLATE()
141 _TEMPLATE(T, poly_add) (rop, rop, hlen[0], h[0], hlen[0], ctx); in _TEMPLATE()
[all …]
/dports/security/libgcrypt/libgcrypt-1.9.4/cipher/
H A Drsa-common.c478 size_t hlen; in _gcry_rsa_oaep_encode() local
545 rc = mgf1 (dmask, nframe - hlen - 1, frame+1, hlen, algo); in _gcry_rsa_oaep_encode()
568 rc = mgf1 (smask, hlen, frame + 1 + hlen, nframe - hlen - 1, algo); in _gcry_rsa_oaep_encode()
636 lhash = xtrymalloc (hlen); in _gcry_rsa_oaep_decode()
676 db = seed + hlen; in _gcry_rsa_oaep_decode()
803 buflen = 8 + hlen + saltlen + (emlen - hlen - 1); in _gcry_rsa_pss_encode()
811 salt = mhash + hlen; in _gcry_rsa_pss_encode()
816 if (valuelen != hlen) in _gcry_rsa_pss_encode()
867 mgf1 (dbmask, emlen - hlen - 1, h, hlen, algo); in _gcry_rsa_pss_encode()
943 buflen += hlen; in _gcry_rsa_pss_verify()
[all …]
H A Ddsa-common.c220 if (!qbits || !h1 || !hlen) in _gcry_dsa_gen_rfc6979_k()
227 V = xtrymalloc (hlen); in _gcry_dsa_gen_rfc6979_k()
233 for (i=0; i < hlen; i++) in _gcry_dsa_gen_rfc6979_k()
237 K = xtrycalloc (1, hlen); in _gcry_dsa_gen_rfc6979_k()
261 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
271 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
278 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
288 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
306 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
311 tbits += 8*hlen; in _gcry_dsa_gen_rfc6979_k()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/libgcrypt/cipher/
H A Drsa-common.c478 size_t hlen; in _gcry_rsa_oaep_encode() local
545 rc = mgf1 (dmask, nframe - hlen - 1, frame+1, hlen, algo); in _gcry_rsa_oaep_encode()
568 rc = mgf1 (smask, hlen, frame + 1 + hlen, nframe - hlen - 1, algo); in _gcry_rsa_oaep_encode()
636 lhash = xtrymalloc (hlen); in _gcry_rsa_oaep_decode()
676 db = seed + hlen; in _gcry_rsa_oaep_decode()
803 buflen = 8 + hlen + saltlen + (emlen - hlen - 1); in _gcry_rsa_pss_encode()
811 salt = mhash + hlen; in _gcry_rsa_pss_encode()
816 if (valuelen != hlen) in _gcry_rsa_pss_encode()
867 mgf1 (dbmask, emlen - hlen - 1, h, hlen, algo); in _gcry_rsa_pss_encode()
943 buflen += hlen; in _gcry_rsa_pss_verify()
[all …]
H A Ddsa-common.c220 if (!qbits || !h1 || !hlen) in _gcry_dsa_gen_rfc6979_k()
227 V = xtrymalloc (hlen); in _gcry_dsa_gen_rfc6979_k()
233 for (i=0; i < hlen; i++) in _gcry_dsa_gen_rfc6979_k()
237 K = xtrycalloc (1, hlen); in _gcry_dsa_gen_rfc6979_k()
261 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
271 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
278 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
288 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
306 _gcry_md_write (hd, V, hlen); in _gcry_dsa_gen_rfc6979_k()
311 tbits += 8*hlen; in _gcry_dsa_gen_rfc6979_k()
[all …]
/dports/games/retroarch/RetroArch-1.9.7/deps/bearssl-0.6/src/rand/
H A Dhmac_drbg.c32 size_t hlen; in br_hmac_drbg_init() local
36 memset(ctx->K, 0x00, hlen); in br_hmac_drbg_init()
37 memset(ctx->V, 0x01, hlen); in br_hmac_drbg_init()
49 size_t hlen; in br_hmac_drbg_generate() local
54 hlen = br_digest_size(dig); in br_hmac_drbg_generate()
61 br_hmac_update(&hc, ctx->V, hlen); in br_hmac_drbg_generate()
63 clen = hlen; in br_hmac_drbg_generate()
80 br_hmac_update(&hc, ctx->V, hlen); in br_hmac_drbg_generate()
86 br_hmac_update(&hc, ctx->V, hlen); in br_hmac_drbg_generate()
97 size_t hlen; in br_hmac_drbg_update() local
[all …]
/dports/security/bearssl/bearssl-0.6/src/rand/
H A Dhmac_drbg.c32 size_t hlen; in br_hmac_drbg_init() local
36 memset(ctx->K, 0x00, hlen); in br_hmac_drbg_init()
37 memset(ctx->V, 0x01, hlen); in br_hmac_drbg_init()
49 size_t hlen; in br_hmac_drbg_generate() local
54 hlen = br_digest_size(dig); in br_hmac_drbg_generate()
61 br_hmac_update(&hc, ctx->V, hlen); in br_hmac_drbg_generate()
63 clen = hlen; in br_hmac_drbg_generate()
80 br_hmac_update(&hc, ctx->V, hlen); in br_hmac_drbg_generate()
86 br_hmac_update(&hc, ctx->V, hlen); in br_hmac_drbg_generate()
97 size_t hlen; in br_hmac_drbg_update() local
[all …]

12345678910>>...69