Searched refs:WORD_BITS (Results 1 – 11 of 11) sorted by relevance
| /freebsd-13-stable/crypto/libecc/include/libecc/nn/ |
| HD | nn_config.h | 84 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(CURVES_MAX_P_BIT_LEN, WORD_BITS) 87 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(CURVES_MAX_CURVE_ORDER_BIT_LEN, WORD_BITS) 100 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(USER_NN_BIT_LEN, WORD_BITS) 103 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(CURVES_MAX_P_BIT_LEN, WORD_BITS) 108 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(USER_NN_BIT_LEN, WORD_BITS) 111 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(CURVES_MAX_CURVE_ORDER_BIT_LEN, WORD_BITS) 124 #if NN_MAX_BIT_LEN < MAX_BIT_LEN_ROUNDING(((8 * MAX_DIGEST_SIZE) / 2), WORD_BITS) 126 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING(((8 * MAX_DIGEST_SIZE) / 2), WORD_BITS) 143 #if NN_MAX_BIT_LEN < MAX_BIT_LEN_ROUNDING((8 * SHA512_DIGEST_SIZE), WORD_BITS) 145 #define NN_MAX_BIT_LEN MAX_BIT_LEN_ROUNDING((8 * SHA512_DIGEST_SIZE), WORD_BITS) [all …]
|
| HD | nn.h | 28 #define BIT_LEN_WORDS(nbits) (((nbits) + WORD_BITS - 1) / WORD_BITS) 36 #define BIT_LEN_CEIL(nbits) (BIT_LEN_WORDS(nbits) * WORD_BITS)
|
| /freebsd-13-stable/crypto/libecc/src/nn/ |
| HD | nn_logical.c | 50 dec = cnt / WORD_BITS; in nn_lshift_fixedlen() 51 hshift = cnt % WORD_BITS; in nn_lshift_fixedlen() 52 lshift = (bitcnt_t)(WORD_BITS - hshift); in nn_lshift_fixedlen() 114 dec = cnt / WORD_BITS; in nn_lshift() 115 hshift = cnt % WORD_BITS; in nn_lshift() 116 lshift = (bitcnt_t)(WORD_BITS - hshift); in nn_lshift() 168 dec = cnt / WORD_BITS; in nn_rshift_fixedlen() 169 lshift = cnt % WORD_BITS; in nn_rshift_fixedlen() 170 hshift = (bitcnt_t)(WORD_BITS - lshift); in nn_rshift_fixedlen() 225 dec = cnt / WORD_BITS; in nn_rshift() [all …]
|
| HD | nn_mul_redc1.c | 69 p_rounded_bitlen = (bitcnt_t)(WORD_BITS * p.wlen); in nn_compute_redc1_coefs() 75 ret = nn_modinv_2exp(&tmp_nn1, &p, WORD_BITS, &isodd); EG(ret, err); in nn_compute_redc1_coefs() 164 MUST_HAVE(((WORD_BITS * (out->wlen + 1)) <= NN_MAX_BIT_LEN), ret, err); in _nn_mul_redc1()
|
| HD | nn_modinv.c | 106 cnt = (bitcnt_t)((a.wlen + b.wlen) * WORD_BITS); in _nn_modinv_odd() 318 bitcnt_t exp_cnt = exp % WORD_BITS; in nn_modinv_2exp() 355 for (; cnt < WORD_MIN(WORD_BITS, exp); cnt = (bitcnt_t)(cnt << 1)) { in nn_modinv_2exp() 392 if (exp > WORD_BITS) { in nn_modinv_2exp()
|
| HD | nn_div.c | 203 MUST_HAVE(!(!((b->val[b->wlen - 1] >> (WORD_BITS - 1)) == WORD(1))), ret, err); in _nn_divrem_normalized() 655 MUST_HAVE((WRSHIFT((b), (WORD_BITS - 1)) == WORD(1)), ret, err); in _word_divrem() 825 p_rounded_bitlen = (bitcnt_t)(WORD_BITS * p.wlen); in nn_compute_div_coefs()
|
| /freebsd-13-stable/crypto/libecc/include/libecc/words/ |
| HD | words.h | 79 #define WLSHIFT(w, c) ((word_t)(((c) >= WORD_BITS) ? WORD(0) : (word_t)((w) << (c)))) 80 #define WRSHIFT(w, c) ((word_t)(((c) >= WORD_BITS) ? WORD(0) : (word_t)((w) >> (c)))) 95 #define WORD_HIGHBIT (WORD(1) << (WORD_BITS - 1))
|
| HD | words_16.h | 29 #define WORD_BITS (16) macro 30 #define WORD_BYTES (WORD_BITS / 8)
|
| HD | words_64.h | 29 #define WORD_BITS (64) macro 30 #define WORD_BYTES (WORD_BITS / 8)
|
| HD | words_32.h | 29 #define WORD_BITS (32) macro 30 #define WORD_BYTES (WORD_BITS / 8)
|
| /freebsd-13-stable/crypto/libecc/src/examples/basic/ |
| HD | nn_miller_rabin.c | 160 (WORD_BITS * (y.wlen + a.wlen))), ret, err); in miller_rabin() 164 MUST_HAVE((NN_MAX_BIT_LEN >= (2 * WORD_BITS * a.wlen)), ret, err); in miller_rabin() 182 (2 * WORD_BITS * y.wlen)), ret, err); in miller_rabin()
|