Searched refs:index_bits (Results 1 – 3 of 3) sorted by relevance
36 In the final tree the first few (prio_tree_root->index_bits) levels38 those levels (i.e. levels prio_tree_root->index_bits + 1 and higher) are47 level prio_tree_root->index_bits = 374 Note that we use prio_tree_root->index_bits to optimize the height75 of the heap-and-radix indexed tree. Since prio_tree_root->index_bits is77 bits (in vm_pgoff) above prio_tree_root->index_bits are 0 (zero). Therefore,78 we only use the first prio_tree_root->index_bits as radix_index.79 Whenever index_bits is increased in prio_tree_expand, we shuffle the tree80 to make sure that the first prio_tree_root->index_bits levels of the tree83 We do not optimize the height of overflow-sub-trees using index_bits.[all …]
99 if (max_heap_index > prio_tree_maxindex(root->index_bits)) in prio_tree_expand()100 root->index_bits++; in prio_tree_expand()102 while (max_heap_index > prio_tree_maxindex(root->index_bits)) { in prio_tree_expand()103 root->index_bits++; in prio_tree_expand()198 heap_index > prio_tree_maxindex(root->index_bits)) in prio_tree_insert()202 mask = 1UL << (root->index_bits - 1); in prio_tree_insert()434 iter->mask = 1UL << (root->index_bits - 1); in prio_tree_first()
30 unsigned short index_bits; member61 (ptr)->index_bits = 1; \