45 	u_int			 scale;  member
257 	return bmachine.scale;  in bmachine_scale()
310 	fprintf(stderr, " %s (%u)\n" , p, n->scale);  in pn()
380 	if (n->scale == 0 && f != NULL)  in split_number()
382 	else if (n->scale < sizeof(factors)/sizeof(factors[0])) {  in split_number()
383 		rem = BN_div_word(i, factors[n->scale]);  in split_number()
398 		bn_check(BN_set_word(p, n->scale));  in split_number()
412 	scale_number(n->number, s - n->scale);  in normalize()
413 	n->scale = s;  in normalize()
581 	bn_check(BN_set_word(n->number, bmachine.scale));  in get_scale()
589 	u_long scale;  in set_scale()  local
596 			scale = get_ulong(n);  in set_scale()
597 			if (scale != ULONG_MAX && scale <= UINT_MAX)  in set_scale()
598 				bmachine.scale = (u_int)scale;  in set_scale()
678 	u_int scale = 0;  in push_scale()  local
686 			scale = value->u.num->scale;  in push_scale()
693 		bn_check(BN_set_word(n->number, scale));  in push_scale()
705 		return n->scale ? n->scale : 1;  in count_digits()
709 	fract_part->scale = n->scale;  in count_digits()
719 	return (i + n->scale);  in count_digits()
980 	r->scale = max(a->scale, b->scale);  in badd()
981 	if (r->scale > a->scale)  in badd()
982 		normalize(a, r->scale);  in badd()
983 	else if (r->scale > b->scale)  in badd()
984 		normalize(b, r->scale);  in badd()
1007 	r->scale = max(a->scale, b->scale);  in bsub()
1008 	if (r->scale > a->scale)  in bsub()
1009 		normalize(a, r->scale);  in bsub()
1010 	else if (r->scale > b->scale)  in bsub()
1011 		normalize(b, r->scale);  in bsub()
1019 bmul_number(struct number *r, struct number *a, struct number *b, u_int scale)  in bmul_number()  argument
1024 	u_int ascale = a->scale;  in bmul_number()
1025 	u_int bscale = b->scale;  in bmul_number()
1033 	r->scale = rscale;  in bmul_number()
1034 	if (rscale > bmachine.scale && rscale > ascale && rscale > bscale)  in bmul_number()
1035 		normalize(r, max(scale, max(ascale, bscale)));  in bmul_number()
1053 	bmul_number(r, a, b, bmachine.scale);  in bmul()
1074 	r = div_number(b, a, bmachine.scale);  in bdiv()
1086 	u_int scale;  in bmod()  local
1098 	scale = max(a->scale, b->scale);  in bmod()
1099 	r->scale = scale;  in bmod()
1104 		normalize(a, scale);  in bmod()
1105 		normalize(b, scale);  in bmod()
1122 	u_int scale;  in bdivmod()  local
1136 	scale = max(a->scale, b->scale);  in bdivmod()
1137 	rdiv->scale = 0;  in bdivmod()
1138 	remainder->scale = scale;  in bdivmod()
1139 	quotient->scale = bmachine.scale;  in bdivmod()
1140 	scale = max(a->scale, b->scale);  in bdivmod()
1145 		normalize(a, scale);  in bdivmod()
1146 		normalize(b, scale);  in bdivmod()
1162 		frac = div_number(remainder, a, bmachine.scale);  in bdivmod()
1163 		normalize(rdiv, bmachine.scale);  in bdivmod()
1164 		normalize(remainder, scale);  in bdivmod()
1193 	if (p->scale != 0) {  in bexp()
1212 		rscale = bmachine.scale;  in bexp()
1219 		m = max(a->scale, bmachine.scale);  in bexp()
1220 		rscale = a->scale * (u_int)b;  in bexp()
1221 		if (rscale > m || (a->scale > 0 && (b == ULONG_MAX ||  in bexp()
1233 		ascale = a->scale;  in bexp()
1263 			scale_number(one, r->scale + rscale);  in bexp()
1272 			r->scale = rscale;  in bexp()
1303 	u_int onecount, scale;  in bsqrt()  local
1315 		scale = max(bmachine.scale, n->scale);  in bsqrt()
1316 		normalize(n, 2*scale);  in bsqrt()
1333 		r->scale = scale;  in bsqrt()
1351 	a->scale = 0;  in not()
1479 	u_int scale;  in compare_numbers()  local
1482 	scale = max(a->scale, b->scale);  in compare_numbers()
1484 	if (scale > a->scale)  in compare_numbers()
1485 		normalize(a, scale);  in compare_numbers()
1486 	else if (scale > b->scale)  in compare_numbers()
1487 		normalize(b, scale);  in compare_numbers()
1682 	    bmachine.ibase, bmachine.scale));  in parse_number()