Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 81) sorted by relevance

1234

/third_party/ulib/musl/src/string/
A Dmemmem.c7 for (h += 2, k -= 2; k; k--, hw = hw << 8 | *h++) in twobyte_memmem()
16 for (h += 3, k -= 3; k; k--, hw = (hw | *h++) << 8) in threebyte_memmem()
25 for (h += 4, k -= 4; k; k--, hw = hw << 8 | *h++) in fourbyte_memmem()
51 k = p = 1; in twoway_memmem()
53 if (n[ip + k] == n[jp + k]) { in twoway_memmem()
59 } else if (n[ip + k] > n[jp + k]) { in twoway_memmem()
74 k = p = 1; in twoway_memmem()
76 if (n[ip + k] == n[jp + k]) { in twoway_memmem()
82 } else if (n[ip + k] < n[jp + k]) { in twoway_memmem()
127 for (k = MAX(ms + 1, mem); k < l && n[k] == h[k]; k++) in twoway_memmem()
[all …]
A Dwcsstr.c19 k = p = 1; in twoway_wcsstr()
21 if (n[ip + k] == n[jp + k]) { in twoway_wcsstr()
26 k++; in twoway_wcsstr()
27 } else if (n[ip + k] > n[jp + k]) { in twoway_wcsstr()
29 k = 1; in twoway_wcsstr()
42 k = p = 1; in twoway_wcsstr()
44 if (n[ip + k] == n[jp + k]) { in twoway_wcsstr()
50 } else if (n[ip + k] < n[jp + k]) { in twoway_wcsstr()
52 k = 1; in twoway_wcsstr()
91 for (k = MAX(ms + 1, mem); n[k] && n[k] == h[k]; k++) in twoway_wcsstr()
[all …]
A Dstrstr.c49 k = p = 1; in twoway_strstr()
51 if (n[ip + k] == n[jp + k]) { in twoway_strstr()
56 k++; in twoway_strstr()
57 } else if (n[ip + k] > n[jp + k]) { in twoway_strstr()
59 k = 1; in twoway_strstr()
72 k = p = 1; in twoway_strstr()
74 if (n[ip + k] == n[jp + k]) { in twoway_strstr()
80 } else if (n[ip + k] < n[jp + k]) { in twoway_strstr()
82 k = 1; in twoway_strstr()
138 for (k = MAX(ms + 1, mem); n[k] && n[k] == h[k]; k++) in twoway_strstr()
[all …]
/third_party/ulib/musl/src/regex/
A Dfnmatch.c64 if (pat[k] == '^' || pat[k] == '!') in pat_next()
69 for (; k < m && pat[k] && pat[k] != ']'; k++) { in pat_next()
70 if (k + 1 < m && pat[k + 1] && pat[k] == '[' && in pat_next()
71 (pat[k + 1] == ':' || pat[k + 1] == '.' || pat[k + 1] == '=')) { in pat_next()
74 if (k < m && pat[k]) in pat_next()
76 while (k < m && pat[k] && (pat[k - 1] != z || pat[k] != ']')) in pat_next()
78 if (k == m || !pat[k]) in pat_next()
82 if (k == m || !pat[k]) { in pat_next()
109 return c == k ? towlower(k) : c; in casefold()
195 kfold = flags & FNM_CASEFOLD ? casefold(k) : k; in fnmatch_internal()
[all …]
/third_party/ulib/musl/third_party/math/
A Dexpm1f.c37 int k, sign = u.i >> 31; in expm1f() local
57 k = 1; in expm1f()
61 k = -1; in expm1f()
65 t = k; in expm1f()
76 k = 0; in expm1f()
84 if (k == 0) /* c is 0 */ in expm1f()
89 if (k == -1) in expm1f()
91 if (k == 1) { in expm1f()
98 if (k < 0 || k > 56) { /* suffice to return exp(x)-1 */ in expm1f()
100 if (k == 128) in expm1f()
[all …]
A Dexpm1.c127 int k, sign = u.i >> 63; in expm1() local
147 k = 1; in expm1()
151 k = -1; in expm1()
155 t = k; in expm1()
166 k = 0; in expm1()
174 if (k == 0) /* c is 0 */ in expm1()
179 if (k == -1) in expm1()
181 if (k == 1) { in expm1()
188 if (k < 0 || k > 56) { /* suffice to return exp(x)-1 */ in expm1()
190 if (k == 1024) in expm1()
[all …]
A Dexpf.c30 int k, sign; in expf() local
57 k = invln2 * x + half[sign]; in expf()
59 k = 1 - sign - sign; in expf()
60 hi = x - k * ln2hi; /* k*ln2hi is exact here */ in expf()
61 lo = k * ln2lo; in expf()
64 k = 0; in expf()
77 if (k == 0) in expf()
79 return scalbnf(y, k); in expf()
A Dexp.c82 int k, sign; in exp() local
109 k = (int)(invln2 * x + half[sign]); in exp()
111 k = 1 - sign - sign; in exp()
112 hi = x - k * ln2hi; /* k*ln2hi is exact here */ in exp()
113 lo = k * ln2lo; in exp()
116 k = 0; in exp()
129 if (k == 0) in exp()
131 return scalbn(y, k); in exp()
A Dpow.c103 int32_t i, j, k, yisint, n; in pow() local
134 if (k > 20) { in pow()
135 j = ly >> (52 - k); in pow()
139 j = iy >> (20 - k); in pow()
242 k = 0; in pow()
244 k = 1; in pow()
246 k = 0; in pow()
254 v = 1.0 / (ax + bp[k]); in pow()
261 t_l = ax - (t_h - bp[k]); in pow()
310 k = (i >> 20) - 0x3ff; in pow()
[all …]
A Dlog1pf.c30 int k; in log1pf() local
33 k = 1; in log1pf()
47 k = 0; in log1pf()
53 if (k) { in log1pf()
57 k = (int)(iu >> 23) - 0x7f; in log1pf()
59 if (k < 25) { in log1pf()
60 c = k >= 2 ? 1 - (u.f - x) : x - (u.f - 1); in log1pf()
76 dk = k; in log1pf()
A Dlog1p.c75 int k; in log1p() local
78 k = 1; in log1p()
92 k = 0; in log1p()
98 if (k) { in log1p()
102 k = (int)(hu >> 20) - 0x3ff; in log1p()
104 if (k < 54) { in log1p()
105 c = k >= 2 ? 1 - (u.f - x) : x - (u.f - 1); in log1p()
121 dk = k; in log1p()
A Dpowf.c59 int32_t i, j, k, yisint, n; in powf() local
88 j = iy >> (23 - k); in powf()
89 if ((j << (23 - k)) == iy) in powf()
166 k = 0; in powf()
168 k = 1; in powf()
170 k = 0; in powf()
178 v = 1.0f / (ax + bp[k]); in powf()
186 t_l = ax - (t_h - bp[k]); in powf()
209 t1 = (((z_h + z_l) + dp_h[k]) + t); in powf()
238 k = (i >> 23) - 0x7f; in powf()
[all …]
/third_party/ulib/jemalloc/test/unit/
A Dph.c173 unsigned i, j, k; in TEST_BEGIN() local
198 for (k = 0; k < j; k++) { in TEST_BEGIN()
199 nodes[k].magic = NODE_MAGIC; in TEST_BEGIN()
200 nodes[k].key = bag[k]; in TEST_BEGIN()
204 for (k = 0; k < j; k++) { in TEST_BEGIN()
205 heap_insert(&heap, &nodes[k]); in TEST_BEGIN()
221 for (k = 0; k < j; k++) { in TEST_BEGIN()
224 node_remove(&heap, &nodes[k]); in TEST_BEGIN()
230 for (k = j; k > 0; k--) { in TEST_BEGIN()
238 for (k = 0; k < j; k++) { in TEST_BEGIN()
[all …]
A Drb.c260 for (k = 0; k < j; k++) { in TEST_BEGIN()
261 nodes[k].magic = NODE_MAGIC; in TEST_BEGIN()
262 nodes[k].key = bag[k]; in TEST_BEGIN()
266 for (k = 0; k < j; k++) { in TEST_BEGIN()
267 tree_insert(&tree, &nodes[k]); in TEST_BEGIN()
288 tree_next(&tree, &nodes[k]); in TEST_BEGIN()
289 tree_prev(&tree, &nodes[k]); in TEST_BEGIN()
295 for (k = 0; k < j; k++) in TEST_BEGIN()
296 node_remove(&tree, &nodes[k], j - k); in TEST_BEGIN()
299 for (k = j; k > 0; k--) in TEST_BEGIN()
[all …]
A Dckh.c54 } k, v; in TEST_BEGIN() local
58 kp = (i & 1) ? &k.p : NULL; in TEST_BEGIN()
60 k.p = NULL; in TEST_BEGIN()
80 } k, v; in TEST_BEGIN() local
84 kp = (i & 1) ? &k.p : NULL; in TEST_BEGIN()
86 k.p = NULL; in TEST_BEGIN()
163 size_t k; in TEST_BEGIN() local
167 for (k = 0; k < NITEMS; k++) { in TEST_BEGIN()
168 if (p[k] == q) { in TEST_BEGIN()
169 assert_false(seen[k], in TEST_BEGIN()
[all …]
/third_party/ulib/musl/src/stdio/
A Dfread.c8 size_t len = size * nmemb, l = len, k; in fread() local
18 k = MIN(f->rend - f->rpos, l); in fread()
19 memcpy(dest, f->rpos, k); in fread()
20 f->rpos += k; in fread()
21 dest += k; in fread()
22 l -= k; in fread()
26 for (; l; l -= k, dest += k) { in fread()
27 k = __toread(f) ? 0 : f->read(f, dest, l); in fread()
28 if (k + 1 <= 1) { in fread()
A D__string_read.c6 size_t k = len + 256; in __string_read() local
7 char* end = memchr(src, 0, k); in __string_read()
9 k = end - src; in __string_read()
10 if (k < len) in __string_read()
11 len = k; in __string_read()
14 f->rend = (void*)(src + k); in __string_read()
15 f->cookie = src + k; in __string_read()
A Dfgets.c9 size_t k; in fgets() local
25 k = z ? z - f->rpos + 1 : f->rend - f->rpos; in fgets()
26 k = MIN(k, n); in fgets()
27 memcpy(p, f->rpos, k); in fgets()
28 f->rpos += k; in fgets()
29 p += k; in fgets()
30 n -= k; in fgets()
A Dgetdelim.c11 size_t k; in getdelim() local
29 k = z ? z - f->rpos + 1 : f->rend - f->rpos; in getdelim()
30 if (i + k + 1 >= *n) { in getdelim()
31 if (k >= SIZE_MAX / 2 - i) in getdelim()
33 size_t m = i + k + 2; in getdelim()
38 m = i + k + 2; in getdelim()
46 memcpy(*s + i, f->rpos, k); in getdelim()
47 f->rpos += k; in getdelim()
48 i += k; in getdelim()
/third_party/ulib/jemalloc/msvc/projects/vc2015/test_threads/
A Dtest_threads.cpp59 for (int k = 0; k < sz; k++) in test_threads() local
60 ptrs[j][k] = tid + k; in test_threads()
63 for (int k = 0, sz = ptrsz[j]; k < sz; k++) in test_threads() local
64 if (ptrs[j][k] != (uint8_t)(tid + k)) { in test_threads()
65 …n thread %d, iter %d, alloc %d @ %d : %02X!=%02X\n", tid, i, j, k, ptrs[j][k], (uint8_t)(tid + k)); in test_threads()
/third_party/ulib/musl/src/internal/
A Dfloatscan.c84 k = 0; in decfloat()
107 x[k] = x[k] * 10 + c - '0'; in decfloat()
190 for (k = a; k != z; k++) { in decfloat()
192 x[k] = x[k] / p10 + carry; in decfloat()
194 if (k == a && !x[k]) { in decfloat()
208 for (k = ((z - 1) & MASK);; k = ((k - 1) & MASK)) { in decfloat()
217 if (k == ((z - 1) & MASK) && k != a && !x[k]) in decfloat()
239 if (k == z || x[k] < th[i]) { in decfloat()
252 for (k = a; k != z; k = ((k + 1) & MASK)) { in decfloat()
254 x[k] = (x[k] >> sh) + carry; in decfloat()
[all …]
/third_party/ulib/musl/src/time/
A Dwcsftime.c11 size_t l, k; in __wcsftime_l() local
41 t_mb = __strftime_fmt_1(&buf, &k, *f, tm, loc); in __wcsftime_l()
44 k = mbstowcs(wbuf, t_mb, sizeof wbuf / sizeof *wbuf); in __wcsftime_l()
45 if (k == (size_t)-1) in __wcsftime_l()
49 for (; *t == '+' || *t == '-' || (*t == '0' && t[1]); t++, k--) in __wcsftime_l()
58 for (; width > k && l < n; width--) in __wcsftime_l()
61 if (k >= n - l) in __wcsftime_l()
62 k = n - l; in __wcsftime_l()
63 wmemcpy(s + l, t, k); in __wcsftime_l()
64 l += k; in __wcsftime_l()
/third_party/ulib/musl/src/ctype/
A Dwcswidth.c4 int l = 0, k = 0; in wcswidth() local
5 for (; n-- && *wcs && (k = wcwidth(*wcs)) >= 0; l += k, wcs++) in wcswidth()
7 return (k < 0) ? k : l; in wcswidth()
/third_party/lib/acpica/source/components/utilities/
A Dutownerid.c73 UINT32 k; in AcpiUtAllocateOwnerId() local
111 for (k = AcpiGbl_NextOwnerIdOffset; k < 32; k++) in AcpiUtAllocateOwnerId()
120 if (!(AcpiGbl_OwnerIdMask[j] & (1 << k))) in AcpiUtAllocateOwnerId()
127 AcpiGbl_OwnerIdMask[j] |= (1 << k); in AcpiUtAllocateOwnerId()
130 AcpiGbl_NextOwnerIdOffset = (UINT8) (k + 1); in AcpiUtAllocateOwnerId()
138 *OwnerId = (ACPI_OWNER_ID) ((k + 1) + ACPI_MUL_32 (j)); in AcpiUtAllocateOwnerId()
/third_party/ulib/musl/pthread/
A Dpthread_key.c7 int pthread_key_create(pthread_key_t* k, void (*dtor)(void*)) { in pthread_key_create() argument
8 return tss_create(k, dtor) == thrd_success ? 0 : EAGAIN; in pthread_key_create()
11 int pthread_key_delete(pthread_key_t k) { in pthread_key_delete() argument
12 tss_delete(k); in pthread_key_delete()

Completed in 32 milliseconds

1234