Lines Matching defs:node
7 * interval_end - return end of @node
10 sector_t interval_end(struct rb_node *node)
12 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb);
16 #define NODE_END(node) ((node)->sector + ((node)->size >> 9))
62 * Returns if the tree contains the node @interval with start sector @start.
71 struct rb_node *node = root->rb_node;
73 while (node) {
75 rb_entry(node, struct drbd_interval, rb);
78 node = node->rb_left;
80 node = node->rb_right;
82 node = node->rb_left;
84 node = node->rb_right;
114 struct rb_node *node = root->rb_node;
120 while (node) {
122 rb_entry(node, struct drbd_interval, rb);
124 if (node->rb_left &&
125 sector < interval_end(node->rb_left)) {
127 node = node->rb_left;
134 node = node->rb_right;
145 struct rb_node *node;
148 node = rb_next(&i->rb);
149 if (!node)
151 i = rb_entry(node, struct drbd_interval, rb);