Lines Matching defs:rdx
146 unsigned long rdx, len, cap;
158 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
159 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1137 n->rdx = scale;
1198 a_max = (a->rdx > b->rdx);
1203 min = b->rdx;
1204 diff = a->rdx - b->rdx;
1208 min = a->rdx;
1209 diff = b->rdx - a->rdx;
1227 else if (n->len < n->rdx) n->len = n->rdx;
1234 n->rdx -= places;
1256 n->rdx += places;
1261 if (n->rdx < scale) bc_num_extend(n, scale - n->rdx);
1262 else bc_num_truncate(n, n->rdx - scale);
1274 a->rdx = b->rdx = 0;
1292 if (n->rdx >= places) n->rdx -= places;
1294 bc_num_extend(n, places - n->rdx);
1295 n->rdx = 0;
1342 c->rdx = maxof(a->rdx, b->rdx);
1343 min_rdx = minof(a->rdx, b->rdx);
1345 if (a->rdx > b->rdx) {
1346 diff = a->rdx - b->rdx;
1352 diff = b->rdx - a->rdx;
1422 bc_num_setToZero(c, maxof(a->rdx, b->rdx));
1441 if (c->rdx < subtrahend->rdx) {
1442 bc_num_extend(c, subtrahend->rdx - c->rdx);
1445 else start = c->rdx - subtrahend->rdx;
1563 size_t maxrdx = maxof(a->rdx, b->rdx);
1565 scale = maxof(scale, a->rdx);
1566 scale = maxof(scale, b->rdx);
1567 scale = minof(a->rdx + b->rdx, scale);
1590 c->rdx = maxrdx;
1627 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1628 cp.rdx -= b->rdx;
1629 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1631 if (b->rdx == b->len) {
1645 c->rdx = cp.rdx;
1686 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1701 size_t ts = maxof(scale + b->rdx, a->rdx), len = bc_num_mulReq(a, b, ts);
1718 if (b->rdx) return bc_vm_err(BC_ERROR_MATH_NON_INTEGER);
1743 if (!neg) scale = minof(a->rdx * pow, maxof(scale, a->rdx));
1745 for (powrdx = a->rdx; !TT.sig && !(pow & 1); pow >>= 1) {
1782 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
1887 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
1908 static void bc_num_printDigits(size_t n, size_t len, int rdx) {
1913 putchar(rdx ? '.' : ' ');
1928 static void bc_num_printHex(size_t n, size_t len, int rdx) {
1930 if (rdx) {
1943 size_t i, rdx = n->rdx - 1;
1949 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
1968 bc_num_init(&fracp, n->rdx);
1974 bc_num_truncate(&intp, intp.rdx);
1991 if (!n->rdx) goto err;
1993 for (radix = 1; frac_len.len <= n->rdx; radix = 0) {
1994 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2044 n->rdx = n->len = 0;
2070 d->rdx = s->rdx;
2103 n->rdx = ptr ? (val + len) - (ptr + 1) : 0;
2131 for (r = 0, i = n->len; i > n->rdx;) {
2164 return maxof(a->rdx, b->rdx) + maxof(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
2168 return BC_NUM_INT(a) + BC_NUM_INT(b) + maxof(scale, a->rdx + b->rdx) + 1;
2209 bc_num_init(b, maxof(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1);
2222 scale = maxof(scale, a->rdx) + 1;
2231 half.rdx = 1;
2252 x0->rdx -= pow;
2255 x0->rdx = digs = digs1 = 0;
2292 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2307 size_t ts = maxof(scale + b->rdx, a->rdx), len = bc_num_mulReq(a, b, ts);
4849 size_t i = (r->t == BC_RESULT_STR) ? r->d.id.len : n->rdx;
5242 return (unsigned long) n->rdx;
5250 if (n->rdx != n->len) return len;