HomeSort by relevance Sort by last modified time
    Searched full:tblsize (Results 1 - 3 of 3) sorted by null

  /bionic/libm/src/
s_exp2f.c 34 #define TBLSIZE (1 << TBLBITS)
39 redux = 0x1.8p23f / TBLSIZE,
45 static const double exp2ft[TBLSIZE] = {
76 * y = i/TBLSIZE + z for integer i near y * TBLSIZE.
77 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z),
78 * with |z| <= 2**-(TBLSIZE+1).
80 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z) via a
119 i0 += TBLSIZE / 2;
121 i0 &= TBLSIZE - 1
    [all...]
s_exp2.c 34 #define TBLSIZE (1 << TBLBITS)
39 redux = 0x1.8p52 / TBLSIZE,
46 static const double tbl[TBLSIZE * 2] = {
318 * y = i/TBLSIZE + z - eps[i] for integer i near y * TBLSIZE.
319 * Thus we have exp2(y) = exp2(i/TBLSIZE) * exp2(z - eps[i]),
322 * We compute exp2(i/TBLSIZE) via table lookup and exp2(z - eps[i]) via
325 * exp2t[i] = exp2(i/TBLSIZE + eps[i]), and eps[i] is a small offset such
328 * Note that the range of i is +-TBLSIZE/2, so we actually index the tables
329 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] ar
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/
memalloc.h 76 int tblsize; /* allocated table size */ member in struct:snd_sg_buf

Completed in 128 milliseconds