19  *      Note. If k=0, then f=x is exact. However, if k!=0, then f
30  *      We use a special Reme algorithm on [0,0.1716] to generate
104 	ax = hx&0x7fffffff;  in log1p()
107 	if (hx < 0x3FDA827A) {			/* 1+x < sqrt(2)+ */  in log1p()
108 	    if(ax>=0x3ff00000) {		/* x <= -1.0 */  in log1p()
112 	    if(ax<0x3e200000) {			/* |x| < 2**-29 */  in log1p()
114 	            &&ax<0x3c900000) 		/* |x| < 2**-54 */  in log1p()
119 	    if(hx>0||hx<=((int32_t)0xbfd2bec4)) {  in log1p()
120 		k=0;f=x;hu=1;}		/* sqrt(2)/2- <= 1+x < sqrt(2)+ */  in log1p()
122 	if (hx >= 0x7ff00000) return x+x;  in log1p()
123 	if(k!=0) {  in log1p()
124 	    if(hx<0x43400000) {  in log1p()
128 	        c  = (k>0)? 1.0-(u-x):x-(u-1.0);/* correction term */  in log1p()
134 		c  = 0;  in log1p()
136 	    hu &= 0x000fffff;  in log1p()
140 	     * strict bounds than the one here so that the k==0 case is  in log1p()
142 	     * using the correction term but don't use it if k==0.  in log1p()
144 	    if(hu<0x6a09e) {			/* u ~< sqrt(2) */  in log1p()
145 	        SET_HIGH_WORD(u,hu|0x3ff00000);	/* normalize u */  in log1p()
148 		SET_HIGH_WORD(u,hu|0x3fe00000);	/* normalize u/2 */  in log1p()
149 	        hu = (0x00100000-hu)>>2;  in log1p()
154 	if(hu==0) {	/* |f| < 2**-20 */  in log1p()
156 		if(k==0) {  in log1p()
164 	    if(k==0) return f-R; else  in log1p()
170 	if(k==0) return f-(hfsq-s*(hfsq+R)); else  in log1p()