HomeSort by: relevance | last modified time | path
    Searched defs:logF_head (Results 1 - 4 of 4) sorted by relevancy

  /src/lib/libm/src/
b_log.c 85 /* Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128.
88 * It ensures correct reading of logF_head, even for inaccurate
99 static const double logF_head[N+1] = {
398 u1 += m*logF_head[N] + logF_head[j];
  /src/lib/libm/ld128/
b_logl.c 55 * Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128.
58 * It ensures correct reading of logF_head, even for inaccurate
65 static double logF_head[N+1] = {
367 u1 += m * (long double)logF_head[N] + logF_head[j];
  /src/lib/libm/ld80/
b_logl.c 59 * Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128.
62 * It ensures correct reading of logF_head, even for inaccurate
69 static double logF_head[N+1] = {
371 u1 += m * (long double)logF_head[N] + logF_head[j];
  /src/lib/libm/noieee_src/
n_log.c 97 /* Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128.
100 * It ensures correct reading of logF_head, even for inaccurate
111 static const double logF_head[N+1] = {
435 /* (m*log2_hi+logF_head[j]+u1) + (m*log2_lo+logF_tail[j]+q); */
438 u1 += m*logF_head[N] + logF_head[j]; /* exact */
479 u1 += m*logF_head[N] + logF_head[j];

Completed in 32 milliseconds