2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
20 #include "kerncompat.h"
21 #include "extent-cache.h"
23 struct cache_extent_search_range {
28 void cache_tree_init(struct cache_tree *tree)
33 static int cache_tree_comp_range(struct rb_node *node, void *data)
35 struct cache_extent *entry;
36 struct cache_extent_search_range *range;
38 range = (struct cache_extent_search_range *)data;
39 entry = rb_entry(node, struct cache_extent, rb_node);
41 if (entry->start + entry->size <= range->start)
43 else if (range->start + range->size <= entry->start)
49 static int cache_tree_comp_nodes(struct rb_node *node1, struct rb_node *node2)
51 struct cache_extent *entry;
52 struct cache_extent_search_range range;
54 entry = rb_entry(node2, struct cache_extent, rb_node);
55 range.start = entry->start;
56 range.size = entry->size;
58 return cache_tree_comp_range(node1, (void *)&range);
61 struct cache_extent *alloc_cache_extent(u64 start, u64 size)
63 struct cache_extent *pe = malloc(sizeof(*pe));
73 int insert_cache_extent(struct cache_tree *tree, struct cache_extent *pe)
75 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes);
78 int add_cache_extent(struct cache_tree *tree, u64 start, u64 size)
80 struct cache_extent *pe = alloc_cache_extent(start, size);
84 fprintf(stderr, "memory allocation failed\n");
88 ret = insert_cache_extent(tree, pe);
95 struct cache_extent *find_cache_extent(struct cache_tree *tree,
99 struct cache_extent *entry;
100 struct cache_extent_search_range range;
104 node = rb_search(&tree->root, &range, cache_tree_comp_range, NULL);
108 entry = rb_entry(node, struct cache_extent, rb_node);
112 struct cache_extent *find_first_cache_extent(struct cache_tree *tree, u64 start)
114 struct rb_node *next;
115 struct rb_node *node;
116 struct cache_extent *entry;
117 struct cache_extent_search_range range;
121 node = rb_search(&tree->root, &range, cache_tree_comp_range, &next);
127 entry = rb_entry(node, struct cache_extent, rb_node);
131 struct cache_extent *first_cache_extent(struct cache_tree *tree)
133 struct rb_node *node = rb_first(&tree->root);
137 return rb_entry(node, struct cache_extent, rb_node);
140 struct cache_extent *prev_cache_extent(struct cache_extent *pe)
142 struct rb_node *node = rb_prev(&pe->rb_node);
146 return rb_entry(node, struct cache_extent, rb_node);
149 struct cache_extent *next_cache_extent(struct cache_extent *pe)
151 struct rb_node *node = rb_next(&pe->rb_node);
155 return rb_entry(node, struct cache_extent, rb_node);
158 void remove_cache_extent(struct cache_tree *tree, struct cache_extent *pe)
160 rb_erase(&pe->rb_node, &tree->root);
163 void cache_tree_free_extents(struct cache_tree *tree,
164 free_cache_extent free_func)
166 struct cache_extent *ce;
168 while ((ce = first_cache_extent(tree))) {
169 remove_cache_extent(tree, ce);