39 	u_int			scale;  member
272 	return bmachine.scale;  in bmachine_scale()
323 	(void)fprintf(stderr, " %s (%u)\n" , p, n->scale);  in pn()
393 	if (n->scale == 0) {  in split_number()
396 	} else if (n->scale < nitems(factors)) {  in split_number()
397 		rem = BN_div_word(i, factors[n->scale]);  in split_number()
409 		bn_check(BN_set_word(p, n->scale));  in split_number()
420 	scale_number(n->number, s - n->scale);  in normalize()
421 	n->scale = s;  in normalize()
574 	bn_check(BN_set_word(n->number, bmachine.scale));  in get_scale()
582 	u_long		scale;  in set_scale()  local
589 			scale = get_ulong(n);  in set_scale()
590 			if (scale != BN_MASK2 && scale <= UINT_MAX)  in set_scale()
591 				bmachine.scale = (u_int)scale;  in set_scale()
670 	u_int		scale = 0;  in push_scale()  local
679 			scale = value->u.num->scale;  in push_scale()
686 		bn_check(BN_set_word(n->number, scale));  in push_scale()
700 		return n->scale;  in count_digits()
739 	return d + n->scale;  in count_digits()
986 	if (b->scale > a->scale)  in badd()
987 		normalize(a, b->scale);  in badd()
988 	else if (a->scale > b->scale)  in badd()
989 		normalize(b, a->scale);  in badd()
1009 	if (b->scale > a->scale)  in bsub()
1010 		normalize(a, b->scale);  in bsub()
1011 	else if (a->scale > b->scale)  in bsub()
1012 		normalize(b, a->scale);  in bsub()
1019 bmul_number(struct number *r, struct number *a, struct number *b, u_int scale)  in bmul_number()  argument
1022 	u_int ascale = a->scale;  in bmul_number()
1023 	u_int bscale = b->scale;  in bmul_number()
1028 	r->scale = rscale;  in bmul_number()
1029 	if (rscale > bmachine.scale && rscale > ascale && rscale > bscale)  in bmul_number()
1030 		normalize(r, max(scale, max(ascale, bscale)));  in bmul_number()
1047 	bmul_number(b, a, b, bmachine.scale);  in bmul()
1057 	u_int		scale;  in bdiv()  local
1069 	r->scale = bmachine.scale;  in bdiv()
1070 	scale = max(a->scale, b->scale);  in bdiv()
1075 		normalize(a, scale);  in bdiv()
1076 		normalize(b, scale + r->scale);  in bdiv()
1090 	u_int		scale;  in bmod()  local
1102 	scale = max(a->scale, b->scale);  in bmod()
1103 	r->scale = max(b->scale, a->scale + bmachine.scale);  in bmod()
1108 		normalize(a, scale);  in bmod()
1109 		normalize(b, scale + bmachine.scale);  in bmod()
1123 	u_int		scale;  in bdivmod()  local
1136 	rdiv->scale = bmachine.scale;  in bdivmod()
1137 	rmod->scale = max(b->scale, a->scale + bmachine.scale);  in bdivmod()
1138 	scale = max(a->scale, b->scale);  in bdivmod()
1143 		normalize(a, scale);  in bdivmod()
1144 		normalize(b, scale + bmachine.scale);  in bdivmod()
1172 	if (p->scale != 0) {  in bexp()
1190 		rscale = bmachine.scale;  in bexp()
1197 		m = max(a->scale, bmachine.scale);  in bexp()
1198 		rscale = a->scale * (u_int)b;  in bexp()
1199 		if (rscale > m || (a->scale > 0 && (b == BN_MASK2 ||  in bexp()
1211 		ascale = a->scale;  in bexp()
1238 			scale_number(one, r->scale + rscale);  in bexp()
1246 			r->scale = rscale;  in bexp()
1261 	u_int		scale, onecount;  in bsqrt()  local
1273 		scale = max(bmachine.scale, n->scale);  in bsqrt()
1274 		normalize(n, 2*scale);  in bsqrt()
1291 		r->scale = scale;  in bsqrt()
1308 	a->scale = 0;  in not()
1411 	u_int	scale;  in compare_numbers()  local
1414 	scale = max(a->scale, b->scale);  in compare_numbers()
1416 	if (scale > a->scale)  in compare_numbers()
1417 		normalize(a, scale);  in compare_numbers()
1418 	else if (scale > b->scale)  in compare_numbers()
1419 		normalize(b, scale);  in compare_numbers()