Lines Matching refs:Notes
6707 # Notes: This will always generate one exception -- inexact. #
6718 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.#
6743 # Notes: The calculation in 2.2 is really performed by #
6762 # Notes: a) The way L1 and L2 are chosen ensures L1+L2 #
6786 # Notes: a) In order to reduce memory access, the coefficients #
6802 # Notes: 2^(J/64) is stored as T and t where T+t approximates #
6817 # Notes: If AdjFlag = 0, we have X = Mlog2 + Jlog2/64 + R, #
6835 # Notes: For non-zero X, the inexact exception will always be #
6855 # Notes: Refer to notes for 2.2 - 2.6. #
6863 # Notes: Exp(X) will surely overflow or underflow, depending on #
6875 # Notes: This will return X with the appropriate rounding #
6886 # Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.#
6901 # Notes: See the notes on Step 2 of setox. #
6908 # Notes: Applying the analysis of Step 3 of setox in this case #
6914 # Notes: a) In order to reduce memory access, the coefficients #
6930 # Notes: 2^(J/64) is stored as T and t where T+t approximates #
6949 # Notes: The various arrangements of the expressions give #
6963 # Notes: The idea is to return "X - tiny" under the user #
6972 # Notes: a) In order to reduce memory access, the coefficients #
6997 # Notes: 10.2 will always create an inexact and return -1 + tiny #
8008 # Implementation Notes: #
8670 # Notes: Default means round-to-nearest mode, no floating-point #
8674 # Notes: Even if X is denormalized, log(X) is always normalized. #
8684 # Notes: Default means round-to-nearest mode, no floating-point #
8697 # Notes: Default means round-to-nearest mode, no floating-point #
8701 # Notes: Even if X is denormalized, log(X) is always normalized. #
8711 # Notes: Default means round-to-nearest mode, no floating-point #