Lines Matching refs:trees

32 overflow-sub-trees to handle each possible radix_index. For example,
33 in figure we have 3 overflow-sub-trees corresponding to radix indices
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
65   5	     [0,3,3]		     [2,2,4]		  [4,0,4]				 |  Overflow-sub-trees
83 We do not optimize the height of overflow-sub-trees using index_bits.
84 The reason is: there can be many such overflow-sub-trees and all of
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
90 of size_index. This may lead to skewed sub-trees because most of the
92 the example above, all 3 overflow-sub-trees are skewed. This may marginally
95 do not require overflow-sub-trees to index all vmas.
99 However, in most of the common cases we do not need overflow-sub-trees,