180 	assert(((size_t) *n) < BC_BASE_POW);  in bc_num_zeroDigits()
223 	assert(((BcBigDig) BC_BASE_POW) * 2 == ((BcDig) BC_BASE_POW) * 2);  in bc_num_addDigits()
224 	assert(a < BC_BASE_POW);  in bc_num_addDigits()
225 	assert(b < BC_BASE_POW);  in bc_num_addDigits()
228 	*carry = (a >= BC_BASE_POW);  in bc_num_addDigits()
229 	if (*carry) a -= BC_BASE_POW;  in bc_num_addDigits()
232 	assert(a < BC_BASE_POW);  in bc_num_addDigits()
247 	assert(a < BC_BASE_POW);  in bc_num_subDigits()
248 	assert(b < BC_BASE_POW);  in bc_num_subDigits()
252 	if (*carry) a += BC_BASE_POW;  in bc_num_subDigits()
255 	assert(a - b < BC_BASE_POW);  in bc_num_subDigits()
309 	assert(b <= BC_BASE_POW);  in bc_num_mulArray()
320 		c->num[i] = in % BC_BASE_POW;  in bc_num_mulArray()
321 		carry = in / BC_BASE_POW;  in bc_num_mulArray()
324 	assert(carry < BC_BASE_POW);  in bc_num_mulArray()
357 		BcBigDig in = ((BcBigDig) a->num[i]) + carry * BC_BASE_POW;  in bc_num_divArray()
358 		assert(in / b < BC_BASE_POW);  in bc_num_divArray()
1099 			if (sum >= ((BcBigDig) BC_BASE_POW) * BC_BASE_POW) {  in bc_num_m_simp()
1100 				carry += sum / BC_BASE_POW;  in bc_num_m_simp()
1101 				sum %= BC_BASE_POW;  in bc_num_m_simp()
1106 		if (sum >= BC_BASE_POW) {  in bc_num_m_simp()
1107 			carry += sum / BC_BASE_POW;  in bc_num_m_simp()
1108 			sum %= BC_BASE_POW;  in bc_num_m_simp()
1113 		assert(ptr_c[i] < BC_BASE_POW);  in bc_num_m_simp()
1454 	assert(divisor < BC_BASE_POW);  in bc_num_divExtend()
1578 			dividend = n1 * BC_BASE_POW + (BcBigDig) n[len - 1];  in bc_num_d_long()
1590 				assert(quotient <= BC_BASE_POW);  in bc_num_d_long()
1600 			assert(result <= BC_BASE_POW);  in bc_num_d_long()
1609 		assert(result < BC_BASE_POW);  in bc_num_d_long()
2654 		if (acc >= BC_BASE_POW) {  in bc_num_printFixup()
2671 			a[i + 1] += acc / BC_BASE_POW;  in bc_num_printFixup()
2672 			acc %= BC_BASE_POW;  in bc_num_printFixup()
2675 		assert(acc < BC_BASE_POW);  in bc_num_printFixup()
2722 			assert(pow < BC_BASE_POW);  in bc_num_printPrepare()
2819 		while (vm.last_pow * base <= BC_BASE_POW) {  in bc_num_printNum()
2825 		vm.last_rem = BC_BASE_POW - vm.last_pow;  in bc_num_printNum()
2986 		assert(base <= BC_BASE_POW);  in bc_num_printBase()
3193 			r = r * BC_BASE_POW + (BcBigDig) n->num[nrdx + 1];  in bc_num_bigdig2()
3200 			r = r * BC_BASE_POW + (BcBigDig) n->num[nrdx];  in bc_num_bigdig2()
3240 	for (ptr = n->num, i = 0; val; ++i, val /= BC_BASE_POW)  in bc_num_bigdig2num()
3241 		ptr[i] = val % BC_BASE_POW;  in bc_num_bigdig2num()
3431 		b->num[i] = (BcDig) bc_rand_bounded(rng, BC_BASE_POW);  in bc_num_irand()
3632 	half.num[0] = BC_BASE_POW / 2;  in bc_num_sqrt()
3758 		assert(rem < BC_BASE_POW);  in bc_num_divmod()