Searched refs:Notes (Results 1 - 22 of 22) sorted by relevance
/kernel/linux/linux-5.10/arch/m68k/fpsp040/ |
H A D | slog2.S | 34 | Notes: Default means round-to-nearest mode, no floating-point 38 | Notes: Even if X is denormalized, log(X) is always normalized. 49 | Notes: Default means round-to-nearest mode, no floating-point 63 | Notes: Default means round-to-nearest mode, no floating-point 67 | Notes: Even if X is denormalized, log(X) is always normalized. 78 | Notes: Default means round-to-nearest mode, no floating-point
|
H A D | setox.S | 53 | Notes: This will always generate one exception -- inexact. 64 | Notes: The usual case should take the branches 1.1 -> 1.3 -> 2. 86 | Notes: The calculation in 2.2 is really performed by 106 | Notes: a) The way L1 and L2 are chosen ensures L1+L2 approximate 129 | Notes: a) In order to reduce memory access, the coefficients are 144 | Notes: 2^(J/64) is stored as T and t where T+t approximates 158 | Notes: If AdjFlag = 0, we have X = Mlog2 + Jlog2/64 + R, 176 | Notes: For non-zero X, the inexact exception will always be 194 | Notes: Refer to notes for 2.2 - 2.6. 202 | Notes [all...] |
H A D | binstr.S | 45 | Implementation Notes:
|
H A D | slogn.S | 50 | Implementation Notes:
|
H A D | round.S | 134 | Notes: the ext_grs uses the round PREC, and therefore has to swap d1
|
H A D | bindec.S | 108 | Implementation Notes:
|
H A D | tbldo.S | 46 | instruction ;opcode-stag Notes
|
H A D | res_func.S | 1974 | Notes on handling of special case (zero, inf, and nan) inputs:
|
/kernel/linux/linux-6.6/arch/m68k/fpsp040/ |
H A D | slog2.S | 34 | Notes: Default means round-to-nearest mode, no floating-point 38 | Notes: Even if X is denormalized, log(X) is always normalized. 49 | Notes: Default means round-to-nearest mode, no floating-point 63 | Notes: Default means round-to-nearest mode, no floating-point 67 | Notes: Even if X is denormalized, log(X) is always normalized. 78 | Notes: Default means round-to-nearest mode, no floating-point
|
H A D | setox.S | 53 | Notes: This will always generate one exception -- inexact. 64 | Notes: The usual case should take the branches 1.1 -> 1.3 -> 2. 86 | Notes: The calculation in 2.2 is really performed by 106 | Notes: a) The way L1 and L2 are chosen ensures L1+L2 approximate 129 | Notes: a) In order to reduce memory access, the coefficients are 144 | Notes: 2^(J/64) is stored as T and t where T+t approximates 158 | Notes: If AdjFlag = 0, we have X = Mlog2 + Jlog2/64 + R, 176 | Notes: For non-zero X, the inexact exception will always be 194 | Notes: Refer to notes for 2.2 - 2.6. 202 | Notes [all...] |
H A D | binstr.S | 45 | Implementation Notes:
|
H A D | slogn.S | 50 | Implementation Notes:
|
H A D | tbldo.S | 46 | instruction ;opcode-stag Notes
|
H A D | round.S | 134 | Notes: the ext_grs uses the round PREC, and therefore has to swap d1
|
H A D | bindec.S | 108 | Implementation Notes:
|
H A D | res_func.S | 1974 | Notes on handling of special case (zero, inf, and nan) inputs:
|
/kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/ |
H A D | fplsp.S | 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 [all...] |
H A D | fpsp.S | 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 [all...] |
/kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/ |
H A D | fplsp.S | 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 [all...] |
H A D | fpsp.S | 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 [all...] |
/kernel/linux/linux-5.10/scripts/ |
H A D | get_maintainer.pl | 1090 Notes: label
|
/kernel/linux/linux-6.6/scripts/ |
H A D | get_maintainer.pl | 1091 Notes: label
|
Completed in 53 milliseconds