| /stdlib/ |
| A D | mul_n.c | 66 MPN_ZERO (prodp, size); in impn_mul_n_basecase()
72 prodp[size] = cy_limb; in impn_mul_n_basecase()
98 if ((size & 1) != 0) in impn_mul_n()
176 cy = mpn_add_n (prodp + size, prodp + size, prodp + size + hsize, hsize); in impn_mul_n()
195 mpn_add_1 (prodp + hsize + size, prodp + hsize + size, hsize, cy); in impn_mul_n()
200 mpn_add_1 (prodp + size, prodp + size, size, 1); in impn_mul_n()
219 MPN_ZERO (prodp, size); in impn_sqr_n_basecase()
251 if ((size & 1) != 0) in impn_sqr_n()
302 cy = mpn_add_n (prodp + size, prodp + size, prodp + size + hsize, hsize); in impn_sqr_n()
318 mpn_add_1 (prodp + hsize + size, prodp + hsize + size, hsize, cy); in impn_sqr_n()
[all …]
|
| A D | qsort.c | 119 char *mid = lo + size * ((hi - lo) / size >> 1); in _quicksort()
131 left_ptr = lo + size; in _quicksort()
140 left_ptr += size; in _quicksort()
143 right_ptr -= size; in _quicksort()
152 left_ptr += size; in _quicksort()
153 right_ptr -= size; in _quicksort()
157 left_ptr += size; in _quicksort()
158 right_ptr -= size; in _quicksort()
214 for (run_ptr = tmp_ptr + size; run_ptr <= thresh; run_ptr += size) in _quicksort()
228 tmp_ptr -= size; in _quicksort()
[all …]
|
| A D | tst-qsort2.c | 29 test (size_t nmemb, size_t size) in test() argument
31 array = malloc (nmemb * size); in test()
34 printf ("%zd x %zd: no memory", nmemb, size); in test()
38 array_end = array + nmemb * size; in test()
39 member_size = size; in test()
44 for (i = 0, p = array; i < nmemb; i++, p += size) in test()
47 if (size > 1) in test()
51 qsort (array, nmemb, size, compare); in test()
55 if (p[0] < p[size] in test()
56 || (size > 1 && p[0] == p[size] && p[1] < p[size + 1])) in test()
[all …]
|
| A D | alloca.h | 35 # define alloca(size) __builtin_alloca (size) argument
|
| A D | cmp.c | 30 mpn_cmp (mp_srcptr op1_ptr, mp_srcptr op2_ptr, mp_size_t size) in mpn_cmp() argument
35 for (i = size - 1; i >= 0; i--) in mpn_cmp()
|
| A D | gmp-impl.h | 166 #define MPN_MUL_N_RECURSE(prodp, up, vp, size, tspace) \ argument
168 if ((size) < KARATSUBA_THRESHOLD) \
169 impn_mul_n_basecase (prodp, up, vp, size); \
171 impn_mul_n (prodp, up, vp, size, tspace); \
173 #define MPN_SQR_N_RECURSE(prodp, up, size, tspace) \ argument
175 if ((size) < KARATSUBA_THRESHOLD) \
176 impn_sqr_n_basecase (prodp, up, size); \
178 impn_sqr_n (prodp, up, size, tspace); \
311 mp_srcptr vp, mp_size_t size))
314 mp_size_t size, mp_ptr tspace))
[all …]
|
| A D | tst-makecontext.c | 36 int cnt, size; member
43 if (++arg->cnt == arg->size) in backtrace_helper()
51 struct trace_arg arg = { .size = 100, .cnt = -1 }; in cf()
|
| A D | setenv.c | 120 size_t size; in __add_to_environ() local
139 size = 0; in __add_to_environ()
146 ++size; in __add_to_environ()
155 (size + 2) * sizeof (char *)); in __add_to_environ()
164 size * sizeof (char *)); in __add_to_environ()
166 new_environ[size] = NULL; in __add_to_environ()
167 new_environ[size + 1] = NULL; in __add_to_environ()
168 ep = new_environ + size; in __add_to_environ()
|
| A D | strfrom-skeleton.c | 37 STRFROM (char *dest, size_t size, const char *format, FLOAT f) in STRFROM() argument
111 if (size == 0) in STRFROM()
118 size = sizeof (sfile.overflow_buf); in STRFROM()
124 _IO_str_init_static_internal (&sfile.f, dest, size - 1, dest); in STRFROM()
|
| A D | sub_n.c | 25 mpn_sub_n (mp_ptr res_ptr, mp_srcptr s1_ptr, mp_srcptr s2_ptr, mp_size_t size) in mpn_sub_n() argument
32 j = -size; in mpn_sub_n()
|
| A D | add_n.c | 25 mpn_add_n (mp_ptr res_ptr, mp_srcptr s1_ptr, mp_srcptr s2_ptr, mp_size_t size) in mpn_add_n() argument
32 j = -size; in mpn_add_n()
|
| A D | tst-strfrom.h | 54 int size; member
58 #define TEST(s, fmt, size, rc, val) \ argument
60 s, fmt, size, rc, { GEN_TEST_STRTOD_FOREACH (ENTRY, val) } \
83 rc = FTOSTR (sbuf, stest[i].size, stest[i].fmt, stest[i].t.FSUF); \
94 rc = FTOSTR (buf, tests[i].size, tests[i].fmt, tests[i].t.FSUF); \
|
| A D | dbl2mpn.c | 26 __mpn_extract_double (mp_ptr res_ptr, mp_size_t size, in __mpn_extract_double() argument
|
| A D | msort.c | 166 size_t size = n * s; in __qsort_r() local
172 size = 2 * n * sizeof (void *) + s; in __qsort_r()
174 if (size < 1024) in __qsort_r()
176 p.t = __alloca (size); in __qsort_r()
213 if (size / pagesize > (size_t) phys_pages) in __qsort_r()
221 tmp = malloc (size); in __qsort_r()
|
| A D | tst-strtod-overflow.c | 33 if (repeat.size == 0) in do_test()
|
| A D | strtod_l.c | 180 #define MPN_VAR(name) mp_limb_t name[MPNSIZE]; mp_size_t name##size
183 memcpy (dst, src, (dst##size = src##size) * sizeof (mp_limb_t))
468 #define __mpn_lshift_1(ptr, size, count, limb) \ argument
475 for (i = (size) - 1; i > 0; --i) \
483 (void) __mpn_lshift (__ptr, __ptr, size, __count); \
1216 size_t size = ttab->arraysize - _FPIO_CONST_OFFSET; in ____STRTOF_INTERNAL() local
1228 size); in ____STRTOF_INTERNAL()
1232 size, psrc, numsize); in ____STRTOF_INTERNAL()
1233 numsize += size; in ____STRTOF_INTERNAL()
|
| A D | longlong.h | 1558 UHItype size; \
1561 for ((count) = 0, size = W_TYPE_SIZE; size; size -= 16) \
1565 c = __clzhi2 ((x) >> (size - 16)); \
|