Lines Matching refs:BE
17 IN NO EVENT SHALL MOTOROLA BE LIABLE FOR ANY DAMAGES WHATSOEVER
5074 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5077 #--R' = SGN*R, S=R*R. THIS CAN BE REWRITTEN AS
5127 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5130 #--S=R*R AND S'=SGN*S. THIS CAN BE REWRITTEN AS
5462 #--WHEN REDUCEX IS USED, THE CODE WILL INEVITABLY BE SLOW.
5537 #--WILL BE TOO INEFFICIENT. THE WAY AROUND IT IS THAT
5893 #--WHEN REDUCEX IS USED, THE CODE WILL INEVITABLY BE SLOW.
5968 #--WILL BE TOO INEFFICIENT. THE WAY AROUND IT IS THAT
6260 #--SO IF F IS CHOSEN TO BE CLOSE TO X AND ATAN(F) IS STORED IN
6265 #--FETCH F AND SAVING OF REGISTERS CAN BE ALL HIDED UNDER THE
6273 #--WE CHOSE F TO BE +-2^K * 1.BBBB1
6275 #--SIXTH BITS IS SET TO BE 1. SINCE K = -4, -3, ..., 3, THERE
6412 #--THIS CAN BE RE-WRITTEN AS
8237 #--THIS SHOULD BE THE USUAL CASE, X NOT VERY CLOSE TO 1
8244 #--LOG(1+U) CAN BE VERY EFFICIENT.
8252 add.l ADJK(%a6),%d1 # ADJUST K, ORIGINAL INPUT MAY BE DENORM.
8485 #--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE