Home
last modified time | relevance | path

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

12345678910>>...19

/bionic/libc/bionic/
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()
Dmalloc_info.cpp78 for (size_t j = 0; j < __mallinfo_nbins(); j++) { in malloc_info() local
79 struct mallinfo mi = __mallinfo_bin_info(i, j); in malloc_info()
81 Elem bin_elem(fp, "bin", "nr=\"%d\"", j); in malloc_info()
/bionic/libc/upstream-openbsd/lib/libc/stdlib/
Dabs.c34 abs(int j) in abs() argument
36 return(j < 0 ? -j : j); in abs()
Dlabs.c34 labs(long j) in labs() argument
36 return(j < 0 ? -j : j); in labs()
Dllabs.c35 llabs(long long j) in llabs() argument
37 return (j < 0 ? -j : j); in llabs()
Dimaxabs.c35 imaxabs(intmax_t j) in imaxabs() argument
37 return (j < 0 ? -j : j); in imaxabs()
/bionic/libm/upstream-freebsd/lib/msun/bsdsrc/
Db_log.c366 int m, j;
385 j = logb(g), m += j;
386 g = ldexp(g, -j);
388 j = N*(g-1) + .5;
389 F = (1.0/N) * j + 1; /* F*128 is an integer in [128, 512] */
402 if (m | j)
417 u1 += m*logF_head[N] + logF_head[j]; /* exact */
418 u2 = (u2 + logF_tail[j]) + q; /* tiny */
435 int m, j; local
446 j = logb(g), m += j;
[all …]
/bionic/libm/upstream-freebsd/lib/msun/src/
Dk_rem_pio2.c296 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __kernel_rem_pio2() local
309 j = jv-jx; m = jx+jk; in __kernel_rem_pio2()
310 for(i=0;i<=m;i++,j++) f[i] = (j<0)? zero : (double) ipio2[j]; in __kernel_rem_pio2()
314 for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; q[i] = fw; in __kernel_rem_pio2()
320 for(i=0,j=jz,z=q[jz];j>0;i++,j--) { in __kernel_rem_pio2()
323 z = q[j-1]+fw; in __kernel_rem_pio2()
343 j = iq[i]; in __kernel_rem_pio2()
345 if(j!=0) { in __kernel_rem_pio2()
346 carry = 1; iq[i] = 0x1000000- j; in __kernel_rem_pio2()
348 } else iq[i] = 0xffffff - j; in __kernel_rem_pio2()
[all …]
De_pow.c101 int32_t i,j,k,yisint,n; in __ieee754_pow() local
131 j = ly>>(52-k); in __ieee754_pow()
132 if((j<<(52-k))==ly) yisint = 2-(j&1); in __ieee754_pow()
134 j = iy>>(20-k); in __ieee754_pow()
135 if((j<<(20-k))==iy) yisint = 2-(j&1); in __ieee754_pow()
213 j = ix&0x000fffff; in __ieee754_pow()
215 ix = j|0x3ff00000; /* normalize ix */ in __ieee754_pow()
216 if(j<=0x3988E) k=0; /* |x|<sqrt(3/2) */ in __ieee754_pow()
217 else if(j<0xBB67A) k=1; /* |x|<sqrt(3) */ in __ieee754_pow()
262 EXTRACT_WORDS(j,i,z); in __ieee754_pow()
[all …]
De_powf.c60 int32_t i,j,k,yisint,n; in __ieee754_powf() local
88 j = iy>>(23-k); in __ieee754_powf()
89 if((j<<(23-k))==iy) yisint = 2-(j&1); in __ieee754_powf()
155 j = ix&0x007fffff; in __ieee754_powf()
157 ix = j|0x3f800000; /* normalize ix */ in __ieee754_powf()
158 if(j<=0x1cc471) k=0; /* |x|<sqrt(3/2) */ in __ieee754_powf()
159 else if(j<0x5db3d7) k=1; /* |x|<sqrt(3) */ in __ieee754_powf()
208 GET_FLOAT_WORD(j,z); in __ieee754_powf()
209 if (j>0x43000000) /* if z > 128 */ in __ieee754_powf()
211 else if (j==0x43000000) { /* if z == 128 */ in __ieee754_powf()
[all …]
Ds_floor.c36 u_int32_t i,j; in floor() local
64 j = i1+(1<<(52-j0)); in floor()
65 if(j<i1) i0 +=1 ; /* got a carry */ in floor()
66 i1=j; in floor()
Ds_ceil.c36 u_int32_t i,j; in ceil() local
63 j = i1 + (1<<(52-j0)); in ceil()
64 if(j<i1) i0+=1; /* got a carry */ in ceil()
65 i1 = j; in ceil()
/bionic/libc/upstream-openbsd/lib/libc/gdtoa/
Dgdtoa.c159 int j, j1, k, k0, k_check, kind, leftright, m2, m5, nbits; local
211 if ( (j = 11 - hi0bits(word0(&d) & Frac_mask)) !=0)
212 dval(&d) /= 1 << j;
238 i += j;
243 if ((j = i) < 0)
244 j = -j;
245 if ((j -= 1077) > 0)
246 ds += j * 7e-17;
253 j = be + bbits - 1;
254 if ( (j1 = j & 3) !=0)
[all …]
Dhd_init.c43 int i, j; local
44 for(i = 0; (j = s[i]) !=0; i++)
45 h[j] = i + inc;
Ddtoa.c119 j, j1, k, k0, k_check, leftright, m2, m5, s2, s5, local
212 if (( j = 11 - hi0bits(word0(&d2) & Frac_mask) )!=0)
213 dval(&d2) /= 1 << j;
241 i += j;
268 j = bbits - i - 1;
269 if (j >= 0) {
271 s2 = j;
274 b2 = -j;
349 j = k >> 4;
350 if (j & Bletch) {
[all …]
/bionic/benchmarks/
Dproperty_benchmark.cpp78 for (int j = 0; j < name_lens[i]; j++) { in LocalPropertyTestState() local
79 if (j == 0 || names[i][j-1] == '.' || j == name_lens[i] - 1) { in LocalPropertyTestState()
89 names[i][j] = prop_name_chars[random() % prop_name_len]; in LocalPropertyTestState()
96 for (int j = 0; j < value_lens[i]; j++) { in LocalPropertyTestState() local
97 values[i][j] = prop_name_chars[random() % (sizeof(prop_name_chars) - 1)]; in LocalPropertyTestState()
/bionic/tests/
Dbuffer_tests.cpp331 for (size_t j = 0; j < 32; j++) { in RunCmpBufferAlignTest() local
332 buf1_align[len+j] = j; in RunCmpBufferAlignTest()
333 buf2_align[len+j] = j+1; in RunCmpBufferAlignTest()
388 for (size_t j = 0; j < pagesize; j++) { in RunSrcDstBufferOverreadTest() local
389 uint8_t* src = &memory[pagesize-j]; in RunSrcDstBufferOverreadTest()
391 test_func(src, dst, j); in RunSrcDstBufferOverreadTest()
438 for (size_t j = 1; j < miscmp_len; j++) { in RunCmpBufferOverreadTest() local
439 if (j == i) in RunCmpBufferOverreadTest()
442 uint8_t* buf2 = &memory2[pagesize-j]; in RunCmpBufferOverreadTest()
444 test_miscmp_func(buf1, buf2, i, j); in RunCmpBufferOverreadTest()
/bionic/libc/arch-mips/syscalls/
Ddelete_module.S12 j ra
16 j t9
Ddup.S12 j ra
16 j t9
Ddup3.S12 j ra
16 j t9
Depoll_create1.S12 j ra
16 j t9
Depoll_ctl.S12 j ra
16 j t9
Deventfd.S12 j ra
16 j t9
Dexecve.S12 j ra
16 j t9
Dfallocate64.S12 j ra
16 j t9

12345678910>>...19