bc/src/num.c

325 		// Clear the lower part of the last digit.
756 	// digit; multiplication never goes above the sum of both lengths.
1865 	BcNum intp, fracp1, fracp2, digit, flen1, flen2, *n1, *n2, *temp;
1886 	// The algorithm takes the current least significant digit (after intp has
1887 	// been converted to an integer) and the next to least significant digit,
1888 	// and it converts the least significant digit into one of the specified
1889 	// base, putting any overflow into the next to least significant digit. It
1892 	// least significant digit is converted, but the others are not, so it
1893 	// iterates again, starting at the next to least significant digit. It keeps
1894 	// doing that conversion, skipping one more digit than the last time, until
1982 	bc_num_setup(&digit, digit_digs, sizeof(digit_digs) / sizeof(BcDig));
2011 		bc_num_bigdig2num(&digit, dig);
2012 		bc_num_sub(&fracp2, &digit, &fracp1, 0);