Home
last modified time | relevance | path

Searched refs:dval (Results 1 – 8 of 8) sorted by relevance

/bionic/libc/upstream-openbsd/lib/libc/gdtoa/
Dstrtod.c144 dval(&rv) = 0.;
350 dval(&rv) = y;
356 dval(&rv) = tens[k - 9] * dval(&rv) + z;
380 /* rv = */ rounded_product(dval(&rv), tens[e]);
397 dval(&rv) *= tens[i];
404 /* rv = */ rounded_product(dval(&rv), tens[e]);
410 /* rv = */ rounded_product(dval(&rv), tens[e]);
424 /* rv = */ rounded_quotient(dval(&rv), tens[-e]);
456 dval(&rv) *= tens[i];
479 dval(&rv0) = 1e300;
[all …]
Ddtoa.c179 dval(&d) += 0; /* normalize */
181 if (!dval(&d)) {
200 b = d2b(dval(&d), &be, &bbits);
208 dval(&d2) = dval(&d);
213 dval(&d2) /= 1 << j;
252 dval(&d2) = x;
258 ds = (dval(&d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
264 if (dval(&d) < tens[k])
343 dval(&d2) = dval(&d);
353 dval(&d) /= bigtens[n_bigtens-1];
[all …]
Dgdtoa.c206 dval(&d) = b2d(b, &i);
212 dval(&d) /= 1 << j;
240 ds = (dval(&d)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
255 dval(&d) *= 1 << j1;
261 if (dval(&d) < tens[k])
342 d2 = dval(&d);
345 dval(&d) /= 1 << j;
356 dval(&d) /= bigtens[n_bigtens-1];
368 dval(&d) *= tens[j1 & 0xf];
372 dval(&d) *= bigtens[i];
[all …]
Dsmisc.c93 dval(&da) = b2d(a, &ka);
94 dval(&db) = b2d(b, &kb);
100 dval(&da) *= 1 << k;
106 dval(&db) *= 1 << k;
116 return dval(&da) / dval(&db);
Dstrtodg.c189 b = d2b(dval(d), &e, &bdif);
380 dval(&rv) = 0.;
574 dval(&rv) = y;
576 dval(&rv) = tens[k - 9] * dval(&rv) + z;
592 /* rv = */ rounded_product(dval(&rv), tens[e]);
609 dval(&rv) *= tens[i];
615 dval(&adj) = dval(&rv);
617 /* adj = */ rounded_product(dval(&adj), tens[e2]);
622 dval(&rv) = dval(&adj);
624 /* rv = */ rounded_product(dval(&rv), tens[e2]);
[all …]
Dulp.c69 return dval(&a);
Dgdtoaimp.h286 #define dval(x) (x)->d macro
Dmisc.c709 return dval(&d);