HomeSort by: relevance | last modified time | path
    Searched defs:j0 (Results 1 - 25 of 100) sorted by relevancy

1 2 3 4

  /src/lib/libm/src/
w_j0.c 19 * wrapper j0(double x), y0(double x)
26 j0(double x) /* wrapper j0 */ function
34 return __kernel_standard(x,x,34); /* j0(|x|>X_TLOSS) */
  /src/external/gpl3/gcc/dist/libquadmath/math/
llroundq.c 26 int64_t j0; local
32 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
37 if (j0 < 48)
39 if (j0 < 0)
40 return j0 < -1 ? 0 : sign;
43 i0 += 0x0000800000000000LL >> j0;
44 result = i0 >> (48 - j0);
47 else if (j0 < (int32_t) (8 * sizeof (long long int)) - 1)
49 if (j0 >= 112)
50 result = ((long long int) i0 << (j0 - 48)) | (i1 << (j0 - 112))
    [all...]
lroundq.c 26 int64_t j0; local
32 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
37 if (j0 < (int32_t) (8 * sizeof (long int)) - 1)
39 if (j0 < 48)
41 if (j0 < 0)
42 return j0 < -1 ? 0 : sign;
45 i0 += 0x0000800000000000LL >> j0;
46 result = i0 >> (48 - j0);
56 else if (j0 >= 112)
57 result = ((long int) i0 << (j0 - 48)) | (i1 << (j0 - 112))
    [all...]
modfq.c 36 int64_t i0,i1,j0; local
39 j0 = ((i0>>48)&0x7fff)-0x3fff; /* exponent of x */
40 if(j0<48) { /* integer part in high x */
41 if(j0<0) { /* |x|<1 */
46 i = (0x0000ffffffffffffLL)>>j0;
57 } else if (j0>111) { /* no fraction part */
60 if (j0 == 0x4000 && ((i0 & 0x0000ffffffffffffLL) | i1))
66 i = -1ULL>>(j0-48);
roundq.c 28 int32_t j0; local
32 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
33 if (j0 < 48)
35 if (j0 < 0)
38 if (j0 == -1)
44 uint64_t i = 0x0000ffffffffffffLL >> j0;
49 i0 += 0x0000800000000000LL >> j0;
54 else if (j0 > 111)
56 if (j0 == 0x4000)
64 uint64_t i = -1ULL >> (j0 - 48)
    [all...]
truncq.c 28 int32_t j0; local
33 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
34 if (j0 < 48)
36 if (j0 < 0)
40 SET_FLT128_WORDS64 (x, i0 & ~(0x0000ffffffffffffLL >> j0), 0);
42 else if (j0 > 111)
44 if (j0 == 0x4000)
50 SET_FLT128_WORDS64 (x, i0, i1 & ~(0xffffffffffffffffULL >> (j0 - 48)));
ceilq.c 33 int64_t i0,i1,j0; local
36 j0 = ((i0>>48)&0x7fff)-0x3fff;
37 if(j0<48) {
38 if(j0<0) {
43 i = (0x0000ffffffffffffULL)>>j0;
45 if(i0>0) i0 += (0x0001000000000000LL)>>j0;
48 } else if (j0>111) {
49 if(j0==0x4000) return x+x; /* inf or NaN */
52 i = -1ULL>>(j0-48);
55 if(j0==48) i0+=1
    [all...]
floorq.c 33 int64_t i0,i1,j0; local
36 j0 = ((i0>>48)&0x7fff)-0x3fff;
37 if(j0<48) {
38 if(j0<0) {
44 i = (0x0000ffffffffffffULL)>>j0;
46 if(i0<0) i0 += (0x0001000000000000LL)>>j0;
49 } else if (j0>111) {
50 if(j0==0x4000) return x+x; /* inf or NaN */
53 i = -1ULL>>(j0-48);
56 if(j0==48) i0+=1
    [all...]
llrintq.c 33 int32_t j0; local
41 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
46 if (j0 < (int32_t) (8 * sizeof (long long int)) - 1)
49 /* X < LLONG_MAX + 1 implied by J0 < 63. */
64 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
68 if (j0 < 0)
70 else if (j0 <= 48)
71 result = i0 >> (48 - j0);
73 result = ((long long int) i0 << (j0 - 48)) | (i1 >> (112 - j0));
    [all...]
lrintq.c 33 int32_t j0; local
41 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
46 if (j0 < (int32_t) (8 * sizeof (long int)) - 1)
48 if (j0 < 48)
51 /* X < LONG_MAX + 1 implied by J0 < 31. */
67 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
71 result = (j0 < 0 ? 0 : i0 >> (48 - j0));
73 else if (j0 >= 112)
74 result = ((long int) i0 << (j0 - 48)) | (i1 << (j0 - 112))
    [all...]
nearbyintq.c 37 int64_t i0,j0,sx; local
42 j0 = ((i0>>48)&0x7fff)-0x3fff;
43 if(j0<112) {
44 if(j0<0) {
55 if(j0==0x4000) return x+x; /* inf or NaN */
rintq.c 42 int64_t i0,j0,sx; local
47 j0 = ((i0>>48)&0x7fff)-0x3fff;
48 if(j0<112) {
49 if(j0<0) {
57 if(j0==0x4000) return x+x; /* inf or NaN */
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
llroundq.c 26 int64_t j0; local
32 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
37 if (j0 < 48)
39 if (j0 < 0)
40 return j0 < -1 ? 0 : sign;
43 i0 += 0x0000800000000000LL >> j0;
44 result = i0 >> (48 - j0);
47 else if (j0 < (int32_t) (8 * sizeof (long long int)) - 1)
49 if (j0 >= 112)
50 result = ((long long int) i0 << (j0 - 48)) | (i1 << (j0 - 112))
    [all...]
lroundq.c 26 int64_t j0; local
32 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
37 if (j0 < (int32_t) (8 * sizeof (long int)) - 1)
39 if (j0 < 48)
41 if (j0 < 0)
42 return j0 < -1 ? 0 : sign;
45 i0 += 0x0000800000000000LL >> j0;
46 result = i0 >> (48 - j0);
56 else if (j0 >= 112)
57 result = ((long int) i0 << (j0 - 48)) | (i1 << (j0 - 112))
    [all...]
modfq.c 36 int64_t i0,i1,j0; local
39 j0 = ((i0>>48)&0x7fff)-0x3fff; /* exponent of x */
40 if(j0<48) { /* integer part in high x */
41 if(j0<0) { /* |x|<1 */
46 i = (0x0000ffffffffffffLL)>>j0;
57 } else if (j0>111) { /* no fraction part */
60 if (j0 == 0x4000 && ((i0 & 0x0000ffffffffffffLL) | i1))
66 i = -1ULL>>(j0-48);
roundq.c 28 int32_t j0; local
32 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
33 if (j0 < 48)
35 if (j0 < 0)
38 if (j0 == -1)
44 uint64_t i = 0x0000ffffffffffffLL >> j0;
49 i0 += 0x0000800000000000LL >> j0;
54 else if (j0 > 111)
56 if (j0 == 0x4000)
64 uint64_t i = -1ULL >> (j0 - 48)
    [all...]
truncq.c 28 int32_t j0; local
33 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
34 if (j0 < 48)
36 if (j0 < 0)
40 SET_FLT128_WORDS64 (x, i0 & ~(0x0000ffffffffffffLL >> j0), 0);
42 else if (j0 > 111)
44 if (j0 == 0x4000)
50 SET_FLT128_WORDS64 (x, i0, i1 & ~(0xffffffffffffffffULL >> (j0 - 48)));
ceilq.c 33 int64_t i0,i1,j0; local
36 j0 = ((i0>>48)&0x7fff)-0x3fff;
37 if(j0<48) {
38 if(j0<0) {
43 i = (0x0000ffffffffffffULL)>>j0;
45 if(i0>0) i0 += (0x0001000000000000LL)>>j0;
48 } else if (j0>111) {
49 if(j0==0x4000) return x+x; /* inf or NaN */
52 i = -1ULL>>(j0-48);
55 if(j0==48) i0+=1
    [all...]
floorq.c 33 int64_t i0,i1,j0; local
36 j0 = ((i0>>48)&0x7fff)-0x3fff;
37 if(j0<48) {
38 if(j0<0) {
44 i = (0x0000ffffffffffffULL)>>j0;
46 if(i0<0) i0 += (0x0001000000000000LL)>>j0;
49 } else if (j0>111) {
50 if(j0==0x4000) return x+x; /* inf or NaN */
53 i = -1ULL>>(j0-48);
56 if(j0==48) i0+=1
    [all...]
llrintq.c 33 int32_t j0; local
41 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
46 if (j0 < (int32_t) (8 * sizeof (long long int)) - 1)
49 /* X < LLONG_MAX + 1 implied by J0 < 63. */
64 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
68 if (j0 < 0)
70 else if (j0 <= 48)
71 result = i0 >> (48 - j0);
73 result = ((long long int) i0 << (j0 - 48)) | (i1 >> (112 - j0));
    [all...]
lrintq.c 33 int32_t j0; local
41 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
46 if (j0 < (int32_t) (8 * sizeof (long int)) - 1)
48 if (j0 < 48)
51 /* X < LONG_MAX + 1 implied by J0 < 31. */
67 j0 = ((i0 >> 48) & 0x7fff) - 0x3fff;
71 result = (j0 < 0 ? 0 : i0 >> (48 - j0));
73 else if (j0 >= 112)
74 result = ((long int) i0 << (j0 - 48)) | (i1 << (j0 - 112))
    [all...]
nearbyintq.c 37 int64_t i0,j0,sx; local
42 j0 = ((i0>>48)&0x7fff)-0x3fff;
43 if(j0<112) {
44 if(j0<0) {
55 if(j0==0x4000) return x+x; /* inf or NaN */
rintq.c 42 int64_t i0,j0,sx; local
47 j0 = ((i0>>48)&0x7fff)-0x3fff;
48 if(j0<112) {
49 if(j0<0) {
57 if(j0==0x4000) return x+x; /* inf or NaN */
  /src/lib/libm/ld80/
s_cospil.c 50 uint32_t j0; local
80 FFLOORL80(x, j0, ix, lx); /* Integer part of ax. */
99 if (j0 > 40)
101 if (j0 > 30)
103 j0 = (uint32_t)x;
105 RETURNI(j0 & 1 ? -c : c);
s_sinpil.c 52 uint32_t j0; local
88 FFLOORL80(x, j0, ix, lx); /* Integer part of ax. */
108 if (j0 > 40)
110 if (j0 > 30)
112 j0 = (uint32_t)x;
113 if (j0 & 1) s = -s;

Completed in 1416 milliseconds

1 2 3 4