Lines Matching refs:THE
257 |--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
258 |--THE IDEA IS ATAN(X) = ATAN(F) + ATAN( [X-F] / [1+XF] ).
262 |--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
263 |--ATAN(U) IS A VERY SHORT POLYNOMIAL AND THE INDEXING TO
264 |--FETCH F AND SAVING OF REGISTERS CAN BE ALL HIDED UNDER THE
265 |--DIVIDE. IN THE END THIS METHOD IS MUCH FASTER THAN A TRADITIONAL
266 |--ONE. NOTE ALSO THAT THE TRADITIONAL SCHEME THAT APPROXIMATE
273 |--THAT IS IT MATCHES THE EXPONENT AND FIRST 5 BITS OF X, THE
291 |--WHILE THE DIVISION IS TAKING ITS TIME, WE FETCH ATAN(|F|)
296 movel %d0,%d2 | ...THE EXPO AND 16 BITS OF X
301 addl %d2,%d0 | ...THE 7 BITS IDENTIFYING F
314 |--BUT ALAS, THE DIVIDE IS STILL CRANKING!
318 |--THE POLYNOMIAL MAY LOOK STRANGE, BUT IS NEVERTHELESS CORRECT.
319 |--THE NATURAL FORM IS U + U*V*(A1 + V*(A2 + V*A3))
321 |--THE REASON FOR THIS REARRANGEMENT IS TO MAKE THE INDEPENDENT