| /src/external/bsd/nsd/dist/simdzone/src/generic/ |
| loc.h | 16 uint8_t digits[3]; local
18 digits[0] = (uint8_t)text[0] - '0';
19 digits[1] = (uint8_t)text[1] - '0';
20 digits[2] = (uint8_t)text[2] - '0';
24 *degrees = digits[0] * 3600000;
25 if (digits[0] > 9)
29 *degrees = digits[0] * 36000000 + digits[1] * 3600000;
30 if (digits[0] > 9 || digits[1] > 9
51 uint8_t digits[2]; local
76 uint8_t digits[3]; local
148 uint8_t digits[2]; local
210 uint8_t digits[2]; local
[all...] |
| apl.h | 16 uint8_t digits[3]; local
33 digits[0] = (uint8_t)text[count+1] - '0';
34 digits[1] = (uint8_t)text[count+2] - '0';
35 if (text[count] != '/' || digits[0] > 9)
37 if (digits[1] > 9)
38 (void)(count += 2), prefix = digits[0];
40 (void)(count += 3), prefix = digits[0] * 10 + digits[1];
53 digits[0] = (uint8_t)text[count+1] - '0';
54 digits[1] = (uint8_t)text[count+2] - '0'
[all...] |
| ip4.h | 18 uint8_t digits[3], count; local
20 digits[0] = (uint8_t)text[0] - '0';
21 digits[1] = (uint8_t)text[1] - '0';
22 digits[2] = (uint8_t)text[2] - '0';
23 if (digits[0] > 9)
25 else if (digits[1] > 9)
26 (void)(count = 1), octet = digits[0];
27 else if (digits[2] > 9)
28 (void)(count = 2), octet = digits[0] * 10 + digits[1]
[all...] |
| gpos.h | 22 uint8_t digits[4]; local
23 digits[0] = (uint8_t)text[0] - '0';
24 digits[1] = (uint8_t)text[1] - '0';
25 digits[2] = (uint8_t)text[2] - '0';
26 digits[3] = (uint8_t)text[3] - '0';
28 int32_t mask = ((digits[0] <= 9) << 0) | // 0b0001
29 ((digits[1] <= 9) << 1) | // 0b0010
30 ((digits[2] <= 9) << 2) | // 0b0100
31 ((digits[3] <= 9) << 3); // 0b1000
43 degrees = digits[0] * 10 + digits[1]
86 uint8_t digits[5]; local
[all...] |
| /src/external/gpl3/gcc/dist/libgcc/config/libbid/ |
| bid64_logb.c | 42 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;
|
| bid128_logb.c | 33 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;
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/libbid/ |
| bid64_logb.c | 42 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;
|
| bid128_logb.c | 33 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;
|
| /src/external/bsd/ntp/dist/libntp/ |
| hextolfp.c | 25 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);
|
| atolfp.c | 43 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);
|
| /src/external/gpl3/gcc/dist/libquadmath/printf/ |
| _itoa.h | 35 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];
|
| _itowa.h | 36 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];
|
| /src/external/gpl3/gcc.old/dist/libquadmath/printf/ |
| _itoa.h | 35 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];
|
| _itowa.h | 36 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];
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/ryu/ |
| d2fixed.c | 183 // 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) {
189 printf("DIGITS=%u\n", digits);
193 while (digits >= 10000) {
195 const uint32_t c = digits - 10000 * (digits / 10000)
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...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/ryu/ |
| d2fixed.c | 183 // 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) {
189 printf("DIGITS=%u\n", digits);
193 while (digits >= 10000) {
195 const uint32_t c = digits - 10000 * (digits / 10000)
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...] |
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_rand.c | 22 mp_rand (mp_int * a, int digits)
28 if (digits <= 0) {
41 while (--digits > 0) {
|
| /src/external/bsd/iscsi/dist/src/lib/ |
| strtoll.c | 42 static char *digits = "0123456789abcdefghijklmnopqrstuvwxyz"; variable
52 for (ret = 0, cp = ptr ; *cp && (dig = strchr(digits, *cp)) != NULL && (d = (int)(dig - digits)) < base ; cp++) {
|
| /src/external/gpl3/gcc/dist/libdecnumber/ |
| decPacked.c | 64 /* 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=(last-first)*2+1; /* calculate digits .. *
[all...] |
| /src/external/gpl3/gcc.old/dist/libdecnumber/ |
| decPacked.c | 64 /* 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=(last-first)*2+1; /* calculate digits .. *
[all...] |
| /src/external/gpl3/gdb/dist/libdecnumber/ |
| decPacked.c | 64 /* 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=(last-first)*2+1; /* calculate digits .. *
[all...] |
| /src/external/gpl3/gdb.old/dist/libdecnumber/ |
| decPacked.c | 64 /* 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=(last-first)*2+1; /* calculate digits .. *
[all...] |
| /src/external/mit/isl/dist/ |
| isl_test_imath.c | 23 * 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);
|
| /src/external/gpl2/groff/dist/src/libs/libgroff/ |
| strtol.c | 57 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;
|
| /src/lib/libc/inet/ |
| inet_net_pton.c | 70 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, ch)
277 int digits; local
[all...] |
