>>>And speaking of emulating IEEE 754 float operations, speed and
>>>code size go south in a big hurry if infinities, denormalized
>>>numbers, NaNs, and rounding are handled properly.
>>Those are rare cases -- affect code size, yes, but only a small
>>effect on speed.
> But every operation pays the price of checking for the rare
> values whether they are present/occur or not.
All the special values (NaN, Inf, Zero and Denorm) can be handled (at
least approximately) with a simple test of the exponent field, before
falling through with the normal case.
Since the Denorms all would be included in the normal
'Special_exponent()' test, the overhead is only in the fixup part.
"almost all programming can be viewed as an exercise in caching"