HomeSort by relevance Sort by last modified time
    Searched defs:i0 (Results 1 - 25 of 71) sorted by null

1 2 3

  /bionic/libm/src/
s_truncf.c 33 int32_t i0,j0; local
35 GET_FLOAT_WORD(i0,x);
36 j0 = ((i0>>23)&0xff)-0x7f;
40 i0 &= 0x80000000;
43 if((i0&i)==0) return x; /* x is integral */
45 i0 &= (~i);
51 SET_FLOAT_WORD(x,i0);
s_ceilf.c 28 int32_t i0,j0; local
31 GET_FLOAT_WORD(i0,x);
32 j0 = ((i0>>23)&0xff)-0x7f;
36 if(i0<0) {i0=0x80000000;}
37 else if(i0!=0) { i0=0x3f800000;}
41 if((i0&i)==0) return x; /* x is integral */
43 if(i0>0) i0 += (0x00800000)>>j0
    [all...]
s_floorf.c 37 int32_t i0,j0; local
39 GET_FLOAT_WORD(i0,x);
40 j0 = ((i0>>23)&0xff)-0x7f;
44 if(i0>=0) {i0=0;}
45 else if((i0&0x7fffffff)!=0)
46 { i0=0xbf800000;}
50 if((i0&i)==0) return x; /* x is integral */
52 if(i0<0) i0 += (0x00800000)>>j0
    [all...]
s_modff.c 28 int32_t i0,j0; local
30 GET_FLOAT_WORD(i0,x);
31 j0 = ((i0>>23)&0xff)-0x7f; /* exponent of x */
34 SET_FLOAT_WORD(*iptr,i0&0x80000000); /* *iptr = +-0 */
38 if((i0&i)==0) { /* x is integral */
45 SET_FLOAT_WORD(*iptr,i0&(~i));
s_trunc.c 33 int32_t i0,i1,j0; local
35 EXTRACT_WORDS(i0,i1,x);
36 j0 = ((i0>>20)&0x7ff)-0x3ff;
40 i0 &= 0x80000000U;
45 if(((i0&i)|i1)==0) return x; /* x is integral */
47 i0 &= (~i); i1=0;
59 INSERT_WORDS(x,i0,i1);
s_ceil.c 34 int32_t i0,i1,j0; local
36 EXTRACT_WORDS(i0,i1,x);
37 j0 = ((i0>>20)&0x7ff)-0x3ff;
41 if(i0<0) {i0=0x80000000;i1=0;}
42 else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;}
46 if(((i0&i)|i1)==0) return x; /* x is integral */
48 if(i0>0) i0 += (0x00100000)>>j0
    [all...]
s_floor.c 34 int32_t i0,i1,j0; local
36 EXTRACT_WORDS(i0,i1,x);
37 j0 = ((i0>>20)&0x7ff)-0x3ff;
41 if(i0>=0) {i0=i1=0;}
42 else if(((i0&0x7fffffff)|i1)!=0)
43 { i0=0xbff00000;i1=0;}
47 if(((i0&i)|i1)==0) return x; /* x is integral */
49 if(i0<0) i0 += (0x00100000)>>j0
    [all...]
s_modf.c 35 int32_t i0,i1,j0; local
37 EXTRACT_WORDS(i0,i1,x);
38 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */
41 INSERT_WORDS(*iptr,i0&0x80000000,0); /* *iptr = +-0 */
45 if(((i0&i)|i1)==0) { /* x is integral */
52 INSERT_WORDS(*iptr,i0&(~i),0);
71 INSERT_WORDS(*iptr,i0,i1&(~i));
s_rint.c 39 int32_t i0,j0,sx; local
42 EXTRACT_WORDS(i0,i1,x);
43 sx = (i0>>31)&1;
44 j0 = ((i0>>20)&0x7ff)-0x3ff;
47 if(((i0&0x7fffffff)|i1)==0) return x;
48 i1 |= (i0&0x0fffff);
49 i0 &= 0xfffe0000;
50 i0 |= ((i1|-i1)>>12)&0x80000;
51 SET_HIGH_WORD(x,i0);
54 GET_HIGH_WORD(i0,t)
    [all...]
s_rintf.c 33 int32_t i0,j0,sx; local
35 GET_FLOAT_WORD(i0,x);
36 sx = (i0>>31)&1;
37 j0 = ((i0>>23)&0xff)-0x7f;
40 if((i0&0x7fffffff)==0) return x;
43 GET_FLOAT_WORD(i0,t);
44 SET_FLOAT_WORD(t,(i0&0x7fffffff)|(sx<<31));
s_exp2f.c 95 uint32_t hx, hr, ix, i0; local
116 /* Reduce x, computing z, i0, and k. */
118 GET_FLOAT_WORD(i0, t);
119 i0 += TBLSIZE / 2;
120 k = (i0 >> TBLBITS) << 23;
121 i0 &= TBLSIZE - 1;
125 /* Compute r = exp2(y) = exp2ft[i0] * p(z). */
126 tv = exp2ft[i0];
s_exp2.c 329 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] are
341 uint32_t hx, hr, ix, lx, i0; local
363 /* Reduce x, computing z, i0, and k. */
365 GET_LOW_WORD(i0, t);
366 i0 += TBLSIZE / 2;
367 k = (i0 >> TBLBITS) << 20;
368 i0 = (i0 & (TBLSIZE - 1)) << 1;
372 /* Compute r = exp2(y) = exp2t[i0] * p(z - eps[i]). */
373 t = tbl[i0]; /* exp2t[i0] *
    [all...]
  /external/clang/test/CXX/expr/
p3.cpp 13 int i0 = a + 1; local
  /external/fdlibm/
s_ceil.c 38 int i0,i1,j0; local
40 i0 = __HI(x);
42 j0 = ((i0>>20)&0x7ff)-0x3ff;
46 if(i0<0) {i0=0x80000000;i1=0;}
47 else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;}
51 if(((i0&i)|i1)==0) return x; /* x is integral */
53 if(i0>0) i0 += (0x00100000)>>j0
    [all...]
s_floor.c 38 int i0,i1,j0; local
40 i0 = __HI(x);
42 j0 = ((i0>>20)&0x7ff)-0x3ff;
46 if(i0>=0) {i0=i1=0;}
47 else if(((i0&0x7fffffff)|i1)!=0)
48 { i0=0xbff00000;i1=0;}
52 if(((i0&i)|i1)==0) return x; /* x is integral */
54 if(i0<0) i0 += (0x00100000)>>j0
    [all...]
s_modf.c 39 int i0,i1,j0; local
41 i0 = __HI(x); /* high x */
43 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */
46 __HIp(iptr) = i0&0x80000000;
51 if(((i0&i)|i1)==0) { /* x is integral */
57 __HIp(iptr) = i0&(~i);
75 __HIp(iptr) = i0;
s_rint.c 43 int i0,j0,sx; local
46 i0 = __HI(x);
47 sx = (i0>>31)&1;
49 j0 = ((i0>>20)&0x7ff)-0x3ff;
52 if(((i0&0x7fffffff)|i1)==0) return x;
53 i1 |= (i0&0x0fffff);
54 i0 &= 0xfffe0000;
55 i0 |= ((i1|-i1)>>12)&0x80000;
56 __HI(x)=i0;
59 i0 = __HI(t)
    [all...]
  /external/clang/test/CXX/basic/basic.lookup/basic.lookup.elab/
p2.cpp 8 namespace i0 { namespace in namespace:test0
  /external/chromium/base/third_party/icu/
icu_utf.cc 213 int32 i0=i; local
219 c=utf8_errorValue[i-i0];
  /external/clang/test/Sema/
attr-unused.c 22 Int_not_unused i0; // expected-warning {{unused variable}} local
  /external/icu4c/common/
utf_impl.c 184 int32_t i0=i; local
190 c=utf8_errorValue[i-i0];
  /dalvik/dx/tests/084-dex-high-register-moves/
Blort.java 24 int i0 = 0; local
  /external/clang/test/FixIt/
fixit.c 37 int i0 = { 17 }; variable
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
s10_8pf.cpp 190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
208 // fix i0 on maximum of correlation position
209 i0 = pos_max[ipos[0]];
227 ps0 = add (dn[i0], dn[i1]);
228 alp0 = L_mult (rr[i0][i0], _1_16);
230 alp0 = L_mac (alp0, rr[i0][i1], _1_8);
239 s = L_mac (s, rr[i0][i3], _1_4); // index increment = step
260 alp1 = L_mac (alp1, rr[i0][i2], _1_8);
305 s = L_mac (s, rr[i0][i5], _1_4)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
  /external/javassist/src/main/javassist/bytecode/stackmap/
TypedBlock.java 182 int i0 = i; local
196 types[n] = new TypeData.ClassName(desc.substring(i0, ++i2));
198 types[n] = new TypeData.ClassName(desc.substring(i0 + 1, ++i2 - 1)
203 types[n] = new TypeData.ClassName(desc.substring(i0, ++i));

Completed in 434 milliseconds

1 2 3