Lines Matching refs:node
23 struct block_range *entry = rb_entry(rb, struct block_range, node);
41 entry = rb_entry(parent, struct block_range, node);
54 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node)
56 struct rb_node **p = &node->rb_left;
58 node = *p;
59 p = &node->rb_right;
61 rb_link_node(left, node, p);
64 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node)
66 struct rb_node **p = &node->rb_right;
68 node = *p;
69 p = &node->rb_left;
71 rb_link_node(right, node, p);
90 entry = rb_entry(parent, struct block_range, node);
109 * If the last node is before, advance one to find the next.
117 next = rb_entry(n, struct block_range, node);
131 rb_link_left_of_node(&head->node, &next->node);
132 rb_insert_color(&head->node, &block_ranges.root);
154 rb_link_node(&entry->node, parent, p);
155 rb_insert_color(&entry->node, &block_ranges.root);
185 rb_link_left_of_node(&head->node, &entry->node);
186 rb_insert_color(&head->node, &block_ranges.root);
225 rb_link_right_of_node(&tail->node, &entry->node);
226 rb_insert_color(&tail->node, &block_ranges.root);
263 rb_link_right_of_node(&tail->node, &entry->node);
264 rb_insert_color(&tail->node, &block_ranges.root);
286 rb_link_left_of_node(&hole->node, &next->node);
287 rb_insert_color(&hole->node, &block_ranges.root);