Searched refs:subtree_last (Results 1 – 4 of 4) sorted by relevance
659 if (child->subtree_last > max) { in interval_tree_compute_max()660 max = child->subtree_last; in interval_tree_compute_max()665 if (child->subtree_last > max) { in interval_tree_compute_max()666 max = child->subtree_last; in interval_tree_compute_max()669 if (exit && node->subtree_last == max) { in interval_tree_compute_max()672 node->subtree_last = max; in interval_tree_compute_max()692 new->subtree_last = old->subtree_last; in interval_tree_copy()700 new->subtree_last = old->subtree_last; in interval_tree_rotate()722 if (parent->subtree_last < last) { in interval_tree_insert()723 parent->subtree_last = last; in interval_tree_insert()[all …]
310 unsigned long max = node->last, subtree_last;312 subtree_last = rb_entry(node->rb.rb_left,314 if (max < subtree_last)315 max = subtree_last;318 subtree_last = rb_entry(node->rb.rb_right,320 if (max < subtree_last)321 max = subtree_last;331 unsigned long subtree_last = compute_subtree_last(node);332 if (node->__subtree_last == subtree_last)334 node->__subtree_last = subtree_last;
348 unsigned long max = node->last, subtree_last;350 subtree_last = rb_entry(node->rb.rb_left,352 if (max < subtree_last)353 max = subtree_last;356 subtree_last = rb_entry(node->rb.rb_right,358 if (max < subtree_last)359 max = subtree_last;369 unsigned long subtree_last = compute_subtree_last(node);370 if (node->__subtree_last == subtree_last)372 node->__subtree_last = subtree_last;
40 uint64_t subtree_last; member