Lines Matching refs:IN

17 IN NO EVENT SHALL MOTOROLA BE LIABLE FOR ANY DAMAGES WHATSOEVER  label
5060 # ...WHICH IS IN TWO PIECES Y1 & Y2
5133 #--NOTE THAT B4 THROUGH B8 ARE STORED IN DOUBLE PRECISION
5134 #--WHILE B2 AND B3 ARE IN DOUBLE-EXTENDED FORMAT, B1 IS -1/2
5150 # ...LEAST SIG. BIT OF D0 IN SIGN POSITION
5539 #--US THE DESIRED VALUE IN FLOATING POINT.
5543 	or.l		&0x5F000000,%d2		# d2 = SIGN(INARG)*2**63 IN SGL
5681 #--N*PI/2, -32 <= N <= 32, IN A LEADING TERM IN EXT. AND TRAILING
5682 #--TERM IN SGL. NOTE THAT PI IS 64-BIT LONG, THUS N*PI/2 IS AT
5785 	add.l		%d1,%a1			# ADDRESS N*PIBY2 IN Y1, Y2
5895 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5966 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6258 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6260 #--SO IF F IS CHOSEN TO BE CLOSE TO X AND ATAN(F) IS STORED IN
6266 #--DIVIDE. IN THE END THIS METHOD IS MUCH FASTER THAN A TRADITIONAL
7924 	fmov.s		%d1,%fp1		# -SIGN(X)*2 IN SGL FMT
7929 	fmov.s		%d1,%fp0		# SGN IN SGL FMT
8239 #--X = 2^(K) * Y, 1 <= Y < 2. THUS, Y = 1.XXXXXXXX....XX IN BINARY.
8245 #--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
8282 	fmov.x		%fp1,KLOG2(%a6)		# PUT K*LOG2 IN MEMEORY, FREE FP1
8466 #--CONTAINS AT LEAST 63 BITS OF INFORMATION OF Z. IN THAT CASE,
8487 #--PRESERVE ALL THE INFORMATION. BECAUSE 1+Z IS IN [1/2,3/2],
8491 #--ON RETURNING TO LP1CONT1, WE MUST HAVE K IN FP1, ADDRESS OF
8492 #--(1/F) IN A0, Y-F IN FP0, AND FP2 SAVED.
8536 #--FPCR SAVED. D0 IS X IN COMPACT FORM.
9025 #--REGISTERS SAVED SO FAR ARE (IN ORDER) FPCR, D0, FP1, a1, AND FP2.
9122 #--REGISTERS SAVED SO FAR ARE (IN ORDER) FPCR, D0, FP1, a1, AND FP2.
9148 #--FPCR, FP2, FP3 ARE SAVED IN ORDER AS SHOWN.