/bionic/libc/upstream-netbsd/common/lib/libc/hash/sha1/ |
D | sha1.c | 95 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/libc/include/ |
D | assert.h | 51 # define assert(e) ((void)0) argument 52 # define _assert(e) ((void)0) argument 54 # define _assert(e) assert(e) argument 56 # define assert(e) ((e) ? (void)0 : __assert2(__FILE__, __LINE__, __func__, #e)) argument 58 # define assert(e) ((e) ? (void)0 : __assert(__FILE__, __LINE__, #e)) argument
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
D | s_modfl.c | 61 int e; in modfl() local 63 ux.e = x; in modfl() 64 e = ux.bits.exp - LDBL_MAX_EXP + 1; in modfl() 65 if (e < HIBITS) { /* Integer part is in manh. */ in modfl() 66 if (e < 0) { /* |x|<1 */ in modfl() 70 if ((GETFRAC(ux.bits.manh, HIBITS - 1 - e) | in modfl() 76 ux.bits.manh >>= HIBITS - 1 - e; in modfl() 77 ux.bits.manh <<= HIBITS - 1 - e; in modfl() 79 *iptr = ux.e; in modfl() 80 return (x - ux.e); in modfl() [all …]
|
D | e_sqrtl.c | 42 u.e = x; in inc() 49 return (u.e); in inc() 58 u.e = x; in dec() 65 return (u.e); in dec() 83 u.e = x; in sqrtl() 103 u.e *= 0x1.0p514; in sqrtl() 124 xn = sqrt(u.e); /* 53-bit estimate of sqrtl(x). */ in sqrtl() 126 xn = (xn + (u.e / xn)) * 0.5; /* 106-bit estimate. */ in sqrtl() 128 lo = u.e; in sqrtl() 130 lo = (lo - u.e) / xn; /* Low bits divided by xn. */ in sqrtl() [all …]
|
D | s_truncl.c | 44 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()
|
D | s_floorl.c | 57 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 …]
|
D | s_ceill.c | 57 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 …]
|
D | s_nextafterl.c | 39 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()
|
D | s_expm1f.c | 44 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 …]
|
D | s_expm1.c | 135 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 …]
|
D | s_copysignl.c | 38 ux.e = x; in copysignl() 39 uy.e = y; in copysignl() 41 return (ux.e); in copysignl()
|
D | s_frexpl.c | 43 u.e = x; in frexpl() 49 u.e *= 0x1.0p514; in frexpl() 61 return (u.e); in frexpl()
|
D | s_scalbnl.c | 49 u.e = x; in scalbnl() 53 u.e *= 0x1p+128; in scalbnl() 61 {u.bits.exp = k; return u.e;} in scalbnl() 68 return u.e*0x1p-128; in scalbnl()
|
D | s_fabsl.c | 40 u.e = x; in fabsl() 42 return (u.e); in fabsl()
|
D | s_tanhl.c | 50 #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()
|
/bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
D | remque.c | 42 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()
|
D | insque.c | 42 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/linker/ |
D | linked_list.h | 149 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) { in visit() local 150 if (!action(e->element)) { in visit() 159 for (LinkedListEntry<T>* e = head_, *p = nullptr; e != nullptr;) { in remove_if() local 160 if (predicate(e->element)) { in remove_if() 161 LinkedListEntry<T>* next = e->next; in remove_if() 168 if (tail_ == e) { in remove_if() 172 Allocator::free(e); in remove_if() 174 e = next; in remove_if() 176 p = e; in remove_if() 177 e = e->next; in remove_if() [all …]
|
/bionic/libc/bionic/ |
D | clearenv.cpp | 33 char** e = environ; in clearenv() local 34 if (e != NULL) { in clearenv() 35 for (; *e; ++e) { in clearenv() 36 *e = NULL; in clearenv()
|
D | mntent.cpp | 43 mntent* getmntent_r(FILE* fp, struct mntent* e, char* buf, int buf_len) { in getmntent_r() argument 44 memset(e, 0, sizeof(*e)); in getmntent_r() 51 &e->mnt_freq, &e->mnt_passno) == 2) { in getmntent_r() 52 e->mnt_fsname = &buf[fsname0]; in getmntent_r() 55 e->mnt_dir = &buf[dir0]; in getmntent_r() 58 e->mnt_type = &buf[type0]; in getmntent_r() 61 e->mnt_opts = &buf[opts0]; in getmntent_r() 64 return e; in getmntent_r()
|
/bionic/tests/ |
D | dirent_test.cpp | 165 dirent* e = readdir(d); in TEST() local 166 ASSERT_STREQ(e->d_name, "."); in TEST() 185 dirent* e = readdir(d); in TEST() local 186 ASSERT_STREQ(e->d_name, "."); in TEST() 207 dirent* e; in TEST() local 208 while ((e = readdir(d)) != NULL) { in TEST() 209 name_set.insert(e->d_name); in TEST() 224 dirent64* e; in TEST() local 225 while ((e = readdir64(d)) != NULL) { in TEST() 226 name_set.insert(e->d_name); in TEST() [all …]
|
D | sys_select_test.cpp | 82 fd_set e; in TEST() local 83 FD_ZERO(&e); in TEST() 92 ASSERT_EQ(-1, select(-1, &r, &w, &e, NULL)); in TEST() 95 int num_fds = select(max, &r, &w, &e, NULL); 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, NULL, &ss)); in TEST() 153 int num_fds = pselect(max, &r, &w, &e, NULL, &ss); in TEST() 165 ASSERT_EQ(-1, pselect(max, &r, &w, &e, &tv, &ss)); in TEST()
|
/bionic/libc/dns/resolv/ |
D | res_cache.c | 1105 entry_free( Entry* e ) in entry_free() argument 1108 if (e) { in entry_free() 1109 free(e); in entry_free() 1114 entry_mru_remove( Entry* e ) in entry_mru_remove() argument 1116 e->mru_prev->mru_next = e->mru_next; in entry_mru_remove() 1117 e->mru_next->mru_prev = e->mru_prev; in entry_mru_remove() 1121 entry_mru_add( Entry* e, Entry* list ) in entry_mru_add() argument 1125 e->mru_next = first; in entry_mru_add() 1126 e->mru_prev = list; in entry_mru_add() 1128 list->mru_next = e; in entry_mru_add() [all …]
|
/bionic/libm/ |
D | signbit.c | 50 int __signbitl(long double e) in __signbitl() argument 54 u.e = e; in __signbitl()
|
/bionic/libm/upstream-freebsd/lib/msun/ld128/ |
D | s_exp2l.c | 361 u.e = x; in exp2l() 397 u.e = x + redux; in exp2l() 401 u.e -= redux; in exp2l() 402 z = x - u.e; in exp2l() 407 twopk = v.e; in exp2l() 410 twopkp10000 = v.e; in exp2l()
|