Lines Matching refs:Let
1569 # address register was the stack pointer used from user mode, then let's update
2593 # now, we're left with ftst and fcmp. so, first let's tag them so that they don't
3008 # the <ea> field is let as undefined.
5040 # 3. Decompose X as X = N(Pi/2) + r where |r| <= Pi/4. Let #
5068 # 2. Decompose X as X = N(Pi/2) + r where |r| <= Pi/4. Let #
5189 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5242 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5742 # 2. Decompose X as X = N(Pi/2) + r where |r| <= Pi/4. Let #
6171 # Step 2. Let X = sgn * 2**k * 1.xxxxxxxx...x. #
8016 #--TANH(X) = 1 - (2/[EXP(2X)+1]). LET Y = 2|X|, SGN = SIGN(X),
8118 # Step 2: Let 1+X = 2**k * Y, where 1 <= Y < 2. Define F as done #
8455 #--LET V=U*U, W=V*V, CALCULATE
8985 # 4. Let AdjFact := 2**(M'). Return #
9660 # the src will force the dst to a DENORM value or worse. so, let's
11785 # for fun, let's use only extended precision, round to zero. then, let
16880 # let the caller of this routine shift the stack frame up to
17449 # let the caller of this routine shift the stack frame up to
18145 # let the caller of this routine shift the stack frame up to
20514 bne.b fout_sgl_unfl_cont # let DENORMs fall through
20743 bne.b fout_dbl_unfl_cont # let DENORMs fall through
22527 # it's an "unnormalized zero". let's convert it to an actual zero...