Lines Matching defs:used
51 This table is used to compute output lengths for the mp_toradix()
215 all the used digits of 'from', we'll re-use it to avoid hitting
282 Release the storage used by an mp_int, and void its fields so that
996 Compute q = a / b and r = a mod b. Input parameters may be re-used
1319 mp_size used;
1339 used = MP_USED(&x);
1340 if (used > 1) {
1341 s_mp_rshd(&x, used / 2);
1722 frequently this wil get used anyway. For small positive constants,
1921 based on the Stein algorithm used for mp_gcd()
2809 /* Make sure the used size of mp is at least 'min', growing if needed */
2920 mp_size used = MP_USED(mp);
2921 while (used > 1 && DIGIT(mp, used - 1) == 0)
2922 --used;
2923 MP_USED(mp) = used;
3091 unsigned int ix, used;
3095 used = MP_USED(mp);
3097 for (ix = 0; ix < used; ix++) {
3156 full division code (used in Barrett reduction, see below)
3259 int used = (int)MP_USED(mp);
3264 while (carry && --used > 0) {
3269 if (carry && !used) {
3271 used = MP_USED(mp);
3272 MP_CHECKOK( s_mp_pad(mp, used + 1) );
3273 MP_DIGIT(mp, used) = carry;
3315 mp_size used = MP_USED(mp);
3320 while (borrow && --used) {
3326 return (borrow && !used) ? MP_RANGE : MP_OKAY;
3338 mp_size used;
3351 used = MP_USED(a);
3352 MP_CHECKOK( s_mp_pad(a, used + 1) );
3354 s_mpv_mul_d(MP_DIGITS(a), used, d, MP_DIGITS(a));
3498 mp_size used;
3514 used = MP_USED(b);
3515 for(ix = 0; ix < used; ix++) {
3532 used = MP_USED(a);
3534 while (w && ix < used) {
3541 while (carry && ix < used) {
3555 if((res = s_mp_pad(a, used + 1)) != MP_OKAY)
3562 if((res = s_mp_pad(a, used + 1)) != MP_OKAY)
3565 DIGIT(a, used) = carry;
3584 mp_size used;
3608 used = MP_USED(b);
3609 for (ix = 0; ix < used; ix++) {
3626 for (used = MP_USED(a); ix < used; ++ix) {
3643 if((res = s_mp_pad(c, used + 1)) != MP_OKAY)
3646 DIGIT(c, used) = (mp_digit)w;
3647 ++used;
3651 if((res = s_mp_pad(c, used + 1)) != MP_OKAY)
3654 DIGIT(c, used) = carry;
3655 ++used;
3658 MP_USED(c) = used;
3990 /* Presently, this is only used by the Montgomery arithmetic code. */