Lines Matching refs:BE
17 IN NO EVENT SHALL MOTOROLA BE LIABLE FOR ANY DAMAGES WHATSOEVER
5180 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5183 #--R' = SGN*R, S=R*R. THIS CAN BE REWRITTEN AS
5233 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5236 #--S=R*R AND S'=SGN*S. THIS CAN BE REWRITTEN AS
5568 #--WHEN REDUCEX IS USED, THE CODE WILL INEVITABLY BE SLOW.
5643 #--WILL BE TOO INEFFICIENT. THE WAY AROUND IT IS THAT
5999 #--WHEN REDUCEX IS USED, THE CODE WILL INEVITABLY BE SLOW.
6074 #--WILL BE TOO INEFFICIENT. THE WAY AROUND IT IS THAT
6366 #--SO IF F IS CHOSEN TO BE CLOSE TO X AND ATAN(F) IS STORED IN
6371 #--FETCH F AND SAVING OF REGISTERS CAN BE ALL HIDED UNDER THE
6379 #--WE CHOSE F TO BE +-2^K * 1.BBBB1
6381 #--SIXTH BITS IS SET TO BE 1. SINCE K = -4, -3, ..., 3, THERE
6518 #--THIS CAN BE RE-WRITTEN AS
8343 #--THIS SHOULD BE THE USUAL CASE, X NOT VERY CLOSE TO 1
8350 #--LOG(1+U) CAN BE VERY EFFICIENT.
8358 add.l ADJK(%a6),%d1 # ADJUST K, ORIGINAL INPUT MAY BE DENORM.
8591 #--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE