Lines Matching full:leaf

40  *	constant defines the size of the bitmaps contained in a leaf node
49 * For a leaf node, a bit is set if the corresponding block is free. For a
155 * number of leaf nodes of the subtree is L=radix/BLIST_RADIX. If 'm'
157 * leaf nodes, the total number of tree nodes is 1 + m + m**2 + ... + m**h,
201 * The smallest blist consists of a single leaf node capable of
221 * Include a sentinel node to ensure that cross-leaf scans stay within in blist_create()
538 * Scan leaf. in blist_stats()
576 * BLST_NEXT_LEAF_ALLOC() - allocate the blocks starting with the next leaf.
578 * 'scan' is a leaf node, and its first block is at address 'start'. The
579 * next leaf node could be adjacent, or several nodes away if the least
602 * Either there is no next leaf with any free blocks, in blst_next_leaf_alloc()
603 * or we've reached the next leaf and found that some in blst_next_leaf_alloc()
610 * There isn't a next leaf with enough free in blst_next_leaf_alloc()
619 * There was no next leaf. Back scan up to in blst_next_leaf_alloc()
620 * last leaf. in blst_next_leaf_alloc()
632 * 'scan' is the last leaf that provides blocks. Clear from 1 to in blst_next_leaf_alloc()
655 /* Clear all the bits of this leaf. */ in blst_next_leaf_alloc()
662 * BLST_LEAF_ALLOC() - allocate at a leaf in the radix tree (a bitmap).
666 * crosses a leaf boundary.
695 * count1 >> num_shifts starting in this leaf. in blst_leaf_alloc()
739 /* Check next leaf for some of the blocks we want or need. */ in blst_leaf_alloc()
745 * The next leaf cannot supply enough blocks to reach in blst_leaf_alloc()
748 * be satisfied later, by this leaf, if the state of in blst_leaf_alloc()
749 * the next leaf changes, and without any changes to in blst_leaf_alloc()
750 * this leaf. in blst_leaf_alloc()
757 /* Clear the allocated bits from this leaf. */ in blst_leaf_alloc()
835 * BLST_LEAF_FREE() - free allocated block from leaf bitmap
917 * Leaf node in blst_copy()
960 * BLST_LEAF_FILL() - allocate specific blocks in leaf bitmap