struct rb_root *root = &tree->state;
struct rb_node **node = &root->rb_node;
struct rb_node *prev = NULL;
- struct tree_entry *entry;
+ struct extent_state *entry;
while (*node) {
prev = *node;
- entry = rb_entry(prev, struct tree_entry, rb_node);
+ entry = rb_entry(prev, struct extent_state, rb_node);
if (offset < entry->start)
node = &(*node)->rb_left;
/* Search neighbors until we find the first one past the end */
while (prev && offset > entry->end) {
prev = rb_next(prev);
- entry = rb_entry(prev, struct tree_entry, rb_node);
+ entry = rb_entry(prev, struct extent_state, rb_node);
}
return prev;
struct rb_node **node = &root->rb_node;
struct rb_node *prev = NULL;
struct rb_node *orig_prev = NULL;
- struct tree_entry *entry;
+ struct extent_state *entry;
ASSERT(prev_ret);
ASSERT(next_ret);
while (*node) {
prev = *node;
- entry = rb_entry(prev, struct tree_entry, rb_node);
+ entry = rb_entry(prev, struct extent_state, rb_node);
if (offset < entry->start)
node = &(*node)->rb_left;
orig_prev = prev;
while (prev && offset > entry->end) {
prev = rb_next(prev);
- entry = rb_entry(prev, struct tree_entry, rb_node);
+ entry = rb_entry(prev, struct extent_state, rb_node);
}
*next_ret = prev;
prev = orig_prev;
- entry = rb_entry(prev, struct tree_entry, rb_node);
+ entry = rb_entry(prev, struct extent_state, rb_node);
while (prev && offset < entry->start) {
prev = rb_prev(prev);
- entry = rb_entry(prev, struct tree_entry, rb_node);
+ entry = rb_entry(prev, struct extent_state, rb_node);
}
*prev_ret = prev;
node = &tree->state.rb_node;
while (*node) {
- struct tree_entry *entry;
+ struct extent_state *entry;
parent = *node;
- entry = rb_entry(parent, struct tree_entry, rb_node);
+ entry = rb_entry(parent, struct extent_state, rb_node);
if (end < entry->start) {
node = &(*node)->rb_left;
parent = &orig->rb_node;
node = &parent;
while (*node) {
- struct tree_entry *entry;
+ struct extent_state *entry;
parent = *node;
- entry = rb_entry(parent, struct tree_entry, rb_node);
+ entry = rb_entry(parent, struct extent_state, rb_node);
if (prealloc->end < entry->start) {
node = &(*node)->rb_left;