Lines Matching defs:ndigits

36  * If arg is finite and nonzero, buf is filled with ndigits hexadecimal
38 * (so ndigits must be at least 1 and buf must be large enough to hold
39 * ndigits + 1 characters). If ndigits is large enough, the representa-
45 * If arg is zero, buf is filled with ndigits zeros followed by a null,
56 __aconvert(double arg, int ndigits, int *exp, int *sign, char *buf)
74 fp_infinity : fp_quiet, ndigits, buf);
82 for (i = 0; i < ndigits; i++)
84 buf[ndigits] = '\0';
104 if (ndigits < 14) {
110 c.i[0] = (0x43700000 | (s << 31)) - (ndigits << 22);
122 for (i = 1; i < ndigits && i < 6; i++) {
127 for (; i < ndigits && i < 14; i++) {
131 for (; i < ndigits; i++)
133 buf[ndigits] = '\0';
137 __qaconvert(long double *arg, int ndigits, int *exp, int *sign, char *buf)
155 == 0)? fp_infinity : fp_quiet, ndigits, buf);
163 for (i = 0; i < ndigits; i++)
165 buf[ndigits] = '\0';
190 if (ndigits < 29) {
197 if (ndigits <= 5) {
204 s = (5 - ndigits) << 2;
211 } else if (ndigits <= 13) {
213 s = (13 - ndigits) << 2;
220 } else if (ndigits <= 21) {
222 s = (21 - ndigits) << 2;
231 s = (29 - ndigits) << 2;
263 for (i = 1; i < ndigits && i < 5; i++) {
268 for (; i < ndigits && i < 13; i++) {
273 for (; i < ndigits && i < 21; i++) {
278 for (; i < ndigits && i < 29; i++) {
282 for (; i < ndigits; i++)
284 buf[ndigits] = '\0';
294 __qaconvert(long double *arg, int ndigits, int *exp, int *sign, char *buf)
311 fp_infinity : fp_quiet, ndigits, buf);
319 for (i = 0; i < ndigits; i++)
321 buf[ndigits] = '\0';
333 if (ndigits < 17) {
339 c.i[2] = (0x4042 | (s << 15)) - (ndigits << 2);
352 for (i = 1; i < ndigits && i < 9; i++) {
357 for (; i < ndigits && i < 17; i++) {
361 for (; i < ndigits; i++)
363 buf[ndigits] = '\0';
367 __aconvert(double arg, int ndigits, int *exp, int *sign, char *buf)
383 __qaconvert(&ldarg, ndigits, exp, sign, buf);