Lines Matching full:using

1 The prio_tree.c code indexes vmas using 3 different indexes:
6 A regular radix-priority-search-tree indexes vmas using only heap_index and
14 	* nodes are hashed to left or right subtree using radix_index
24 linked using vm_set.list, 2) if there are many vmas with the same radix
27 vmas using heap and size indices instead of heap and radix indices. For
37 are indexed using heap and radix indices whereas the overflow-sub-trees below
39 indexed using heap and size indices. In overflow-sub-trees the size_index
81 is indexed properly using heap and radix indices.
83 We do not optimize the height of overflow-sub-trees using index_bits.
88 heap-and-size indexed overflow-sub-trees using prio_tree->index_bits.
89 Instead the overflow sub-trees are indexed using full BITS_PER_LONG bits