Lines Matching refs:rb_node
22 static int cache_tree_comp_range(struct rb_node *node, void *data) in cache_tree_comp_range()
28 entry = rb_entry(node, struct cache_extent, rb_node); in cache_tree_comp_range()
38 static int cache_tree_comp_nodes(struct rb_node *node1, struct rb_node *node2) in cache_tree_comp_nodes()
43 entry = rb_entry(node2, struct cache_extent, rb_node); in cache_tree_comp_nodes()
50 static int cache_tree_comp_range2(struct rb_node *node, void *data) in cache_tree_comp_range2()
56 entry = rb_entry(node, struct cache_extent, rb_node); in cache_tree_comp_range2()
70 static int cache_tree_comp_nodes2(struct rb_node *node1, struct rb_node *node2) in cache_tree_comp_nodes2()
75 entry = rb_entry(node2, struct cache_extent, rb_node); in cache_tree_comp_nodes2()
118 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes); in insert_cache_extent()
123 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes2); in insert_cache_extent2()
129 struct rb_node *node; in lookup_cache_extent()
139 entry = rb_entry(node, struct cache_extent, rb_node); in lookup_cache_extent()
146 struct rb_node *node; in lookup_cache_extent2()
157 entry = rb_entry(node, struct cache_extent, rb_node); in lookup_cache_extent2()
163 struct rb_node *next; in search_cache_extent()
164 struct rb_node *node; in search_cache_extent()
176 entry = rb_entry(node, struct cache_extent, rb_node); in search_cache_extent()
183 struct rb_node *next; in search_cache_extent2()
184 struct rb_node *node; in search_cache_extent2()
197 entry = rb_entry(node, struct cache_extent, rb_node); in search_cache_extent2()
203 struct rb_node *node = rb_first(&tree->root); in first_cache_extent()
207 return rb_entry(node, struct cache_extent, rb_node); in first_cache_extent()
212 struct rb_node *node = rb_last(&tree->root); in last_cache_extent()
216 return rb_entry(node, struct cache_extent, rb_node); in last_cache_extent()
221 struct rb_node *node = rb_prev(&pe->rb_node); in prev_cache_extent()
225 return rb_entry(node, struct cache_extent, rb_node); in prev_cache_extent()
230 struct rb_node *node = rb_next(&pe->rb_node); in next_cache_extent()
234 return rb_entry(node, struct cache_extent, rb_node); in next_cache_extent()
239 rb_erase(&pe->rb_node, &tree->root); in remove_cache_extent()