Lines Matching defs:limbs
92 * Traverse limbs and
94 * - swap the limbs themselves.
95 * For that, simultaneously traverse the limbs from left to right
97 * than the right index (it's not a problem if limbs is odd and the
121 /* limbs other than the least significant one are all zero? */
127 /* min <= A iff the lowest limb of A is >= min or the other limbs
134 size_t limbs)
138 for (size_t i = limbs; i > 0; i--) {
161 * If all the limbs were equal, then the numbers are equal, A < B is false
170 size_t limbs,
182 for (size_t i = 0; i < limbs; i++) {
189 size_t limbs,
196 for (size_t i = 0; i < limbs; i++) {
208 const size_t limbs = CHARS_TO_LIMBS(input_length);
210 if (X_limbs < limbs) {
231 const size_t limbs = CHARS_TO_LIMBS(input_length);
233 if (X_limbs < limbs) {
330 void mbedtls_mpi_core_shift_r(mbedtls_mpi_uint *X, size_t limbs,
339 if (v0 > limbs || (v0 == limbs && v1 > 0)) {
340 memset(X, 0, limbs * ciL);
348 for (i = 0; i < limbs - v0; i++) {
352 for (; i < limbs; i++) {
361 for (i = limbs; i > 0; i--) {
370 void mbedtls_mpi_core_shift_l(mbedtls_mpi_uint *X, size_t limbs,
383 for (i = limbs; i > v0; i--) {
396 for (i = v0; i < limbs; i++) {
408 size_t limbs)
412 for (size_t i = 0; i < limbs; i++) {
425 size_t limbs,
432 for (size_t i = 0; i < limbs; i++) {
447 size_t limbs)
451 for (size_t i = 0; i < limbs; i++) {
573 * but is in (the lower AN_limbs limbs of) T if (carry ^ borrow) = 1.
599 size_t limbs,
603 for (size_t i = 0; i < count; i++, table += limbs) {
605 mbedtls_mpi_core_cond_assign(dest, table, limbs, assign);
621 const size_t limbs = CHARS_TO_LIMBS(n_bytes);
622 const size_t overhead = (limbs * ciL) - n_bytes;
624 if (X_limbs < limbs) {
629 memset((unsigned char *) X + limbs * ciL, 0, (X_limbs - limbs) * ciL);
631 mbedtls_mpi_core_bigendian_to_host(X, limbs);
640 size_t limbs,
645 size_t n_bits = mbedtls_mpi_core_bitlen(N, limbs);
677 MBEDTLS_MPI_CHK(mbedtls_mpi_core_fill_random(X, limbs,
680 mbedtls_mpi_core_shift_r(X, limbs, 8 * n_bytes - n_bits);
687 ge_lower = mbedtls_mpi_core_uint_le_mpi(min, X, limbs);
688 lt_upper = mbedtls_mpi_core_lt_ct(X, N, limbs);
847 size_t limbs)
849 for (size_t i = 0; i < limbs; i++) {
860 size_t limbs)
865 for (size_t i = 0; i < limbs; i++) {