Lines Matching refs:n
62 if (X->n != Y->n) { in mbedtls_mpi_lt_mpi_ct()
90 mbedtls_ct_condition_t lt = mbedtls_mpi_core_lt_ct(p[i], p[i ^ 1], X->n); in mbedtls_mpi_lt_mpi_ct()
123 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, Y->n)); in mbedtls_mpi_safe_cond_assign()
130 mbedtls_mpi_core_cond_assign(X->p, Y->p, Y->n, do_assign); in mbedtls_mpi_safe_cond_assign()
133 for (size_t i = Y->n; i < X->n; i++) { in mbedtls_mpi_safe_cond_assign()
161 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, Y->n)); in mbedtls_mpi_safe_cond_swap()
162 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(Y, X->n)); in mbedtls_mpi_safe_cond_swap()
168 mbedtls_mpi_core_cond_swap(X->p, Y->p, X->n, do_swap); in mbedtls_mpi_safe_cond_swap()
175 #define mbedtls_mpi_zeroize_and_free(v, n) mbedtls_zeroize_and_free(v, ciL * (n)) argument
183 X->n = 0; in mbedtls_mpi_init()
197 mbedtls_mpi_zeroize_and_free(X->p, X->n); in mbedtls_mpi_free()
201 X->n = 0; in mbedtls_mpi_free()
216 if (X->n < nblimbs) { in mbedtls_mpi_grow()
222 memcpy(p, X->p, X->n * ciL); in mbedtls_mpi_grow()
223 mbedtls_mpi_zeroize_and_free(X->p, X->n); in mbedtls_mpi_grow()
228 X->n = (unsigned short) nblimbs; in mbedtls_mpi_grow()
249 if (X->n <= nblimbs) { in mbedtls_mpi_shrink()
254 for (i = X->n - 1; i > 0; i--) { in mbedtls_mpi_shrink()
271 mbedtls_mpi_zeroize_and_free(X->p, X->n); in mbedtls_mpi_shrink()
276 X->n = (unsigned short) i; in mbedtls_mpi_shrink()
288 } else if (X->n == limbs) { in mbedtls_mpi_resize_clear()
315 if (Y->n == 0) { in mbedtls_mpi_copy()
316 if (X->n != 0) { in mbedtls_mpi_copy()
318 memset(X->p, 0, X->n * ciL); in mbedtls_mpi_copy()
323 for (i = Y->n - 1; i > 0; i--) { in mbedtls_mpi_copy()
332 if (X->n < i) { in mbedtls_mpi_copy()
335 memset(X->p + i, 0, (X->n - i) * ciL); in mbedtls_mpi_copy()
381 memset(X->p, 0, X->n * ciL); in mbedtls_mpi_lset()
396 if (X->n * biL <= pos) { in mbedtls_mpi_get_bit()
416 if (X->n * biL <= pos) { in mbedtls_mpi_set_bit()
450 for (i = 0; i < X->n; i++) { in mbedtls_mpi_lsb()
457 for (i = 0; i < X->n; i++) { in mbedtls_mpi_lsb()
474 return mbedtls_mpi_core_bitlen(X->p, X->n); in mbedtls_mpi_bitlen()
515 size_t i, j, slen, n; in mbedtls_mpi_read_string() local
543 n = BITS_TO_LIMBS(slen << 2); in mbedtls_mpi_read_string()
545 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, n)); in mbedtls_mpi_read_string()
618 size_t n; in mbedtls_mpi_write_string() local
626 n = mbedtls_mpi_bitlen(X); /* Number of bits necessary to present `n`. */ in mbedtls_mpi_write_string()
628 n >>= 1; /* Number of 4-adic digits necessary to present in mbedtls_mpi_write_string()
634 n >>= 1; /* Number of hexadecimal digits necessary to in mbedtls_mpi_write_string()
638 n += 1; /* Terminating null byte */ in mbedtls_mpi_write_string()
639 n += 1; /* Compensate for the divisions above, which round down `n` in mbedtls_mpi_write_string()
641 n += 1; /* Potential '-'-sign. */ in mbedtls_mpi_write_string()
642 n += (n & 1); /* Make n even to have enough space for hexadecimal writing, in mbedtls_mpi_write_string()
645 if (buflen < n) { in mbedtls_mpi_write_string()
646 *olen = n; in mbedtls_mpi_write_string()
662 for (i = X->n, k = 0; i > 0; i--) { in mbedtls_mpi_write_string()
747 size_t n, slen, plen; in mbedtls_mpi_write_file() local
760 MBEDTLS_MPI_CHK(mbedtls_mpi_write_string(X, radix, s, sizeof(s) - 2, &n)); in mbedtls_mpi_write_file()
801 MBEDTLS_MPI_CHK(mbedtls_mpi_core_read_le(X->p, X->n, buf, buflen)); in mbedtls_mpi_read_binary_le()
827 MBEDTLS_MPI_CHK(mbedtls_mpi_core_read_be(X->p, X->n, buf, buflen)); in mbedtls_mpi_read_binary()
845 return mbedtls_mpi_core_write_le(X->p, X->n, buf, buflen); in mbedtls_mpi_write_binary_le()
854 return mbedtls_mpi_core_write_be(X->p, X->n, buf, buflen); in mbedtls_mpi_write_binary()
867 if (X->n * biL < i) { in mbedtls_mpi_shift_l()
873 mbedtls_mpi_core_shift_l(X->p, X->n, count); in mbedtls_mpi_shift_l()
884 if (X->n != 0) { in mbedtls_mpi_shift_r()
885 mbedtls_mpi_core_shift_r(X->p, X->n, count); in mbedtls_mpi_shift_r()
897 for (i = X->n; i > 0; i--) { in mbedtls_mpi_cmp_abs()
903 for (j = Y->n; j > 0; j--) { in mbedtls_mpi_cmp_abs()
938 for (i = X->n; i > 0; i--) { in mbedtls_mpi_cmp_mpi()
944 for (j = Y->n; j > 0; j--) { in mbedtls_mpi_cmp_mpi()
990 Y.n = 1; in mbedtls_mpi_cmp_int()
1019 for (j = B->n; j > 0; j--) { in mbedtls_mpi_add_abs()
1044 if (j >= X->n) { in mbedtls_mpi_add_abs()
1063 size_t n; in mbedtls_mpi_sub_abs() local
1066 for (n = B->n; n > 0; n--) { in mbedtls_mpi_sub_abs()
1067 if (B->p[n - 1] != 0) { in mbedtls_mpi_sub_abs()
1071 if (n > A->n) { in mbedtls_mpi_sub_abs()
1077 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, A->n)); in mbedtls_mpi_sub_abs()
1082 if (A->n > n && A != X) { in mbedtls_mpi_sub_abs()
1083 memcpy(X->p + n, A->p + n, (A->n - n) * ciL); in mbedtls_mpi_sub_abs()
1085 if (X->n > A->n) { in mbedtls_mpi_sub_abs()
1086 memset(X->p + A->n, 0, (X->n - A->n) * ciL); in mbedtls_mpi_sub_abs()
1089 carry = mbedtls_mpi_core_sub(X->p, A->p, B->p, n); in mbedtls_mpi_sub_abs()
1092 carry = mbedtls_mpi_core_sub_int(X->p + n, X->p + n, carry, X->n - n); in mbedtls_mpi_sub_abs()
1167 B.n = 1; in mbedtls_mpi_add_int()
1183 B.n = 1; in mbedtls_mpi_sub_int()
1209 for (i = A->n; i > 0; i--) { in mbedtls_mpi_mul_mpi()
1218 for (j = B->n; j > 0; j--) { in mbedtls_mpi_mul_mpi()
1254 size_t n = A->n; in mbedtls_mpi_mul_int() local
1255 while (n > 0 && A->p[n - 1] == 0) { in mbedtls_mpi_mul_int()
1256 --n; in mbedtls_mpi_mul_int()
1260 if (b == 0 || n == 0) { in mbedtls_mpi_mul_int()
1277 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, n + 1)); in mbedtls_mpi_mul_int()
1279 mbedtls_mpi_core_mla(X->p, X->n, A->p, n, b - 1); in mbedtls_mpi_mul_int()
1396 size_t i, n, t, k; in mbedtls_mpi_div_mpi() local
1414 T2.n = sizeof(TP2) / sizeof(*TP2); in mbedtls_mpi_div_mpi()
1431 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&Z, A->n + 2)); in mbedtls_mpi_div_mpi()
1433 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(&T1, A->n + 2)); in mbedtls_mpi_div_mpi()
1444 n = X.n - 1; in mbedtls_mpi_div_mpi()
1445 t = Y.n - 1; in mbedtls_mpi_div_mpi()
1446 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&Y, biL * (n - t))); in mbedtls_mpi_div_mpi()
1449 Z.p[n - t]++; in mbedtls_mpi_div_mpi()
1452 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&Y, biL * (n - t))); in mbedtls_mpi_div_mpi()
1454 for (i = n; i > t; i--) { in mbedtls_mpi_div_mpi()
1524 B.n = 1; in mbedtls_mpi_div_int()
1575 if (b == 1 || A->n == 0) { in mbedtls_mpi_mod_int()
1588 for (i = A->n, y = 0; i > 0; i--) { in mbedtls_mpi_mod_int()
1635 if (E->n == 0) { in mbedtls_mpi_exp_mod()
1643 size_t T_limbs = mbedtls_mpi_core_exp_mod_working_limbs(N->n, E->n); in mbedtls_mpi_exp_mod()
1662 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(prec_RR, N->n)); in mbedtls_mpi_exp_mod()
1690 MBEDTLS_MPI_CHK(mbedtls_mpi_grow(X, N->n)); in mbedtls_mpi_exp_mod()
1697 mbedtls_mpi_core_to_mont_rep(X->p, X->p, N->p, N->n, mm, RR.p, T); in mbedtls_mpi_exp_mod()
1698 mbedtls_mpi_core_exp_mod(X->p, X->p, N->p, N->n, E->p, E->n, RR.p, T); in mbedtls_mpi_exp_mod()
1699 mbedtls_mpi_core_from_mont_rep(X->p, X->p, N->p, N->n, mm, T); in mbedtls_mpi_exp_mod()
1706 mbedtls_ct_condition_t is_x_non_zero = mbedtls_mpi_core_check_zero_ct(X->p, X->n); in mbedtls_mpi_exp_mod()
1848 ret = mbedtls_mpi_core_fill_random(X->p, X->n, size, f_rng, p_rng); in mbedtls_mpi_fill_random()
1870 int ret = mbedtls_mpi_resize_clear(X, N->n); in mbedtls_mpi_random()
1875 return mbedtls_mpi_core_random(X->p, min, N->p, X->n, f_rng, p_rng); in mbedtls_mpi_random()
2059 MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(&A, X->n * ciL, f_rng, p_rng)); in mpi_miller_rabin()
2064 A.p[A.n - 1] &= ((mbedtls_mpi_uint) 1 << (k - (A.n - 1) * biL - 1)) - 1; in mpi_miller_rabin()
2129 XX.n = X->n; in mbedtls_mpi_is_prime_ext()
2171 size_t k, n; in mbedtls_mpi_gen_prime() local
2182 n = BITS_TO_LIMBS(nbits); in mbedtls_mpi_gen_prime()
2203 MBEDTLS_MPI_CHK(mbedtls_mpi_fill_random(X, n * ciL, f_rng, p_rng)); in mbedtls_mpi_gen_prime()
2205 if (X->p[n-1] < CEIL_MAXUINT_DIV_SQRT2) { in mbedtls_mpi_gen_prime()
2209 k = n * biL; in mbedtls_mpi_gen_prime()