Searched refs:digits (Results 1 - 25 of 353) sorted by relevance

1234567891011>>

/netbsd-current/external/gpl3/gdb.old/dist/ld/testsuite/ld-ctf/
H A Darray-int.c1 int digits[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, }; variable
H A Darray.d26 digits.*\[10] .*
27 digits.*\[10] .*
/netbsd-current/external/gpl3/gcc.old/dist/libgcc/config/libbid/
H A Dbid64_logb.c42 int exponent_x, bin_expon_cx, digits; local
55 // find number of digits in coefficient
57 digits = 16;
61 digits = estimate_decimal_digits[bin_expon_cx];
62 if (coefficient_x >= power10_table_128[digits].w[0])
63 digits++;
65 exponent_x = exponent_x - DECIMAL_EXPONENT_BIAS + digits - 1;
H A Dbid128_logb.c33 int exponent_x, bin_expon_cx, digits; variable
41 // find number of digits in coefficient
47 digits = estimate_decimal_digits[bin_expon_cx];
51 digits++;
54 exponent_x = exponent_x - DECIMAL_EXPONENT_BIAS_128 - 1 + digits;
/netbsd-current/external/gpl3/gcc/dist/libgcc/config/libbid/
H A Dbid64_logb.c42 int exponent_x, bin_expon_cx, digits; local
55 // find number of digits in coefficient
57 digits = 16;
61 digits = estimate_decimal_digits[bin_expon_cx];
62 if (coefficient_x >= power10_table_128[digits].w[0])
63 digits++;
65 exponent_x = exponent_x - DECIMAL_EXPONENT_BIAS + digits - 1;
H A Dbid128_logb.c33 int exponent_x, bin_expon_cx, digits; variable
41 // find number of digits in coefficient
47 digits = estimate_decimal_digits[bin_expon_cx];
51 digits++;
54 exponent_x = exponent_x - DECIMAL_EXPONENT_BIAS_128 - 1 + digits;
/netbsd-current/external/bsd/ntp/dist/libntp/
H A Dhextolfp.c25 static const char *digits = "0123456789abcdefABCDEF"; local
40 (ind = strchr(digits, *cp)) != NULL) {
42 dec_i += ((ind - digits) > 15)
43 ? (u_long)(ind - digits - 6)
44 : (u_long)(ind - digits);
55 (ind = strchr(digits, *cp)) != NULL) {
57 dec_f += ((ind - digits) > 15)
58 ? (u_long)(ind - digits - 6)
59 : (u_long)(ind - digits);
H A Datolfp.c43 static const char *digits = "0123456789"; local
55 * [spaces][-|+][digits][.][digits][spaces|\n|\0]
71 while (*cp != '\0' && (ind = strchr(digits, *cp)) != NULL) {
73 dec_i += (u_long)(ind - digits);
82 && (ind = strchr(digits, *cp)) != NULL) {
85 dec_f += (u_long)(ind - digits);
/netbsd-current/external/gpl3/gcc/dist/libquadmath/printf/
H A D_itoa.h35 const char *digits = (upper_case ? _itoa_upper_digits : _itoa_lower_digits); local
42 *--buflim = digits[value % Base]; \
51 *--buflim = digits[value % base];
61 const char *digits = (upper_case ? _itoa_upper_digits : _itoa_lower_digits); local
70 *--buflim = digits[value % base];
H A D_itowa.h36 const wchar_t *digits = (upper_case local
45 *--bp = digits[value % Base]; \
54 *--bp = digits[value % base];
65 const wchar_t *digits = (upper_case local
76 *--bp = digits[value % base];
/netbsd-current/external/gpl3/gcc.old/dist/libquadmath/printf/
H A D_itoa.h35 const char *digits = (upper_case ? _itoa_upper_digits : _itoa_lower_digits); local
42 *--buflim = digits[value % Base]; \
51 *--buflim = digits[value % base];
61 const char *digits = (upper_case ? _itoa_upper_digits : _itoa_lower_digits); local
70 *--buflim = digits[value % base];
H A D_itowa.h36 const wchar_t *digits = (upper_case local
45 *--bp = digits[value % Base]; \
54 *--bp = digits[value % base];
65 const wchar_t *digits = (upper_case local
76 *--bp = digits[value % base];
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/ryu/
H A Dd2fixed.c183 // Convert `digits` to a sequence of decimal digits. Append the digits to the result.
185 // 10^(olength-1) <= digits < 10^olength
186 // e.g., by passing `olength` as `decimalLength9(digits)`.
187 static inline void append_n_digits(const uint32_t olength, uint32_t digits, char* const result) { argument
189 printf("DIGITS=%u\n", digits);
193 while (digits >= 10000) {
195 const uint32_t c = digits - 10000 * (digits / 1000
224 append_d_digits(const uint32_t olength, uint32_t digits, char* const result) argument
262 append_c_digits(const uint32_t count, uint32_t digits, char* const result) argument
282 append_nine_digits(uint32_t digits, char* const result) argument
373 const uint32_t digits = mulShift_mod1e9(m2 << 8, POW10_SPLIT[POW10_OFFSET[idx] + i], (int32_t) (j + 8)); local
425 uint32_t digits = mulShift_mod1e9(m2 << 8, POW10_SPLIT_2[p], j + 8); local
548 uint32_t digits = 0; local
[all...]
/netbsd-current/external/bsd/iscsi/dist/src/lib/
H A Dstrtoll.c42 static char *digits = "0123456789abcdefghijklmnopqrstuvwxyz"; variable
52 for (ret = 0, cp = ptr ; *cp && (dig = strchr(digits, *cp)) != NULL && (d = (int)(dig - digits)) < base ; cp++) {
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dbn_mp_rand.c22 mp_rand (mp_int * a, int digits) argument
28 if (digits <= 0) {
41 while (--digits > 0) {
/netbsd-current/external/gpl3/gdb/dist/libdecnumber/
H A DdecPacked.c64 /* If there is an error (that is, the decNumber has too many digits */
73 Int indigs=dn->digits; /* digits processed */
81 if (dn->digits>length*2-1 /* too long .. */
139 /* dn is the decNumber [with space for length*2 digits] */
144 /* of digits, and must be ended by a 4-bit sign nibble in the least */
151 /* hold the converted number (that is, up to length*2-1 digits), so */
163 Int digits; /* digits count */ local
174 digits
[all...]
H A DdecNumber.c58 /* precision (up to 999,999,999 digits) and arbitrary exponent */
62 /* tightly: digits, emax, and -emin in the context must be <= */
67 /* be finite, positive, have an exponent of zero, and all digits */
68 /* must be either 0 or 1. The result will only contain digits */
148 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */
150 /* accounting of digits is not needed. The correct digits value */
152 /* This must be called before any rounding if the number of digits */
156 /* numbers up to four digits, using appropriate constants. This */
315 /* complement of digits (wher
6679 decShiftToMost(Unit *uar, Int digits, Int shift) argument
7763 Int digits=(len-1)*DECDPUN+1; /* possible digits excluding msu */ local
7953 Int ae, d, digits; /* .. */ local
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/libdecnumber/
H A DdecPacked.c64 /* If there is an error (that is, the decNumber has too many digits */
73 Int indigs=dn->digits; /* digits processed */
81 if (dn->digits>length*2-1 /* too long .. */
139 /* dn is the decNumber [with space for length*2 digits] */
144 /* of digits, and must be ended by a 4-bit sign nibble in the least */
151 /* hold the converted number (that is, up to length*2-1 digits), so */
163 Int digits; /* digits count */ local
174 digits
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libdecnumber/
H A DdecPacked.c64 /* If there is an error (that is, the decNumber has too many digits */
73 Int indigs=dn->digits; /* digits processed */
81 if (dn->digits>length*2-1 /* too long .. */
139 /* dn is the decNumber [with space for length*2 digits] */
144 /* of digits, and must be ended by a 4-bit sign nibble in the least */
151 /* hold the converted number (that is, up to length*2-1 digits), so */
163 Int digits; /* digits count */ local
174 digits
[all...]
/netbsd-current/external/gpl3/gcc/dist/libdecnumber/
H A DdecPacked.c64 /* If there is an error (that is, the decNumber has too many digits */
73 Int indigs=dn->digits; /* digits processed */
81 if (dn->digits>length*2-1 /* too long .. */
139 /* dn is the decNumber [with space for length*2 digits] */
144 /* of digits, and must be ended by a 4-bit sign nibble in the least */
151 /* hold the converted number (that is, up to length*2-1 digits), so */
163 Int digits; /* digits count */ local
174 digits
[all...]
/netbsd-current/lib/libutil/
H A Dstrpct.c36 * "digits" is the number of digits past the decimal place you want
54 size_t digits)
81 (uintmax_t)denominator, digits);
89 size_t digits)
95 for (u = 0; u < digits; u++) {
116 if (digits == 0)
53 strspct(char *buf, size_t bufsiz, intmax_t numerator, intmax_t denominator, size_t digits) argument
88 strpct(char *buf, size_t bufsiz, uintmax_t numerator, uintmax_t denominator, size_t digits) argument
/netbsd-current/external/mit/isl/dist/
H A Disl_test_imath.c23 * fields. The digits are stored with less significant digits at lower array
44 assert(val.digits[0] == 0);
51 assert(val.digits[0] == 1);
58 assert(val.digits[0] == 1);
65 assert(val.digits[0] == 0);
66 assert(val.digits[1] == 1);
/netbsd-current/external/gpl2/groff/dist/src/libs/libgroff/
H A Dstrtol.c57 static char digits[] = "0123456789abcdefghijklmnopqrstuvwxyz"; local
83 p = strchr(digits, (ISASCII((unsigned char)*str)
87 if (p == 0 || (val = (p - digits)) >= base) {
105 p = strchr(digits, (ISASCII((unsigned char)*str)
110 n = p - digits;
/netbsd-current/external/bsd/libbind/dist/inet/
H A Dinet_net_pton.c66 static const char digits[] = "0123456789"; local
105 n = strchr(digits, ch) - digits;
134 n = strchr(digits, ch) - digits;
193 static const char digits[] = "0123456789"; local
203 pch = strchr(digits, ch);
208 val += (pch - digits);
223 static const char digits[] = "0123456789"; local
234 pch = strchr(digits, c
272 int digits; local
[all...]
/netbsd-current/lib/libc/inet/
H A Dinet_net_pton.c70 static const char digits[] = "0123456789"; local
112 n = strchr(digits, ch) - digits;
141 n = strchr(digits, ch) - digits;
196 static const char digits[] = "0123456789"; local
206 pch = strchr(digits, ch);
211 val += (int)(pch - digits);
227 static const char digits[] = "0123456789"; local
238 pch = strchr(digits, c
277 int digits; local
[all...]

Completed in 404 milliseconds

1234567891011>>