43 	u_int			scale;  member
267 	return bmachine.scale;  in bmachine_scale()
318 	(void)fprintf(stderr, " %s (%u)\n" , p, n->scale);  in pn()
392 	if (n->scale == 0 && f != NULL)  in split_number()
394 	else if (n->scale < sizeof(factors)/sizeof(factors[0])) {  in split_number()
395 		rem = BN_div_word(i, factors[n->scale]);  in split_number()
410 		bn_check(BN_set_word(p, n->scale));  in split_number()
422 	scale_number(n->number, (int)(s - n->scale));  in normalize()
423 	n->scale = s;  in normalize()
578 	bn_check(BN_set_word(n->number, bmachine.scale));  in get_scale()
586 	u_long		scale;  in set_scale()  local
593 			scale = get_ulong(n);  in set_scale()
594 			if (scale != NO_NUMBER && scale <= UINT_MAX)  in set_scale()
595 				bmachine.scale = (u_int)scale;  in set_scale()
674 	u_int		scale = 0;  in push_scale()  local
684 			scale = value->u.num->scale;  in push_scale()
691 		bn_check(BN_set_word(n->number, scale));  in push_scale()
703 		return n->scale ? n->scale : 1;  in count_digits()
707 	fract_part->scale = n->scale;  in count_digits()
717 	return i + n->scale;  in count_digits()
967 	r->scale = max(a->scale, b->scale);  in badd()
968 	if (r->scale > a->scale)  in badd()
969 		normalize(a, r->scale);  in badd()
970 	else if (r->scale > b->scale)  in badd()
971 		normalize(b, r->scale);  in badd()
995 	r->scale = max(a->scale, b->scale);  in bsub()
996 	if (r->scale > a->scale)  in bsub()
997 		normalize(a, r->scale);  in bsub()
998 	else if (r->scale > b->scale)  in bsub()
999 		normalize(b, r->scale);  in bsub()
1007 bmul_number(struct number *r, struct number *a, struct number *b, u_int scale)  in bmul_number()  argument
1012 	u_int ascale = a->scale;  in bmul_number()
1013 	u_int bscale = b->scale;  in bmul_number()
1021 	r->scale = rscale;  in bmul_number()
1022 	if (rscale > bmachine.scale && rscale > ascale && rscale > bscale)  in bmul_number()
1023 		normalize(r, max(scale, max(ascale, bscale)));  in bmul_number()
1042 	bmul_number(r, a, b, bmachine.scale);  in bmul()
1054 	u_int		scale;  in bdiv()  local
1067 	r->scale = bmachine.scale;  in bdiv()
1068 	scale = max(a->scale, b->scale);  in bdiv()
1073 		normalize(a, scale);  in bdiv()
1074 		normalize(b, scale + r->scale);  in bdiv()
1091 	u_int		scale;  in bmod()  local
1104 	scale = max(a->scale, b->scale);  in bmod()
1105 	r->scale = max(b->scale, a->scale + bmachine.scale);  in bmod()
1110 		normalize(a, scale);  in bmod()
1111 		normalize(b, scale + bmachine.scale);  in bmod()
1128 	u_int		scale;  in bdivmod()  local
1142 	rdiv->scale = bmachine.scale;  in bdivmod()
1143 	rmod->scale = max(b->scale, a->scale + bmachine.scale);  in bdivmod()
1144 	scale = max(a->scale, b->scale);  in bdivmod()
1149 		normalize(a, scale);  in bdivmod()
1150 		normalize(b, scale + bmachine.scale);  in bdivmod()
1181 	if (p->scale != 0) {  in bexp()
1200 		rscale = bmachine.scale;  in bexp()
1207 		m = max(a->scale, bmachine.scale);  in bexp()
1208 		rscale = a->scale * (u_int)b;  in bexp()
1209 		if (rscale > m || (a->scale > 0 && (b == NO_NUMBER ||  in bexp()
1221 		ascale = a->scale;  in bexp()
1251 			scale_number(one, (int)(r->scale + rscale));  in bexp()
1260 			r->scale = rscale;  in bexp()
1291 	u_int		scale, onecount;  in bsqrt()  local
1304 		scale = max(bmachine.scale, n->scale);  in bsqrt()
1305 		normalize(n, 2*scale);  in bsqrt()
1322 		r->scale = scale;  in bsqrt()
1340 	a->scale = 0;  in not()
1461 	u_int	scale;  in compare_numbers()  local
1464 	scale = max(a->scale, b->scale);  in compare_numbers()
1466 	if (scale > a->scale)  in compare_numbers()
1467 		normalize(a, scale);  in compare_numbers()
1468 	else if (scale > b->scale)  in compare_numbers()
1469 		normalize(b, scale);  in compare_numbers()