| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/ |
| string.d | 26 radix = the numeric base to use in the conversion (defaults to 10)
31 char[] unsignedToTempString(uint radix = 10)(ulong value, return scope char[] buf) @safe
32 if (radix >= 2 && radix <= 16)
38 if (value < radix)
45 x = cast(uint)(value % radix);
46 value /= radix;
48 buf[--i] = cast(char)((radix <= 10 || x < 10) ? x + '0' : x - 10 + 'a');
71 radix = the numeric base to use in the conversion (defaults to 10)
76 auto unsignedToTempString(uint radix = 10)(ulong value) @saf
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_read_radix.c | 20 /* read a string [ASCII] in a given radix */
21 int mp_read_radix (mp_int * a, const char *str, int radix)
29 /* make sure the radix is ok */
30 if (radix < 2 || radix > 64) {
49 /* if the radix < 36 the conversion is case insensitive
53 ch = (char) ((radix < 36) ? toupper (*str) : *str);
61 * and is less than the given radix add it
64 if (y < radix) {
65 if ((res = mp_mul_d (a, (mp_digit) radix, a)) != MP_OKAY)
[all...] |
| bn_mp_radix_size.c | 21 int mp_radix_size (mp_int * a, int radix, int *size)
30 if (radix == 2) {
35 /* make sure the radix is in range */
36 if (radix < 2 || radix > 64) {
63 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
| bn_mp_fwrite.c | 20 int mp_fwrite(mp_int *a, int radix, FILE *stream)
25 if ((err = mp_radix_size(a, radix, &len)) != MP_OKAY) {
34 if ((err = mp_toradix(a, buf, radix)) != MP_OKAY) {
|
| bn_mp_fread.c | 21 int mp_fread(mp_int *a, int radix, FILE *stream)
38 /* find y in the radix map */
39 for (y = 0; y < radix; y++) {
44 if (y == radix) {
49 if ((err = mp_mul_d(a, radix, a)) != MP_OKAY) {
|
| bn_mp_toradix.c | 20 /* stores a bignum as a ASCII string in a given radix (2..64) */
21 int mp_toradix (mp_int * a, char *str, int radix)
28 /* check range of the radix */
29 if (radix < 2 || radix > 64) {
53 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
| bn_mp_toradix_n.c | 20 /* stores a bignum as a ASCII string in a given radix (2..64)
24 int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen)
31 /* check range of the maxlen, radix */
32 if (maxlen < 2 || radix < 2 || radix > 64) {
66 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
| /src/external/mpl/bind/dist/lib/dns/ |
| iptable.c | 20 #include <isc/radix.h>
26 * Create a new IP table and the underlying radix structure
37 isc_radix_create(mctx, &tab->radix, RADIX_MAXBITS);
57 INSIST(tab->radix != NULL);
61 result = isc_radix_insert(tab->radix, &node, NULL, &pfx);
99 RADIX_WALK(source->radix->head, node) {
101 result = isc_radix_insert(tab->radix, &new_node, node, NULL);
128 tab->radix->num_added_node += max_node;
138 if (dtab->radix != NULL) {
139 isc_radix_destroy(dtab->radix, NULL)
[all...] |
| /src/external/mpl/bind/dist/tests/isc/ |
| radix_test.c | 29 #include <isc/radix.h>
35 /* test radix node removal */
37 isc_radix_tree_t *radix = NULL; local
46 isc_radix_create(mctx, &radix, 32);
53 result = isc_radix_insert(radix, &node, NULL, &prefix);
63 result = isc_radix_insert(radix, &node, NULL, &prefix);
73 result = isc_radix_insert(radix, &node, NULL, &prefix);
78 isc_radix_remove(radix, node);
80 isc_radix_destroy(radix, NULL);
83 /* test radix searching *
85 isc_radix_tree_t *radix = NULL; local
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| radix.c | 1 /* $NetBSD: radix.c,v 1.1 2024/02/18 20:57:50 christos Exp $ */
18 * Id: radix.c,v 1.10.2.1 1999/11/29 05:16:24 masaki Exp
25 #include <isc/radix.h>
45 _clear_radix(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func);
138 isc_radix_tree_t *radix; local
142 radix = isc_mem_get(mctx, sizeof(isc_radix_tree_t));
144 radix->mctx = NULL;
145 isc_mem_attach(mctx, &radix->mctx);
146 radix->maxbits = maxbits;
147 radix->head = NULL
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| radix.c | 1 /* $NetBSD: radix.c,v 1.12 2026/04/08 00:16:15 christos Exp $ */
18 * Id: radix.c,v 1.10.2.1 1999/11/29 05:16:24 masaki Exp
25 #include <isc/radix.h>
45 _clear_radix(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func);
141 isc_radix_tree_t *radix = isc_mem_get(mctx, sizeof(isc_radix_tree_t)); local
142 *radix = (isc_radix_tree_t){
146 isc_mem_attach(mctx, &radix->mctx);
147 *target = radix;
156 _clear_radix(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func) {
157 REQUIRE(radix != NULL)
[all...] |
| /src/sys/kern/ |
| subr_blist.c | 30 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting
37 * A radix tree is used to maintain the bitmap. Two radix constants are
43 * low. When the radix tree is searched, allocation failures in subtrees
46 * The radix tree also implements two collapsed states for meta nodes:
53 * the general radix structure optimizes both allocations and frees. The
54 * radix tree should be able to operate well no matter how much
66 * LAYOUT: The radix tree is laid out recursively using a
75 * must be encompassed in larger root-node radix.
80 * radix is large enough that this restriction does not affect the swap
187 blist_blkno_t radix; local
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| iptable.c | 20 #include <isc/radix.h>
29 * Create a new IP table and the underlying radix structure
40 tab->radix = NULL;
43 result = isc_radix_create(mctx, &tab->radix, RADIX_MAXBITS);
71 INSIST(tab->radix != NULL);
75 result = isc_radix_insert(tab->radix, &node, NULL, &pfx);
113 RADIX_WALK(source->radix->head, node) {
115 result = isc_radix_insert(tab->radix, &new_node, node, NULL);
142 tab->radix->num_added_node += max_node;
169 if (dtab->radix != NULL)
[all...] |
| /src/bin/ed/ |
| cbc.c | 263 int radix /* base (2 to 16) */)
268 case '2': return(radix > 2 ? 0x2 : -1);
269 case '3': return(radix > 3 ? 0x3 : -1);
270 case '4': return(radix > 4 ? 0x4 : -1);
271 case '5': return(radix > 5 ? 0x5 : -1);
272 case '6': return(radix > 6 ? 0x6 : -1);
273 case '7': return(radix > 7 ? 0x7 : -1);
274 case '8': return(radix > 8 ? 0x8 : -1);
275 case '9': return(radix > 9 ? 0x9 : -1);
276 case 'A': case 'a': return(radix > 10 ? 0xa : -1)
[all...] |
| /src/external/mit/isl/dist/imath/ |
| imrat.h | 183 `d` in the specified radix and writing no more than `limit` bytes to the
185 if `r` is negative. Requires `MP_MIN_RADIX <= radix <= MP_MAX_RADIX`. */
186 mp_result mp_rat_to_string(mp_rat r, mp_size radix, char *str, int limit);
189 specified radix, writing no more than `limit` bytes of data to the given
191 `MP_MIN_RADIX <= radix <= MP_MAX_RADIX`.
215 mp_result mp_rat_to_decimal(mp_rat r, mp_size radix, mp_size prec,
219 zero-terminated string in the given `radix`.
220 Requires `MP_MIN_RADIX <= radix <= MP_MAX_RADIX`. */
221 mp_result mp_rat_string_len(mp_rat r, mp_size radix);
224 `mp_rat_to_decimal()` function with the specified `radix` and `prec`. Th
[all...] |
| imrat.c | 468 mp_result mp_rat_to_string(mp_rat r, mp_size radix, char *str, int limit) {
472 if ((res = mp_int_to_string(MP_NUMER_P(r), radix, str, limit)) != MP_OK) {
491 return mp_int_to_string(MP_DENOM_P(r), radix, start, limit);
494 mp_result mp_rat_to_decimal(mp_rat r, mp_size radix, mp_size prec,
514 /* Count up leading zeroes after the radix point. */
519 if ((res = mp_int_mul_value(TEMP(1), radix, TEMP(1))) != MP_OK) {
524 /* Multiply remainder by a power of the radix sufficient to get the right
527 if ((res = mp_int_expt_value(radix, zprec - lead_0, TEMP(2))) != MP_OK) {
597 if ((res = mp_int_to_string(TEMP(0), radix, start, left)) != MP_OK) {
619 res = mp_int_to_string(TEMP(1), radix, start, left)
799 (void)mp_int_set_value(MP_DENOM_P(r), radix); local
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/include/dns/ |
| iptable.h | 24 #include <isc/radix.h>
32 isc_radix_tree_t *radix; member in struct:dns_iptable
48 * Create a new IP table and the underlying radix structure
|
| /src/external/mpl/bind/dist/lib/isc/include/isc/ |
| radix.h | 1 /* $NetBSD: radix.h,v 1.10 2025/01/26 16:25:42 christos Exp $ */
66 * We need "first match" when we search the radix tree to preserve
67 * compatibility with the existing ACL implementation. Radix trees
73 * An IPv4 prefix and an IPv6 prefix may share a radix tree node if they
93 isc_prefix_t *prefix; /* who we are in radix tree */
118 isc_radix_search(isc_radix_tree_t *radix, isc_radix_node_t **target,
121 * Search 'radix' for the best match to 'prefix'.
125 * \li 'radix' to be valid.
135 isc_radix_insert(isc_radix_tree_t *radix, isc_radix_node_t **target,
138 * Insert 'source' or 'prefix' into the radix tree 'radix'
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/isc/include/isc/ |
| radix.h | 1 /* $NetBSD: radix.h,v 1.1 2024/02/18 20:57:54 christos Exp $ */
67 * We need "first match" when we search the radix tree to preserve
68 * compatibility with the existing ACL implementation. Radix trees
74 * An IPv4 prefix and an IPv6 prefix may share a radix tree node if they
94 isc_prefix_t *prefix; /* who we are in radix tree */
119 isc_radix_search(isc_radix_tree_t *radix, isc_radix_node_t **target,
122 * Search 'radix' for the best match to 'prefix'.
126 * \li 'radix' to be valid.
136 isc_radix_insert(isc_radix_tree_t *radix, isc_radix_node_t **target,
139 * Insert 'source' or 'prefix' into the radix tree 'radix'
[all...] |
| /src/external/bsd/less/dist/ |
| lessecho.c | 70 static long lstrtol(char *s, char **pend, int radix)
90 /* Determine radix if caller does not specify. */
91 if (radix == 0)
93 radix = 10;
99 radix = 16;
103 radix = 8;
120 if (v >= radix)
122 n = n * radix + v;
|
| /src/external/gpl2/gettext/dist/gettext-tools/src/ |
| x-scheme.c | 258 is_integer_syntax (const char *str, int len, int radix)
265 where DIGIT is a hexadecimal digit whose value is below radix. */
287 if (c >= radix)
299 is_other_number_syntax (const char *str, int len, int radix, bool unconstrained)
311 (Dot and exponent are allowed only if radix is 10.)
345 if (c >= 'D' && radix == 10) /* exponent? */
351 if (c >= 'd' && radix == 10) /* exponent? */
357 if (c >= radix)
368 if (!seen_digits && !(*p == '.' && radix == 10))
392 if (c >= radix)
501 int radix = 10; local
[all...] |
| /src/sbin/routed/ |
| Makefile | 6 SRCS= if.c input.c main.c output.c parms.c radix.c rdisc.c table.c trace.c
|
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| print-utils.h | 59 /* Convert VAL to a numeral in the given radix. For
60 * radix 10, IS_SIGNED may be true, indicating a signed quantity;
66 extern const char *int_string (LONGEST val, int radix, int is_signed, int width,
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++11/ |
| limits.cc | 51 const int __numeric_limits_base::radix; member in class:__numeric_limits_base
76 const int numeric_limits<bool>::radix; member in class:numeric_limits
101 const int numeric_limits<char>::radix; member in class:numeric_limits
126 const int numeric_limits<signed char>::radix; member in class:numeric_limits
151 const int numeric_limits<unsigned char>::radix; member in class:numeric_limits
178 const int numeric_limits<wchar_t>::radix; member in class:numeric_limits
204 const int numeric_limits<short>::radix; member in class:numeric_limits
229 const int numeric_limits<unsigned short>::radix; member in class:numeric_limits
254 const int numeric_limits<int>::radix; member in class:numeric_limits
279 const int numeric_limits<unsigned int>::radix; member in class:numeric_limits
304 const int numeric_limits<long>::radix; member in class:numeric_limits
329 const int numeric_limits<unsigned long>::radix; member in class:numeric_limits
354 const int numeric_limits<long long>::radix; member in class:numeric_limits
378 const int numeric_limits<unsigned long long>::radix; member in class:numeric_limits
465 const int numeric_limits<float>::radix; member in class:numeric_limits
490 const int numeric_limits<double>::radix; member in class:numeric_limits
515 const int numeric_limits<long double>::radix; member in class:numeric_limits
541 const int numeric_limits<char8_t>::radix; member in class:numeric_limits
567 const int numeric_limits<char16_t>::radix; member in class:numeric_limits
592 const int numeric_limits<char32_t>::radix; member in class:numeric_limits
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++11/ |
| limits.cc | 51 const int __numeric_limits_base::radix; member in class:__numeric_limits_base
76 const int numeric_limits<bool>::radix; member in class:numeric_limits
101 const int numeric_limits<char>::radix; member in class:numeric_limits
126 const int numeric_limits<signed char>::radix; member in class:numeric_limits
151 const int numeric_limits<unsigned char>::radix; member in class:numeric_limits
178 const int numeric_limits<wchar_t>::radix; member in class:numeric_limits
204 const int numeric_limits<short>::radix; member in class:numeric_limits
229 const int numeric_limits<unsigned short>::radix; member in class:numeric_limits
254 const int numeric_limits<int>::radix; member in class:numeric_limits
279 const int numeric_limits<unsigned int>::radix; member in class:numeric_limits
304 const int numeric_limits<long>::radix; member in class:numeric_limits
329 const int numeric_limits<unsigned long>::radix; member in class:numeric_limits
354 const int numeric_limits<long long>::radix; member in class:numeric_limits
378 const int numeric_limits<unsigned long long>::radix; member in class:numeric_limits
465 const int numeric_limits<float>::radix; member in class:numeric_limits
490 const int numeric_limits<double>::radix; member in class:numeric_limits
515 const int numeric_limits<long double>::radix; member in class:numeric_limits
541 const int numeric_limits<char8_t>::radix; member in class:numeric_limits
567 const int numeric_limits<char16_t>::radix; member in class:numeric_limits
592 const int numeric_limits<char32_t>::radix; member in class:numeric_limits
[all...] |
