60 static int round(struct fpemu *, struct fpn *);
64  * Round a number (algorithm from Motorola MC68882 manual, modified for
68  * After rounding, we discard the guard and round bits by shifting right
76 round(struct fpemu *fe, struct fpn *fp)  in round()  function
100 	/* Go to rounddown to round down; break to round up. */  in round()
105 		 * Round only if guard is set (gr & 2).  If guard is set,  in round()
106 		 * but round & sticky both clear, then we want to round  in round()
107 		 * but have a tie, so round to even, i.e., add 1 iff odd.  in round()
116 		/* Round towards zero, i.e., down. */  in round()
120 		/* Round towards -Inf: up if negative, down if positive. */  in round()
126 		/* Round towards +Inf: up if positive, down otherwise. */  in round()
208 		 * shifting any guard and round bits out into the sticky  in fpu_ftoi()
209 		 * bit.  Then ``round'' towards zero, i.e., just set an  in fpu_ftoi()
210 		 * inexact exception if sticky is set (see round()).  in fpu_ftoi()
255 		 * shifting any guard and round bits out into the sticky  in fpu_ftox()
256 		 * bit.  Then ``round'' towards zero, i.e., just set an  in fpu_ftox()
257 		 * inexact exception if sticky is set (see round()).  in fpu_ftox()
316 	 * may round to the smallest normal (1.0 x 2^minexp), or may  in fpu_ftos()
327 	 * Note that the guard and round bits vanish from the number after  in fpu_ftos()
333 		if (round(fe, fp) && fp->fp_mant[3] == SNG_EXP(1))  in fpu_ftos()
346 	if (round(fe, fp) && fp->fp_mant[3] == SNG_EXP(2))  in fpu_ftos()
390 		if (round(fe, fp) && fp->fp_mant[2] == DBL_EXP(1)) {  in fpu_ftod()
401 	if (round(fe, fp) && fp->fp_mant[2] == DBL_EXP(2))  in fpu_ftod()