68 		p0 = dfclass(A,#2)  define
69 		p0 = dfclass(B,#2)  define
84 	// Adding 2 HLs, we get 2^64-3*2^32+2 maximum.
85 	// Therefore, we can add 3 2^32-1 values safely without carry.  We only need one.
97 		if (!p0) jump .Lmul_abnormal
124 		p0 = !cmp.gt(EXP0,BTMPH)  define
125 		p0 = cmp.gt(EXP0,BTMPL)  define
126 		if (!p0.new) jump:nt .Lmul_ovf_unf
149 		p0 = cmp.eq(AL,#0)  define
150 		p0 = bitsclr(AH,BTMPL)  define
151 		if (!p0.new) jumpr:t r31
155 		p0 = bitsset(ATMPH,BTMPH)  define
160 		if (p0) BTMPL = or(BTMPL,BTMPH)
166 		p0 = dfcmp.eq(A,A)  define
187 		p0 = cmp.gt(EXP1,##BIAS+BIAS-2)	// overflow  define
188 		if (p0.new) jump:nt .Lmul_ovf
191 		p0 = cmp.gt(EXP1,#0)  define
192 		if (p0.new) jump:nt .Lpossible_unf
235 		p0 = cmp.gtu(ONE,PP_LL)				// Did we extract all zeros?  define
236 		if (!p0.new) PP_HH_L = or(PP_HH_L,S_ONE)	// add sticky bit
237 		PP_HH_H = setbit(PP_HH_H,#HI_MANTBITS+3)	// Add back in a bit so we can use convert instruction
250 		p0 = dfcmp.eq(A,A)			// realize exception  define
275 		p0 = !cmp.eq(TMP,#1)			// If not round-to-zero and  define
276 		p0 = !cmp.eq(PP_LL_L,#2)		// Not rounding the other way,  define
277 		if (p0.new) ATMP = BTMP			// we should get infinity
278 		p0 = dfcmp.eq(A,A)			// Realize FP exception if enabled  define
297 		p0 = dfclass(A,#0x0f)		// A not NaN?  define
298 		if (!p0.new) jump:nt .Linvalid_nan
310 		p0 = dfclass(A,#0x08)		// A is infinity  define
311 		p0 = dfclass(B,#0x01)		// B is zero  define
318 		if (p0) jump .Linvalid_zeroinf
328 		p0 = bitsclr(AH,TMP)  define
329 		if (p0.new) jump:nt .Lmul_tiny
357 		p0 = cmp.gt(BTMPH,#1)			// Round towards pos/neg inf?  define
358 		if (!p0.new) AL = #0			// If not, zero
362 		p0 = cmp.eq(BTMPH,#3)			// if rounding towards right inf  define
363 		if (!p0.new) AL = #0			// don't go to zero
378 		p0 = dfcmp.uo(A,A)			// force exception if enabled  define
383 		p0 = dfclass(B,#0x0f)			// if B is not NaN  define
385 		if (p0.new) B = A 			// make it whatever A is