Bfree(b);
b = b1;
}
- b->x[wds++] = carry;
+ b->x[wds++] = (ULong)carry;
b->wds = wds;
}
return b;
*xc++ = z & FFFFFFFF;
}
while(x < xae);
- *xc = carry;
+ *xc = (ULong)carry;
}
}
#else
{
int i, j;
for(i = 0; (j = s[i]) !=0; i++)
- h[j] = i + inc;
+ h[j] = (unsigned char)(i + inc);
}
static void
#ifdef Avoid_Underflow
if (bc.scale && y <= 2*P*Exp_msk1) {
if (aadj <= 0x7fffffff) {
- if ((z = aadj) <= 0)
+ if ((z = (ULong)aadj) <= 0)
z = 1;
aadj = z;
aadj1 = bc.dsign ? aadj : -aadj;
*/
dval(&eps) = 0.5/tens[ilim-1] - dval(&eps);
for(i = 0;;) {
- L = dval(&u);
+ L = (long)dval(&u);
dval(&u) -= L;
- *s++ = '0' + (int)L;
+ *s++ = '0' + (char)L;
if (dval(&u) < dval(&eps))
goto ret1;
if (1. - dval(&u) < dval(&eps))
L = (Long)(dval(&u));
if (!(dval(&u) -= L))
ilim = i;
- *s++ = '0' + (int)L;
+ *s++ = '0' + (char)L;
if (i == ilim) {
if (dval(&u) > 0.5 + dval(&eps))
goto bump_up;
dval(&u) += ds;
}
#endif
- *s++ = '0' + (int)L;
+ *s++ = '0' + (char)L;
if (!dval(&u)) {
#ifdef SET_INEXACT
inexact = 0;
else if (!b->x[0] && b->wds <= 1)
inexact = 0;
#endif
- *s++ = dig;
+ *s++ = (char)dig;
goto ret;
}
#endif
goto round_9_up;
}
accept_dig:
- *s++ = dig;
+ *s++ = (char)dig;
goto ret;
}
if (j1 > 0) {
*s++ = '9';
goto roundoff;
}
- *s++ = dig + 1;
+ *s++ = (char)dig + 1;
goto ret;
}
#ifdef Honor_FLT_ROUNDS
keep_dig:
#endif
- *s++ = dig;
+ *s++ = (char)dig;
if (i == ilim)
break;
b = multadd(b, 10, 0);
}
else
for(i = 1;; i++) {
- *s++ = dig = quorem(b,S) + '0';
+ dig = quorem(b,S) + '0';
+ *s++ = (char)dig;
if (!b->x[0] && b->wds <= 1) {
#ifdef SET_INEXACT
inexact = 0;