Lines Matching defs:pow
598 size_t pow;
602 pow = bc_num_leastSigPow(n->scale);
612 if (BC_NUM_NONZERO(n)) n->num[0] -= n->num[0] % (BcDig) pow;
785 BcBigDig carry = 0, pow;
791 pow = bc_num_pow10[dig];
801 carry = in % pow;
802 ptr[i] = ((BcDig) (in / pow)) + (BcDig) temp;
1673 size_t pow;
1677 pow = BC_BASE_DIGS - bc_num_log10((size_t) divisor);
1679 bc_num_shiftLeft(a, pow);
1680 bc_num_shiftLeft(b, pow);
2504 BcBigDig exp, pow;
2510 pow = bc_num_pow10[exp];
2536 dig = ((BcBigDig) n->num[idx]) + ((BcBigDig) c) * pow;
2555 if ((exp + 1) % BC_BASE_DIGS == 0) pow = 1;
2556 else pow *= BC_BASE;
2776 size_t exp, pow;
2782 for (exp = 0, pow = 1; exp < len - 1; ++exp, pow *= BC_BASE)
2788 for (exp = 0; exp < len; pow /= BC_BASE, ++exp)
2791 size_t dig = n / pow;
2794 n -= dig * pow;
2975 * given index to base @a pow, where @a pow is obase^N.
2977 * @param rem BC_BASE_POW - @a pow.
2978 * @param pow The power of obase we will convert the number to.
2984 bc_num_printFixup(BcNum* restrict n, BcBigDig rem, BcBigDig pow, size_t idx)
3003 // Store a value in base pow in the previous limb.
3004 a[i - 1] = (BcDig) (acc % pow);
3007 acc /= pow;
3045 * BC_BASE_POW to limbs of pow, where pow is obase^N.
3048 * @param pow The power of the base.
3051 bc_num_printPrepare(BcNum* restrict n, BcBigDig rem, BcBigDig pow)
3059 bc_num_printFixup(n, rem, pow, i);
3064 // is less than pow and to expand the number to fit new limbs as necessary.
3067 assert(pow == ((BcBigDig) ((BcDig) pow)));
3070 if (n->num[i] >= (BcDig) pow)
3083 assert(pow < BC_BASE_POW);
3086 n->num[i + 1] += n->num[i] / ((BcDig) pow);
3087 n->num[i] %= (BcDig) pow;
3759 // frac is guaranteed to be smaller than vm->max * vm->max (pow).
4133 size_t pow, len, rdx, req, resscale, realscale;
4216 pow = bc_num_intDigits(a);
4220 // in the same ballpark. That ballpark is half of pow because the result
4222 if (pow)
4224 // An odd number is served by starting with 2^((pow-1)/2), and an even
4225 // number is served by starting with 6^((pow-2)/2). Why? Because math.
4226 if (pow & 1) x0->num[0] = 2;
4229 pow -= 2 - (pow & 1);
4230 bc_num_shiftLeft(x0, pow / 2);