Lines Matching refs:biL
362 /* Take care to handle the most negative value (-2^(biL-1)) correctly.
371 #define TO_SIGN(x) ((mbedtls_mpi_sint) (((mbedtls_mpi_uint) x) >> (biL - 1)) * -2 + 1)
396 if (X->n * biL <= pos) {
400 return (X->p[pos / biL] >> (pos % biL)) & 0x01;
409 size_t off = pos / biL;
410 size_t idx = pos % biL;
416 if (X->n * biL <= pos) {
452 return i * biL + mbedtls_mpi_uint_ctz(X->p[i]);
458 for (size_t j = 0; j < biL; j++, count++) {
867 if (X->n * biL < i) {
1316 dividend = (mbedtls_t_udbl) u1 << biL;
1319 if (quotient > ((mbedtls_t_udbl) 1 << biL) - 1) {
1320 quotient = ((mbedtls_t_udbl) 1 << biL) - 1;
1342 u1 |= (u0 >> (biL - s)) & (-(mbedtls_mpi_sint) s >> (biL - 1));
1435 k = mbedtls_mpi_bitlen(&Y) % biL;
1436 if (k < biL - 1) {
1437 k = biL - 1 - k;
1446 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&Y, biL * (n - t)));
1452 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_r(&Y, biL * (n - t)));
1477 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&T1, biL * (i - t - 1)));
1482 MBEDTLS_MPI_CHK(mbedtls_mpi_shift_l(&T1, biL * (i - t - 1)));
2064 A.p[A.n - 1] &= ((mbedtls_mpi_uint) 1 << (k - (A.n - 1) * biL - 1)) - 1;
2209 k = n * biL;