Lines Matching refs:Notes
6813 # Notes: This will always generate one exception -- inexact. #
6824 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.#
6849 # Notes: The calculation in 2.2 is really performed by #
6868 # Notes: a) The way L1 and L2 are chosen ensures L1+L2 #
6892 # Notes: a) In order to reduce memory access, the coefficients #
6908 # Notes: 2^(J/64) is stored as T and t where T+t approximates #
6923 # Notes: If AdjFlag = 0, we have X = Mlog2 + Jlog2/64 + R, #
6941 # Notes: For non-zero X, the inexact exception will always be #
6961 # Notes: Refer to notes for 2.2 - 2.6. #
6969 # Notes: Exp(X) will surely overflow or underflow, depending on #
6981 # Notes: This will return X with the appropriate rounding #
6992 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.#
7007 # Notes: See the notes on Step 2 of setox. #
7014 # Notes: Applying the analysis of Step 3 of setox in this case #
7020 # Notes: a) In order to reduce memory access, the coefficients #
7036 # Notes: 2^(J/64) is stored as T and t where T+t approximates #
7055 # Notes: The various arrangements of the expressions give #
7069 # Notes: The idea is to return "X - tiny" under the user #
7078 # Notes: a) In order to reduce memory access, the coefficients #
7103 # Notes: 10.2 will always create an inexact and return -1 + tiny #
8114 # Implementation Notes: #
8776 # Notes: Default means round-to-nearest mode, no floating-point #
8780 # Notes: Even if X is denormalized, log(X) is always normalized. #
8790 # Notes: Default means round-to-nearest mode, no floating-point #
8803 # Notes: Default means round-to-nearest mode, no floating-point #
8807 # Notes: Even if X is denormalized, log(X) is always normalized. #
8817 # Notes: Default means round-to-nearest mode, no floating-point #
22214 # Notes: the ext_grs uses the round PREC, and therefore has to swap d1
23587 # Implementation Notes:
24498 # Implementation Notes: