Searched refs:radix_index (Results 1 – 2 of 2) sorted by relevance
3 * radix_index = vm_pgoff : start_vm_pgoff7 radix_index. The conditions for indexing are:11 then ->radix_index < ->left->radix_index;13 then ->radix_index < ->right->radix_index;14 * nodes are hashed to left or right subtree using radix_index31 the same vm_pgoff (radix_index) and if necessary we build different32 overflow-sub-trees to handle each possible radix_index. For example,44 vmas are represented [radix_index, size_index, heap_index]78 we only use the first prio_tree_root->index_bits as radix_index.
191 unsigned long radix_index, heap_index; in prio_tree_insert() local195 get_index(root, node, &radix_index, &heap_index); in prio_tree_insert()207 if (r_index == radix_index && h_index == heap_index) in prio_tree_insert()211 (h_index == heap_index && r_index > radix_index)) { in prio_tree_insert()217 r_index = radix_index; in prio_tree_insert()218 radix_index = index; in prio_tree_insert()225 index = heap_index - radix_index; in prio_tree_insert()227 index = radix_index; in prio_tree_insert()