2 * *****************************************************************************
4 * SPDX-License-Identifier: BSD-2-Clause
6 * Copyright (c) 2018-2020 Gavin D. Howard and contributors.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * * Redistributions of source code must retain the above copyright notice, this
12 * list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above copyright notice,
15 * this list of conditions and the following disclaimer in the documentation
16 * and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
30 * *****************************************************************************
32 * Code for the number type.
48 static void bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
50 static inline ssize_t bc_num_neg(size_t n, bool neg) {
51 return (((ssize_t) n) ^ -((ssize_t) neg)) + neg;
54 ssize_t bc_num_cmpZero(const BcNum *n) {
55 return bc_num_neg((n)->len != 0, BC_NUM_NEG(n));
58 static inline size_t bc_num_int(const BcNum *n) {
59 return n->len ? n->len - BC_NUM_RDX_VAL(n) : 0;
62 static void bc_num_expand(BcNum *restrict n, size_t req) {
66 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
72 n->num = bc_vm_realloc(n->num, BC_NUM_SIZE(req));
79 static void bc_num_setToZero(BcNum *restrict n, size_t scale) {
85 void bc_num_zero(BcNum *restrict n) {
86 bc_num_setToZero(n, 0);
89 void bc_num_one(BcNum *restrict n) {
95 static void bc_num_clean(BcNum *restrict n) {
97 while (BC_NUM_NONZERO(n) && !n->num[n->len - 1]) n->len -= 1;
99 if (BC_NUM_ZERO(n)) n->rdx = 0;
101 size_t rdx = BC_NUM_RDX_VAL(n);
102 if (n->len < rdx) n->len = rdx;
106 static size_t bc_num_log10(size_t i) {
108 for (len = 1; i; i /= BC_BASE, ++len);
109 assert(len - 1 <= BC_BASE_DIGS + 1);
113 static inline size_t bc_num_zeroDigits(const BcDig *n) {
115 assert(((size_t) *n) < BC_BASE_POW);
116 return BC_BASE_DIGS - bc_num_log10((size_t) *n);
119 static size_t bc_num_intDigits(const BcNum *n) {
120 size_t digits = bc_num_int(n) * BC_BASE_DIGS;
121 if (digits > 0) digits -= bc_num_zeroDigits(n->num + n->len - 1);
125 static size_t bc_num_nonzeroLen(const BcNum *restrict n) {
126 size_t i, len = n->len;
127 assert(len == BC_NUM_RDX_VAL(n));
128 for (i = len - 1; i < len && !n->num[i]; --i);
133 static BcDig bc_num_addDigits(BcDig a, BcDig b, bool *carry) {
135 assert(((BcBigDig) BC_BASE_POW) * 2 == ((BcDig) BC_BASE_POW) * 2);
136 assert(a < BC_BASE_POW);
137 assert(b < BC_BASE_POW);
140 *carry = (a >= BC_BASE_POW);
141 if (*carry) a -= BC_BASE_POW;
144 assert(a < BC_BASE_POW);
149 static BcDig bc_num_subDigits(BcDig a, BcDig b, bool *carry) {
151 assert(a < BC_BASE_POW);
152 assert(b < BC_BASE_POW);
156 if (*carry) a += BC_BASE_POW;
159 assert(a - b < BC_BASE_POW);
164 static void bc_num_addArrays(BcDig *restrict a, const BcDig *restrict b,
170 for (i = 0; i < len; ++i) a[i] = bc_num_addDigits(a[i], b[i], &carry);
172 for (; carry; ++i) a[i] = bc_num_addDigits(a[i], 0, &carry);
175 static void bc_num_subArrays(BcDig *restrict a, const BcDig *restrict b,
181 for (i = 0; i < len; ++i) a[i] = bc_num_subDigits(a[i], b[i], &carry);
183 for (; carry; ++i) a[i] = bc_num_subDigits(a[i], 0, &carry);
186 static void bc_num_mulArray(const BcNum *restrict a, BcBigDig b,
192 assert(b <= BC_BASE_POW);
194 if (a->len + 1 > c->cap) bc_num_expand(c, a->len + 1);
196 memset(c->num, 0, BC_NUM_SIZE(c->cap));
198 for (i = 0; i < a->len; ++i) {
199 BcBigDig in = ((BcBigDig) a->num[i]) * b + carry;
200 c->num[i] = in % BC_BASE_POW;
201 carry = in / BC_BASE_POW;
204 assert(carry < BC_BASE_POW);
205 c->num[i] = (BcDig) carry;
207 c->len += (carry != 0);
211 assert(!BC_NUM_NEG(c) || BC_NUM_NONZERO(c));
212 assert(BC_NUM_RDX_VAL(c) <= c->len || !c->len);
213 assert(!c->len || c->num[c->len - 1] || BC_NUM_RDX_VAL(c) == c->len);
216 static void bc_num_divArray(const BcNum *restrict a, BcBigDig b,
217 BcNum *restrict c, BcBigDig *rem)
222 assert(c->cap >= a->len);
224 for (i = a->len - 1; i < a->len; --i) {
225 BcBigDig in = ((BcBigDig) a->num[i]) + carry * BC_BASE_POW;
226 assert(in / b < BC_BASE_POW);
227 c->num[i] = (BcDig) (in / b);
235 assert(!BC_NUM_NEG(c) || BC_NUM_NONZERO(c));
236 assert(BC_NUM_RDX_VAL(c) <= c->len || !c->len);
237 assert(!c->len || c->num[c->len - 1] || BC_NUM_RDX_VAL(c) == c->len);
240 static ssize_t bc_num_compare(const BcDig *restrict a, const BcDig *restrict b,
245 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
246 return bc_num_neg(i + 1, c < 0);
249 ssize_t bc_num_cmp(const BcNum *a, const BcNum *b) {
251 size_t i, min, a_int, b_int, diff, ardx, brdx;
252 BcDig *max_num, *min_num;
253 bool a_max, neg = false;
256 assert(a != NULL && b != NULL);
258 if (a == b) return 0;
259 if (BC_NUM_ZERO(a)) return bc_num_neg(b->len != 0, !BC_NUM_NEG(b));
260 if (BC_NUM_ZERO(b)) return bc_num_cmpZero(a);
262 if (BC_NUM_NEG(b)) neg = true;
265 else if (BC_NUM_NEG(b)) return 1;
267 a_int = bc_num_int(a);
268 b_int = bc_num_int(b);
271 if (a_int) return neg ? -((ssize_t) a_int) : (ssize_t) a_int;
273 ardx = BC_NUM_RDX_VAL(a);
274 brdx = BC_NUM_RDX_VAL(b);
275 a_max = (ardx > brdx);
280 max_num = a->num + diff;
286 max_num = b->num + diff;
290 cmp = bc_num_compare(max_num, min_num, b_int + min);
292 if (cmp) return bc_num_neg((size_t) cmp, !a_max == !neg);
294 for (max_num -= diff, i = diff - 1; i < diff; --i) {
295 if (max_num[i]) return bc_num_neg(1, !a_max == !neg);
301 void bc_num_truncate(BcNum *restrict n, size_t places) {
303 size_t nrdx, places_rdx;
307 nrdx = BC_NUM_RDX_VAL(n);
308 places_rdx = nrdx ? nrdx - BC_NUM_RDX(n->scale - places) : 0;
309 assert(places <= n->scale && (BC_NUM_ZERO(n) || places_rdx <= n->len));
312 BC_NUM_RDX_SET(n, nrdx - places_rdx);
314 if (BC_NUM_NONZERO(n)) {
318 pow = n->scale % BC_BASE_DIGS;
319 pow = pow ? BC_BASE_DIGS - pow : 0;
320 pow = bc_num_pow10[pow];
322 n->len -= places_rdx;
323 memmove(n->num, n->num + places_rdx, BC_NUM_SIZE(n->len));
325 // Clear the lower part of the last digit.
326 if (BC_NUM_NONZERO(n)) n->num[0] -= n->num[0] % (BcDig) pow;
332 void bc_num_extend(BcNum *restrict n, size_t places) {
334 size_t nrdx, places_rdx;
337 if (BC_NUM_ZERO(n)) {
342 nrdx = BC_NUM_RDX_VAL(n);
343 places_rdx = BC_NUM_RDX(places + n->scale) - nrdx;
346 bc_num_expand(n, bc_vm_growSize(n->len, places_rdx));
347 memmove(n->num + places_rdx, n->num, BC_NUM_SIZE(n->len));
348 memset(n->num, 0, BC_NUM_SIZE(places_rdx));
351 BC_NUM_RDX_SET(n, nrdx + places_rdx);
353 n->len += places_rdx;
355 assert(BC_NUM_RDX_VAL(n) == BC_NUM_RDX(n->scale));
358 static void bc_num_retireMul(BcNum *restrict n, size_t scale,
359 bool neg1, bool neg2)
361 if (n->scale < scale) bc_num_extend(n, scale - n->scale);
362 else bc_num_truncate(n, n->scale - scale);
365 if (BC_NUM_NONZERO(n)) n->rdx = BC_NUM_NEG_VAL(n, !neg1 != !neg2);
368 static void bc_num_split(const BcNum *restrict n, size_t idx,
369 BcNum *restrict a, BcNum *restrict b)
371 assert(BC_NUM_ZERO(a));
372 assert(BC_NUM_ZERO(b));
376 b->len = n->len - idx;
378 a->scale = b->scale = 0;
379 BC_NUM_RDX_SET(a, 0);
380 BC_NUM_RDX_SET(b, 0);
382 assert(a->cap >= a->len);
383 assert(b->cap >= b->len);
385 memcpy(b->num, n->num + idx, BC_NUM_SIZE(b->len));
386 memcpy(a->num, n->num, BC_NUM_SIZE(idx));
390 else bc_num_copy(a, n);
395 static size_t bc_num_shiftZero(BcNum *restrict n) {
399 assert(!BC_NUM_RDX_VAL(n) || BC_NUM_ZERO(n));
401 for (i = 0; i < n->len && !n->num[i]; ++i);
409 static void bc_num_unshiftZero(BcNum *restrict n, size_t places_rdx) {
410 n->len += places_rdx;
411 n->num -= places_rdx;
414 static void bc_num_shift(BcNum *restrict n, BcBigDig dig) {
416 size_t i, len = n->len;
417 BcBigDig carry = 0, pow;
420 assert(dig < BC_BASE_DIGS);
422 pow = bc_num_pow10[dig];
423 dig = bc_num_pow10[BC_BASE_DIGS - dig];
425 for (i = len - 1; i < len; --i) {
427 in = ((BcBigDig) ptr[i]);
430 ptr[i] = ((BcDig) (in / pow)) + (BcDig) temp;
436 static void bc_num_shiftLeft(BcNum *restrict n, size_t places) {
443 if (places > n->scale) {
444 size_t size = bc_vm_growSize(BC_NUM_RDX(places - n->scale), n->len);
445 if (size > SIZE_MAX - 1) bc_vm_err(BC_ERR_MATH_OVERFLOW);
447 if (BC_NUM_ZERO(n)) {
448 if (n->scale >= places) n->scale -= places;
453 dig = (BcBigDig) (places % BC_BASE_DIGS);
455 places_rdx = BC_NUM_RDX(places);
459 size_t nrdx = BC_NUM_RDX_VAL(n);
461 if (nrdx >= places_rdx) {
463 size_t mod = n->scale % BC_BASE_DIGS, revdig;
465 mod = mod ? mod : BC_BASE_DIGS;
466 revdig = dig ? BC_BASE_DIGS - dig : 0;
468 if (mod + revdig > BC_BASE_DIGS) places_rdx = 1;
471 else places_rdx -= nrdx;
475 bc_num_expand(n, bc_vm_growSize(n->len, places_rdx));
476 memmove(n->num + places_rdx, n->num, BC_NUM_SIZE(n->len));
477 memset(n->num, 0, BC_NUM_SIZE(places_rdx));
478 n->len += places_rdx;
481 if (places > n->scale) {
483 BC_NUM_RDX_SET(n, 0);
487 BC_NUM_RDX_SET(n, BC_NUM_RDX(n->scale));
490 if (shift) bc_num_shift(n, BC_BASE_DIGS - dig);
495 void bc_num_shiftRight(BcNum *restrict n, size_t places) {
498 size_t places_rdx, scale, scale_mod, int_len, expand;
502 if (BC_NUM_ZERO(n)) {
504 bc_num_expand(n, BC_NUM_RDX(n->scale));
508 dig = (BcBigDig) (places % BC_BASE_DIGS);
511 scale_mod = scale % BC_BASE_DIGS;
512 scale_mod = scale_mod ? scale_mod : BC_BASE_DIGS;
513 int_len = bc_num_int(n);
514 places_rdx = BC_NUM_RDX(places);
516 if (scale_mod + dig > BC_BASE_DIGS) {
517 expand = places_rdx - 1;
525 if (expand > int_len) expand -= int_len;
528 bc_num_extend(n, places_rdx * BC_BASE_DIGS);
529 bc_num_expand(n, bc_vm_growSize(expand, n->len));
530 memset(n->num + n->len, 0, BC_NUM_SIZE(expand));
533 BC_NUM_RDX_SET(n, 0);
535 if (shift) bc_num_shift(n, dig);
537 n->scale = scale + places;
538 BC_NUM_RDX_SET(n, BC_NUM_RDX(n->scale));
542 assert(BC_NUM_RDX_VAL(n) <= n->len && n->len <= n->cap);
543 assert(BC_NUM_RDX_VAL(n) == BC_NUM_RDX(n->scale));
546 static void bc_num_inv(BcNum *a, BcNum *b, size_t scale) {
551 assert(BC_NUM_NONZERO(a));
553 bc_num_setup(&one, num, sizeof(num) / sizeof(BcDig));
556 bc_num_div(&one, a, b, scale);
559 #if BC_ENABLE_EXTRA_MATH
560 static void bc_num_intop(const BcNum *a, const BcNum *b, BcNum *restrict c,
563 if (BC_ERR(BC_NUM_RDX_VAL(b))) bc_vm_err(BC_ERR_MATH_NON_INTEGER);
567 #endif // BC_ENABLE_EXTRA_MATH
569 static void bc_num_as(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub) {
571 BcDig *ptr_c, *ptr_l, *ptr_r;
572 size_t i, min_rdx, max_rdx, diff, a_int, b_int, min_len, max_len, max_int;
573 size_t len_l, len_r, ardx, brdx;
574 bool b_neg, do_sub, do_rev_sub, carry, c_neg;
576 // Because this function doesn't need to use scale (per the bc spec),
577 // I am hijacking it to say whether it's doing an add or a subtract.
578 // Convert substraction to addition of negative second operand.
580 if (BC_NUM_ZERO(b)) {
584 if (BC_NUM_ZERO(a)) {
586 c->rdx = BC_NUM_NEG_VAL(c, BC_NUM_NEG(b) != sub);
590 // Invert sign of b if it is to be subtracted. This operation must
591 // preced the tests for any of the operands being zero.
592 b_neg = (BC_NUM_NEG(b) != sub);
594 // Actually add the numbers if their signs are equal, else subtract.
595 do_sub = (BC_NUM_NEG(a) != b_neg);
597 a_int = bc_num_int(a);
598 b_int = bc_num_int(b);
599 max_int = BC_MAX(a_int, b_int);
601 ardx = BC_NUM_RDX_VAL(a);
602 brdx = BC_NUM_RDX_VAL(b);
603 min_rdx = BC_MIN(ardx, brdx);
604 max_rdx = BC_MAX(ardx, brdx);
605 diff = max_rdx - min_rdx;
607 max_len = max_int + max_rdx;
611 // Check whether b has to be subtracted from a or a from b.
612 if (a_int != b_int) do_rev_sub = (a_int < b_int);
613 else if (ardx > brdx)
614 do_rev_sub = (bc_num_compare(a->num + diff, b->num, b->len) < 0);
616 do_rev_sub = (bc_num_compare(a->num, b->num + diff, a->len) <= 0);
620 // The result array of the addition might come out one element
621 // longer than the bigger of the operand arrays.
623 do_rev_sub = (a_int < b_int);
626 assert(max_len <= c->cap);
646 // If the rdx values of the operands do not match, the result will
647 // have low end elements that are the positive or negative trailing
648 // elements of the operand with higher rdx value.
649 if ((ardx > brdx) != do_rev_sub) {
651 // !do_rev_sub && ardx > brdx || do_rev_sub && brdx > ardx
652 // The left operand has BcDig values that need to be copied,
653 // either from a or from b (in case of a reversed subtraction).
654 memcpy(ptr_c, ptr_l, BC_NUM_SIZE(diff));
660 // The right operand has BcDig values that need to be copied
661 // or subtracted from zero (in case of a subtraction).
664 // do_sub (do_rev_sub && ardx > brdx ||
665 // !do_rev_sub && brdx > ardx)
666 for (i = 0; i < diff; i++)
667 ptr_c[i] = bc_num_subDigits(0, ptr_r[i], &carry);
671 // !do_sub && brdx > ardx
672 memcpy(ptr_c, ptr_r, BC_NUM_SIZE(diff));
682 min_len = BC_MIN(len_l, len_r);
684 // After dealing with possible low array elements that depend on only one
685 // operand, the actual add or subtract can be performed as if the rdx of
686 // both operands was the same.
687 // Inlining takes care of eliminating constant zero arguments to
688 // addDigit/subDigit (checked in disassembly of resulting bc binary
689 // compiled with gcc and clang).
691 for (i = 0; i < min_len; ++i)
692 ptr_c[i] = bc_num_subDigits(ptr_l[i], ptr_r[i], &carry);
693 for (; i < len_l; ++i) ptr_c[i] = bc_num_subDigits(ptr_l[i], 0, &carry);
696 for (i = 0; i < min_len; ++i)
697 ptr_c[i] = bc_num_addDigits(ptr_l[i], ptr_r[i], &carry);
698 for (; i < len_l; ++i) ptr_c[i] = bc_num_addDigits(ptr_l[i], 0, &carry);
699 ptr_c[i] = bc_num_addDigits(0, 0, &carry);
702 assert(carry == false);
704 // The result has the same sign as a, unless the operation was a
705 // reverse subtraction (b - a).
706 c_neg = BC_NUM_NEG(a) != (do_sub && do_rev_sub);
707 BC_NUM_RDX_SET_NEG(c, max_rdx, c_neg);
709 c->scale = BC_MAX(a->scale, b->scale);
714 static void bc_num_m_simp(const BcNum *a, const BcNum *b, BcNum *restrict c)
716 size_t i, alen = a->len, blen = b->len, clen;
717 BcDig *ptr_a = a->num, *ptr_b = b->num, *ptr_c;
718 BcBigDig sum = 0, carry = 0;
720 assert(sizeof(sum) >= sizeof(BcDig) * 2);
721 assert(!BC_NUM_RDX_VAL(a) && !BC_NUM_RDX_VAL(b));
723 clen = bc_vm_growSize(alen, blen);
724 bc_num_expand(c, bc_vm_growSize(clen, 1));
727 memset(ptr_c, 0, BC_NUM_SIZE(c->cap));
729 for (i = 0; i < clen; ++i) {
731 ssize_t sidx = (ssize_t) (i - blen + 1);
732 size_t j = (size_t) BC_MAX(0, sidx), k = BC_MIN(i, blen - 1);
734 for (; j < alen && k < blen; ++j, --k) {
736 sum += ((BcBigDig) ptr_a[j]) * ((BcBigDig) ptr_b[k]);
738 if (sum >= ((BcBigDig) BC_BASE_POW) * BC_BASE_POW) {
739 carry += sum / BC_BASE_POW;
744 if (sum >= BC_BASE_POW) {
745 carry += sum / BC_BASE_POW;
749 ptr_c[i] = (BcDig) sum;
750 assert(ptr_c[i] < BC_BASE_POW);
755 // This should always be true because there should be no carry on the last
756 // digit; multiplication never goes above the sum of both lengths.
762 static void bc_num_shiftAddSub(BcNum *restrict n, const BcNum *restrict a,
763 size_t shift, BcNumShiftAddOp op)
765 assert(n->len >= shift + a->len);
766 assert(!BC_NUM_RDX_VAL(n) && !BC_NUM_RDX_VAL(a));
767 op(n->num + shift, a->num, a->len);
770 static void bc_num_k(BcNum *a, BcNum *b, BcNum *restrict c) {
772 size_t max, max2, total;
773 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
774 BcDig *digs, *dig_ptr;
776 bool aone = BC_NUM_ONE(a);
778 assert(BC_NUM_ZERO(c));
780 if (BC_NUM_ZERO(a) || BC_NUM_ZERO(b)) return;
781 if (aone || BC_NUM_ONE(b)) {
782 bc_num_copy(c, aone ? b : a);
783 if ((aone && BC_NUM_NEG(a)) || BC_NUM_NEG(b)) BC_NUM_NEG_TGL(c);
786 if (a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN) {
787 bc_num_m_simp(a, b, c);
791 max = BC_MAX(a->len, b->len);
792 max = BC_MAX(max, BC_NUM_DEF_SIZE);
793 max2 = (max + 1) / 2;
795 total = bc_vm_arraySize(BC_NUM_KARATSUBA_ALLOCS, max);
799 digs = dig_ptr = bc_vm_malloc(BC_NUM_SIZE(total));
801 bc_num_setup(&l1, dig_ptr, max);
803 bc_num_setup(&h1, dig_ptr, max);
805 bc_num_setup(&l2, dig_ptr, max);
807 bc_num_setup(&h2, dig_ptr, max);
809 bc_num_setup(&m1, dig_ptr, max);
811 bc_num_setup(&m2, dig_ptr, max);
812 max = bc_vm_growSize(max, 1);
813 bc_num_init(&z0, max);
814 bc_num_init(&z1, max);
815 bc_num_init(&z2, max);
816 max = bc_vm_growSize(max, max) + 1;
817 bc_num_init(&temp, max);
819 BC_SETJMP_LOCKED(err);
823 bc_num_split(a, max2, &l1, &h1);
824 bc_num_split(b, max2, &l2, &h2);
826 bc_num_expand(c, max);
828 memset(c->num, 0, BC_NUM_SIZE(c->len));
830 bc_num_sub(&h1, &l1, &m1, 0);
831 bc_num_sub(&l2, &h2, &m2, 0);
833 if (BC_NUM_NONZERO(&h1) && BC_NUM_NONZERO(&h2)) {
835 assert(BC_NUM_RDX_VALID_NP(h1));
836 assert(BC_NUM_RDX_VALID_NP(h2));
838 bc_num_m(&h1, &h2, &z2, 0);
841 bc_num_shiftAddSub(c, &z2, max2 * 2, bc_num_addArrays);
842 bc_num_shiftAddSub(c, &z2, max2, bc_num_addArrays);
845 if (BC_NUM_NONZERO(&l1) && BC_NUM_NONZERO(&l2)) {
847 assert(BC_NUM_RDX_VALID_NP(l1));
848 assert(BC_NUM_RDX_VALID_NP(l2));
850 bc_num_m(&l1, &l2, &z0, 0);
853 bc_num_shiftAddSub(c, &z0, max2, bc_num_addArrays);
854 bc_num_shiftAddSub(c, &z0, 0, bc_num_addArrays);
857 if (BC_NUM_NONZERO(&m1) && BC_NUM_NONZERO(&m2)) {
859 assert(BC_NUM_RDX_VALID_NP(m1));
860 assert(BC_NUM_RDX_VALID_NP(m1));
862 bc_num_m(&m1, &m2, &z1, 0);
865 op = (BC_NUM_NEG_NP(m1) != BC_NUM_NEG_NP(m2)) ?
866 bc_num_subArrays : bc_num_addArrays;
867 bc_num_shiftAddSub(c, &z1, max2, op);
880 static void bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
883 size_t ascale, bscale, ardx, brdx, azero = 0, bzero = 0, zero, len, rscale;
885 assert(BC_NUM_RDX_VALID(a));
886 assert(BC_NUM_RDX_VALID(b));
891 scale = BC_MAX(scale, ascale);
892 scale = BC_MAX(scale, bscale);
894 rscale = ascale + bscale;
895 scale = BC_MIN(rscale, scale);
897 if ((a->len == 1 || b->len == 1) && !a->rdx && !b->rdx) {
903 dig = (BcBigDig) a->num[0];
907 dig = (BcBigDig) b->num[0];
911 bc_num_mulArray(operand, dig, c);
913 if (BC_NUM_NONZERO(c))
914 c->rdx = BC_NUM_NEG_VAL(c, BC_NUM_NEG(a) != BC_NUM_NEG(b));
919 assert(BC_NUM_RDX_VALID(a));
920 assert(BC_NUM_RDX_VALID(b));
924 bc_num_init(&cpa, a->len + BC_NUM_RDX_VAL(a));
925 bc_num_init(&cpb, b->len + BC_NUM_RDX_VAL(b));
927 BC_SETJMP_LOCKED(err);
931 bc_num_copy(&cpa, a);
932 bc_num_copy(&cpb, b);
934 assert(BC_NUM_RDX_VALID_NP(cpa));
935 assert(BC_NUM_RDX_VALID_NP(cpb));
937 BC_NUM_NEG_CLR_NP(cpa);
938 BC_NUM_NEG_CLR_NP(cpb);
940 assert(BC_NUM_RDX_VALID_NP(cpa));
941 assert(BC_NUM_RDX_VALID_NP(cpb));
943 ardx = BC_NUM_RDX_VAL_NP(cpa) * BC_BASE_DIGS;
944 bc_num_shiftLeft(&cpa, ardx);
946 brdx = BC_NUM_RDX_VAL_NP(cpb) * BC_BASE_DIGS;
947 bc_num_shiftLeft(&cpb, brdx);
949 // We need to reset the jump here because azero and bzero are used in the
950 // cleanup, and local variables are not guaranteed to be the same after a
956 azero = bc_num_shiftZero(&cpa);
957 bzero = bc_num_shiftZero(&cpb);
959 BC_SETJMP_LOCKED(err);
966 bc_num_k(&cpa, &cpb, c);
968 zero = bc_vm_growSize(azero, bzero);
969 len = bc_vm_growSize(c->len, zero);
971 bc_num_expand(c, len);
972 bc_num_shiftLeft(c, (len - c->len) * BC_BASE_DIGS);
973 bc_num_shiftRight(c, ardx + brdx);
975 bc_num_retireMul(c, scale, BC_NUM_NEG(a), BC_NUM_NEG(b));
979 bc_num_unshiftZero(&cpb, bzero);
981 bc_num_unshiftZero(&cpa, azero);
986 static bool bc_num_nonZeroDig(BcDig *restrict a, size_t len) {
988 bool nonzero = false;
989 for (i = len - 1; !nonzero && i < len; --i) nonzero = (a[i] != 0);
993 static ssize_t bc_num_divCmp(const BcDig *a, const BcNum *b, size_t len) {
997 if (b->len > len && a[len]) cmp = bc_num_compare(a, b->num, len + 1);
998 else if (b->len <= len) {
1000 else cmp = bc_num_compare(a, b->num, len);
1007 static void bc_num_divExtend(BcNum *restrict a, BcNum *restrict b,
1012 assert(divisor < BC_BASE_POW);
1014 pow = BC_BASE_DIGS - bc_num_log10((size_t) divisor);
1016 bc_num_shiftLeft(a, pow);
1017 bc_num_shiftLeft(b, pow);
1020 static void bc_num_d_long(BcNum *restrict a, BcNum *restrict b,
1021 BcNum *restrict c, size_t scale)
1024 size_t len, end, i, rdx;
1026 bool nonzero = false;
1028 assert(b->len < a->len);
1033 bc_num_expand(c, a->len);
1034 memset(c->num, 0, c->cap * sizeof(BcDig));
1036 BC_NUM_RDX_SET(c, BC_NUM_RDX_VAL(a));
1037 c->scale = a->scale;
1040 divisor = (BcBigDig) b->num[len - 1];
1042 if (len > 1 && bc_num_nonZeroDig(b->num, len - 1)) {
1044 nonzero = (divisor > 1 << ((10 * BC_BASE_DIGS) / 6 + 1));
1048 bc_num_divExtend(a, b, divisor);
1050 len = BC_MAX(a->len, b->len);
1051 bc_num_expand(a, len + 1);
1053 if (len + 1 > a->len) a->len = len + 1;
1057 divisor = (BcBigDig) b->num[len - 1];
1059 nonzero = bc_num_nonZeroDig(b->num, len - 1);
1065 bc_num_expand(c, a->len);
1066 memset(c->num, 0, BC_NUM_SIZE(c->cap));
1068 assert(c->scale >= scale);
1069 rdx = BC_NUM_RDX_VAL(c) - BC_NUM_RDX(scale);
1073 bc_num_init(&cpb, len + 1);
1075 BC_SETJMP_LOCKED(err);
1081 for (; i < end && i >= rdx && BC_NUM_NONZERO(a); --i) {
1088 assert(n >= a->num);
1091 cmp = bc_num_divCmp(n, b, len);
1095 BcBigDig n1, dividend, q;
1097 n1 = (BcBigDig) n[len];
1098 dividend = n1 * BC_BASE_POW + (BcBigDig) n[len - 1];
1099 q = (dividend / divisor);
1103 bc_num_subArrays(n, b->num, len);
1107 assert(q <= BC_BASE_POW);
1109 bc_num_mulArray(b, (BcBigDig) q, &cpb);
1110 bc_num_subArrays(n, cpb.num, cpb.len);
1114 assert(result <= BC_BASE_POW);
1116 if (nonzero) cmp = bc_num_divCmp(n, b, len);
1120 assert(result < BC_BASE_POW);
1122 c->num[i] = (BcDig) result;
1131 static void bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
1136 if (BC_NUM_ZERO(b)) bc_vm_err(BC_ERR_MATH_DIVIDE_BY_ZERO);
1137 if (BC_NUM_ZERO(a)) {
1138 bc_num_setToZero(c, scale);
1141 if (BC_NUM_ONE(b)) {
1143 bc_num_retireMul(c, scale, BC_NUM_NEG(a), BC_NUM_NEG(b));
1146 if (!BC_NUM_RDX_VAL(a) && !BC_NUM_RDX_VAL(b) && b->len == 1 && !scale) {
1148 bc_num_divArray(a, (BcBigDig) b->num[0], c, &rem);
1149 bc_num_retireMul(c, scale, BC_NUM_NEG(a), BC_NUM_NEG(b));
1153 len = bc_num_divReq(a, b, scale);
1157 bc_num_init(&cpa, len);
1158 bc_num_copy(&cpa, a);
1159 bc_num_createCopy(&cpb, b);
1161 BC_SETJMP_LOCKED(err);
1167 if (len > cpa.len) {
1168 bc_num_expand(&cpa, bc_vm_growSize(len, 2));
1169 bc_num_extend(&cpa, (len - cpa.len) * BC_BASE_DIGS);
1172 cpardx = BC_NUM_RDX_VAL_NP(cpa);
1173 cpa.scale = cpardx * BC_BASE_DIGS;
1175 bc_num_extend(&cpa, b->scale);
1176 cpardx = BC_NUM_RDX_VAL_NP(cpa) - BC_NUM_RDX(b->scale);
1177 BC_NUM_RDX_SET_NP(cpa, cpardx);
1178 cpa.scale = cpardx * BC_BASE_DIGS;
1180 if (scale > cpa.scale) {
1181 bc_num_extend(&cpa, scale);
1182 cpardx = BC_NUM_RDX_VAL_NP(cpa);
1183 cpa.scale = cpardx * BC_BASE_DIGS;
1186 if (cpa.cap == cpa.len) bc_num_expand(&cpa, bc_vm_growSize(cpa.len, 1));
1188 // We want an extra zero in front to make things simpler.
1189 cpa.num[cpa.len++] = 0;
1191 if (cpardx == cpa.len) cpa.len = bc_num_nonzeroLen(&cpa);
1192 if (BC_NUM_RDX_VAL_NP(cpb) == cpb.len) cpb.len = bc_num_nonzeroLen(&cpb);
1194 BC_NUM_RDX_SET_NP(cpb, 0);
1196 bc_num_d_long(&cpa, &cpb, c, scale);
1198 bc_num_retireMul(c, scale, BC_NUM_NEG(a), BC_NUM_NEG(b));
1207 static void bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1208 BcNum *restrict d, size_t scale, size_t ts)
1213 if (BC_NUM_ZERO(b)) bc_vm_err(BC_ERR_MATH_DIVIDE_BY_ZERO);
1214 if (BC_NUM_ZERO(a)) {
1215 bc_num_setToZero(c, ts);
1216 bc_num_setToZero(d, ts);
1222 bc_num_init(&temp, d->cap);
1224 BC_SETJMP_LOCKED(err);
1228 bc_num_d(a, b, c, scale);
1230 if (scale) scale = ts + 1;
1232 assert(BC_NUM_RDX_VALID(c));
1233 assert(BC_NUM_RDX_VALID(b));
1235 bc_num_m(c, b, &temp, scale);
1236 bc_num_sub(a, &temp, d, scale);
1238 if (ts > d->scale && BC_NUM_NONZERO(d)) bc_num_extend(d, ts - d->scale);
1240 neg = BC_NUM_NEG(d);
1241 bc_num_retireMul(d, ts, BC_NUM_NEG(a), BC_NUM_NEG(b));
1242 d->rdx = BC_NUM_NEG_VAL(d, BC_NUM_NONZERO(d) ? neg : false);
1250 static void bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
1255 ts = bc_vm_growSize(scale, b->scale);
1256 ts = BC_MAX(ts, a->scale);
1260 bc_num_init(&c1, bc_num_mulReq(a, b, ts));
1262 BC_SETJMP_LOCKED(err);
1266 bc_num_r(a, b, &c1, c, scale, ts);
1274 static void bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
1278 size_t i, powrdx, resrdx;
1281 if (BC_ERR(BC_NUM_RDX_VAL(b))) bc_vm_err(BC_ERR_MATH_NON_INTEGER);
1283 if (BC_NUM_ZERO(b)) {
1287 if (BC_NUM_ZERO(a)) {
1288 if (BC_NUM_NEG(b)) bc_vm_err(BC_ERR_MATH_DIVIDE_BY_ZERO);
1289 bc_num_setToZero(c, scale);
1292 if (BC_NUM_ONE(b)) {
1293 if (!BC_NUM_NEG(b)) bc_num_copy(c, a);
1294 else bc_num_inv(a, c, scale);
1300 neg = BC_NUM_NEG(b);
1302 bc_num_bigdig(b, &pow);
1303 b->rdx = BC_NUM_NEG_VAL(b, neg);
1305 bc_num_createCopy(©, a);
1307 BC_SETJMP_LOCKED(err);
1312 size_t max = BC_MAX(scale, a->scale), scalepow = a->scale * pow;
1313 scale = BC_MIN(scalepow, max);
1316 for (powrdx = a->scale; !(pow & 1); pow >>= 1) {
1318 assert(BC_NUM_RDX_VALID_NP(copy));
1319 bc_num_mul(©, ©, ©, powrdx);
1322 bc_num_copy(c, ©);
1328 assert(BC_NUM_RDX_VALID_NP(copy));
1329 bc_num_mul(©, ©, ©, powrdx);
1333 assert(BC_NUM_RDX_VALID(c));
1334 assert(BC_NUM_RDX_VALID_NP(copy));
1335 bc_num_mul(c, ©, c, resrdx);
1339 if (neg) bc_num_inv(c, c, scale);
1341 if (c->scale > scale) bc_num_truncate(c, c->scale - scale);
1343 // We can't use bc_num_clean() here.
1344 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
1345 if (zero) bc_num_setToZero(c, scale);
1353 #if BC_ENABLE_EXTRA_MATH
1354 static void bc_num_place(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
1360 bc_num_intop(a, b, c, &val);
1362 if (val < c->scale) bc_num_truncate(c, c->scale - val);
1363 else if (val > c->scale) bc_num_extend(c, val - c->scale);
1366 static void bc_num_left(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
1372 bc_num_intop(a, b, c, &val);
1374 bc_num_shiftLeft(c, (size_t) val);
1377 static void bc_num_right(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale) {
1383 bc_num_intop(a, b, c, &val);
1385 if (BC_NUM_ZERO(c)) return;
1387 bc_num_shiftRight(c, (size_t) val);
1389 #endif // BC_ENABLE_EXTRA_MATH
1391 static void bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1392 BcNumBinaryOp op, size_t req)
1394 BcNum *ptr_a, *ptr_b, num2;
1397 assert(a != NULL && b != NULL && c != NULL && op != NULL);
1399 assert(BC_NUM_RDX_VALID(a));
1400 assert(BC_NUM_RDX_VALID(b));
1408 memcpy(ptr_a, c, sizeof(BcNum));
1420 memcpy(ptr_b, c, sizeof(BcNum));
1430 bc_num_init(c, req);
1432 BC_SETJMP_LOCKED(err);
1437 bc_num_expand(c, req);
1440 op(ptr_a, ptr_b, c, scale);
1442 assert(!BC_NUM_NEG(c) || BC_NUM_NONZERO(c));
1443 assert(BC_NUM_RDX_VAL(c) <= c->len || !c->len);
1444 assert(BC_NUM_RDX_VALID(c));
1445 assert(!c->len || c->num[c->len - 1] || BC_NUM_RDX_VAL(c) == c->len);
1455 #if !defined(NDEBUG) || BC_ENABLE_LIBRARY
1456 bool bc_num_strValid(const char *restrict val) {
1459 size_t i, len = strlen(val);
1461 if (!len) return true;
1463 for (i = 0; i < len; ++i) {
1469 if (radix) return false;
1475 if (!(isdigit(c) || isupper(c))) return false;
1480 #endif // !defined(NDEBUG) || BC_ENABLE_LIBRARY
1482 static BcBigDig bc_num_parseChar(char c, size_t base_t) {
1485 c = BC_NUM_NUM_LETTER(c);
1486 c = ((size_t) c) >= base_t ? (char) base_t - 1 : c;
1490 return (BcBigDig) (uchar) c;
1493 static void bc_num_parseDecimal(BcNum *restrict n, const char *restrict val) {
1495 size_t len, i, temp, mod;
1497 bool zero = true, rdx;
1499 for (i = 0; val[i] == '0'; ++i);
1502 assert(!val[0] || isalnum(val[0]) || val[0] == '.');
1504 // All 0's. We can just return, since this
1505 // procedure expects a virgin (already 0) BcNum.
1506 if (!val[0]) return;
1510 ptr = strchr(val, '.');
1511 rdx = (ptr != NULL);
1513 for (i = 0; i < len && (zero = (val[i] == '0' || val[i] == '.')); ++i);
1515 n->scale = (size_t) (rdx * (((uintptr_t) (val + len)) -
1516 (((uintptr_t) ptr) + 1)));
1518 BC_NUM_RDX_SET(n, BC_NUM_RDX(n->scale));
1519 i = len - (ptr == val ? 0 : i) - rdx;
1520 temp = BC_NUM_ROUND_POW(i);
1521 mod = n->scale % BC_BASE_DIGS;
1522 i = mod ? BC_BASE_DIGS - mod : 0;
1523 n->len = ((temp + i) / BC_BASE_DIGS);
1525 bc_num_expand(n, n->len);
1526 memset(n->num, 0, BC_NUM_SIZE(n->len));
1529 // I think I can set rdx directly to zero here because n should be a
1530 // new number with sign set to false.
1531 n->len = n->rdx = 0;
1537 assert(i <= BC_NUM_BIGDIG_MAX);
1540 pow = bc_num_pow10[exp];
1542 for (i = len - 1; i < len; --i, ++exp) {
1546 if (c == '.') exp -= 1;
1549 size_t idx = exp / BC_BASE_DIGS;
1551 if (isupper(c)) c = '9';
1552 n->num[idx] += (((BcBigDig) c) - '0') * pow;
1554 if ((exp + 1) % BC_BASE_DIGS == 0) pow = 1;
1555 else pow *= BC_BASE;
1561 static void bc_num_parseBase(BcNum *restrict n, const char *restrict val,
1564 BcNum temp, mult1, mult2, result1, result2, *m1, *m2, *ptr;
1568 size_t i, digs, len = strlen(val);
1570 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
1575 bc_num_init(&temp, BC_NUM_BIGDIG_LOG10);
1576 bc_num_init(&mult1, BC_NUM_BIGDIG_LOG10);
1578 BC_SETJMP_LOCKED(int_err);
1582 for (i = 0; i < len && (c = val[i]) && c != '.'; ++i) {
1584 v = bc_num_parseChar(c, base);
1586 bc_num_mulArray(n, base, &mult1);
1587 bc_num_bigdig2num(&temp, v);
1588 bc_num_add(&mult1, &temp, n, 0);
1591 if (i == len && !(c = val[i])) goto int_err;
1599 bc_num_init(&mult2, BC_NUM_BIGDIG_LOG10);
1600 bc_num_init(&result1, BC_NUM_DEF_SIZE);
1601 bc_num_init(&result2, BC_NUM_DEF_SIZE);
1604 BC_SETJMP_LOCKED(err);
1611 for (i += 1, digs = 0; i < len && (c = val[i]); ++i, ++digs) {
1615 v = bc_num_parseChar(c, base);
1617 bc_num_mulArray(&result1, base, &result2);
1619 bc_num_bigdig2num(&temp, v);
1620 bc_num_add(&result2, &temp, &result1, 0);
1621 bc_num_mulArray(m1, base, m2);
1623 rdx = BC_NUM_RDX_VAL(m2);
1625 if (m2->len < rdx) m2->len = rdx;
1632 // This one cannot be a divide by 0 because mult starts out at 1, then is
1633 // multiplied by base, and base cannot be 0, so mult cannot be 0.
1634 bc_num_div(&result1, m1, &result2, digs * 2);
1635 bc_num_truncate(&result2, digs);
1636 bc_num_add(n, &result2, n, digs);
1638 if (BC_NUM_NONZERO(n)) {
1639 if (n->scale < digs) bc_num_extend(n, digs - n->scale);
1641 else bc_num_zero(n);
1645 bc_num_free(&result2);
1646 bc_num_free(&result1);
1647 bc_num_free(&mult2);
1650 bc_num_free(&mult1);
1655 static inline void bc_num_printNewline(void) {
1656 #if !BC_ENABLE_LIBRARY
1657 if (vm.nchars >= vm.line_len - 1) {
1658 bc_vm_putchar('\\');
1659 bc_vm_putchar('\n');
1661 #endif // !BC_ENABLE_LIBRARY
1664 static void bc_num_putchar(int c) {
1665 if (c != '\n') bc_num_printNewline();
1669 #if DC_ENABLED && !BC_ENABLE_LIBRARY
1670 static void bc_num_printChar(size_t n, size_t len, bool rdx) {
1674 bc_vm_putchar((uchar) n);
1676 #endif // DC_ENABLED && !BC_ENABLE_LIBRARY
1678 static void bc_num_printDigits(size_t n, size_t len, bool rdx) {
1682 bc_num_putchar(rdx ? '.' : ' ');
1684 for (exp = 0, pow = 1; exp < len - 1; ++exp, pow *= BC_BASE);
1686 for (exp = 0; exp < len; pow /= BC_BASE, ++exp) {
1687 size_t dig = n / pow;
1689 bc_num_putchar(((uchar) dig) + '0');
1693 static void bc_num_printHex(size_t n, size_t len, bool rdx) {
1699 if (rdx) bc_num_putchar('.');
1701 bc_num_putchar(bc_num_hex_digits[n]);
1704 static void bc_num_printDecimal(const BcNum *restrict n) {
1706 size_t i, j, rdx = BC_NUM_RDX_VAL(n);
1708 size_t buffer[BC_BASE_DIGS];
1710 if (BC_NUM_NEG(n)) bc_num_putchar('-');
1712 for (i = n->len - 1; i < n->len; --i) {
1714 BcDig n9 = n->num[i];
1716 bool irdx = (i == rdx - 1);
1718 zero = (zero & !irdx);
1719 temp = n->scale % BC_BASE_DIGS;
1720 temp = i || !temp ? 0 : BC_BASE_DIGS - temp;
1722 memset(buffer, 0, BC_BASE_DIGS * sizeof(size_t));
1724 for (j = 0; n9 && j < BC_BASE_DIGS; ++j) {
1725 buffer[j] = ((size_t) n9) % BC_BASE;
1729 for (j = BC_BASE_DIGS - 1; j < BC_BASE_DIGS && j >= temp; --j) {
1730 bool print_rdx = (irdx & (j == BC_BASE_DIGS - 1));
1731 zero = (zero && buffer[j] == 0);
1732 if (!zero) bc_num_printHex(buffer[j], 1, print_rdx);
1737 #if BC_ENABLE_EXTRA_MATH
1738 static void bc_num_printExponent(const BcNum *restrict n, bool eng) {
1740 size_t places, mod, nrdx = BC_NUM_RDX_VAL(n);
1741 bool neg = (n->len <= nrdx);
1743 BcDig digs[BC_NUM_BIGDIG_LOG10];
1747 bc_num_createCopy(&temp, n);
1749 BC_SETJMP_LOCKED(exit);
1755 size_t i, idx = bc_num_nonzeroLen(n) - 1;
1759 for (i = BC_BASE_DIGS - 1; i < BC_BASE_DIGS; --i) {
1760 if (bc_num_pow10[i] > (BcBigDig) n->num[idx]) places += 1;
1764 places += (nrdx - (idx + 1)) * BC_BASE_DIGS;
1767 if (eng && mod != 0) places += 3 - mod;
1768 bc_num_shiftLeft(&temp, places);
1771 places = bc_num_intDigits(n) - 1;
1773 if (eng && mod != 0) places -= 3 - (3 - mod);
1774 bc_num_shiftRight(&temp, places);
1777 bc_num_printDecimal(&temp);
1778 bc_num_putchar('e');
1781 bc_num_printHex(0, 1, false);
1785 if (neg) bc_num_putchar('-');
1787 bc_num_setup(&exp, digs, BC_NUM_BIGDIG_LOG10);
1788 bc_num_bigdig2num(&exp, (BcBigDig) places);
1790 bc_num_printDecimal(&exp);
1797 #endif // BC_ENABLE_EXTRA_MATH
1799 static void bc_num_printFixup(BcNum *restrict n, BcBigDig rem,
1800 BcBigDig pow, size_t idx)
1802 size_t i, len = n->len - idx;
1804 BcDig *a = n->num + idx;
1806 if (len < 2) return;
1808 for (i = len - 1; i > 0; --i) {
1810 acc = ((BcBigDig) a[i]) * rem + ((BcBigDig) a[i - 1]);
1811 a[i - 1] = (BcDig) (acc % pow);
1813 acc += (BcBigDig) a[i];
1815 if (acc >= BC_BASE_POW) {
1818 len = bc_vm_growSize(len, 1);
1819 bc_num_expand(n, bc_vm_growSize(len, idx));
1824 a[i + 1] += acc / BC_BASE_POW;
1828 assert(acc < BC_BASE_POW);
1835 static void bc_num_printPrepare(BcNum *restrict n, BcBigDig rem,
1840 for (i = 0; i < n->len; ++i) bc_num_printFixup(n, rem, pow, i);
1842 for (i = 0; i < n->len; ++i) {
1844 assert(pow == ((BcBigDig) ((BcDig) pow)));
1846 if (n->num[i] >= (BcDig) pow) {
1848 if (i + 1 == n->len) {
1849 n->len = bc_vm_growSize(n->len, 1);
1850 bc_num_expand(n, n->len);
1854 assert(pow < BC_BASE_POW);
1855 n->num[i + 1] += n->num[i] / ((BcDig) pow);
1856 n->num[i] %= (BcDig) pow;
1861 static void bc_num_printNum(BcNum *restrict n, BcBigDig base,
1862 size_t len, BcNumDigitOp print)
1865 BcNum intp, fracp1, fracp2, digit, flen1, flen2, *n1, *n2, *temp;
1866 BcBigDig dig = 0, *ptr, acc, exp;
1869 BcDig digit_digs[BC_NUM_BIGDIG_LOG10 + 1];
1873 if (BC_NUM_ZERO(n)) {
1874 print(0, len, false);
1878 // This function uses an algorithm that Stefan Esser <se@freebsd.org> came
1879 // up with to print the integer part of a number. What it does is convert
1880 // intp into a number of the specified base, but it does it directly,
1881 // instead of just doing a series of divisions and printing the remainders
1882 // in reverse order.
1884 // Let me explain in a bit more detail:
1886 // The algorithm takes the current least significant digit (after intp has
1887 // been converted to an integer) and the next to least significant digit,
1888 // and it converts the least significant digit into one of the specified
1889 // base, putting any overflow into the next to least significant digit. It
1890 // iterates through the whole number, from least significant to most
1891 // significant, doing this conversion. At the end of that iteration, the
1892 // least significant digit is converted, but the others are not, so it
1893 // iterates again, starting at the next to least significant digit. It keeps
1894 // doing that conversion, skipping one more digit than the last time, until
1895 // all digits have been converted. Then it prints them in reverse order.
1897 // That is the gist of the algorithm. It leaves out several things, such as
1898 // the fact that digits are not always converted into the specified base,
1899 // but into something close, basically a power of the specified base. In
1900 // Stefan's words, "You could consider BcDigs to be of base 10^BC_BASE_DIGS
1901 // in the normal case and obase^N for the largest value of N that satisfies
1902 // obase^N <= 10^BC_BASE_DIGS. [This means that] the result is not in base
1903 // "obase", but in base "obase^N", which happens to be printable as a number
1904 // of base "obase" without consideration for neighbouring BcDigs." This fact
1905 // is what necessitates the existence of the loop later in this function.
1907 // The conversion happens in bc_num_printPrepare() where the outer loop
1908 // happens and bc_num_printFixup() where the inner loop, or actual
1909 // conversion, happens.
1911 nrdx = BC_NUM_RDX_VAL(n);
1915 bc_vec_init(&stack, sizeof(BcBigDig), NULL);
1916 bc_num_init(&fracp1, nrdx);
1918 bc_num_createCopy(&intp, n);
1920 BC_SETJMP_LOCKED(err);
1924 bc_num_truncate(&intp, intp.scale);
1926 bc_num_sub(n, &intp, &fracp1, 0);
1928 if (base != vm.last_base) {
1933 while (vm.last_pow * base <= BC_BASE_POW) {
1934 vm.last_pow *= base;
1938 vm.last_rem = BC_BASE_POW - vm.last_pow;
1939 vm.last_base = base;
1944 if (vm.last_rem != 0) bc_num_printPrepare(&intp, vm.last_rem, vm.last_pow);
1946 for (i = 0; i < intp.len; ++i) {
1948 acc = (BcBigDig) intp.num[i];
1950 for (j = 0; j < exp && (i < intp.len - 1 || acc != 0); ++j)
1963 bc_vec_push(&stack, &dig);
1969 for (i = 0; i < stack.len; ++i) {
1970 ptr = bc_vec_item_rev(&stack, i);
1971 assert(ptr != NULL);
1972 print(*ptr, len, false);
1975 if (!n->scale) goto err;
1981 bc_num_init(&fracp2, nrdx);
1982 bc_num_setup(&digit, digit_digs, sizeof(digit_digs) / sizeof(BcDig));
1983 bc_num_init(&flen1, BC_NUM_BIGDIG_LOG10);
1984 bc_num_init(&flen2, BC_NUM_BIGDIG_LOG10);
1986 BC_SETJMP_LOCKED(frac_err);
1996 fracp2.scale = n->scale;
1997 BC_NUM_RDX_SET_NP(fracp2, BC_NUM_RDX(fracp2.scale));
1999 while (bc_num_intDigits(n1) < n->scale + 1) {
2001 bc_num_expand(&fracp2, fracp1.len + 1);
2002 bc_num_mulArray(&fracp1, base, &fracp2);
2004 nrdx = BC_NUM_RDX_VAL_NP(fracp2);
2006 if (fracp2.len < nrdx) fracp2.len = nrdx;
2008 // fracp is guaranteed to be non-negative and small enough.
2009 bc_num_bigdig2(&fracp2, &dig);
2011 bc_num_bigdig2num(&digit, dig);
2012 bc_num_sub(&fracp2, &digit, &fracp1, 0);
2014 print(dig, len, radix);
2015 bc_num_mulArray(n1, base, n2);
2025 bc_num_free(&flen2);
2026 bc_num_free(&flen1);
2027 bc_num_free(&fracp2);
2030 bc_num_free(&fracp1);
2032 bc_vec_free(&stack);
2036 static void bc_num_printBase(BcNum *restrict n, BcBigDig base) {
2040 bool neg = BC_NUM_NEG(n);
2042 if (neg) bc_num_putchar('-');
2046 if (base <= BC_NUM_MAX_POSIX_IBASE) {
2048 print = bc_num_printHex;
2051 assert(base <= BC_BASE_POW);
2052 width = bc_num_log10(base - 1);
2053 print = bc_num_printDigits;
2056 bc_num_printNum(n, base, width, print);
2057 n->rdx = BC_NUM_NEG_VAL(n, neg);
2060 #if DC_ENABLED && !BC_ENABLE_LIBRARY
2061 void bc_num_stream(BcNum *restrict n, BcBigDig base) {
2062 bc_num_printNum(n, base, 1, bc_num_printChar);
2064 #endif // DC_ENABLED && !BC_ENABLE_LIBRARY
2066 void bc_num_setup(BcNum *restrict n, BcDig *restrict num, size_t cap) {
2073 void bc_num_init(BcNum *restrict n, size_t req) {
2077 BC_SIG_ASSERT_LOCKED;
2081 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
2083 if (req == BC_NUM_DEF_SIZE && vm.temps.len) {
2084 BcNum *nptr = bc_vec_top(&vm.temps);
2086 bc_vec_pop(&vm.temps);
2088 else num = bc_vm_malloc(BC_NUM_SIZE(req));
2090 bc_num_setup(n, num, req);
2093 void bc_num_clear(BcNum *restrict n) {
2098 void bc_num_free(void *num) {
2100 BcNum *n = (BcNum*) num;
2102 BC_SIG_ASSERT_LOCKED;
2106 if (n->cap == BC_NUM_DEF_SIZE) bc_vec_push(&vm.temps, n);
2110 void bc_num_copy(BcNum *d, const BcNum *s) {
2111 assert(d != NULL && s != NULL);
2113 bc_num_expand(d, s->len);
2115 // I can just copy directly here.
2117 d->scale = s->scale;
2118 memcpy(d->num, s->num, BC_NUM_SIZE(d->len));
2121 void bc_num_createCopy(BcNum *d, const BcNum *s) {
2122 BC_SIG_ASSERT_LOCKED;
2123 bc_num_init(d, s->len);
2127 void bc_num_createFromBigdig(BcNum *n, BcBigDig val) {
2128 BC_SIG_ASSERT_LOCKED;
2129 bc_num_init(n, BC_NUM_BIGDIG_LOG10);
2130 bc_num_bigdig2num(n, val);
2133 size_t bc_num_scale(const BcNum *restrict n) {
2137 size_t bc_num_len(const BcNum *restrict n) {
2139 size_t len = n->len;
2141 if (BC_NUM_ZERO(n)) return 0;
2143 if (BC_NUM_RDX_VAL(n) == len) {
2147 len = bc_num_nonzeroLen(n);
2149 scale = n->scale % BC_BASE_DIGS;
2150 scale = scale ? scale : BC_BASE_DIGS;
2152 zero = bc_num_zeroDigits(n->num + len - 1);
2154 len = len * BC_BASE_DIGS - zero - (BC_BASE_DIGS - scale);
2156 else len = bc_num_intDigits(n) + n->scale;
2161 void bc_num_parse(BcNum *restrict n, const char *restrict val, BcBigDig base) {
2163 assert(n != NULL && val != NULL && base);
2164 assert(base >= BC_NUM_MIN_BASE && base <= vm.maxes[BC_PROG_GLOBALS_IBASE]);
2165 assert(bc_num_strValid(val));
2168 BcBigDig dig = bc_num_parseChar(val[0], BC_NUM_MAX_LBASE);
2169 bc_num_bigdig2num(n, dig);
2171 else if (base == BC_BASE) bc_num_parseDecimal(n, val);
2172 else bc_num_parseBase(n, val, base);
2174 assert(BC_NUM_RDX_VALID(n));
2177 void bc_num_print(BcNum *restrict n, BcBigDig base, bool newline) {
2180 assert(BC_ENABLE_EXTRA_MATH || base >= BC_NUM_MIN_BASE);
2182 bc_num_printNewline();
2184 if (BC_NUM_ZERO(n)) bc_num_printHex(0, 1, false);
2185 else if (base == BC_BASE) bc_num_printDecimal(n);
2186 #if BC_ENABLE_EXTRA_MATH
2187 else if (base == 0 || base == 1) bc_num_printExponent(n, base != 0);
2188 #endif // BC_ENABLE_EXTRA_MATH
2189 else bc_num_printBase(n, base);
2191 if (newline) bc_num_putchar('\n');
2194 void bc_num_bigdig2(const BcNum *restrict n, BcBigDig *result) {
2196 // This function returns no errors because it's guaranteed to succeed if
2197 // its preconditions are met. Those preconditions include both parameters
2198 // being non-NULL, n being non-negative, and n being less than vm.max. If
2199 // all of that is true, then we can just convert without worrying about
2200 // negative errors or overflow.
2203 size_t nrdx = BC_NUM_RDX_VAL(n);
2205 assert(n != NULL && result != NULL);
2206 assert(!BC_NUM_NEG(n));
2207 assert(bc_num_cmp(n, &vm.max) < 0);
2208 assert(n->len - nrdx <= 3);
2210 // There is a small speed win from unrolling the loop here, and since it
2211 // only adds 53 bytes, I decided that it was worth it.
2212 switch (n->len - nrdx) {
2216 r = (BcBigDig) n->num[nrdx + 2];
2223 r = r * BC_BASE_POW + (BcBigDig) n->num[nrdx + 1];
2230 r = r * BC_BASE_POW + (BcBigDig) n->num[nrdx];
2237 void bc_num_bigdig(const BcNum *restrict n, BcBigDig *result) {
2239 assert(n != NULL && result != NULL);
2241 if (BC_ERR(BC_NUM_NEG(n))) bc_vm_err(BC_ERR_MATH_NEGATIVE);
2242 if (BC_ERR(bc_num_cmp(n, &vm.max) >= 0))
2243 bc_vm_err(BC_ERR_MATH_OVERFLOW);
2245 bc_num_bigdig2(n, result);
2248 void bc_num_bigdig2num(BcNum *restrict n, BcBigDig val) {
2259 bc_num_expand(n, BC_NUM_BIGDIG_LOG10);
2261 for (ptr = n->num, i = 0; val; ++i, val /= BC_BASE_POW)
2262 ptr[i] = val % BC_BASE_POW;
2267 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
2268 void bc_num_rng(const BcNum *restrict n, BcRNG *rng) {
2270 BcNum temp, temp2, intn, frac;
2271 BcRand state1, state2, inc1, inc2;
2272 size_t nrdx = BC_NUM_RDX_VAL(n);
2276 bc_num_init(&temp, n->len);
2277 bc_num_init(&temp2, n->len);
2278 bc_num_init(&frac, nrdx);
2279 bc_num_init(&intn, bc_num_int(n));
2281 BC_SETJMP_LOCKED(err);
2285 assert(BC_NUM_RDX_VALID_NP(vm.max));
2287 memcpy(frac.num, n->num, BC_NUM_SIZE(nrdx));
2289 BC_NUM_RDX_SET_NP(frac, nrdx);
2290 frac.scale = n->scale;
2292 assert(BC_NUM_RDX_VALID_NP(frac));
2293 assert(BC_NUM_RDX_VALID_NP(vm.max2));
2295 bc_num_mul(&frac, &vm.max2, &temp, 0);
2297 bc_num_truncate(&temp, temp.scale);
2298 bc_num_copy(&frac, &temp);
2300 memcpy(intn.num, n->num + nrdx, BC_NUM_SIZE(bc_num_int(n)));
2301 intn.len = bc_num_int(n);
2303 // This assert is here because it has to be true. It is also here to justify
2304 // the use of BC_ERR_SIGNAL_ONLY() on each of the divmod's and mod's below.
2305 assert(BC_NUM_NONZERO(&vm.max));
2307 if (BC_NUM_NONZERO(&frac)) {
2309 bc_num_divmod(&frac, &vm.max, &temp, &temp2, 0);
2311 // frac is guaranteed to be smaller than vm.max * vm.max (pow).
2312 // This means that when dividing frac by vm.max, as above, the
2313 // quotient and remainder are both guaranteed to be less than vm.max,
2314 // which means we can use bc_num_bigdig2() here and not worry about
2316 bc_num_bigdig2(&temp2, (BcBigDig*) &state1);
2317 bc_num_bigdig2(&temp, (BcBigDig*) &state2);
2319 else state1 = state2 = 0;
2321 if (BC_NUM_NONZERO(&intn)) {
2323 bc_num_divmod(&intn, &vm.max, &temp, &temp2, 0);
2325 // Because temp2 is the mod of vm.max, from above, it is guaranteed
2326 // to be small enough to use bc_num_bigdig2().
2327 bc_num_bigdig2(&temp2, (BcBigDig*) &inc1);
2329 if (bc_num_cmp(&temp, &vm.max) >= 0) {
2330 bc_num_copy(&temp2, &temp);
2331 bc_num_mod(&temp2, &vm.max, &temp, 0);
2334 // The if statement above ensures that temp is less than vm.max, which
2335 // means that we can use bc_num_bigdig2() here.
2336 bc_num_bigdig2(&temp, (BcBigDig*) &inc2);
2338 else inc1 = inc2 = 0;
2340 bc_rand_seed(rng, state1, state2, inc1, inc2);
2346 bc_num_free(&temp2);
2351 void bc_num_createFromRNG(BcNum *restrict n, BcRNG *rng) {
2353 BcRand s1, s2, i1, i2;
2354 BcNum conv, temp1, temp2, temp3;
2355 BcDig temp1_num[BC_RAND_NUM_SIZE], temp2_num[BC_RAND_NUM_SIZE];
2356 BcDig conv_num[BC_NUM_BIGDIG_LOG10];
2360 bc_num_init(&temp3, 2 * BC_RAND_NUM_SIZE);
2362 BC_SETJMP_LOCKED(err);
2366 bc_num_setup(&temp1, temp1_num, sizeof(temp1_num) / sizeof(BcDig));
2367 bc_num_setup(&temp2, temp2_num, sizeof(temp2_num) / sizeof(BcDig));
2368 bc_num_setup(&conv, conv_num, sizeof(conv_num) / sizeof(BcDig));
2370 // This assert is here because it has to be true. It is also here to justify
2371 // the assumption that vm.max2 is not zero.
2372 assert(BC_NUM_NONZERO(&vm.max));
2374 // Because this is true, we can just use BC_ERR_SIGNAL_ONLY() below when
2375 // dividing by vm.max2.
2376 assert(BC_NUM_NONZERO(&vm.max2));
2378 bc_rand_getRands(rng, &s1, &s2, &i1, &i2);
2380 bc_num_bigdig2num(&conv, (BcBigDig) s2);
2382 assert(BC_NUM_RDX_VALID_NP(conv));
2384 bc_num_mul(&conv, &vm.max, &temp1, 0);
2386 bc_num_bigdig2num(&conv, (BcBigDig) s1);
2388 bc_num_add(&conv, &temp1, &temp2, 0);
2390 bc_num_div(&temp2, &vm.max2, &temp3, BC_RAND_STATE_BITS);
2392 bc_num_bigdig2num(&conv, (BcBigDig) i2);
2394 assert(BC_NUM_RDX_VALID_NP(conv));
2396 bc_num_mul(&conv, &vm.max, &temp1, 0);
2398 bc_num_bigdig2num(&conv, (BcBigDig) i1);
2400 bc_num_add(&conv, &temp1, &temp2, 0);
2402 bc_num_add(&temp2, &temp3, n, 0);
2404 assert(BC_NUM_RDX_VALID(n));
2408 bc_num_free(&temp3);
2412 void bc_num_irand(const BcNum *restrict a, BcNum *restrict b,
2413 BcRNG *restrict rng)
2417 BcNum pow, pow2, cp, cp2, mod, temp1, temp2, rand;
2418 BcNum *p1, *p2, *t1, *t2, *c1, *c2, *tmp;
2419 BcDig rand_num[BC_NUM_BIGDIG_LOG10];
2425 if (BC_ERR(BC_NUM_NEG(a))) bc_vm_err(BC_ERR_MATH_NEGATIVE);
2426 if (BC_ERR(BC_NUM_RDX_VAL(a))) bc_vm_err(BC_ERR_MATH_NON_INTEGER);
2427 if (BC_NUM_ZERO(a) || BC_NUM_ONE(a)) return;
2429 cmp = bc_num_cmp(a, &vm.max);
2435 if (cmp < 0) bc_num_bigdig2(a, (BcBigDig*) &bits);
2437 // This condition means that bits is a power of 2. In that case, we
2438 // can just grab a full-size int and mask out the unneeded bits.
2439 // Also, this condition says that 0 is a power of 2, which works for
2440 // us, since a value of 0 means a == rng->max. The bitmask will mask
2441 // nothing in that case as well.
2442 if (!(bits & (bits - 1))) r = bc_rand_int(rng) & (bits - 1);
2443 else r = bc_rand_bounded(rng, bits);
2445 // We made sure that r is less than vm.max,
2446 // so we can use bc_num_bigdig2() here.
2447 bc_num_bigdig2num(b, r);
2452 // In the case where a is less than rng->max, we have to make sure we have
2453 // an exclusive bound. This ensures that it happens. (See below.)
2458 bc_num_createCopy(&cp, a);
2460 bc_num_init(&cp2, cp.len);
2461 bc_num_init(&mod, BC_NUM_BIGDIG_LOG10);
2462 bc_num_init(&temp1, BC_NUM_DEF_SIZE);
2463 bc_num_init(&temp2, BC_NUM_DEF_SIZE);
2464 bc_num_init(&pow2, BC_NUM_DEF_SIZE);
2465 bc_num_init(&pow, BC_NUM_DEF_SIZE);
2467 bc_num_setup(&rand, rand_num, sizeof(rand_num) / sizeof(BcDig));
2469 BC_SETJMP_LOCKED(err);
2480 // This assert is here because it has to be true. It is also here to justify
2481 // the use of BC_ERR_SIGNAL_ONLY() on each of the divmod's and mod's below.
2482 assert(BC_NUM_NONZERO(&vm.max));
2484 while (BC_NUM_NONZERO(c1)) {
2486 bc_num_divmod(c1, &vm.max, c2, &mod, 0);
2488 // Because mod is the mod of vm.max, it is guaranteed to be smaller,
2489 // which means we can use bc_num_bigdig2() here.
2490 bc_num_bigdig(&mod, &modl);
2492 if (bc_num_cmp(c1, &vm.max) < 0) {
2494 // In this case, if there is no carry, then we know we can generate
2495 // an integer *equal* to modl. Thus, we add one if there is no
2496 // carry. Otherwise, we add zero, and we are still bounded properly.
2497 // Since the last portion is guaranteed to be greater than 1, we
2498 // know modl isn't 0 unless there is no carry.
2501 if (modl == 1) r = 0;
2502 else if (!modl) r = bc_rand_int(rng);
2503 else r = bc_rand_bounded(rng, (BcRand) modl);
2506 if (modl) modl -= carry;
2507 r = bc_rand_int(rng);
2508 carry = (r >= (BcRand) modl);
2511 bc_num_bigdig2num(&rand, r);
2513 assert(BC_NUM_RDX_VALID_NP(rand));
2514 assert(BC_NUM_RDX_VALID(p1));
2516 bc_num_mul(&rand, p1, p2, 0);
2517 bc_num_add(p2, t1, t2, 0);
2519 if (BC_NUM_NONZERO(c2)) {
2521 assert(BC_NUM_RDX_VALID_NP(vm.max));
2522 assert(BC_NUM_RDX_VALID(p1));
2524 bc_num_mul(&vm.max, p1, p2, 0);
2544 assert(BC_NUM_RDX_VALID(b));
2550 bc_num_free(&temp2);
2551 bc_num_free(&temp1);
2557 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
2559 size_t bc_num_addReq(const BcNum *a, const BcNum *b, size_t scale) {
2561 size_t aint, bint, ardx, brdx;
2565 ardx = BC_NUM_RDX_VAL(a);
2566 aint = bc_num_int(a);
2567 assert(aint <= a->len && ardx <= a->len);
2569 brdx = BC_NUM_RDX_VAL(b);
2570 bint = bc_num_int(b);
2571 assert(bint <= b->len && brdx <= b->len);
2573 ardx = BC_MAX(ardx, brdx);
2574 aint = BC_MAX(aint, bint);
2576 return bc_vm_growSize(bc_vm_growSize(ardx, aint), 1);
2579 size_t bc_num_mulReq(const BcNum *a, const BcNum *b, size_t scale) {
2581 rdx = bc_vm_growSize(BC_NUM_RDX_VAL(a), BC_NUM_RDX_VAL(b));
2582 max = BC_NUM_RDX(scale);
2583 max = bc_vm_growSize(BC_MAX(max, rdx), 1);
2584 rdx = bc_vm_growSize(bc_vm_growSize(bc_num_int(a), bc_num_int(b)), max);
2588 size_t bc_num_divReq(const BcNum *a, const BcNum *b, size_t scale) {
2590 rdx = bc_vm_growSize(BC_NUM_RDX_VAL(a), BC_NUM_RDX_VAL(b));
2591 max = BC_NUM_RDX(scale);
2592 max = bc_vm_growSize(BC_MAX(max, rdx), 1);
2593 rdx = bc_vm_growSize(bc_num_int(a), max);
2597 size_t bc_num_powReq(const BcNum *a, const BcNum *b, size_t scale) {
2599 return bc_vm_growSize(bc_vm_growSize(a->len, b->len), 1);
2602 #if BC_ENABLE_EXTRA_MATH
2603 size_t bc_num_placesReq(const BcNum *a, const BcNum *b, size_t scale) {
2605 return a->len + b->len - BC_NUM_RDX_VAL(a) - BC_NUM_RDX_VAL(b);
2607 #endif // BC_ENABLE_EXTRA_MATH
2609 void bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2610 assert(BC_NUM_RDX_VALID(a));
2611 assert(BC_NUM_RDX_VALID(b));
2612 bc_num_binary(a, b, c, false, bc_num_as, bc_num_addReq(a, b, scale));
2615 void bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2616 assert(BC_NUM_RDX_VALID(a));
2617 assert(BC_NUM_RDX_VALID(b));
2618 bc_num_binary(a, b, c, true, bc_num_as, bc_num_addReq(a, b, scale));
2621 void bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2622 assert(BC_NUM_RDX_VALID(a));
2623 assert(BC_NUM_RDX_VALID(b));
2624 bc_num_binary(a, b, c, scale, bc_num_m, bc_num_mulReq(a, b, scale));
2627 void bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2628 assert(BC_NUM_RDX_VALID(a));
2629 assert(BC_NUM_RDX_VALID(b));
2630 bc_num_binary(a, b, c, scale, bc_num_d, bc_num_divReq(a, b, scale));
2633 void bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2634 assert(BC_NUM_RDX_VALID(a));
2635 assert(BC_NUM_RDX_VALID(b));
2636 bc_num_binary(a, b, c, scale, bc_num_rem, bc_num_divReq(a, b, scale));
2639 void bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2640 assert(BC_NUM_RDX_VALID(a));
2641 assert(BC_NUM_RDX_VALID(b));
2642 bc_num_binary(a, b, c, scale, bc_num_p, bc_num_powReq(a, b, scale));
2645 #if BC_ENABLE_EXTRA_MATH
2646 void bc_num_places(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2647 assert(BC_NUM_RDX_VALID(a));
2648 assert(BC_NUM_RDX_VALID(b));
2649 bc_num_binary(a, b, c, scale, bc_num_place, bc_num_placesReq(a, b, scale));
2652 void bc_num_lshift(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2653 assert(BC_NUM_RDX_VALID(a));
2654 assert(BC_NUM_RDX_VALID(b));
2655 bc_num_binary(a, b, c, scale, bc_num_left, bc_num_placesReq(a, b, scale));
2658 void bc_num_rshift(BcNum *a, BcNum *b, BcNum *c, size_t scale) {
2659 assert(BC_NUM_RDX_VALID(a));
2660 assert(BC_NUM_RDX_VALID(b));
2661 bc_num_binary(a, b, c, scale, bc_num_right, bc_num_placesReq(a, b, scale));
2663 #endif // BC_ENABLE_EXTRA_MATH
2665 void bc_num_sqrt(BcNum *restrict a, BcNum *restrict b, size_t scale) {
2667 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2668 size_t pow, len, rdx, req, digs, digs1, digs2, resscale;
2671 assert(a != NULL && b != NULL && a != b);
2673 if (BC_ERR(BC_NUM_NEG(a))) bc_vm_err(BC_ERR_MATH_NEGATIVE);
2675 if (a->scale > scale) scale = a->scale;
2677 len = bc_vm_growSize(bc_num_intDigits(a), 1);
2678 rdx = BC_NUM_RDX(scale);
2679 req = bc_vm_growSize(BC_MAX(rdx, BC_NUM_RDX_VAL(a)), len >> 1);
2683 bc_num_init(b, bc_vm_growSize(req, 1));
2687 assert(a != NULL && b != NULL && a != b);
2688 assert(a->num != NULL && b->num != NULL);
2690 if (BC_NUM_ZERO(a)) {
2691 bc_num_setToZero(b, scale);
2694 if (BC_NUM_ONE(a)) {
2696 bc_num_extend(b, scale);
2700 rdx = BC_NUM_RDX(scale);
2701 rdx = BC_MAX(rdx, BC_NUM_RDX_VAL(a));
2702 len = bc_vm_growSize(a->len, rdx);
2706 bc_num_init(&num1, len);
2707 bc_num_init(&num2, len);
2708 bc_num_setup(&half, half_digs, sizeof(half_digs) / sizeof(BcDig));
2711 half.num[0] = BC_BASE_POW / 2;
2713 BC_NUM_RDX_SET_NP(half, 1);
2716 bc_num_init(&f, len);
2717 bc_num_init(&fprime, len);
2719 BC_SETJMP_LOCKED(err);
2727 pow = bc_num_intDigits(a);
2731 if (pow & 1) x0->num[0] = 2;
2732 else x0->num[0] = 6;
2734 pow -= 2 - (pow & 1);
2735 bc_num_shiftLeft(x0, pow / 2);
2738 // I can set the rdx here directly because neg should be false.
2739 x0->scale = x0->rdx = digs = digs1 = digs2 = 0;
2740 resscale = (scale + BC_BASE_DIGS) + 2;
2742 while (bc_num_cmp(x1, x0)) {
2744 assert(BC_NUM_NONZERO(x0));
2746 bc_num_div(a, x0, &f, resscale);
2747 bc_num_add(x0, &f, &fprime, resscale);
2749 assert(BC_NUM_RDX_VALID_NP(fprime));
2750 assert(BC_NUM_RDX_VALID_NP(half));
2752 bc_num_mul(&fprime, &half, x1, resscale);
2760 if (b->scale > scale) bc_num_truncate(b, b->scale - scale);
2762 assert(!BC_NUM_NEG(b) || BC_NUM_NONZERO(b));
2763 assert(BC_NUM_RDX_VALID(b));
2764 assert(BC_NUM_RDX_VAL(b) <= b->len || !b->len);
2765 assert(!b->len || b->num[b->len - 1] || BC_NUM_RDX_VAL(b) == b->len);
2769 bc_num_free(&fprime);
2776 void bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d, size_t scale) {
2782 ts = BC_MAX(scale + b->scale, a->scale);
2783 len = bc_num_mulReq(a, b, ts);
2785 assert(a != NULL && b != NULL && c != NULL && d != NULL);
2786 assert(c != d && a != d && b != d && b != c);
2790 memcpy(&num2, c, sizeof(BcNum));
2795 bc_num_init(c, len);
2799 BC_SETJMP_LOCKED(err);
2805 bc_num_expand(c, len);
2808 if (BC_NUM_NONZERO(a) && !BC_NUM_RDX_VAL(a) &&
2809 !BC_NUM_RDX_VAL(b) && b->len == 1 && !scale)
2813 bc_num_divArray(ptr_a, (BcBigDig) b->num[0], c, &rem);
2815 assert(rem < BC_BASE_POW);
2817 d->num[0] = (BcDig) rem;
2818 d->len = (rem != 0);
2820 else bc_num_r(ptr_a, b, c, d, scale, ts);
2822 assert(!BC_NUM_NEG(c) || BC_NUM_NONZERO(c));
2823 assert(BC_NUM_RDX_VALID(c));
2824 assert(BC_NUM_RDX_VAL(c) <= c->len || !c->len);
2825 assert(!c->len || c->num[c->len - 1] || BC_NUM_RDX_VAL(c) == c->len);
2826 assert(!BC_NUM_NEG(d) || BC_NUM_NONZERO(d));
2827 assert(BC_NUM_RDX_VALID(d));
2828 assert(BC_NUM_RDX_VAL(d) <= d->len || !d->len);
2829 assert(!d->len || d->num[d->len - 1] || BC_NUM_RDX_VAL(d) == d->len);
2840 void bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d) {
2842 BcNum base, exp, two, temp;
2845 assert(a != NULL && b != NULL && c != NULL && d != NULL);
2846 assert(a != d && b != d && c != d);
2848 if (BC_ERR(BC_NUM_ZERO(c))) bc_vm_err(BC_ERR_MATH_DIVIDE_BY_ZERO);
2849 if (BC_ERR(BC_NUM_NEG(b))) bc_vm_err(BC_ERR_MATH_NEGATIVE);
2850 if (BC_ERR(BC_NUM_RDX_VAL(a) || BC_NUM_RDX_VAL(b) || BC_NUM_RDX_VAL(c)))
2851 bc_vm_err(BC_ERR_MATH_NON_INTEGER);
2853 bc_num_expand(d, c->len);
2857 bc_num_init(&base, c->len);
2858 bc_num_setup(&two, two_digs, sizeof(two_digs) / sizeof(BcDig));
2859 bc_num_init(&temp, b->len + 1);
2860 bc_num_createCopy(&exp, b);
2862 BC_SETJMP_LOCKED(err);
2870 // We already checked for 0.
2871 bc_num_rem(a, c, &base, 0);
2873 while (BC_NUM_NONZERO(&exp)) {
2875 // Num two cannot be 0, so no errors.
2876 bc_num_divmod(&exp, &two, &exp, &temp, 0);
2878 if (BC_NUM_ONE(&temp) && !BC_NUM_NEG_NP(temp)) {
2880 assert(BC_NUM_RDX_VALID(d));
2881 assert(BC_NUM_RDX_VALID_NP(base));
2883 bc_num_mul(d, &base, &temp, 0);
2885 // We already checked for 0.
2886 bc_num_rem(&temp, c, d, 0);
2889 assert(BC_NUM_RDX_VALID_NP(base));
2891 bc_num_mul(&base, &base, &temp, 0);
2893 // We already checked for 0.
2894 bc_num_rem(&temp, c, &base, 0);
2903 assert(!BC_NUM_NEG(d) || d->len);
2904 assert(BC_NUM_RDX_VALID(d));
2905 assert(!d->len || d->num[d->len - 1] || BC_NUM_RDX_VAL(d) == d->len);
2907 #endif // DC_ENABLED
2910 void bc_num_printDebug(const BcNum *n, const char *name, bool emptyline) {
2911 bc_file_puts(&vm.fout, name);
2912 bc_file_puts(&vm.fout, ": ");
2913 bc_num_printDecimal(n);
2914 bc_file_putchar(&vm.fout, '\n');
2915 if (emptyline) bc_file_putchar(&vm.fout, '\n');
2919 void bc_num_printDigs(const BcDig *n, size_t len, bool emptyline) {
2923 for (i = len - 1; i < len; --i)
2924 bc_file_printf(&vm.fout, " %lu", (unsigned long) n[i]);
2926 bc_file_putchar(&vm.fout, '\n');
2927 if (emptyline) bc_file_putchar(&vm.fout, '\n');
2931 void bc_num_printWithDigs(const BcNum *n, const char *name, bool emptyline) {
2932 bc_file_puts(&vm.fout, name);
2933 bc_file_printf(&vm.fout, " len: %zu, rdx: %zu, scale: %zu\n",
2934 name, n->len, BC_NUM_RDX_VAL(n), n->scale);
2935 bc_num_printDigs(n->num, n->len, emptyline);
2938 void bc_num_dump(const char *varname, const BcNum *n) {
2940 ulong i, scale = n->scale;
2942 bc_file_printf(&vm.ferr, "\n%s = %s", varname,
2943 n->len ? (BC_NUM_NEG(n) ? "-" : "+") : "0 ");
2945 for (i = n->len - 1; i < n->len; --i) {
2947 if (i + 1 == BC_NUM_RDX_VAL(n)) bc_file_puts(&vm.ferr, ". ");
2949 if (scale / BC_BASE_DIGS != BC_NUM_RDX_VAL(n) - i - 1)
2950 bc_file_printf(&vm.ferr, "%lu ", (unsigned long) n->num[i]);
2953 int mod = scale % BC_BASE_DIGS;
2954 int d = BC_BASE_DIGS - mod;
2958 div = n->num[i] / ((BcDig) bc_num_pow10[(ulong) d]);
2959 bc_file_printf(&vm.ferr, "%lu", (unsigned long) div);
2962 div = n->num[i] % ((BcDig) bc_num_pow10[(ulong) d]);
2963 bc_file_printf(&vm.ferr, " ' %lu ", (unsigned long) div);
2967 bc_file_printf(&vm.ferr, "(%zu | %zu.%zu / %zu) %lu\n",
2968 n->scale, n->len, BC_NUM_RDX_VAL(n), n->cap,
2969 (unsigned long) (void*) n->num);
2971 #endif // BC_DEBUG_CODE