Home
last modified time | relevance | path

Searched +full:- +full:i (Results 1 – 25 of 469) sorted by relevance

12345678910>>...19

/picolibc-3.5.0-3.4.0/newlib/libm/math/
Dkf_rem_pio2.c1 /* kf_rem_pio2.c -- float version of k_rem_pio2.c
25 4.5776367188e-04, /* 0x39f00000 */
26 2.5987625122e-05, /* 0x37da0000 */
27 7.5437128544e-08, /* 0x33a20000 */
28 6.0026650317e-11, /* 0x2e840000 */
29 7.3896444519e-13, /* 0x2b500000 */
30 5.3845816694e-15, /* 0x27c20000 */
31 5.6378512969e-18, /* 0x22d00000 */
32 8.3009228831e-20, /* 0x1fc40000 */
33 3.2756352257e-22, /* 0x1bc60000 */
[all …]
Dk_rem_pio2.c19 * y = x - N*pi/2
28 * (2/pi) is represented by an array of 24-bit integers in ipio2[].
32 * pieces of 24-bit integers in double precision format.
33 * x[i] will be the i-th 24 bit of x. The scaled exponent
34 * of x[0] is given in input parameter e0 (i.e., x[0]*2^e0
38 * e0 = ilogb(z)-23
39 * z = scalbn(z,-e0)
40 * for i = 0,1,2
41 * x[i] = floor(z)
42 * z = (z-x[i])*2**24
[all …]
Dsf_jn.c1 /* ef_jn.c -- float version of e_jn.c.
26 __int32_t i, hx, ix, sgn; in jnf() local
30 /* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x) in jnf()
31 * Thus, J(-n,x) = J(n,-x) in jnf()
39 n = -n; in jnf()
40 x = -x; in jnf()
47 sgn = (n & 1) & (hx >> 31); /* even n -- 0, odd n -- sign(x) */ in jnf()
52 /* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */ in jnf()
55 for (i = 1; i < n; i++) { in jnf()
57 b = b * ((float)(i + i) / x) - a; /* avoid underflow */ in jnf()
[all …]
/picolibc-3.5.0-3.4.0/newlib/testsuite/newlib.locale/
DUTF-8.c7 * Tests gleaned from Markus Kuhn's UTF-8 and Unicode FAQ,
8 * and specifically, his UTF-8-test.txt decoder stress test file.
20 {0x0}, /* U-00000000 */
21 {0xc2, 0x80}, /* U-00000080 */
22 {0xe0, 0xa0, 0x80}, /* U-00000800 */
23 {0xf0, 0x90, 0x80, 0x80}, /* U-00010000 */
24 {0xf8, 0x88, 0x80, 0x80, 0x80}, /* U-00200000 */
25 {0xfc, 0x84, 0x80, 0x80, 0x80, 0x80} /* U-04000000 */
29 {0x7f}, /* U-0000007F */
30 {0xdf, 0xbf}, /* U-000007FF */
[all …]
/picolibc-3.5.0-3.4.0/test/
Dmalloc_stress.c2 * SPDX-License-Identifier: BSD-3-Clause
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()
[all …]
Dtimegm.c2 * SPDX-License-Identifier: BSD-3-Clause
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()
[all …]
Dlong_double_gen.5c56 for (int i = 0; i < dim(limited_funcs); i++)
57 if (limited_funcs[i] == name)
72 for (int i = 0; i < String::length(s); i++) {
73 int c = s[i];
75 c = c - 'a' + 'A';
101 for (x = -10; x <= 10; x += .1) {
107 sy = sprintf("%.-eL", y);
116 sy = "-" + sy;
120 printf(" { .line = __LINE__, .x = %.-eL, .y = %s },\n", x, sy);
121 } catch invalid_argument(string s, int i, poly x) {
[all …]
/picolibc-3.5.0-3.4.0/newlib/libc/iconv/ces/
Deuc.c2 * Copyright (c) 2003-2004, Artem B. Bityuckiy
106 int i; in euc_from_ucs_init() local
116 data->type = TYPE_EUC_JP; in euc_from_ucs_init()
117 data->mb_cur_max = 3; in euc_from_ucs_init()
118 data->desc = &euc_jp_cs_desc[0]; in euc_from_ucs_init()
126 data->type = TYPE_EUC_KR; in euc_from_ucs_init()
127 data->mb_cur_max = 2; in euc_from_ucs_init()
128 data->desc = &euc_kr_cs_desc[0]; in euc_from_ucs_init()
136 data->type = TYPE_EUC_TW; in euc_from_ucs_init()
137 data->mb_cur_max = 4; in euc_from_ucs_init()
[all …]
/picolibc-3.5.0-3.4.0/test/libc-testsuite/
Dsscanf.c2 * Copyright © 2005-2020 Rich Felker
37 TEST(i, sscanf(# x, "%lf", &d), 1, "got %d fields, expected %d"), \
40 #pragma GCC diagnostic ignored "-Wpragmas"
41 #pragma GCC diagnostic ignored "-Wunknown-warning-option"
42 #pragma GCC diagnostic ignored "-Wunused-value"
43 #pragma GCC diagnostic ignored "-Woverflow"
44 #pragma GCC diagnostic ignored "-Wliteral-range"
45 #pragma GCC diagnostic ignored "-Wformat-extra-args"
49 int i; in test_sscanf() local
59 TEST(i, sscanf("hello, world\n", "%s %s", a, b), 2, "only %d fields, expected %d"); in test_sscanf()
[all …]
Dqsort.c2 * Copyright © 2005-2020 Rich Felker
35 return *(int*)a - *(int*)b; in icmp()
50 int i; in tcmp() local
52 for (i = 0; i < 3; i++) { in tcmp()
53 c = (int) a->b[i] - (int) b->b[i]; in tcmp()
67 int i; in test_qsort() local
69 /* 26 items -- even */ in test_qsort()
79 /* 23 items -- odd, prime */ in test_qsort()
93 for (i=0; i<(int) (sizeof(s)/sizeof(char *)-1); i++) { in test_qsort()
94 if (strcmp(s[i], s[i+1]) > 0) { in test_qsort()
[all …]
Dstrtol.c2 * Copyright © 2005-2020 Rich Felker
34 #pragma GCC diagnostic ignored "-Wpragmas"
35 #pragma GCC diagnostic ignored "-Wunknown-warning-option"
36 #pragma GCC diagnostic ignored "-Wformat-extra-args"
37 #pragma GCC diagnostic ignored "-Wformat"
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()
71 TEST(l, strtol(s="-2147483649", &c, 0), -2147483647L-1, "uncaught overflow %ld != %ld"); in test_strtol()
72 TEST2(i, c-s, 11, "wrong final position %d != %d"); in test_strtol()
[all …]
/picolibc-3.5.0-3.4.0/newlib/testsuite/newlib.string/
Dmemmove1.c1 /* A minor test-program for memmove.
29 /* Test moves of 0..MAX bytes; overlapping-src-higher,
30 overlapping-src-lower and non-overlapping. The overlap varies with
34 making this 256 added 90s to the test-run (2GHz P4) while 64 (4s) was
51 /* A safe target-independent memmove. */
58 while (n-- > 0) in mymemmove()
64 while (n-- > 0) in mymemmove()
65 *--dest = *--src; in mymemmove()
70 pass -fno-builtin-memmove. */
96 size_t i; in fill() local
[all …]
Dtstring.c21 #pragma GCC diagnostic ignored "-Wmemset-transposed-args"
23 #pragma GCC diagnostic ignored "-Wstringop-truncation"
25 #pragma GCC diagnostic ignored "-Wunused-value"
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()
75 unsigned i, j, k, x, z = 0, align_test_iterations; in main() local
[all …]
/picolibc-3.5.0-3.4.0/newlib/libc/string/
Dstr-two-way.h1 /* Byte-wise substring search, using the Two-Way algorithm.
14 lvalue. For NUL-terminated searches,
19 For case-insensitivity, you may optionally define:
36 /* We use the Two-Way string matching algorithm, which guarantees
39 Boyer-Moore algorithm to achieve improved (potentially sub-linear)
42 See http://www-igm.univ-mlv.fr/~lecroq/string/node26.html#SECTION00260
43 and http://en.wikipedia.org/wiki/Boyer-Moore_string_search_algorithm
46 /* Point at which computing a bad-byte shift table is likely to be
51 hand, on non-POSIX systems with CHAR_BIT larger than eight, the
79 non-empty NEEDLE have a local period of at least 1 and no greater
[all …]
Dtimingsafe_memcmp.c25 size_t i; in timingsafe_memcmp() local
28 for (i = 0; i < len; i++) { in timingsafe_memcmp()
29 /* lt is -1 if p1[i] < p2[i]; else 0. */ in timingsafe_memcmp()
30 int lt = (p1[i] - p2[i]) >> CHAR_BIT; in timingsafe_memcmp()
32 /* gt is -1 if p1[i] > p2[i]; else 0. */ in timingsafe_memcmp()
33 int gt = (p2[i] - p1[i]) >> CHAR_BIT; in timingsafe_memcmp()
35 /* cmp is 1 if p1[i] > p2[i]; -1 if p1[i] < p2[i]; else 0. */ in timingsafe_memcmp()
36 int cmp = lt - gt; in timingsafe_memcmp()
41 /* set done if p1[i] != p2[i]. */ in timingsafe_memcmp()
/picolibc-3.5.0-3.4.0/newlib/libc/sys/rtems/include/
DREADME29 git format-patch 3bf66365129a13933f77d1f4421d5136861cffb4 -- \
39 sed -i 's,include/arpa/inet.h,newlib/libc/sys/rtems/include/arpa/inet.h,g' *.patch
40 sed -i 's,include/netdb.h,newlib/libc/sys/rtems/include/netdb.h,g' *.patch
41 sed -i 's,include/termios.h,newlib/libc/sys/rtems/include/termios.h,g' *.patch
42 sed -i 's,sys/net/if.h,newlib/libc/sys/rtems/include/net/if.h,g' *.patch
43 sed -i 's,sys/netinet6/in6.h,newlib/libc/sys/rtems/include/netinet6/in6.h,g' *.patch
44 sed -i 's,sys/netinet/in.h,newlib/libc/sys/rtems/include/netinet/in.h,g' *.patch
45 sed -i 's,sys/netinet/tcp.h,newlib/libc/sys/rtems/include/netinet/tcp.h,g' *.patch
46 sed -i 's,sys/sys/filio.h,newlib/libc/sys/rtems/include/sys/filio.h,g' *.patch
47 sed -i 's,sys/sys/ioccom.h,newlib/libc/sys/rtems/include/sys/ioccom.h,g' *.patch
[all …]
/picolibc-3.5.0-3.4.0/newlib/libc/locale/
Dnewlocale.c2 Copyright (c) 1996 - 2002 FreeBSD Project
32 <<newlocale>>---create or modify a locale object
57 bitwise-inclusive OR of the symbolic constants LC_CTYPE_MASK,
59 LC_MESSAGES_MASK, or any of the other implementation-defined LC_*_MASK
72 "POSIX" Specifies the minimal environment for C-language translation
77 "" Specifies an implementation-defined native environment. This
102 <<newlocale>> is POSIX-1.2008.
126 int i; in newlocale() local
150 for (i = 1; i < _LC_LAST; ++i) in newlocale()
152 if (((1 << i) & category_mask) != 0) in newlocale()
[all …]
/picolibc-3.5.0-3.4.0/newlib/libm/ld/common/
Dk_rem_pio2.c21 * y = x - N*pi/2
30 * (2/pi) is represented by an array of 24-bit integers in ipio2[].
34 * pieces of 24-bit integers in double precision format.
35 * x[i] will be the i-th 24 bit of x. The scaled exponent
36 * of x[0] is given in input parameter e0 (i.e., x[0]*2^e0
40 * e0 = ilogb(z)-23
41 * z = scalbn(z,-e0)
42 * for i = 0,1,2
43 * x[i] = floor(z)
44 * z = (z-x[i])*2**24
[all …]
/picolibc-3.5.0-3.4.0/newlib/libm/complex/
Dcasinf.c3 /*-
55 w = M_PI_2 + 0.0f * I; in __weak_alias()
60 w = asinf(x) + 0.0f * I; in __weak_alias()
71 z2.r = (x - y) * (x + y); in __weak_alias()
72 z2.i = 2.0 * x * y; in __weak_alias()
77 ca.i = y; in __weak_alias()
79 sum.i = y; in __weak_alias()
82 ct.r = z2.r * ca.r - z2.i * ca.i; in __weak_alias()
83 ct.i = z2.r * ca.i + z2.i * ca.r; in __weak_alias()
85 ca.i = ct.i; in __weak_alias()
[all …]
Dcasinl.c3 /*-
54 w = M_PI_2L + 0.0L * (double complex) I; in __weak_alias()
59 w = asinl(x) + 0.0L * (double complex) I; in __weak_alias()
70 z2.r = (x - y) * (x + y); in __weak_alias()
71 z2.i = 2.0L * x * y; in __weak_alias()
76 ca.i = y; in __weak_alias()
78 sum.i = y; in __weak_alias()
81 ct.r = z2.r * ca.r - z2.i * ca.i; in __weak_alias()
82 ct.i = z2.r * ca.i + z2.i * ca.r; in __weak_alias()
84 ca.i = ct.i; in __weak_alias()
[all …]
Dcasin.c3 /*-
37 <<casin>>, <<casinf>>---complex arc sine
52 with branch cuts outside the interval [-1, +1] along the real axis.
61 and in the interval [-pi/2, +pi/2] along the real axis.
66 and in the interval [$-\pi/2$, $+\pi/2$] along the real axis.
98 w = M_PI_2 + 0.0 * (double complex) I; in __weak_alias()
103 w = asin(x) + 0.0 * (double complex) I; in __weak_alias()
114 z2.r = (x - y) * (x + y); in __weak_alias()
115 z2.i = 2.0 * x * y; in __weak_alias()
120 ca.i = y; in __weak_alias()
[all …]
/picolibc-3.5.0-3.4.0/newlib/libc/stdlib/
Ddtoa.c22 AT&T Bell Laboratories, Room 2C-463
24 Murray Hill, NJ 07974-2070
50 n = S->_wds; in quorem()
52 /*debug*/ if (b->_wds > n) in quorem()
55 if (b->_wds < n) in quorem()
57 sx = S->_x; in quorem()
58 sxe = sx + --n; in quorem()
59 bx = b->_x; in quorem()
77 y = (*bx & 0xffff) - (ys & 0xffff) + borrow; in quorem()
80 z = (*bx >> 16) - (zs & 0xffff) + borrow; in quorem()
[all …]
Dldtoa.c1 /* Extended precision arithmetic functions for long double I/O.
35 #define NBITS ((NI-4)*16)
45 /* Maximum exponent digits - base 10 */
163 * Numbers are stored in C language as arrays of 16-bit unsigned
171 * NE-1 significand words (least significant word first,
183 * to ei[NI-2] significand (NI-4 significand words,
186 * ei[NI-1] low guard word (0x8000 bit is rounding place)
205 * -1 if a < b, -2 if either a or b is a NaN.
207 * efloor( a, b, ldp ) truncate to integer, toward -infinity
215 * eneg(e) e = -e
[all …]
Dgdtoa-gdtoa.c46 int i, k; local
50 i = ULbits;
52 while(i < nbits) {
53 i <<= 1;
63 be = bits + ((nbits - 1) >> kshift);
64 x = x0 = b->_x;
71 i = x - x0;
72 while(!x0[--i])
73 if (!i) {
74 b->_wds = 0;
[all …]
/picolibc-3.5.0-3.4.0/newlib/libc/time/
Dtzcalc_limits.c6 * - Changed to mktm_r and added __tzcalc_limits - 04/10/02, Jeff Johnston
7 * - Fixed bug in mday computations - 08/12/04, Alex Mogilnikov <alx@intellectronika.ru>
8 * - Fixed bug in __tzcalc_limits - 08/12/04, Alex Mogilnikov <alx@intellectronika.ru>
9 * - Moved __tzcalc_limits() to separate file - 05/09/14, Freddie Chopin <freddie_chopin@op.pl>
18 int i, j; in __tzcalc_limits() local
24 tz->__tzyear = year; in __tzcalc_limits()
26 years = (year - EPOCH_YEAR); in __tzcalc_limits()
29 (years - 1 + EPOCH_YEARS_SINCE_LEAP) / 4 - in __tzcalc_limits()
30 (years - 1 + EPOCH_YEARS_SINCE_CENTURY) / 100 + in __tzcalc_limits()
31 (years - 1 + EPOCH_YEARS_SINCE_LEAP_CENTURY) / 400; in __tzcalc_limits()
[all …]

12345678910>>...19