Dealing with exceptional cases

Floating-point ciphering in a computer can run into three kinds of problems:

An operation can be mathematically undefined, such as ∞/∞, or analysis by zero.

An operation can be acknowledged in principle, but not accurate by the specific format, for example, artful the aboveboard basis of −1 or the changed sine of 2 (both of which aftereffect in circuitous numbers).

An operation can be acknowledged in principle, but the aftereffect can be absurd to represent in the authentic format, because the backer is too ample or too baby to encode in the backer field. Such an accident is alleged an overflow (exponent too large), underflow (exponent too small) or denormalization (precision loss).

Prior to the IEEE standard, such altitude usually acquired the affairs to terminate, or triggered some affectionate of allurement that the programmer ability be able to catch. How this formed was system-dependent, acceptation that floating-point programs were not portable. (Note that the appellation "exception" as acclimated in IEEE-754 is a accepted appellation acceptation an aberrant condition, which is not necessarily an error, and is a altered acceptance to that about authentic in programming languages such as a C++ or Java, in which an "exception" is an addition breeze of control, afterpiece to what is termed a "trap" in IEEE-754 terminology).

Here, the appropriate absence adjustment of administration exceptions according to IEEE 754 is discussed (the IEEE-754 alternative accoutrement and added "alternate barring handling" modes are not discussed). Addition exceptions are (by default) appropriate to be recorded in "sticky" cachet banderole bits. That they are "sticky" agency that they are not displace by the next (arithmetic) operation, but break set until absolutely reset. The use of "sticky" flags appropriately allows for testing of aberrant altitude to be delayed until afterwards a abounding amphibian point announcement or subroutine: afterwards them aberrant altitude that could not be contrarily abandoned would crave complete testing anon afterwards every amphibian point operation. By default, an operation consistently allotment a aftereffect according to blueprint afterwards arresting computation. For instance, 1/0 allotment +∞, while aswell ambience the divide-by-zero banderole bit (this absence of ∞ is advised so as to generally acknowledgment a bound aftereffect if acclimated in consecutive operations and so be cautiously ignored).

The aboriginal IEEE 754 standard, however, bootless to acclaim operations to handle such sets of addition barring banderole bits. So while these were implemented in hardware, initially programming accent implementations about did not accommodate a agency to admission them (apart from assembler). Over time some programming accent standards (e.g., C99/C11 and Fortran) accept been adapted to specify methods to admission and change cachet banderole bits. The 2008 adaptation of the IEEE 754 accepted now specifies a few operations for accessing and administration the addition banderole bits. The programming archetypal is based on a individual cilia of beheading and use of them by assorted accoutrement has to be handled by a agency alfresco of the accepted (e.g. C11 specifies that the flags accept thread-local storage).

IEEE 754 specifies 5 addition exceptions that are to be recorded in the cachet flags ("sticky bits"):

inexact, set if the angled (and returned) amount is altered from the mathematically exact aftereffect of the operation.

underflow, set if the angled amount is tiny (as authentic in IEEE 754) and inexact (or maybe bound to if it has denormalisation loss, as per the 1984 adaptation of IEEE 754), abiding a arrested amount including the zeros.

overflow, set if the complete amount of the angled amount is too ample to be represented. An beyond or acute bound amount is returned, depending on which rounding is used.

divide-by-zero, set if the aftereffect is absolute accustomed bound operands, abiding an infinity, either +∞ or −∞.

invalid, set if a real-valued aftereffect cannot be alternate e.g. sqrt(−1) or 0/0, abiding a quiet NaN.

Fig. 1: resistances in parallel, with absolute attrition

The absence acknowledgment amount for anniversary of the exceptions is advised to accord the actual aftereffect in the majority of cases such that the exceptions can be abandoned in the majority of codes. inexact allotment a accurately angled result, and underflow allotment a denormalised baby amount and so can about consistently be ignored.19 divide-by-zero allotment beyond exactly, which will about again bisect a bound amount and so accord zero, or abroad will accord an invalid barring after if not, and so can aswell about be ignored. For example, the able attrition of three resistors in alongside (see fig. 1) is accustomed by . If a circumlocute develops with set to 0, will acknowledgment +infinity which will accord a final of 0, as accepted 20 (see the connected atom archetype of IEEE 754 architecture account for addition example).

Overflow and invalid exceptions can about not be ignored, but do not necessarily represent errors: for example, a root-finding routine, as allotment of its accustomed operation, may appraise a passed-in action at ethics alfresco of its domain, abiding NaN and an invalid barring banderole to be abandoned until award a advantageous alpha point.