Lines Matching refs:J
82 | 2.3 Calculate J = N mod 64; so J = 0,1,2,..., or 63.
83 | 2.4 Calculate M = (N - J)/64; so N = 64M + J.
84 | 2.5 Calculate the address of the stored value of 2^(J/64).
141 | Step 5. Compute 2^(J/64)*exp(R) = 2^(J/64)*(1+p) by
143 | where T and t are the stored values for 2^(J/64).
144 | Notes: 2^(J/64) is stored as T and t where T+t approximates
145 | 2^(J/64) to roughly 85 bits; T is in extended precision
153 | exp(X) = 2^M * 2^(J/64) * exp(R).
189 | 8.3 Calculate J = N mod 64, J = 0,1,...,63
190 | 8.4 K := (N-J)/64, M1 := truncate(K/2), M = K-M1, AdjFlag := 1.
191 | 8.5 Calculate the address of the stored value 2^(J/64).
492 andil #0x3F,%d0 | ...D0 is J = N mod 64
494 addal %d0,%a1 | ...address of 2^(J/64)
503 |--a0 points to 2^(J/64), D0 is biased expo. of 2^(M)
521 | MOVE.W #0,2(%a1) ...load 2^(J/64) in cache
545 fmovex (%a1)+,%fp1 | ...fp1 is lead. pt. of 2^(J/64)
551 |--EXP(X) = 2^M * ( 2^(J/64) + 2^(J/64)*(EXP(R)-1) )
553 fmulx %fp1,%fp0 | ...2^(J/64)*(Exp(R)-1)
555 fadds (%a1),%fp0 | ...accurate 2^(J/64)
557 faddx %fp1,%fp0 | ...2^(J/64) + 2^(J/64)*...
592 andil #0x3F,%d0 | ...D0 is J = N mod 64
594 addal %d0,%a1 | ...address of 2^(J/64)
659 andil #0x3F,%d0 | ...D0 is J = N mod 64
661 addal %d0,%a1 | ...address of 2^(J/64)
669 |--a0 points to 2^(J/64), D0 and a1 both contain M
688 | MOVE.W #0,2(%a1) ...load 2^(J/64) in cache
727 |--Compute 2^(J/64)*p
729 fmulx (%a1),%fp0 | ...2^(J/64)*(Exp(R)-1)