Lines Matching defs:b_len
471 size_t b_len = b.nlimbs;
493 if (b_len == 0)
496 if (b_ptr[b_len - 1] == 0)
497 b_len--;
502 /* Here m = a_len >= 0 and n = b_len > 0. */
504 if (a_len < b_len)
513 else if (b_len == 1)
554 mp_limb_t msd = b_ptr[b_len - 1]; /* = b[n-1], > 0 */
615 tmp_roomptr = (mp_limb_t *) malloc (b_len * sizeof (mp_limb_t));
626 for (count = b_len; count > 0; count--)
641 at the end: r = roomptr[0..b_len-1], q = roomptr[b_len..a_len] */
662 q_ptr = roomptr + b_len;
663 q_len = a_len - b_len + 1; /* q will have m-n+1 limbs */
665 size_t j = a_len - b_len; /* m-n */
666 mp_limb_t b_msd = b_ptr[b_len - 1]; /* b[n-1] */
667 mp_limb_t b_2msd = b_ptr[b_len - 2]; /* b[n-2] */
676 if (r_ptr[j + b_len] < b_msd) /* r[j+n] < b[n-1] ? */
680 ((mp_twolimb_t) r_ptr[j + b_len] << GMP_LIMB_BITS)
681 | r_ptr[j + b_len - 1];
696 if (r_ptr[j + b_len] > b_msd
697 || (c1 = r_ptr[j + b_len - 1] + b_msd) < b_msd)
707 ((mp_twolimb_t) c1 << GMP_LIMB_BITS) | r_ptr[j + b_len - 2];
731 for (count = b_len; count > 0; count--)
744 /* Subtract cr from r_ptr[j + b_len], then forget about
745 r_ptr[j + b_len]. */
746 if (cr > r_ptr[j + b_len])
756 for (count = b_len; count > 0; count--)
777 r_len = b_len;
802 if (r_len > b_len)
806 for (i = b_len;;)
811 mp_limb_t b_i = (i < b_len ? b_ptr[i] : 0);
