Lines Matching refs:node
6 * interval_end - return end of @node
9 sector_t interval_end(struct rb_node *node)
11 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb);
16 * compute_subtree_last - compute end of @node
19 * node and of its children. Called for @node and its parents whenever the end
23 compute_subtree_last(struct drbd_interval *node)
25 sector_t max = node->sector + (node->size >> 9);
27 if (node->rb.rb_left) {
28 sector_t left = interval_end(node->rb.rb_left);
32 if (node->rb.rb_right) {
33 sector_t right = interval_end(node->rb.rb_right);
84 * Returns if the tree contains the node @interval with start sector @start.
93 struct rb_node *node = root->rb_node;
95 while (node) {
97 rb_entry(node, struct drbd_interval, rb);
100 node = node->rb_left;
102 node = node->rb_right;
104 node = node->rb_left;
106 node = node->rb_right;
136 struct rb_node *node = root->rb_node;
142 while (node) {
144 rb_entry(node, struct drbd_interval, rb);
146 if (node->rb_left &&
147 sector < interval_end(node->rb_left)) {
149 node = node->rb_left;
156 node = node->rb_right;
167 struct rb_node *node;
170 node = rb_next(&i->rb);
171 if (!node)
173 i = rb_entry(node, struct drbd_interval, rb);