| /darwin-on-arm/xnu/bsd/dev/dtrace/ |
| H A D | blist.c | 2 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting
12 * A radix tree is used to maintain the bitmap. Two radix constants are
18 * low. When the radix tree is searched, allocation failures in subtrees
21 * The radix tree also implements two collapsed states for meta nodes:
28 * the general radix structure optimizes both allocations and frees. The
29 * radix tree should be able to operate well no matter how much
41 * LAYOUT: The radix tree is layed out recursively using a
50 * must be encompassed in larger root-node radix.
55 * radix i
167 int radix; local
395 blst_meta_alloc(blmeta_t *scan, daddr_t blk, daddr_t count, daddr_t radix, int skip) argument
518 blst_meta_free(blmeta_t *scan, daddr_t freeBlk, daddr_t count, daddr_t radix, int skip, daddr_t blk) argument
606 blst_copy(blmeta_t *scan, daddr_t blk, daddr_t radix, daddr_t skip, blist_t dest, daddr_t count) argument
703 blst_radix_init(blmeta_t *scan, daddr_t radix, int skip, daddr_t count) argument
775 blst_radix_print(blmeta_t *scan, daddr_t blk, daddr_t radix, int skip, int tab) argument
[all...] |
| /darwin-on-arm/xnu/pexpert/gen/ |
| H A D | bootargs.c | 231 unsigned int radix, intval; local
240 radix = 10;
245 radix = 16;
250 radix = 2;
258 radix = 8;
265 } else if (intval >= radix) {
272 if ((radix <= 10) &&
273 ((c >= '0') && (c <= ('9' - (10 - radix))))) {
275 } else if ((radix == 16) &&
278 } else if ((radix
[all...] |
| /darwin-on-arm/xnu/iokit/IOKit/ |
| H A D | system.h | 70 void (*lputc)(char), int radix );
|
| /darwin-on-arm/xnu/pexpert/pexpert/ |
| H A D | protos.h | 58 int radix);
|
| /darwin-on-arm/xnu/bsd/net/ |
| H A D | Makefile | 31 if_ether.h init.h radix.h
35 ppp_defs.h radix.h if_bond_var.h if_bond_internal.h lacp.h ndrv_var.h \
|
| H A D | route.h | 158 #include <net/radix.h>
|
| H A D | radix.c | 60 * @(#)radix.c 8.4 (Berkeley) 11/2/94
61 * $FreeBSD: src/sys/net/radix.c,v 1.20.2.2 2001/03/06 00:56:50 obrien Exp $
65 * Routines to build and maintain radix trees for routing lookups.
78 #include <net/radix.h>
120 * The data structure for the keys is a radix tree with one way
955 * to an already-freed radix node as the successor node. To get
956 * around this issue, if we detect that the radix tree has changed
1075 * to an already-freed radix node as the successor node. To get
1076 * around this issue, if we detect that the radix tree has changed
1162 "rn_init: radix function
[all...] |
| H A D | pf_table.c | 72 #include <net/radix.h>
|
| H A D | pfvar.h | 83 #include <net/radix.h>
|
| H A D | if.c | 99 #include <net/radix.h>
|
| /darwin-on-arm/xnu/osfmk/kern/ |
| H A D | misc_protos.h | 154 int radix);
161 int radix);
|
| H A D | printf.c | 145 * r signed, 'radix'
146 * n unsigned, 'radix'
226 int radix) /* default radix - for '%r' */
529 base = radix;
535 base = radix;
658 int radix) /* default radix - for '%r' */
672 __doprnt(fmt, *argp, dummy_putc, putc, radix);
220 __doprnt( const char *fmt, va_list argp, void (*putc)(int, void *arg), void *arg, int radix) argument
653 _doprnt( register const char *fmt, va_list *argp, void (*putc)(char), int radix) argument
|
| /darwin-on-arm/xnu/bsd/kern/ |
| H A D | subr_prf.c | 133 int radix);
523 kvprintf(char const *fmt, void (*func)(int, void*), void *arg, int radix, va_list ap) argument
525 __doprnt(fmt, ap, func, arg, radix);
|
| /darwin-on-arm/xnu/bsd/conf/ |
| H A D | Makefile.template | 57 radix.o \
175 radix.o \
|
| H A D | files | 221 bsd/net/radix.c optional networking
|
| /darwin-on-arm/xnu/iokit/Kernel/ |
| H A D | IOHibernateRestoreKernel.c | 819 hibkvprintf(char const *fmt, void (*func)(int, void*), void *arg, int radix, va_list ap) argument
843 if (radix < 2 || radix > 36)
844 radix = 10;
994 base = radix;
|
| H A D | IOLib.cpp | 90 int radix);
|
| /darwin-on-arm/xnu/bsd/sys/ |
| H A D | mount_internal.h | 82 #include <net/radix.h>
|
| /darwin-on-arm/xnu/bsd/netinet6/ |
| H A D | in6_proto.c | 108 #include <net/radix.h>
|
| H A D | nd6_rtr.c | 83 #include <net/radix.h>
|