Lines Matching refs:node
9 sector_t interval_end(struct rb_node *node) in interval_end() argument
11 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb); in interval_end()
23 compute_subtree_last(struct drbd_interval *node) in compute_subtree_last() argument
25 sector_t max = node->sector + (node->size >> 9); in compute_subtree_last()
27 if (node->rb.rb_left) { in compute_subtree_last()
28 sector_t left = interval_end(node->rb.rb_left); in compute_subtree_last()
32 if (node->rb.rb_right) { in compute_subtree_last()
33 sector_t right = interval_end(node->rb.rb_right); in compute_subtree_last()
43 struct drbd_interval *node = rb_entry(rb, struct drbd_interval, rb); in augment_propagate() local
44 sector_t subtree_last = compute_subtree_last(node); in augment_propagate()
45 if (node->end == subtree_last) in augment_propagate()
47 node->end = subtree_last; in augment_propagate()
48 rb = rb_parent(&node->rb); in augment_propagate()
121 struct rb_node *node = root->rb_node; in drbd_contains_interval() local
123 while (node) { in drbd_contains_interval()
125 rb_entry(node, struct drbd_interval, rb); in drbd_contains_interval()
128 node = node->rb_left; in drbd_contains_interval()
130 node = node->rb_right; in drbd_contains_interval()
132 node = node->rb_left; in drbd_contains_interval()
134 node = node->rb_right; in drbd_contains_interval()
164 struct rb_node *node = root->rb_node; in drbd_find_overlap() local
170 while (node) { in drbd_find_overlap()
172 rb_entry(node, struct drbd_interval, rb); in drbd_find_overlap()
174 if (node->rb_left && in drbd_find_overlap()
175 sector < interval_end(node->rb_left)) { in drbd_find_overlap()
177 node = node->rb_left; in drbd_find_overlap()
184 node = node->rb_right; in drbd_find_overlap()
195 struct rb_node *node; in drbd_next_overlap() local
198 node = rb_next(&i->rb); in drbd_next_overlap()
199 if (!node) in drbd_next_overlap()
201 i = rb_entry(node, struct drbd_interval, rb); in drbd_next_overlap()