Lines Matching defs:r_index
173 unsigned long r_index, h_index, index, mask;
186 get_index(cur, &r_index, &h_index);
188 if (r_index == radix_index && h_index == heap_index)
192 (h_index == heap_index && r_index > radix_index)) {
197 index = r_index;
198 r_index = radix_index;
248 unsigned long r_index, h_index_right, h_index_left;
254 get_index(cur->left, &r_index, &h_index_left);
261 get_index(cur->right, &r_index, &h_index_right);
298 unsigned long *r_index, unsigned long *h_index)
303 get_index(iter->cur->left, r_index, h_index);
305 if (iter->r_index <= *h_index) {
329 unsigned long *r_index, unsigned long *h_index)
344 get_index(iter->cur->right, r_index, h_index);
346 if (iter->r_index <= *h_index) {
387 unsigned long r_index, unsigned long h_index)
389 return iter->h_index >= r_index && iter->r_index <= h_index;
402 unsigned long r_index, h_index;
410 get_index(root->prio_tree_node, &r_index, &h_index);
412 if (iter->r_index > h_index)
419 if (overlap(iter, r_index, h_index))
422 if (prio_tree_left(iter, &r_index, &h_index))
425 if (prio_tree_right(iter, &r_index, &h_index))
440 unsigned long r_index, h_index;
446 while (prio_tree_left(iter, &r_index, &h_index))
447 if (overlap(iter, r_index, h_index))
450 while (!prio_tree_right(iter, &r_index, &h_index)) {
461 if (overlap(iter, r_index, h_index))
