• Home
  • History
  • Annotate
  • Raw
  • Download

Lines Matching refs:r_index

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