+ if (in->leader < in->low)
+ {
+ out->leader = out->low - 1; /* 0.0 case */
+ }
+ else
+ {
+ out_length = out->high - out->low;
+ /* Assume no GAPS in packing of littlenums.
+ I.e. sizeof(array) == sizeof(element) * number_of_elements. */
+ if (in_length <= out_length)
+ {
+ {
+ /* For defensive programming, zero any high-order
+ littlenums we don't need. This is destroying evidence
+ and wasting time, so why bother??? */
+ if (in_length < out_length)
+ {
+ memset ((char *) (out->low + in_length + 1), '\0',
+ out_length - in_length);
+ }
+ }
+ memcpy ((void *) (out->low), (void *) (in->low),
+ ((in_length + 1) * sizeof (LITTLENUM_TYPE)));
+ out->exponent = in->exponent;
+ out->leader = in->leader - in->low + out->low;
+ }
+ else
+ {
+ int shorten; /* 1-origin. Number of littlenums we drop. */
+
+ shorten = in_length - out_length;
+ /* Assume out_length >= 0 ! */
+ memcpy ((void *) (out->low), (void *) (in->low + shorten),
+ ((out_length + 1) * sizeof (LITTLENUM_TYPE)));
+ out->leader = out->high;
+ out->exponent = in->exponent + shorten;
+ }
+ } /* if any significant bits */
+}