Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 27) sorted by relevance

12

/bionic/libc/string/
Dmemmem.c43 size_t j = 0; in memmem() local
50 while (j <= n-m) { in memmem()
51 if (x[1] != y[j+1]) { in memmem()
52 j += k; in memmem()
54 if (!memcmp(x+2, y+j+2, m-2) && x[0] == y[j]) in memmem()
55 return (void*) &y[j]; in memmem()
56 j += l; in memmem()
/bionic/libm/bsdsrc/
Db_log.c368 int m, j;
387 j = logb(g), m += j;
388 g = ldexp(g, -j);
390 j = N*(g-1) + .5;
391 F = (1.0/N) * j + 1; /* F*128 is an integer in [128, 512] */
404 if (m | j)
419 u1 += m*logF_head[N] + logF_head[j]; /* exact */
420 u2 = (u2 + logF_tail[j]) + q; /* tiny */
437 int m, j; local
448 j = logb(g), m += j;
[all …]
/bionic/libm/src/
Dk_rem_pio2f.c50 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __kernel_rem_pio2f() local
63 j = jv-jx; m = jx+jk; in __kernel_rem_pio2f()
64 for(i=0;i<=m;i++,j++) f[i] = (j<0)? zero : (float) ipio2[j]; in __kernel_rem_pio2f()
68 for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; q[i] = fw; in __kernel_rem_pio2f()
74 for(i=0,j=jz,z=q[jz];j>0;i++,j--) { in __kernel_rem_pio2f()
77 z = q[j-1]+fw; in __kernel_rem_pio2f()
97 j = iq[i]; in __kernel_rem_pio2f()
99 if(j!=0) { in __kernel_rem_pio2f()
100 carry = 1; iq[i] = 0x100- j; in __kernel_rem_pio2f()
102 } else iq[i] = 0xff - j; in __kernel_rem_pio2f()
[all …]
Dk_rem_pio2.c158 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __kernel_rem_pio2() local
171 j = jv-jx; m = jx+jk; in __kernel_rem_pio2()
172 for(i=0;i<=m;i++,j++) f[i] = (j<0)? zero : (double) ipio2[j]; in __kernel_rem_pio2()
176 for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; q[i] = fw; in __kernel_rem_pio2()
182 for(i=0,j=jz,z=q[jz];j>0;i++,j--) { in __kernel_rem_pio2()
185 z = q[j-1]+fw; in __kernel_rem_pio2()
205 j = iq[i]; in __kernel_rem_pio2()
207 if(j!=0) { in __kernel_rem_pio2()
208 carry = 1; iq[i] = 0x1000000- j; in __kernel_rem_pio2()
210 } else iq[i] = 0xffffff - j; in __kernel_rem_pio2()
[all …]
De_pow.c102 int32_t i,j,k,yisint,n; in __ieee754_pow() local
129 j = ly>>(52-k); in __ieee754_pow()
130 if((j<<(52-k))==ly) yisint = 2-(j&1); in __ieee754_pow()
132 j = iy>>(20-k); in __ieee754_pow()
133 if((j<<(20-k))==iy) yisint = 2-(j&1); in __ieee754_pow()
211 j = ix&0x000fffff; in __ieee754_pow()
213 ix = j|0x3ff00000; /* normalize ix */ in __ieee754_pow()
214 if(j<=0x3988E) k=0; /* |x|<sqrt(3/2) */ in __ieee754_pow()
215 else if(j<0xBB67A) k=1; /* |x|<sqrt(3) */ in __ieee754_pow()
260 EXTRACT_WORDS(j,i,z); in __ieee754_pow()
[all …]
De_powf.c61 int32_t i,j,k,yisint,n; in __ieee754_powf() local
86 j = iy>>(23-k); in __ieee754_powf()
87 if((j<<(23-k))==iy) yisint = 2-(j&1); in __ieee754_powf()
153 j = ix&0x007fffff; in __ieee754_powf()
155 ix = j|0x3f800000; /* normalize ix */ in __ieee754_powf()
156 if(j<=0x1cc471) k=0; /* |x|<sqrt(3/2) */ in __ieee754_powf()
157 else if(j<0x5db3d7) k=1; /* |x|<sqrt(3) */ in __ieee754_powf()
206 GET_FLOAT_WORD(j,z); in __ieee754_powf()
207 if (j>0x43000000) /* if z > 128 */ in __ieee754_powf()
209 else if (j==0x43000000) { /* if z == 128 */ in __ieee754_powf()
[all …]
Ds_floor.c35 u_int32_t i,j; in floor() local
63 j = i1+(1<<(52-j0)); in floor()
64 if(j<i1) i0 +=1 ; /* got a carry */ in floor()
65 i1=j; in floor()
Ds_ceil.c35 u_int32_t i,j; in ceil() local
62 j = i1 + (1<<(52-j0)); in ceil()
63 if(j<i1) i0+=1; /* got a carry */ in ceil()
64 i1 = j; in ceil()
De_logf.c39 int32_t k,ix,i,j; in __ieee754_logf() local
70 j = (0x6b851<<3)-ix; in __ieee754_logf()
73 i |= j; in __ieee754_logf()
De_hypotf.c27 int32_t j,k,ha,hb; in __ieee754_hypotf() local
33 if(hb > ha) {a=y;b=x;j=ha; ha=hb;hb=j;} else {a=x;b=y;} in __ieee754_hypotf()
De_log.c90 int32_t k,hx,i,j; in __ieee754_log() local
122 j = 0x6b851-hx; in __ieee754_log()
125 i |= j; in __ieee754_log()
De_rem_pio2.c80 int32_t e0,i,j,nx,n,ix,hx; in __ieee754_rem_pio2() local
122 j = ix>>20; in __ieee754_rem_pio2()
125 i = j-((high>>20)&0x7ff); in __ieee754_rem_pio2()
133 i = j-((high>>20)&0x7ff); in __ieee754_rem_pio2()
De_hypot.c57 int32_t j,k,ha,hb; in __ieee754_hypot() local
63 if(hb > ha) {a=y;b=x;j=ha; ha=hb;hb=j;} else {a=x;b=y;} in __ieee754_hypot()
Ds_trunc.c34 u_int32_t i,j; in trunc() local
/bionic/libc/kernel/common/linux/
Djbd.h97 #define JFS_HAS_COMPAT_FEATURE(j,mask) ((j)->j_format_version >= 2 && ((j)->j_superblock->s_fea… argument
98 #define JFS_HAS_RO_COMPAT_FEATURE(j,mask) ((j)->j_format_version >= 2 && ((j)->j_superblock->s_… argument
99 #define JFS_HAS_INCOMPAT_FEATURE(j,mask) ((j)->j_format_version >= 2 && ((j)->j_superblock->s_f… argument
/bionic/libc/bionic/
Darc4random.c61 u_int8_t j; member
80 rs.j = 0; in arc4_init()
93 rs.j = (rs.j + si + dat[n % datlen]); in arc4_addrandom()
94 rs.s[rs.i] = rs.s[rs.j]; in arc4_addrandom()
95 rs.s[rs.j] = si; in arc4_addrandom()
97 rs.j = rs.i; in arc4_addrandom()
167 rs.j = (rs.j + si); in arc4_getbyte()
168 sj = rs.s[rs.j]; in arc4_getbyte()
170 rs.s[rs.j] = si; in arc4_getbyte()
Dsha1.c219 u_int i, j; local
224 j = context->count[0];
225 if ((context->count[0] += len << 3) < j)
227 j = (j >> 3) & 63;
228 if ((j + len) > 63) {
229 (void)memcpy(&context->buffer[j], data, (i = 64-j));
233 j = 0;
237 (void)memcpy(&context->buffer[j], &data[i], len - i);
/bionic/libc/netbsd/resolv/
Dres_random.c179 u_int16_t j, i; in res_initid() local
198 j = arc4random_uniform(RU_N); in res_initid()
208 if (j % pfacts[i] == 0) in res_initid()
214 j = (j + 1) % RU_N; in res_initid()
217 ru_g = pmod(RU_GEN, j, RU_N); in res_initid()
/bionic/libc/stdlib/
Dstrtod.c886 int i, j; local
896 j = b->wds;
900 if (j > 1 && !b->x[j-1])
903 if (i -= j)
906 xa = xa0 + j;
908 xb = xb0 + j;
1335 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign; local
1580 for(j = 0; e1 > 1; j++,
1583 value(rv) *= bigtens[j];
1586 value(rv) *= bigtens[j];
[all …]
Dsha1hash.c202 uint32_t i, j; /* JHB */ in SHA1Update() local
207 j = (context->count[0] >> 3) & 63; in SHA1Update()
210 if ((j + len) > 63) { in SHA1Update()
211 memcpy(&context->buffer[j], data, (i = 64-j)); in SHA1Update()
216 j = 0; in SHA1Update()
219 memcpy(&context->buffer[j], &data[i], len - i); in SHA1Update()
268 int i, j; in mybase64() local
280 for ( j = 0 ; j < 4 ; j++ ) { in mybase64()
/bionic/libc/kernel/tools/
Dcpp.py1137 j = i
1143 while j < i and self.tok[j].id == tokSPACE:
1144 j += 1
1146 while k > j and self.tok[k-1].id == tokSPACE:
1148 param = self.tok[j:k]
1152 j = i+1
1741 j = i
1742 while j < n and src[j].id != tokLN:
1743 j += 1
1745 if j >= n:
[all …]
/bionic/libc/kernel/arch-arm/asm/
Duser.h24 unsigned int j:1; member
/bionic/libc/netbsd/
Dgethnamaddr.c1006 int i, j; in addrsort() local
1015 for (j = 0 ; (unsigned)j < res->nsort; j++) in addrsort()
1016 if (res->sort_list[j].addr.s_addr == in addrsort()
1018 res->sort_list[j].mask)) in addrsort()
1020 aval[i] = j; in addrsort()
1021 if (needsort == 0 && i > 0 && j < aval[i-1]) in addrsort()
1028 for (j = needsort - 1; j >= 0; j--) { in addrsort()
1029 if (aval[j] > aval[j+1]) { in addrsort()
1032 i = aval[j]; in addrsort()
1033 aval[j] = aval[j+1]; in addrsort()
[all …]
/bionic/libc/tzcode/
Dlocaltime.c619 register int j; local
621 for (j = 0; j + i < sp->timecnt; ++j) {
622 sp->ats[j] = sp->ats[j + i];
623 sp->types[j] = sp->types[j + i];
625 sp->timecnt = j;
1126 register int j; local
1135 j = sp->types[i];
1136 if (!sp->ttis[j].tt_isdst) {
1138 -sp->ttis[j].tt_gmtoff;
1144 j = sp->types[i];
[all …]
/bionic/libc/unistd/
Dgetopt_long.c137 int cstart, cyclelen, i, j, ncycle, nnonopts, nopts, pos; in permute_args() local
151 for (j = 0; j < cyclelen; j++) { in permute_args()

12