Home
last modified time | relevance | path

Searched refs:e (Results 1 – 25 of 92) sorted by relevance

1234

/bionic/libc/upstream-netbsd/common/lib/libc/hash/sha1/
Dsha1.c95 void do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
96 void do_R2(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
97 void do_R3(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
98 void do_R4(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *);
107 do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block) in do_R01() argument
109 nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2); nR0(c,d,e,a,b, 3); in do_R01()
110 nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5); nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7); in do_R01()
111 nR0(c,d,e,a,b, 8); nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11); in do_R01()
112 nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14); nR0(a,b,c,d,e,15); in do_R01()
113 nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17); nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19); in do_R01()
[all …]
/bionic/linker/
Dlinked_list.h177 for (LinkedListEntry<T>* e = head(); e != nullptr; e = e->next) { in visit() local
178 if (!action(e->element)) { in visit()
188 for (LinkedListEntry<T>* e = header_->head, *p = nullptr; e != nullptr;) { in remove_if() local
189 if (predicate(e->element)) { in remove_if()
190 LinkedListEntry<T>* next = e->next; in remove_if()
197 if (header_->tail == e) { in remove_if()
201 Allocator::free(e); in remove_if()
203 e = next; in remove_if()
205 p = e; in remove_if()
206 e = e->next; in remove_if()
[all …]
/bionic/libm/upstream-freebsd/lib/msun/src/
Ds_modfl.c63 int e; in modfl() local
65 ux.e = x; in modfl()
66 e = ux.bits.exp - LDBL_MAX_EXP + 1; in modfl()
67 if (e < HIBITS) { /* Integer part is in manh. */ in modfl()
68 if (e < 0) { /* |x|<1 */ in modfl()
72 if ((GETFRAC(ux.bits.manh, HIBITS - 1 - e) | in modfl()
78 ux.bits.manh >>= HIBITS - 1 - e; in modfl()
79 ux.bits.manh <<= HIBITS - 1 - e; in modfl()
81 *iptr = ux.e; in modfl()
82 return (x - ux.e); in modfl()
[all …]
De_sqrtl.c44 u.e = x; in inc()
51 return (u.e); in inc()
60 u.e = x; in dec()
67 return (u.e); in dec()
85 u.e = x; in sqrtl()
105 u.e *= 0x1.0p514; in sqrtl()
126 xn = sqrt(u.e); /* 53-bit estimate of sqrtl(x). */ in sqrtl()
128 xn = (xn + (u.e / xn)) * 0.5; /* 106-bit estimate. */ in sqrtl()
130 lo = u.e; in sqrtl()
132 lo = (lo - u.e) / xn; /* Low bits divided by xn. */ in sqrtl()
[all …]
Ds_ceill.c57 union IEEEl2bits u = { .e = x }; in ceill()
58 int e = u.bits.exp - LDBL_MAX_EXP + 1; in ceill() local
60 if (e < MANH_SIZE - 1) { in ceill()
61 if (e < 0) { /* raise inexact if x != 0 */ in ceill()
65 u.e = u.bits.sign ? -0.0 : 1.0; in ceill()
67 uint64_t m = ((1llu << MANH_SIZE) - 1) >> (e + 1); in ceill()
72 if (e == 0) in ceill()
76 INC_MANH(u, 1llu << (MANH_SIZE - e - 1)); in ceill()
83 } else if (e < LDBL_MANT_DIG - 1) { in ceill()
84 uint64_t m = (uint64_t)-1 >> (64 - LDBL_MANT_DIG + e + 1); in ceill()
[all …]
Ds_floorl.c57 union IEEEl2bits u = { .e = x }; in floorl()
58 int e = u.bits.exp - LDBL_MAX_EXP + 1; in floorl() local
60 if (e < MANH_SIZE - 1) { in floorl()
61 if (e < 0) { /* raise inexact if x != 0 */ in floorl()
65 u.e = u.bits.sign ? -1.0 : 0.0; in floorl()
67 uint64_t m = ((1llu << MANH_SIZE) - 1) >> (e + 1); in floorl()
72 if (e == 0) in floorl()
76 INC_MANH(u, 1llu << (MANH_SIZE - e - 1)); in floorl()
83 } else if (e < LDBL_MANT_DIG - 1) { in floorl()
84 uint64_t m = (uint64_t)-1 >> (64 - LDBL_MANT_DIG + e + 1); in floorl()
[all …]
Ds_truncl.c44 union IEEEl2bits u = { .e = x }; in truncl()
45 int e = u.bits.exp - LDBL_MAX_EXP + 1; in truncl() local
47 if (e < MANH_SIZE - 1) { in truncl()
48 if (e < 0) { /* raise inexact if x != 0 */ in truncl()
50 u.e = zero[u.bits.sign]; in truncl()
52 uint64_t m = ((1llu << MANH_SIZE) - 1) >> (e + 1); in truncl()
60 } else if (e < LDBL_MANT_DIG - 1) { in truncl()
61 uint64_t m = (uint64_t)-1 >> (64 - LDBL_MANT_DIG + e + 1); in truncl()
67 return (u.e); in truncl()
Ds_nextafterl.c39 ux.e = x; in nextafterl()
40 uy.e = y; in nextafterl()
52 t = ux.e*ux.e; in nextafterl()
53 if(t==ux.e) return t; else return ux.e; /* raise underflow flag */ in nextafterl()
73 t = ux.e * ux.e; in nextafterl()
74 if(t!=ux.e) /* raise underflow flag */ in nextafterl()
75 return ux.e; in nextafterl()
77 return ux.e; in nextafterl()
Ds_expm1f.c44 float y,hi,lo,c,t,e,hxs,hfx,r1,twopk; in expm1f() local
94 e = hxs*((r1-t)/((float)6.0 - x*t)); in expm1f()
95 if(k==0) return x - (x*e-hxs); /* c is 0 */ in expm1f()
98 e = (x*(e-c)-c); in expm1f()
99 e -= hxs; in expm1f()
100 if(k== -1) return (float)0.5*(x-e)-(float)0.5; in expm1f()
102 if(x < (float)-0.25) return -(float)2.0*(e-(x+(float)0.5)); in expm1f()
103 else return one+(float)2.0*(x-e); in expm1f()
106 y = one-(e-x); in expm1f()
114 y = t-(e-x); in expm1f()
[all …]
Ds_expm1.c135 double y,hi,lo,c,t,e,hxs,hfx,r1,twopk; in expm1() local
188 e = hxs*((r1-t)/(6.0 - x*t)); in expm1()
189 if(k==0) return x - (x*e-hxs); /* c is 0 */ in expm1()
192 e = (x*(e-c)-c); in expm1()
193 e -= hxs; in expm1()
194 if(k== -1) return 0.5*(x-e)-0.5; in expm1()
196 if(x < -0.25) return -2.0*(e-(x+0.5)); in expm1()
197 else return one+2.0*(x-e); in expm1()
200 y = one-(e-x); in expm1()
208 y = t-(e-x); in expm1()
[all …]
Ds_tanhl.c50 #define T3 T3u.e
87 long double e, long double f) in divl() argument
95 e = e + f; in divl()
97 inv = 1 / (d + e); in divl()
103 fw = d + e; in divl()
104 e = d - fw + e; in divl()
107 r = r + (a - d * r + b - e * r) * inv; in divl()
Ds_cosl.c49 #define pio4 (pio4u.e)
65 z.e = x; in cosl()
79 if (z.e < pio4) in cosl()
80 RETURNI(__kernel_cosl(z.e, 0)); in cosl()
/bionic/tests/
Dsearch_test.cpp219 static void AssertEntry(ENTRY* e, const char* expected_key, const char* expected_data) { in AssertEntry() argument
220 ASSERT_TRUE(e != nullptr); in AssertEntry()
221 ASSERT_STREQ(expected_key, reinterpret_cast<char*>(e->key)); in AssertEntry()
222 ASSERT_STREQ(expected_data, reinterpret_cast<char*>(e->data)); in AssertEntry()
229 ENTRY* e; in TEST() local
230 e = hsearch(ENTRY{.key = const_cast<char*>("a"), .data = const_cast<char*>("A")}, ENTER); in TEST()
231 AssertEntry(e, "a", "A"); in TEST()
232 e = hsearch(ENTRY{.key = const_cast<char*>("aa"), .data = const_cast<char*>("B")}, ENTER); in TEST()
233 AssertEntry(e, "aa", "B"); in TEST()
234 e = hsearch(ENTRY{.key = const_cast<char*>("aaa"), .data = const_cast<char*>("C")}, ENTER); in TEST()
[all …]
Ddirent_test.cpp191 dirent* e = readdir(d); in TEST() local
192 ASSERT_STREQ(e->d_name, "."); in TEST()
213 dirent* e = readdir(d); in TEST() local
214 ASSERT_STREQ(e->d_name, "."); in TEST()
235 dirent* e; in TEST() local
236 while ((e = readdir(d)) != nullptr) { in TEST()
237 name_set.insert(e->d_name); in TEST()
252 dirent64* e; in TEST() local
253 while ((e = readdir64(d)) != nullptr) { in TEST()
254 name_set.insert(e->d_name); in TEST()
[all …]
Dsys_select_test.cpp82 fd_set e; in TEST() local
83 FD_ZERO(&e); in TEST()
92 ASSERT_EQ(-1, select(-1, &r, &w, &e, nullptr)); in TEST()
95 int num_fds = select(max, &r, &w, &e, nullptr); in TEST()
110 ASSERT_EQ(-1, select(max, &r, &w, &e, &tv)); in TEST()
137 fd_set e; in TEST() local
138 FD_ZERO(&e); in TEST()
147 ASSERT_EQ(-1, pselect(-1, &r, &w, &e, nullptr, &ss)); in TEST()
153 int num_fds = pselect(max, &r, &w, &e, nullptr, &ss); in TEST()
165 ASSERT_EQ(-1, pselect(max, &r, &w, &e, &tv, &ss)); in TEST()
/bionic/libc/upstream-openbsd/lib/libc/stdlib/
Dremque.c42 struct qelem *e = element; in remque() local
44 if (e->q_forw != NULL) in remque()
45 e->q_forw->q_back = e->q_back; in remque()
46 if (e->q_back != NULL) in remque()
47 e->q_back->q_forw = e->q_forw; in remque()
Dinsque.c42 struct qelem *e = entry; in insque() local
46 e->q_forw = e->q_back = NULL; in insque()
48 e->q_forw = p->q_forw; in insque()
49 e->q_back = p; in insque()
51 p->q_forw->q_back = e; in insque()
52 p->q_forw = e; in insque()
/bionic/libc/bionic/
Dmntent.cpp39 mntent* getmntent_r(FILE* fp, struct mntent* e, char* buf, int buf_len) { in getmntent_r() argument
40 memset(e, 0, sizeof(*e)); in getmntent_r()
47 &e->mnt_freq, &e->mnt_passno) == 2) { in getmntent_r()
48 e->mnt_fsname = &buf[fsname0]; in getmntent_r()
51 e->mnt_dir = &buf[dir0]; in getmntent_r()
54 e->mnt_type = &buf[type0]; in getmntent_r()
57 e->mnt_opts = &buf[opts0]; in getmntent_r()
60 return e; in getmntent_r()
Dclearenv.cpp33 char** e = environ; in clearenv() local
34 if (e != nullptr) { in clearenv()
35 for (; *e; ++e) { in clearenv()
36 *e = nullptr; in clearenv()
/bionic/libc/dns/resolv/
Dres_cache.c1161 entry_free( Entry* e ) in entry_free() argument
1164 if (e) { in entry_free()
1165 free(e); in entry_free()
1169 static __inline__ void entry_mru_remove(Entry* e) { in entry_mru_remove() argument
1170 e->mru_prev->mru_next = e->mru_next; in entry_mru_remove()
1171 e->mru_next->mru_prev = e->mru_prev; in entry_mru_remove()
1174 static __inline__ void entry_mru_add(Entry* e, Entry* list) { in entry_mru_add() argument
1177 e->mru_next = first; in entry_mru_add()
1178 e->mru_prev = list; in entry_mru_add()
1180 list->mru_next = e; in entry_mru_add()
[all …]
/bionic/libc/include/
Dassert.h52 # define assert(e) __assert_no_op argument
55 # define assert(e) ((e) ? __assert_no_op : __assert2(__FILE__, __LINE__, __PRETTY_FUNCTION__, #e)) argument
63 # define assert(e) ((e) ? __assert_no_op : __assert(__FILE__, __LINE__, #e)) argument
/bionic/libm/upstream-netbsd/lib/libm/complex/
Dcephes_subrl.c42 long double e, ei; in _cchshl() local
48 e = expl(x); in _cchshl()
49 ei = 0.5L / e; in _cchshl()
50 e = 0.5L * e; in _cchshl()
51 *s = e - ei; in _cchshl()
52 *c = e + ei; in _cchshl()
/bionic/libc/kernel/uapi/linux/netfilter_bridge/
Debtables.h135 #define EBT_MATCH_ITERATE(e,fn,args...) \ argument
136 …e)->watchers_offset; __i += __match->match_size + sizeof(struct ebt_entry_match)) { __match = (voi…
138 #define EBT_WATCHER_ITERATE(e,fn,args...) \ argument
139 …e->watchers_offset; __i < (e)->target_offset; __i += __watcher->watcher_size + sizeof(struct ebt_e…
/bionic/libm/upstream-freebsd/lib/msun/ld128/
Ds_exp2l.c363 u.e = x; in exp2l()
399 u.e = x + redux; in exp2l()
403 u.e -= redux; in exp2l()
404 z = x - u.e; in exp2l()
409 twopk = v.e; in exp2l()
412 twopkp10000 = v.e; in exp2l()
/bionic/libc/upstream-openbsd/lib/libc/gdtoa/
Dgethex.c50 Long e, e1; local
77 e = 0;
119 e = -(((Long)(s-decpt)) << 2);
145 e += e1;
250 e += n;
257 e -= n;
260 if (e > fpi->emax) {
270 if (e < fpi->emin) {
272 n = fpi->emin - e;
313 e = fpi->emin;
[all …]

1234