usr.bin/dc/bcode.c

43 	u_int			 scale;
255 	return bmachine.scale;
308 	fprintf(stderr, " %s (%u)\n" , p, n->scale);
378 	if (n->scale == 0 && f != NULL)
380 	else if (n->scale < sizeof(factors)/sizeof(factors[0])) {
381 		rem = BN_div_word(i, factors[n->scale]);
396 		bn_check(BN_set_word(p, n->scale));
405 /* Change the scale of n to s.  Reducing scale may truncate the mantissa */
410 	scale_number(n->number, s - n->scale);
411 	n->scale = s;
579 	bn_check(BN_set_word(n->number, bmachine.scale));
587 	u_long scale;
592 			warnx("scale must be a nonnegative number");
594 			scale = get_ulong(n);
595 			if (scale != ULONG_MAX && scale <= UINT_MAX)
596 				bmachine.scale = (u_int)scale;
598 				warnx("scale too large");
676 	u_int scale = 0;
684 			scale = value->u.num->scale;
691 		bn_check(BN_set_word(n->number, scale));
703 		return n->scale ? n->scale : 1;
707 	fract_part->scale = n->scale;
717 	return (i + n->scale);
978 	r->scale = max(a->scale, b->scale);
979 	if (r->scale > a->scale)
980 		normalize(a, r->scale);
981 	else if (r->scale > b->scale)
982 		normalize(b, r->scale);
1005 	r->scale = max(a->scale, b->scale);
1006 	if (r->scale > a->scale)
1007 		normalize(a, r->scale);
1008 	else if (r->scale > b->scale)
1009 		normalize(b, r->scale);
1017 bmul_number(struct number *r, struct number *a, struct number *b, u_int scale)
1022 	u_int ascale = a->scale;
1023 	u_int bscale = b->scale;
1031 	r->scale = rscale;
1032 	if (rscale > bmachine.scale && rscale > ascale && rscale > bscale)
1033 		normalize(r, max(scale, max(ascale, bscale)));
1051 	bmul_number(r, a, b, bmachine.scale);
1072 	r = div_number(b, a, bmachine.scale);
1084 	u_int scale;
1096 	scale = max(a->scale, b->scale);
1097 	r->scale = scale;
1102 		normalize(a, scale);
1103 		normalize(b, scale);
1120 	u_int scale;
1134 	scale = max(a->scale, b->scale);
1135 	rdiv->scale = 0;
1136 	remainder->scale = scale;
1137 	quotient->scale = bmachine.scale;
1138 	scale = max(a->scale, b->scale);
1143 		normalize(a, scale);
1144 		normalize(b, scale);
1160 		frac = div_number(remainder, a, bmachine.scale);
1161 		normalize(rdiv, bmachine.scale);
1162 		normalize(remainder, scale);
1191 	if (p->scale != 0) {
1210 		rscale = bmachine.scale;
1212 		/* Posix bc says min(a.scale * b, max(a.scale, scale) */
1217 		m = max(a->scale, bmachine.scale);
1218 		rscale = a->scale * (u_int)b;
1219 		if (rscale > m || (a->scale > 0 && (b == ULONG_MAX ||
1231 		ascale = a->scale;
1261 			scale_number(one, r->scale + rscale);
1270 			r->scale = rscale;
1301 	u_int onecount, scale;
1313 		scale = max(bmachine.scale, n->scale);
1314 		normalize(n, 2*scale);
1331 		r->scale = scale;
1349 	a->scale = 0;
1477 	u_int scale;
1480 	scale = max(a->scale, b->scale);
1482 	if (scale > a->scale)
1483 		normalize(a, scale);
1484 	else if (scale > b->scale)
1485 		normalize(b, scale);
1680 	    bmachine.ibase, bmachine.scale));