| /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/libc/bionic/ |
| D | sha1.c | 68 void do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
69 void do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
70 void do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
71 void do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
80 do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) in do_R01() argument
82 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()
83 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()
84 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()
85 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()
86 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/stdlib/ |
| D | sha1hash.c | 132 uint32_t a, b, c, d, e; in SHA1Transform() local
150 e = state[4]; in SHA1Transform()
152 R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3); in SHA1Transform()
153 R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7); in SHA1Transform()
154 R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11); in SHA1Transform()
155 R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15); in SHA1Transform()
156 R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19); in SHA1Transform()
157 R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23); in SHA1Transform()
158 R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27); in SHA1Transform()
159 R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31); in SHA1Transform()
[all …]
|
| /bionic/libm/src/ |
| 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 = 0.0; 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_ceill.c | 58 union IEEEl2bits u = { .e = x }; in ceill()
59 int e = u.bits.exp - LDBL_MAX_EXP + 1; in ceill() local
61 if (e < MANH_SIZE - 1) { in ceill()
62 if (e < 0) { /* raise inexact if x != 0 */ in ceill()
66 u.e = u.bits.sign ? 0.0 : 1.0; in ceill()
68 uint64_t m = ((1llu << MANH_SIZE) - 1) >> (e + 1); in ceill()
73 if (e == 0) in ceill()
77 INC_MANH(u, 1llu << (MANH_SIZE - e - 1)); in ceill()
84 } else if (e < LDBL_MANT_DIG - 1) { in ceill()
85 uint64_t m = (uint64_t)-1 >> (64 - LDBL_MANT_DIG + e + 1); in ceill()
[all …]
|
| D | s_floorl.c | 58 union IEEEl2bits u = { .e = x }; in floorl()
59 int e = u.bits.exp - LDBL_MAX_EXP + 1; in floorl() local
61 if (e < MANH_SIZE - 1) { in floorl()
62 if (e < 0) { /* raise inexact if x != 0 */ in floorl()
66 u.e = u.bits.sign ? -1.0 : 0.0; in floorl()
68 uint64_t m = ((1llu << MANH_SIZE) - 1) >> (e + 1); in floorl()
73 if (e == 0) in floorl()
77 INC_MANH(u, 1llu << (MANH_SIZE - e - 1)); in floorl()
84 } else if (e < LDBL_MANT_DIG - 1) { in floorl()
85 uint64_t m = (uint64_t)-1 >> (64 - LDBL_MANT_DIG + e + 1); in floorl()
[all …]
|
| D | s_nextafterl.c | 41 ux.e = x; in nextafterl()
42 uy.e = y; in nextafterl()
54 t = ux.e*ux.e; in nextafterl()
55 if(t==ux.e) return t; else return ux.e; /* raise underflow flag */ in nextafterl()
75 t = ux.e * ux.e; in nextafterl()
76 if(t!=ux.e) /* raise underflow flag */ in nextafterl()
77 return ux.e; in nextafterl()
79 return ux.e; in nextafterl()
|
| D | s_copysignl.c | 38 ux.e = x; in copysignl()
39 uy.e = y; in copysignl()
41 return (ux.e); in copysignl()
|
| D | s_expm1f.c | 41 float y,hi,lo,c,t,e,hxs,hfx,r1; in expm1f() local
92 e = hxs*((r1-t)/((float)6.0 - x*t)); in expm1f()
93 if(k==0) return x - (x*e-hxs); /* c is 0 */ in expm1f()
95 e = (x*(e-c)-c); in expm1f()
96 e -= hxs; in expm1f()
97 if(k== -1) return (float)0.5*(x-e)-(float)0.5; in expm1f()
99 if(x < (float)-0.25) return -(float)2.0*(e-(x+(float)0.5)); in expm1f()
100 else return one+(float)2.0*(x-e); in expm1f()
103 y = one-(e-x); in expm1f()
112 y = t-(e-x); in expm1f()
[all …]
|
| D | s_expm1.c | 133 double y,hi,lo,c,t,e,hxs,hfx,r1; in expm1() local
187 e = hxs*((r1-t)/(6.0 - x*t)); in expm1()
188 if(k==0) return x - (x*e-hxs); /* c is 0 */ in expm1()
190 e = (x*(e-c)-c); in expm1()
191 e -= hxs; in expm1()
192 if(k== -1) return 0.5*(x-e)-0.5; in expm1()
194 if(x < -0.25) return -2.0*(e-(x+0.5)); in expm1()
195 else return one+2.0*(x-e); in expm1()
198 y = one-(e-x); in expm1()
207 y = t-(e-x); in expm1()
[all …]
|
| D | s_isfinite.c | 52 __isfinitel(long double e) in __isfinitel() argument
56 u.e = e; in __isfinitel()
|
| D | s_signbit.c | 52 __signbitl(long double e) in __signbitl() argument
56 u.e = e; in __signbitl()
|
| D | s_fabsl.c | 40 u.e = x; in fabsl()
42 return (u.e); in fabsl()
|
| 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_isnormal.c | 52 __isnormall(long double e) in __isnormall() argument
56 u.e = e; in __isnormall()
|
| 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_isnan.c | 55 __isnanl(long double e) in __isnanl() argument
59 u.e = e; in __isnanl()
|
| D | s_fminl.c | 39 u[0].e = x; in fminl()
41 u[1].e = y; in fminl()
|
| D | s_fmaxl.c | 39 u[0].e = x; in fmaxl()
41 u[1].e = y; in fmaxl()
|
| /bionic/libc/netbsd/resolv/ |
| D | res_cache.c | 996 entry_free( Entry* e ) in entry_free() argument
999 if (e) { in entry_free()
1000 free(e); in entry_free()
1005 entry_mru_remove( Entry* e ) in entry_mru_remove() argument
1007 e->mru_prev->mru_next = e->mru_next; in entry_mru_remove()
1008 e->mru_next->mru_prev = e->mru_prev; in entry_mru_remove()
1012 entry_mru_add( Entry* e, Entry* list ) in entry_mru_add() argument
1016 e->mru_next = first; in entry_mru_add()
1017 e->mru_prev = list; in entry_mru_add()
1019 list->mru_next = e; in entry_mru_add()
[all …]
|
| /bionic/libm/ |
| D | isinf.c | 57 __isinfl(long double e) in __isinfl() argument
61 u.e = e; in __isinfl()
|
| D | fpclassify.c | 76 __fpclassifyl(long double e) in __fpclassifyl() argument
80 u.e = e; in __fpclassifyl()
|
| /bionic/libc/kernel/common/linux/ |
| D | kernel.h | 35 #define BUILD_BUG_ON_ZERO(e) (sizeof(char[1 - 2 * !!(e)]) - 1) argument
|
| /bionic/libc/kernel/common/linux/netfilter_ipv4/ |
| D | ip_tables.h | 171 ipt_get_target(struct ipt_entry *e) in ipt_get_target() argument
173 return (void *)e + e->target_offset; in ipt_get_target()
176 …e, fn, args...) ({ unsigned int __i; int __ret = 0; struct ipt_entry_match *__match; fo… argument
|
| /bionic/libc/kernel/arch-x86/asm/ |
| D | pgtable-2level.h | 15 #define pte_ERROR(e) printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, (e).pte_low) argument
16 #define pgd_ERROR(e) printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, pgd_val(e)) argument
|