37  * A.full => The full number as it is. Generally not easy to read
42     int full;  member
223 		temp.full = (X << SHIFT_AMOUNT);  in ConvertToFraction()
225 		temp.full = 0;  in ConvertToFraction()
241 		temp.full = (X << SHIFT_AMOUNT);  in Convert_ULONG_ToFraction()
243 		temp.full = 0;  in Convert_ULONG_ToFraction()
280 			fValue.full = 0;  in GetScaledFraction()
290 	fValue.full = fValue.full << times_shifted;  in GetScaledFraction()
291 	fValue.full = fValue.full >> factor_shifted;  in GetScaledFraction()
301 	Sum.full = X.full + Y.full;  in fAdd()
311 	Difference.full = X.full - Y.full;  in fSubtract()
318 	if (A.full == B.full)  in Equal()
326 	if (A.full > B.full)  in GreaterThan()
341 	X_LessThanOne = (X.partial.real == 0 && X.partial.decimal != 0 && X.full >= 0);  in fMultiply()
342 	Y_LessThanOne = (Y.partial.real == 0 && Y.partial.decimal != 0 && Y.full >= 0);  in fMultiply()
345 		Product.full = X.full * Y.full;  in fMultiply()
349 …tempProduct = ((int64_t)X.full) * ((int64_t)Y.full); /*Q(16,16)*Q(16,16) = Q(32, 32) - Might becom…  in fMultiply()
351 …Product.full = (int)tempProduct; /*The int64_t will lose the leading 16 bits that were part of the…  in fMultiply()
366 	longlongX = (int64_t)X.full;  in fDivide()
367 	longlongY = (int64_t)Y.full;  in fDivide()
373 	fQuotient.full = (int)longlongX;  in fDivide()
381 	scaledReal.full = GetReal(A) * uPow(10, PRECISION-1); /* DOUBLE CHECK THISSSS!!! */  in ConvertBackToInteger()
383 	scaledDecimal.full = uGetScaledDecimal(A);  in ConvertBackToInteger()
387 	return fullNumber.full;  in ConvertBackToInteger()
433 		x_old.full = x_new.full;  in fSqrt()
494 	return (A.full >> SHIFT_AMOUNT);  in GetReal()
501 	A.full = X << SHIFT_AMOUNT;  in Divide()
502 	B.full = Y << SHIFT_AMOUNT;  in Divide()