Searched refs:heap_index (Results 1 - 1 of 1) sorted by relevance
| /external/fio/lib/ |
| H A D | prio_tree.c | 31 * heap_index]. We assume that always radix_index <= heap_index. McCreight's PST
34 * overcome by using the size, i.e., heap_index - radix_index, as part of the
35 * index, so we index the tree using [(radix_index,size), heap_index].
62 * Maximum heap_index that can be stored in a PST with index_bits bits
70 * Extend a priority search tree so that it can store a node with heap_index
161 * required to represent the maximum heap_index. In the worst case, the algo
164 * If a prior node with same radix_index and heap_index is already found in
172 unsigned long radix_index, heap_index; local
176 get_index(node, &radix_index, &heap_index);
[all...] |
Completed in 71 milliseconds