| /picolibc-latest/newlib/testsuite/newlib.locale/ |
| D | UTF-8.c | 140 int i; in main() local
158 for (i = 2; i < 7; i++) in main()
160 retval = mbtowc (&wchar, first[i-1], MAX_BYTES); in main()
161 if (retval == i) in main()
162 printf("2.1.%d: U-%08lx\n", i, (long) wchar); in main()
164 printf("2.1.%d: Invalid\n", i); in main()
168 for (i = 1; i < 7; i++) in main()
170 retval = mbtowc (&wchar, last[i-1], MAX_BYTES); in main()
171 if (retval == i) in main()
172 printf("2.2.%d: U-%08lx\n", i, (long) wchar); in main()
[all …]
|
| /picolibc-latest/newlib/libm/ld/common/ |
| D | k_rem_pio2.c | 296 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; in __kernel_rem_pio2() local
310 for(i=0;i<=m;i++,j++) f[i] = (j<0)? zero : (double) ipio2[j]; in __kernel_rem_pio2()
313 for (i=0;i<=jk;i++) { in __kernel_rem_pio2()
314 for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; in __kernel_rem_pio2()
315 q[i] = fw; in __kernel_rem_pio2()
321 for(i=0,j=jz,z=q[jz];j>0;i++,j--) { in __kernel_rem_pio2()
323 iq[i] = (int32_t)(z-two24*fw); in __kernel_rem_pio2()
334 i = (iq[jz-1]>>(24-q0)); n += i; in __kernel_rem_pio2()
335 iq[jz-1] -= i<<(24-q0); in __kernel_rem_pio2()
343 for(i=0;i<jz ;i++) { /* compute 1-q */ in __kernel_rem_pio2()
[all …]
|
| /picolibc-latest/newlib/libm/math/ |
| D | kf_rem_pio2.c | 53 __int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; in __kernel_rem_pio2f() local
70 for (i = 0; i <= m; i++, j++) in __kernel_rem_pio2f()
71 f[i] = (j < 0) ? zero : (float)ipio2[j]; in __kernel_rem_pio2f()
74 for (i = 0; i <= jk; i++) { in __kernel_rem_pio2f()
76 fw += x[j] * f[jx + i - j]; in __kernel_rem_pio2f()
77 q[i] = fw; in __kernel_rem_pio2f()
83 for (i = 0, j = jz, z = q[jz]; j > 0; i++, j--) { in __kernel_rem_pio2f()
85 iq[i] = (__int32_t)(z - two8 * fw); in __kernel_rem_pio2f()
96 i = (iq[jz - 1] >> (8 - q0)); in __kernel_rem_pio2f()
97 n += i; in __kernel_rem_pio2f()
[all …]
|
| D | k_rem_pio2.c | 163 __int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; in __kernel_rem_pio2() local
180 for (i = 0; i <= m; i++, j++) in __kernel_rem_pio2()
181 f[i] = (j < 0) ? zero : (__float64)ipio2[j]; in __kernel_rem_pio2()
184 for (i = 0; i <= jk; i++) { in __kernel_rem_pio2()
186 fw += x[j] * f[jx + i - j]; in __kernel_rem_pio2()
187 q[i] = fw; in __kernel_rem_pio2()
193 for (i = 0, j = jz, z = q[jz]; j > 0; i++, j--) { in __kernel_rem_pio2()
195 iq[i] = (__int32_t)(z - two24 * fw); in __kernel_rem_pio2()
206 i = (iq[jz - 1] >> (24 - q0)); in __kernel_rem_pio2()
207 n += i; in __kernel_rem_pio2()
[all …]
|
| D | sf_jn.c | 26 __int32_t i, hx, ix, sgn; in jnf() local
55 for (i = 1; i < n; i++) { in jnf()
57 b = b * ((float)(i + i) / x) - a; /* avoid underflow */ in jnf()
70 for (a = one, i = 2; i <= n; i++) { in jnf()
71 a *= (float)i; /* a = n! */ in jnf()
123 for (t = zero, i = 2 * (n + k); i >= m; i -= 2) in jnf()
124 t = one / (i / x - t); in jnf()
139 for (i = n - 1, di = (float)(i + i); i > 0; i--) { in jnf()
147 for (i = n - 1, di = (float)(i + i); i > 0; i--) { in jnf()
173 __int32_t i, hx, ix, ib; in ynf() local
[all …]
|
| /picolibc-latest/test/ |
| D | malloc_stress.c | 62 int i; in shuffle_order() local
63 for (i = 0; i < NUM_MALLOC; i++) in shuffle_order()
64 order[i] = i; in shuffle_order()
65 for (i = 0; i < NUM_MALLOC - 1; i++) { in shuffle_order()
66 int j = randint(NUM_MALLOC - 1 - i) + i + 1; in shuffle_order()
68 int t = order[i]; in shuffle_order()
69 order[i] = order[j]; in shuffle_order()
75 fill_block(int i) in fill_block() argument
77 block_data[i] = randint(256); in fill_block()
78 if (blocks[i]) in fill_block()
[all …]
|
| D | timegm.c | 54 unsigned i; in main() local
58 for (i = 0; i < NUM_TEST; i++) { in main()
59 tests[i].time = random(); in main()
60 gmtime_r(&tests[i].time, &tests[i].tm); in main()
62 printf (" .time = %ld,\n", tests[i].time); in main()
64 printf (" .tm_sec = %d,\n", tests[i].tm.tm_sec); /* Seconds (0-60) */ in main()
65 printf (" .tm_min = %d,\n", tests[i].tm.tm_min); /* Minutes (0-59) */ in main()
66 printf (" .tm_hour = %d,\n", tests[i].tm.tm_hour); /* Hours (0-23) */ in main()
67 … printf (" .tm_mday = %d,\n", tests[i].tm.tm_mday); /* Day of the month (1-31) */ in main()
68 printf (" .tm_mon = %d,\n", tests[i].tm.tm_mon); /* Month (0-11) */ in main()
[all …]
|
| D | test-strtod.c | 133 int i; in main() local
144 for (i = 0; i < (int) NTESTS; i++) { in main()
145 d = strtod(tests[i].string, &end); in main()
146 if (d != tests[i].dvalue) { in main()
147 printf("strtod(\"%s\"): got %.17e %a want %.17e %a\n", tests[i].string, in main()
148 d, d, tests[i].dvalue, tests[i].dvalue); in main()
151 if (strcmp(end, tests[i].end_test) != 0) { in main()
153 tests[i].string, end, tests[i].end_test); in main()
156 f = strtof(tests[i].string, &end); in main()
157 if (f != tests[i].fvalue) { in main()
[all …]
|
| /picolibc-latest/test/libc-testsuite/ |
| D | qsort.c | 52 int i; in tcmp() local
54 for (i = 0; i < 3; i++) { in tcmp()
55 c = (int) a->b[i] - (int) b->b[i]; in tcmp()
92 int i; in test_qsort() local
96 for (i=0; i<(int) (sizeof(s)/sizeof(char *)-1); i++) { in test_qsort()
97 if (strcmp(s[i], s[i+1]) > 0) { in test_qsort()
99 for (i=0; i<(int)(sizeof(s)/sizeof(char *)); i++) in test_qsort()
100 printf("\t%s\n", s[i]); in test_qsort()
106 for (i=0; i<(int)(sizeof(n)/sizeof(n[0])-1); i++) { in test_qsort()
107 if (n[i] > n[i+1]) { in test_qsort()
[all …]
|
| D | sscanf.c | 44 TEST(i, sscanf(# x, "%lf", &d), 1, "got %d fields, expected %d"), \
48 TEST(i, sscanf(v, "%lf", &d), 1, "got %d fields, expected %d"), \
72 int i; in test_sscanf() local
95 TEST(i, sscanf("hello, world\n", "%s %s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
102 TEST(i, sscanf("hello, world\n", "%6c %5c%c", a, b, c), 3, "only %d fields, expected %d"); in test_sscanf()
107 TEST(i, sscanf("hello, world\n", "%[hel]%s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
111 TEST(i, sscanf("hello, world\n", "%[hel] %s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
115 TEST(i, sscanf("elloworld", "%1[abcdefg]%s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
119 TEST(i, sscanf("elloworld", "%5[a-z]%s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
126 TEST(i, sscanf("㌰ello, ✕orld\n", "%s %s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
[all …]
|
| D | strtol.c | 49 int i; in test_strtol() local
68 TEST2(i, c-s, 10, "wrong final position %d != %d"); in test_strtol()
69 TEST2(i, errno, ERANGE, "missing errno %d != %d"); in test_strtol()
72 TEST2(i, c-s, 11, "wrong final position %d != %d"); in test_strtol()
73 TEST2(i, errno, ERANGE, "missing errno %d != %d"); in test_strtol()
76 TEST2(i, c-s, 10, "wrong final position %d != %d"); in test_strtol()
77 TEST2(i, errno, ERANGE, "missing errno %d != %d"); in test_strtol()
80 TEST2(i, c-s, 2, "wrong final position %d != %d"); in test_strtol()
81 TEST2(i, errno, 0, "spurious errno %d != %d"); in test_strtol()
84 TEST2(i, c-s, 2, "wrong final position %d != %d"); in test_strtol()
[all …]
|
| D | snprintf.c | 50 int i; member
169 int i, j, k; in test_snprintf() local
173 TEST(i, snprintf(0, 0, "%ld", 123456l), 6, "length returned %d != %d"); in test_snprintf()
174 TEST(i, snprintf(0, 0, "%.4s", "hello"), 4, "length returned %d != %d"); in test_snprintf()
175 TEST(i, snprintf(b, 0, "%.0s", "goodbye"), 0, "length returned %d != %d"); in test_snprintf()
178 TEST(i, snprintf(b, 4, "%ld", 123456l), 6, "length returned %d != %d"); in test_snprintf()
180 TEST(i, b[5], 'x', "buffer overrun"); in test_snprintf()
185 TEST(i, snprintf(b, sizeof b, "%.1022f", 0x1p-1021), 1024, "%d != %d"); in test_snprintf()
187 for (i=0; i<1021; i++) { in test_snprintf()
193 TEST(i, b[1], '1', "'%c' != '%c'"); in test_snprintf()
[all …]
|
| /picolibc-latest/newlib/libc/locale/ |
| D | newlocale.c | 135 int i; in newlocale() local
140 for (i = 1; i < _LC_LAST; ++i) in newlocale()
142 if (((1 << i) & category_mask) != 0) in newlocale()
146 const char *cat = (locale[0] == '\0') ? __get_locale_env (i) in newlocale()
153 strcpy (new_categories[i], cat); in newlocale()
156 strcpy (new_categories[i], base ? base->categories[i] : "C"); in newlocale()
159 for (i = 1; i < _LC_LAST; ++i) in newlocale()
163 if (base && (((1 << i) & category_mask) == 0 in newlocale()
164 || !strcmp (base->categories[i], new_categories[i]))) in newlocale()
166 strcpy (tmp_locale.categories[i], new_categories[i]); in newlocale()
[all …]
|
| D | duplocale.c | 78 int i; in duplocale() local
81 (void) i; in duplocale()
96 for (i = 1; i < _LC_LAST; ++i) in duplocale()
97 if (locobj->lc_cat[i].buf) in duplocale()
101 tmp_locale.lc_cat[i].ptr = NULL; in duplocale()
102 tmp_locale.lc_cat[i].buf = NULL; in duplocale()
103 tmp_locale.categories[i][0] = '\0'; /* __loadlocale tests this! */ in duplocale()
104 if (!__loadlocale (&tmp_locale, i, locobj->categories[i])) in duplocale()
120 while (--i > 0) in duplocale()
121 if (tmp_locale.lc_cat[i].buf) in duplocale()
[all …]
|
| /picolibc-latest/newlib/libc/string/ |
| D | str-two-way.h | 201 size_t i; /* Index into current byte of NEEDLE. */ in two_way_short_needle() local
223 i = MAX (suffix, memory); in two_way_short_needle()
224 while (i < needle_len && (CANON_ELEMENT (needle[i]) in two_way_short_needle()
225 == CANON_ELEMENT (haystack[i + j]))) in two_way_short_needle()
226 ++i; in two_way_short_needle()
227 if (needle_len <= i) in two_way_short_needle()
230 i = suffix - 1; in two_way_short_needle()
231 while (memory < i + 1 && (CANON_ELEMENT (needle[i]) in two_way_short_needle()
232 == CANON_ELEMENT (haystack[i + j]))) in two_way_short_needle()
233 --i; in two_way_short_needle()
[all …]
|
| D | uniset | 260 for $i (keys(%category)) {
261 $used{$i} = "[${cat}]" if $category{$i} eq $cat;
266 for $i (keys(%category)) {
267 delete $used{$i} if $category{$i} eq $cat;
272 for $i (keys(%category)) {
273 delete $used{$i} unless $category{$i} eq $cat;
284 $i = ord($_);
285 $used{$i} .= "[${setname}]" unless $remove;
286 delete $used{$i} if $remove;
299 for ($i = $first; $i <= $last; $i++) {
[all …]
|
| D | strverscmp.c | 67 size_t i, dp, j; in strverscmp() local
72 for (dp=i=0; l[i]==r[i]; i++) { in strverscmp()
73 int c = l[i]; in strverscmp()
75 if (!isdigit(c)) dp=i+1, z=1; in strverscmp()
82 for (j=i; isdigit(l[j]); j++) in strverscmp()
85 } else if (z && dp<i && (isdigit(l[i]) || isdigit(r[i]))) { in strverscmp()
88 return (unsigned char)(l[i]-'0') - (unsigned char)(r[i]-'0'); in strverscmp()
91 return l[i] - r[i]; in strverscmp()
|
| /picolibc-latest/newlib/testsuite/newlib.string/ |
| D | memmove1.c | 96 size_t i; in fill() local
97 for (i = 0; i < MAX*3; i++) in fill()
98 dest[i] = (10 + i) % MAX; in fill()
104 size_t i; in main() local
116 for (i = 0; i < MAX; i++) in main()
122 xmemmove (to_test + MAX, 1 + from_test + MAX, i); in main()
126 mymemmove (to_known + MAX, 1 + from_known + MAX, i); in main()
131 DEBUGP ("memmove failed non-overlap test for %lu bytes\n", (unsigned long) i); in main()
136 for (i = 0; i < MAX; i++) in main()
139 for (j = 0; j < i; j++) in main()
[all …]
|
| D | tstring.c | 41 int i; in mycopy() local
43 for (i = 0; i < size; ++i) in mycopy()
45 target[i] = source[i]; in mycopy()
51 int i; in myset() local
53 for (i = 0; i < size; ++i) in myset()
55 target[i] = ch; in myset()
78 unsigned i, j, k, x, z = 0, align_test_iterations; in main() local
251 for (i = j-1; i <= j+1; ++i) in main()
255 if (i <= 16 * sizeof(long)) in main()
258 if (i <= 2 * sizeof(long) + 1) in main()
[all …]
|
| /picolibc-latest/newlib/libc/iconv/ces/ |
| D | euc.c | 102 int i; in euc_from_ucs_init() local
142 for (i = 0; i < MAX_CS_NUM && data->desc[i].csname != NULL; i++) in euc_from_ucs_init()
144 data->data[i] = _iconv_from_ucs_ces_handlers_table.init ( in euc_from_ucs_init()
145 data->desc[i].csname); in euc_from_ucs_init()
146 if (data->data[i] == NULL) in euc_from_ucs_init()
164 int i; in euc_from_ucs_close() local
167 for (i = 0; i < MAX_CS_NUM; i++) in euc_from_ucs_close()
169 if (((euc_data_t *)data)->data[i] != NULL) in euc_from_ucs_close()
171 ((euc_data_t *)data)->data[i]); in euc_from_ucs_close()
184 int i; in euc_convert_from_ucs() local
[all …]
|
| /picolibc-latest/newlib/libm/test/ |
| D | math2.c | 75 int i; in test_frexp() local
89 for (i = 0; i < 1000; i++) in test_frexp()
93 line(i); in test_frexp()
136 r = frexp(64.0, &i); in test_frexp()
139 test_iok(i, 7); in test_frexp()
141 r = frexp(96.0, &i); in test_frexp()
144 test_iok(i, 7); in test_frexp()
163 int i; in test_mod() local
168 for (i = 0; i < 1000; i++) in test_mod()
172 line(i); in test_mod()
[all …]
|
| /picolibc-latest/newlib/libc/picolib/machine/m68k/ |
| D | interrupt.c | 76 #define i(id,name) [id] = m68k_ ## name ## _isr macro
82 i(2, access_fault),
83 i(3, address_error),
85 i(4, illegal_instruction),
86 i(5, divide_by_zero),
87 i(6, chk),
88 i(7, trap),
90 i(48, fp_branch_uc),
91 i(49, fp_inexact),
92 i(50, fp_divide_by_zero),
[all …]
|
| /picolibc-latest/newlib/libc/stdlib/ |
| D | ldtoa.c | 384 double i; member
472 register int i; in eclear() local
474 for (i = 0; i < NE; i++) in eclear()
488 register int i; in emov() local
490 for (i = 0; i < NE; i++) in emov()
559 int i; in eisnan() local
564 for (i = 0; i < NE - 1; i++) in eisnan()
585 register int i; in einfin() local
588 for (i = 0; i < NE - 1; i++) in einfin()
593 for (i = 0; i < NE - 1; i++) in einfin()
[all …]
|
| D | gdtoa-hexnan.c | 66 int i) in L_shift() argument
70 i = 8 - i; in L_shift()
71 i <<= 2; in L_shift()
72 j = ULbits - i; in L_shift()
75 x[1] >>= i; in L_shift()
86 int havedig, hd0, i, nbits; in hexnan() local
94 havedig = hd0 = i = 0; in hexnan()
100 if (x < x1 && i < 8) in hexnan()
101 L_shift(x, x1, i); in hexnan()
103 i = 8; in hexnan()
[all …]
|
| /picolibc-latest/newlib/libc/machine/spu/ |
| D | stdio.c | 46 int i; in __sfp() local
47 for (i = 0; i < SPE_FOPEN_MAX; i++) { in __sfp()
48 if (!__fp[i]._fp) { in __sfp()
49 return &__fp[i]; in __sfp()
59 int i; in __cleanup() local
60 for (i = 0; i < SPE_FOPEN_MAX; i++) { in __cleanup()
61 if (__fp[i]._fp) { in __cleanup()
62 fclose(&__fp[i]); in __cleanup()
|
