Lines Matching defs:node
19 struct block_range *entry = rb_entry(rb, struct block_range, node);
37 entry = rb_entry(parent, struct block_range, node);
50 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node)
52 struct rb_node **p = &node->rb_left;
54 node = *p;
55 p = &node->rb_right;
57 rb_link_node(left, node, p);
60 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node)
62 struct rb_node **p = &node->rb_right;
64 node = *p;
65 p = &node->rb_left;
67 rb_link_node(right, node, p);
86 entry = rb_entry(parent, struct block_range, node);
105 * If the last node is before, advance one to find the next.
113 next = rb_entry(n, struct block_range, node);
127 rb_link_left_of_node(&head->node, &next->node);
128 rb_insert_color(&head->node, &block_ranges.root);
150 rb_link_node(&entry->node, parent, p);
151 rb_insert_color(&entry->node, &block_ranges.root);
181 rb_link_left_of_node(&head->node, &entry->node);
182 rb_insert_color(&head->node, &block_ranges.root);
221 rb_link_right_of_node(&tail->node, &entry->node);
222 rb_insert_color(&tail->node, &block_ranges.root);
259 rb_link_right_of_node(&tail->node, &entry->node);
260 rb_insert_color(&tail->node, &block_ranges.root);
282 rb_link_left_of_node(&hole->node, &next->node);
283 rb_insert_color(&hole->node, &block_ranges.root);