43 	u_int			 scale;  member
255 	return bmachine.scale;  in bmachine_scale()
308 	fprintf(stderr, " %s (%u)\n" , p, n->scale);  in pn()
378 	if (n->scale == 0 && f != NULL)  in split_number()
380 	else if (n->scale < sizeof(factors)/sizeof(factors[0])) {  in split_number()
381 		rem = BN_div_word(i, factors[n->scale]);  in split_number()
396 		bn_check(BN_set_word(p, n->scale));  in split_number()
410 	scale_number(n->number, s - n->scale);  in normalize()
411 	n->scale = s;  in normalize()
579 	bn_check(BN_set_word(n->number, bmachine.scale));  in get_scale()
587 	u_long scale;  in set_scale()  local
594 			scale = get_ulong(n);  in set_scale()
595 			if (scale != ULONG_MAX && scale <= UINT_MAX)  in set_scale()
596 				bmachine.scale = (u_int)scale;  in set_scale()
676 	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()
978 	r->scale = max(a->scale, b->scale);  in badd()
979 	if (r->scale > a->scale)  in badd()
980 		normalize(a, r->scale);  in badd()
981 	else if (r->scale > b->scale)  in badd()
982 		normalize(b, r->scale);  in badd()
1005 	r->scale = max(a->scale, b->scale);  in bsub()
1006 	if (r->scale > a->scale)  in bsub()
1007 		normalize(a, r->scale);  in bsub()
1008 	else if (r->scale > b->scale)  in bsub()
1009 		normalize(b, r->scale);  in bsub()
1017 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()
1031 	r->scale = rscale;  in bmul_number()
1032 	if (rscale > bmachine.scale && rscale > ascale && rscale > bscale)  in bmul_number()
1033 		normalize(r, max(scale, max(ascale, bscale)));  in bmul_number()
1051 	bmul_number(r, a, b, bmachine.scale);  in bmul()
1072 	r = div_number(b, a, bmachine.scale);  in bdiv()
1084 	u_int scale;  in bmod()  local
1096 	scale = max(a->scale, b->scale);  in bmod()
1097 	r->scale = scale;  in bmod()
1102 		normalize(a, scale);  in bmod()
1103 		normalize(b, scale);  in bmod()
1120 	u_int scale;  in bdivmod()  local
1134 	scale = max(a->scale, b->scale);  in bdivmod()
1135 	rdiv->scale = 0;  in bdivmod()
1136 	remainder->scale = scale;  in bdivmod()
1137 	quotient->scale = bmachine.scale;  in bdivmod()
1138 	scale = max(a->scale, b->scale);  in bdivmod()
1143 		normalize(a, scale);  in bdivmod()
1144 		normalize(b, scale);  in bdivmod()
1160 		frac = div_number(remainder, a, bmachine.scale);  in bdivmod()
1161 		normalize(rdiv, bmachine.scale);  in bdivmod()
1162 		normalize(remainder, scale);  in bdivmod()
1191 	if (p->scale != 0) {  in bexp()
1210 		rscale = bmachine.scale;  in bexp()
1217 		m = max(a->scale, bmachine.scale);  in bexp()
1218 		rscale = a->scale * (u_int)b;  in bexp()
1219 		if (rscale > m || (a->scale > 0 && (b == ULONG_MAX ||  in bexp()
1231 		ascale = a->scale;  in bexp()
1261 			scale_number(one, r->scale + rscale);  in bexp()
1270 			r->scale = rscale;  in bexp()
1301 	u_int onecount, scale;  in bsqrt()  local
1313 		scale = max(bmachine.scale, n->scale);  in bsqrt()
1314 		normalize(n, 2*scale);  in bsqrt()
1331 		r->scale = scale;  in bsqrt()
1349 	a->scale = 0;  in not()
1477 	u_int scale;  in compare_numbers()  local
1480 	scale = max(a->scale, b->scale);  in compare_numbers()
1482 	if (scale > a->scale)  in compare_numbers()
1483 		normalize(a, scale);  in compare_numbers()
1484 	else if (scale > b->scale)  in compare_numbers()
1485 		normalize(b, scale);  in compare_numbers()
1680 	    bmachine.ibase, bmachine.scale));  in parse_number()