| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| D | s_tanhf.c | 23 static const float one=1.0, two=2.0, huge = 1.0e30; variable
46 t = expm1f(two*fabsf(x)); in tanhf()
47 z = one - two/(t+two); in tanhf()
49 t = expm1f(-two*fabsf(x)); in tanhf()
50 z= -t/(t+two); in tanhf()
|
| D | s_tanh.c | 46 static const double one = 1.0, two = 2.0, huge = 1.0e300; variable
69 t = expm1(two*fabs(x)); in tanh()
70 z = one - two/(t+two); in tanh()
72 t = expm1(-two*fabs(x)); in tanh()
73 z= -t/(t+two); in tanh()
|
| D | e_jnf.c | 29 two = 2.0000000000e+00, /* 0x40000000 */ variable
136 v = two/x; in __ieee754_jnf()
144 di -= two; in __ieee754_jnf()
152 di -= two; in __ieee754_jnf()
|
| D | e_jn.c | 50 two = 2.00000000000000000000e+00, /* 0x40000000, 0x00000000 */ variable
180 v = two/x; in __ieee754_jn()
188 di -= two; in __ieee754_jn()
196 di -= two; in __ieee754_jn()
|
| D | s_erff.c | 28 two = 2, variable
171 if(hx<0&&ix>=0x40a00000) return two-tiny;/* x < -5 */ in erfcf()
177 if(hx>0) return r/x; else return two-r/x; in erfcf()
179 if(hx>0) return tiny*tiny; else return two-tiny; in erfcf()
|
| D | s_erf.c | 120 two = 2, variable
294 if(hx<0&&ix>=0x40180000) return two-tiny;/* x < -6 */ in erfc()
301 if(hx>0) return r/x; else return two-r/x; in erfc()
303 if(hx>0) return tiny*tiny; else return two-tiny; in erfc()
|
| D | e_powf.c | 28 two = 2.0, variable
242 r = (z*t1)/(t1-two)-(w+z*w); in __ieee754_powf()
|
| D | e_pow.c | 69 two = 2.0, variable
299 r = (z*t1)/(t1-two)-(w+z*w); in __ieee754_pow()
|
| /bionic/tests/ |
| D | setjmp_test.cpp | 68 SigSets() : one(MakeSigSet(0)), two(MakeSigSet(1)) { in SigSets()
84 sigset_t two; member
103 sigprocmask(SIG_SETMASK, &ss.two, NULL); in TEST()
107 AssertSigmaskEquals(ss.two); in TEST()
120 sigprocmask(SIG_SETMASK, &ss.two, NULL); in TEST()
129 AssertSigmaskEquals(ss.two); in TEST()
141 sigprocmask(SIG_SETMASK, &ss.two, NULL); in TEST()
145 AssertSigmaskEquals(ss.two); in TEST()
156 sigprocmask(SIG_SETMASK, &ss.two, NULL); in TEST()
|
| D | search_test.cpp | 150 q_node two(2); in TEST() local
156 insque(&two, &one); in TEST()
165 for (q_node* q = &two; q != NULL; q = q->prev) { in TEST()
178 remque(&two); in TEST()
190 insque(&two, &one); in TEST()
205 remque(&two); in TEST()
|
| /bionic/libstdc++/include/ |
| D | new | 26 // these next two are not really required, since exceptions are off
|
| /bionic/libm/upstream-freebsd/lib/msun/ld128/ |
| D | s_erfl.c | 33 two = 2; variable
317 if(x < -9) return two-tiny; /* x < -9 */ in erfcl()
325 if(x>0) return r/ax; else return two-r/ax; in erfcl()
327 if(x>0) return tiny*tiny; else return two-tiny; in erfcl()
|
| /bionic/linker/ |
| D | linker_allocator.h | 57 bool operator<(const small_object_page_record& one, const small_object_page_record& two);
|
| D | linker_allocator.cpp | 56 bool operator<(const small_object_page_record& one, const small_object_page_record& two) { in operator <() argument
57 return one.page_addr < two.page_addr; in operator <()
|
| /bionic/libc/malloc_debug/ |
| D | README_api.md | 4 in a process. The libc library in Android exports two calls that can be
|
| D | README.md | 21 On 32 bit systems, these two deprecated functions are also replaced:
322 like two arguments instead of one.
|
| /bionic/tools/bionicbb/ |
| D | README.md | 4 The bionic buildbot contains two services: a gmail polling service, and a web
|
| /bionic/libc/ |
| D | SYSCALLS.TXT | 157 # sizeof(off_t) == sizeof(off64_t), so there we emit two symbols that are
158 # aliases. On 32-bit systems, we have two different system calls.
171 # (mmap only gets two lines because we only used the 64-bit variant on 32-bit systems.)
174 # (fallocate only gets two lines because there is no 32-bit variant.)
|
| D | Android.bp | 604 // These two depend on getentropy_linux.c, which isn't in libc_ndk.a.
|
| /bionic/libc/bionic/ |
| D | system_properties.cpp | 410 static int cmp_prop_name(const char *one, uint8_t one_len, const char *two, in cmp_prop_name() argument
418 return strncmp(one, two, one_len); in cmp_prop_name()
|
| /bionic/ |
| D | README.md | 165 As mentioned above, this is currently a two-step process:
|