Searched refs:radix (Results 1 - 25 of 27) sorted by relevance

12

/illumos-gate/usr/src/cmd/pools/poold/com/sun/solaris/service/pools/
H A DUnsignedInt64.java65 public UnsignedInt64(String string, int radix) argument
68 super(string, radix);
/illumos-gate/usr/src/common/ficl/
H A Dutility.c78 ficlLtoa(ficlInteger value, char *string, int radix) argument
81 int sign = ((radix == 10) && (value < 0));
84 FICL_ASSERT(NULL, radix > 1);
85 FICL_ASSERT(NULL, radix < 37);
88 pwr = ficlIsPowerOfTwo((ficlUnsigned)radix);
107 result = ficl2UnsignedDivide(v, (ficlUnsigned)radix);
125 ficlUltoa(ficlUnsigned value, char *string, int radix) argument
131 FICL_ASSERT(NULL, radix > 1);
132 FICL_ASSERT(NULL, radix < 37);
140 result = ficl2UnsignedDivide(ud, (ficlUnsigned)radix);
[all...]
H A Dficl.h1302 ficlLtoa(ficlInteger value, char *string, int radix);
1304 ficlUltoa(ficlUnsigned value, char *string, int radix);
/illumos-gate/usr/src/uts/common/inet/
H A Dip_ftable.h36 #include <net/radix.h>
/illumos-gate/usr/src/uts/common/net/
H A DMakefile30 ppp-comp.h ppp_defs.h pppio.h vjcompress.h sppptun.h pppoe.h radix.h \
/illumos-gate/usr/src/boot/lib/libstand/
H A Dprintf.c62 static int kvprintf(char const *fmt, kvprintf_fn_t *func, void *arg, int radix, va_list ap);
214 kvprintf(char const *fmt, kvprintf_fn_t *func, void *arg, int radix, va_list ap) argument
238 if (radix < 2 || radix > 36)
239 radix = 10;
389 base = radix;
/illumos-gate/usr/src/cmd/mdb/common/mdb/
H A Dmdb_string.c188 * number. The number may be in the current radix, or it may have an
189 * explicit radix qualifier. The number will be validated against the
190 * legal characters for the given radix.
196 int radix = mdb.m_radix; local
202 radix = 2;
207 radix = 8;
212 radix = 10;
217 radix = 16;
224 valid[radix > 10 ? 10 + (radix
[all...]
H A Dmdb_modapi.c218 int radix = mdb.m_radix; local
224 radix = 2;
229 radix = 8;
234 radix = 10;
239 radix = 16;
245 return (strtonum(s, radix));
/illumos-gate/usr/src/uts/common/inet/ipf/netinet/
H A Dip_pool.h16 # include <net/radix.h>
H A Dipf_stack.h36 #include <net/radix.h>
295 /* radix.c */
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A DMakefile8 ROUTEDOBJS= common.o if.o input.o main.o output.o parms.o radix.o \
/illumos-gate/usr/src/lib/cfgadm_plugins/usb/common/
H A Dcfga_configfile.c176 register int radix; local
199 radix = 16;
202 radix = 8;
205 radix = 10;
209 switch (radix) {
/illumos-gate/usr/src/lib/libbc/libc/stdio/common/
H A Ddoprnt.c182 char radix; local
569 * "radix" is the radix for the conversion.
581 radix = 10;
586 radix = 8;
591 radix = 16;
621 switch(radix) {
/illumos-gate/usr/src/common/mpi/
H A Dmpi.h224 ** MP_HALF_RADIX because it's the radix for MP_HALF_DIGITs, and it's
336 mp_err mp_read_radix(mp_int *mp, const char *str, int radix);
338 int mp_radix_size(mp_int *mp, int radix);
339 mp_err mp_toradix(mp_int *mp, char *str, int radix);
H A Dmpi.c63 function. Since a number n in radix r takes up about log_r(n)
88 /* Value to digit maps for radix conversion */
2464 stream 'ofp'. Output is generated using the internal radix.
2565 /* {{{ mp_read_radix(mp, str, radix) */
2568 mp_read_radix(mp, str, radix)
2576 mp_err mp_read_radix(mp_int *mp, const char *str, int radix) argument
2582 ARGCHK(mp != NULL && str != NULL && radix >= 2 && radix <= MAX_RADIX,
2589 (s_mp_tovalue(str[ix], radix) < 0) &&
2603 while((val = s_mp_tovalue(str[ix], radix)) >
2622 int radix = default_radix; local
2663 mp_radix_size(mp_int *mp, int radix) argument
2680 mp_toradix(mp_int *mp, char *str, int radix) argument
[all...]
/illumos-gate/usr/src/lib/libdevinfo/
H A Ddevinfo_devperm.c704 int radix; local
727 radix = 16;
730 radix = 8;
733 radix = 10;
736 switch (radix) {
/illumos-gate/usr/src/uts/common/inet/ipf/
H A Dradix_ipf.h26 * @(#)radix.h 8.2 (Berkeley) 10/31/94
35 #include <net/radix.h>
H A Dip_lookup.c42 # include <net/radix.h>
H A Dip_pool.c62 # include <net/radix.h>
97 * So why not use a radix tree for this? As the first line implies, it
104 * not make it worthwhile not using radix trees. For now the radix tree from
253 /* function for the radix tree that supports the pools. ip_pool_destroy() is*/
/illumos-gate/usr/src/uts/i86pc/os/
H A Dfakebop.c510 int radix = 10; local
521 radix = 16;
524 radix = 8;
537 if (digit >= radix)
539 tmp = tmp * radix + digit;
/illumos-gate/usr/src/cmd/sgs/rtld.4.x/
H A Dumultiply.s134 ! To simplify the equations, the radix point can be moved to just
/illumos-gate/usr/src/uts/common/os/
H A Dmodsysfile.c1397 int radix; local
1420 radix = 16;
1423 radix = 8;
1425 radix = 10;
1428 switch (radix) {
/illumos-gate/usr/src/common/net/patricia/
H A Dradix.c32 * @(#)radix.c 8.5 (Berkeley) 5/19/95
33 * $FreeBSD: /repoman/r/ncvs/src/sys/net/radix.c,v 1.36.2.1 2005/01/31 23:26:23
39 * Routines to build and maintain radix trees for routing lookups.
58 #include <net/radix.h>
127 * The data structure for the keys is a radix tree with one way
1081 * Walk the radix tree; For the kernel routing table, we hold additional
/illumos-gate/usr/src/uts/common/io/comstar/port/qlt/
H A Dqlt.c150 static int qlt_convert_string_to_ull(char *prop, int radix,
6195 qlt_convert_string_to_ull(char *prop, int radix, argument
6198 return (ddi_strtoull((const char *)prop, 0, radix, result));
6206 int radix; local
6210 radix = 16;
6214 rval = qlt_convert_string_to_ull(prop_val, radix, &wwnn);
6220 rval = qlt_convert_string_to_ull(prop_val, radix,
/illumos-gate/usr/src/uts/common/inet/ip/
H A Dip_ftable.c71 #include <net/radix.h>
139 * each matching leaf in the radix tree. ire_match_args is
143 * that the radix node can't be deleted by incrementing ire_refcnt.
397 * First attempt to add a node to the radix tree via rn_addroute. If the
400 * Locking notes: Need to hold the global radix tree lock in write mode to
401 * add a radix node. To prevent the node from being deleted, ire_get_bucket()
403 * while holding the irb_lock, but not the radix tree lock.
657 * the radix tree.
718 * Someone has a reference to this radix node
728 * radix nod
[all...]

Completed in 172 milliseconds

12