| /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 in function:blist_create
[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/sbin/routed/ |
| Makefile | 6 SRCS= if.c input.c main.c output.c parms.c radix.c rdisc.c table.c trace.c
|
| /src/sys/netcan/ |
| can_proto.c | 42 #include <net/radix.h>
|
| /src/usr.bin/m4/ |
| tokenizer.l | 47 radix 0[rR][0-9]+:[0-9a-zA-Z]+
52 {radix} { if (mimic_gnu) {
|
| /src/sbin/dmesg/ |
| dmesg.c | 71 static const char *radix; variable in typeref:typename:const char *
112 APPENDFMT("%jd%s%.*ld%c", a, radix, pr, ms, \
167 radix = nl_langinfo(RADIXCHAR);
168 if (radix == NULL)
169 radix = "."; /* could also select "," */
377 printf(" %5jd%s", sec, radix);
388 (intmax_t)dt.tv_sec, radix,
|
| /src/sys/external/bsd/drm2/dist/drm/i915/gem/ |
| i915_gem_context_types.h | 17 #include <linux/radix-tree.h>
|
| i915_gem_pages.c | 178 radix_tree_for_each_slot(slot, &obj->mm.get_page.radix, &iter, 0)
179 radix_tree_delete(&obj->mm.get_page.radix, iter.index);
541 ret = radix_tree_insert(&iter->radix, idx, sg);
547 ret = radix_tree_insert(&iter->radix, idx + i, entry);
581 sg = radix_tree_lookup(&iter->radix, n);
585 * the radix tree will contain a value entry that points
594 sg = radix_tree_lookup(&iter->radix, base);
|
| i915_gem_object_types.h | 270 struct radix_tree_root radix; member in struct:drm_i915_gem_object::__anonbfddbbad0408::i915_gem_object_page_iter
|
| i915_gem_object.c | 87 INIT_RADIX_TREE(&obj->mm.get_page.radix, GFP_KERNEL | __GFP_NOWARN);
|
| /src/sys/net/ |
| Makefile | 11 pfil.h pfkeyv2.h pfvar.h ppp-comp.h ppp_defs.h radix.h \
|
| route.h | 107 #include <net/radix.h>
|
| radix.c | 1 /* $NetBSD: radix.c,v 1.49 2020/10/18 13:07:31 gson Exp $ */
31 * @(#)radix.c 8.6 (Berkeley) 10/17/95
35 * Routines to build and maintain radix trees for routing lookups.
39 __KERNEL_RCSID(0, "$NetBSD: radix.c,v 1.49 2020/10/18 13:07:31 gson Exp $");
58 #include <net/radix.h>
92 * The data structure for the keys is a radix tree with one way
1048 * Initialize a radix tree once radix is initialized. Only for bootstrap.
1113 panic("radix already initialized");
1124 "rn_init: radix functions require max_keylen be set\n")
[all...] |
| /src/usr.bin/bdes/ |
| bdes.c | 142 #define KEY_DEFAULT 0 /* interpret radix of key from key */
377 tobinhex(char c, int radix)
382 case '2': return(radix > 2 ? 0x2 : -1);
383 case '3': return(radix > 3 ? 0x3 : -1);
384 case '4': return(radix > 4 ? 0x4 : -1);
385 case '5': return(radix > 5 ? 0x5 : -1);
386 case '6': return(radix > 6 ? 0x6 : -1);
387 case '7': return(radix > 7 ? 0x7 : -1);
388 case '8': return(radix > 8 ? 0x8 : -1);
389 case '9': return(radix > 9 ? 0x9 : -1)
[all...] |
| /src/sys/external/bsd/drm2/linux/ |
| linux_radixtree.c | 38 #include <linux/radix-tree.h>
|
| /src/sys/dev/microcode/siop/ |
| ncr53cxxx.c | 785 int radix; local in function:number
787 radix = 10;
790 radix = 8;
794 radix = 16;
798 radix = 2;
800 if (radix != 8)
817 if (n >= radix)
820 value = value * radix + n;
|
| /src/usr.bin/make/unit-tests/ |
| cond-token-number.mk | 85 # Make can do radix conversion from hex.
|
| /src/lib/libutil/ |
| login_cap.c | 798 strtosize(const char *str, char **endptr, int radix)
807 num = strtouq(str, &expr, radix);
844 num2 = strtosize(expr+1, &expr2, radix);
872 strtolimit(const char *str, char **endptr, int radix)
883 return (strtosize(str, endptr, radix));
|
| /src/usr.sbin/fstyp/ |
| hammer2_disk.h | 84 * using 64KB indirect blocks (128 byte refs, 512 or radix 9 per indblk).
136 #define HAMMER2_SET_RADIX 2 /* radix 2 = 4 entries */
330 * Freemap radix. Assumes a set-count of 4, 128-byte blockrefs,
378 #define H2FMBASE(key, radix) rounddown2(key, (hammer2_off_t)1 << (radix))
391 * 32 blocks (radix 5) per element.
454 * to as a power of 2. The theoretical minimum radix is thus 6 (The space
456 * minimum allocation chunk size is 1KB (a radix of 10), so HAMMER2 sets
457 * HAMMER2_RADIX_MIN to 10. The maximum radix is currently 16 (64KB), but
460 * WARNING! A radix of 0 (such as when data_off is all 0's) is a specia
[all...] |
| /src/sbin/nvmectl/ |
| bignum.c | 2068 * Let B represent the radix [e.g. 2**DIGIT_BIT] and
3851 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
4051 * Uses Montgomery or Diminished Radix reduction [whichever appropriate]
4341 /* modified diminished radix reduction */
4362 /* reverse an array, used for radix code */
4897 mp_radix_size(mp_int *a, int radix, int *size)
4906 if (radix == 2) {
4911 /* make sure the radix is in range */
4912 if (radix < 2 || radix > 64)
[all...] |
| /src/sys/nfs/ |
| nfs_export.c | 98 #include <net/radix.h>
644 * Free the netcred object pointed to by the 'rn' radix node.
645 * 'w' holds a pointer to the radix tree head.
|
| /src/sys/rump/net/lib/libsockin/ |
| sockin.c | 48 #include <net/radix.h>
|
| /src/sys/fs/nfs/common/ |
| nfsport.h | 80 #include <net/radix.h>
|
| /src/sys/dist/pf/net/ |
| pfvar.h | 47 #include <net/radix.h>
|
