Searched refs:radix (Results 1 - 4 of 4) sorted by relevance
/haiku/src/system/kernel/util/ |
H A D | RadixBitmap.cpp | 29 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting 36 * A radix tree is used to maintain the bitmap. Two radix constants are 42 * low. When the radix tree is searched, allocation failures in subtrees 45 * The radix tree also implements two collapsed states for meta nodes: 52 * the general radix structure optimizes both allocations and frees. The 53 * radix tree should be able to operate well no matter how much 65 * LAYOUT: The radix tree is layed out recursively using a 74 * must be encompassed in larger root-node radix. 79 * radix i 106 radix_bitmap_init(radix_node *node, uint32 radix, uint32 skip, uint32 slots) argument [all...] |
/haiku/src/system/libroot/posix/glibc/arch/generic/ |
H A D | mpa2.h | 37 /**/ radix = {{0x41700000, 0x00000000} }, /* 2**24 */ variable 57 /**/ radix = {{0x00000000, 0x41700000} }, /* 2**24 */ variable 77 #define RADIX radix.d
|
H A D | mpexp.h | 82 /**/ radix = {{0x41700000, 0x00000000} }, /* 2**24 */ variable 141 /**/ radix = {{0x00000000, 0x41700000} }, /* 2**24 */ variable 151 #define RADIX radix.d
|
/haiku/headers/private/kernel/util/ |
H A D | RadixBitmap.h | 29 * The radix bitmap structure is ported from FreeBSD. 51 // Bitmap which uses radix tree for hinting. 52 // The radix tree is stored in an array. 55 radix_slot_t radix; // coverage radix member in struct:radix_bitmap 57 radix_node *root; // root of radix tree, actually it is an array
|
Completed in 68 milliseconds