HomeSort by relevance Sort by last modified time
    Searched defs:j0 (Results 1 - 18 of 18) sorted by null

  /bionic/libm/src/
s_truncf.c 33 int32_t i0,j0; local
36 j0 = ((i0>>23)&0xff)-0x7f;
37 if(j0<23) {
38 if(j0<0) { /* raise inexact if x != 0 */
42 i = (0x007fffff)>>j0;
48 if(j0==0x80) return x+x; /* inf or NaN */
s_ceilf.c 28 int32_t i0,j0; local
32 j0 = ((i0>>23)&0xff)-0x7f;
33 if(j0<23) {
34 if(j0<0) { /* raise inexact if x != 0 */
40 i = (0x007fffff)>>j0;
43 if(i0>0) i0 += (0x00800000)>>j0;
48 if(j0==0x80) return x+x; /* inf or NaN */
s_floorf.c 37 int32_t i0,j0; local
40 j0 = ((i0>>23)&0xff)-0x7f;
41 if(j0<23) {
42 if(j0<0) { /* raise inexact if x != 0 */
49 i = (0x007fffff)>>j0;
52 if(i0<0) i0 += (0x00800000)>>j0;
57 if(j0==0x80) return x+x; /* inf or NaN */
s_modff.c 28 int32_t i0,j0; local
31 j0 = ((i0>>23)&0xff)-0x7f; /* exponent of x */
32 if(j0<23) { /* integer part in x */
33 if(j0<0) { /* |x|<1 */
37 i = (0x007fffff)>>j0;
s_trunc.c 33 int32_t i0,i1,j0; local
36 j0 = ((i0>>20)&0x7ff)-0x3ff;
37 if(j0<20) {
38 if(j0<0) { /* raise inexact if x != 0 */
44 i = (0x000fffff)>>j0;
50 } else if (j0>51) {
51 if(j0==0x400) return x+x; /* inf or NaN */
54 i = ((u_int32_t)(0xffffffff))>>(j0-20);
s_ceil.c 34 int32_t i0,i1,j0; local
37 j0 = ((i0>>20)&0x7ff)-0x3ff;
38 if(j0<20) {
39 if(j0<0) { /* raise inexact if x != 0 */
45 i = (0x000fffff)>>j0;
48 if(i0>0) i0 += (0x00100000)>>j0;
52 } else if (j0>51) {
53 if(j0==0x400) return x+x; /* inf or NaN */
56 i = ((u_int32_t)(0xffffffff))>>(j0-20);
60 if(j0==20) i0+=1
    [all...]
s_floor.c 34 int32_t i0,i1,j0; local
37 j0 = ((i0>>20)&0x7ff)-0x3ff;
38 if(j0<20) {
39 if(j0<0) { /* raise inexact if x != 0 */
46 i = (0x000fffff)>>j0;
49 if(i0<0) i0 += (0x00100000)>>j0;
53 } else if (j0>51) {
54 if(j0==0x400) return x+x; /* inf or NaN */
57 i = ((u_int32_t)(0xffffffff))>>(j0-20);
61 if(j0==20) i0+=1
    [all...]
s_modf.c 35 int32_t i0,i1,j0; local
38 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */
39 if(j0<20) { /* integer part in high x */
40 if(j0<0) { /* |x|<1 */
44 i = (0x000fffff)>>j0;
56 } else if (j0>51) { /* no fraction part */
63 i = ((u_int32_t)(0xffffffff))>>(j0-20);
s_rint.c 39 int32_t i0,j0,sx; local
44 j0 = ((i0>>20)&0x7ff)-0x3ff;
45 if(j0<20) {
46 if(j0<0) {
58 i = (0x000fffff)>>j0;
66 * guard bit. We do this for all j0<=51. The
67 * adjustment is trickiest for j0==18 and j0==19
70 if(j0==19) i1 = 0x40000000; else
71 if(j0==18) i1 = 0x80000000; els
    [all...]
s_rintf.c 33 int32_t i0,j0,sx; local
37 j0 = ((i0>>23)&0xff)-0x7f;
38 if(j0<23) {
39 if(j0<0) {
50 if(j0==0x80) return x+x; /* inf or NaN */
  /external/fdlibm/
s_ceil.c 38 int i0,i1,j0; local
42 j0 = ((i0>>20)&0x7ff)-0x3ff;
43 if(j0<20) {
44 if(j0<0) { /* raise inexact if x != 0 */
50 i = (0x000fffff)>>j0;
53 if(i0>0) i0 += (0x00100000)>>j0;
57 } else if (j0>51) {
58 if(j0==0x400) return x+x; /* inf or NaN */
61 i = ((unsigned)(0xffffffff))>>(j0-20);
65 if(j0==20) i0+=1;
    [all...]
s_floor.c 38 int i0,i1,j0; local
42 j0 = ((i0>>20)&0x7ff)-0x3ff;
43 if(j0<20) {
44 if(j0<0) { /* raise inexact if x != 0 */
51 i = (0x000fffff)>>j0;
54 if(i0<0) i0 += (0x00100000)>>j0;
58 } else if (j0>51) {
59 if(j0==0x400) return x+x; /* inf or NaN */
62 i = ((unsigned)(0xffffffff))>>(j0-20);
66 if(j0==20) i0+=1;
    [all...]
s_modf.c 39 int i0,i1,j0; local
43 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */
44 if(j0<20) { /* integer part in high x */
45 if(j0<0) { /* |x|<1 */
50 i = (0x000fffff)>>j0;
62 } else if (j0>51) { /* no fraction part */
68 i = ((unsigned)(0xffffffff))>>(j0-20);
s_rint.c 43 int i0,j0,sx; local
49 j0 = ((i0>>20)&0x7ff)-0x3ff;
50 if(j0<20) {
51 if(j0<0) {
63 i = (0x000fffff)>>j0;
67 if(j0==19) i1 = 0x40000000; else
68 i0 = (i0&(~i))|((0x20000)>>j0);
71 } else if (j0>51) {
72 if(j0==0x400) return x+x; /* inf or NaN */
75 i = ((unsigned)(0xffffffff))>>(j0-20)
    [all...]
  /external/opencv/cxcore/src/
cxmatrix.cpp 561 int j0 = 0, j1 = nrows; local
564 if( !LtoR ) j1 = i; else j0 = i+1;
565 for( j = j0; j < j1; j++ )
573 int j0 = 0, j1 = nrows; local
576 if( !LtoR ) j1 = i; else j0 = i+1;
577 for( j = j0; j < j1; j++ )
    [all...]
  /frameworks/base/media/libstagefright/codecs/avc/enc/src/
motion_est.cpp 956 int i0, int j0, int type_pred, int FS_en, int *hp_guess)
1032 jlow = j0 - range;
1033 if (j0 - jlow > MaxVmvR[lev_idx] - 1) /* clip to conform with the standard */
1035 jlow = j0 - MaxVmvR[lev_idx] + 1;
1042 jhigh = j0 + range - 1
1270 int j0 = *jmin; local
    [all...]
  /frameworks/base/media/libstagefright/codecs/m4v_h263/enc/src/
motion_est.cpp 76 Int i0, Int j0, Int type_pred, Int fullsearch, Int *hp_guess);
771 Int i0, Int j0, Int type_pred, Int FS_en, Int *hp_guess)
815 jlow = j0 - range;
818 jhigh = j0 + range - 1;
830 jlow = j0 - range;
833 jhigh = j0 + range - 1;
839 jmin = j0; /* needed for fullsearch */
853 mot[mbnum][0].y = (jmin - j0) << 1;
861 if (video->forwardRefVop->predictionType == I_VOP && j0 == 0 && i0 <= 64 && type_pred != 1)
871 CandidateSelection(mvx, mvy, &num_can, i0 >> 4, j0 >> 4, video, type_pred)
1187 Int j0 = *jmin; local
    [all...]
  /external/svox/pico/lib/
picofftsg.c 670 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; local
680 j0 = 0;
683 for (j = j0; j < j0 + k0; j += 4) {
846 k1 = j0 + k0;
907 for (i = nh >> 1; i > (j0 ^= i); i >>= 1) {
912 j0 = 0;
915 for (j = j0; j < j0 + k0; j += 4) {
998 k1 = j0 + k0
1029 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh, m2; local
1583 picoos_int32 j0, k0, j1, k1, l, m, i, j, k, nh; local
1707 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local
2034 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local
2248 picoos_int32 i, i0, j, j0, j1, j2, j3, m, mh; local
    [all...]

Completed in 3351 milliseconds