Searched refs:radix_index (Results 1 - 1 of 1) sorted by relevance
| /external/fio/lib/ |
| H A D | prio_tree.c | 30 * In our implementation, we store closed intervals of the form [radix_index,
31 * heap_index]. We assume that always radix_index <= heap_index. McCreight's PST
33 * interval have different radix_index. However, this limitation can be easily
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].
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);
188 if (r_index == radix_index && h_index == heap_index)
192 (h_index == heap_index && r_index > radix_index)) {
[all...] |
Completed in 333 milliseconds