303 	size_t nrdx, places_rdx;  in bc_num_truncate()  local
307 	nrdx = BC_NUM_RDX_VAL(n);  in bc_num_truncate()
308 	places_rdx = nrdx ? nrdx - BC_NUM_RDX(n->scale - places) : 0;  in bc_num_truncate()
312 	BC_NUM_RDX_SET(n, nrdx - places_rdx);  in bc_num_truncate()
334 	size_t nrdx, places_rdx;  in bc_num_extend()  local
342 	nrdx = BC_NUM_RDX_VAL(n);  in bc_num_extend()
343 	places_rdx = BC_NUM_RDX(places + n->scale) - nrdx;  in bc_num_extend()
351 	BC_NUM_RDX_SET(n, nrdx + places_rdx);  in bc_num_extend()
459 		size_t nrdx = BC_NUM_RDX_VAL(n);  in bc_num_shiftLeft()  local
461 		if (nrdx >= places_rdx) {  in bc_num_shiftLeft()
471 		else places_rdx -= nrdx;  in bc_num_shiftLeft()
1740 	size_t places, mod, nrdx = BC_NUM_RDX_VAL(n);  in bc_num_printExponent()  local
1741 	bool neg = (n->len <= nrdx);  in bc_num_printExponent()
1764 		places += (nrdx - (idx + 1)) * BC_BASE_DIGS;  in bc_num_printExponent()
1867 	size_t i, j, nrdx;  in bc_num_printNum()  local
1911 	nrdx = BC_NUM_RDX_VAL(n);  in bc_num_printNum()
1916 	bc_num_init(&fracp1, nrdx);  in bc_num_printNum()
1981 	bc_num_init(&fracp2, nrdx);  in bc_num_printNum()
2004 		nrdx = BC_NUM_RDX_VAL_NP(fracp2);  in bc_num_printNum()
2006 		if (fracp2.len < nrdx) fracp2.len = nrdx;  in bc_num_printNum()
2203 	size_t nrdx = BC_NUM_RDX_VAL(n);  in bc_num_bigdig2()  local
2208 	assert(n->len - nrdx <= 3);  in bc_num_bigdig2()
2212 	switch (n->len - nrdx) {  in bc_num_bigdig2()
2216 			r = (BcBigDig) n->num[nrdx + 2];  in bc_num_bigdig2()
2223 			r = r * BC_BASE_POW + (BcBigDig) n->num[nrdx + 1];  in bc_num_bigdig2()
2230 			r = r * BC_BASE_POW + (BcBigDig) n->num[nrdx];  in bc_num_bigdig2()
2272 	size_t nrdx = BC_NUM_RDX_VAL(n);  in bc_num_rng()  local
2278 	bc_num_init(&frac, nrdx);  in bc_num_rng()
2287 	memcpy(frac.num, n->num, BC_NUM_SIZE(nrdx));  in bc_num_rng()
2288 	frac.len = nrdx;  in bc_num_rng()
2289 	BC_NUM_RDX_SET_NP(frac, nrdx);  in bc_num_rng()
2300 	memcpy(intn.num, n->num + nrdx, BC_NUM_SIZE(bc_num_int(n)));  in bc_num_rng()