| /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/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/sys/external/bsd/drm2/dist/drm/i915/gem/ |
| i915_gem_object_types.h | 270 struct radix_tree_root radix; member in struct:drm_i915_gem_object::__anonbfddbbad0408::i915_gem_object_page_iter
|
| /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;
|
