1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/*
* Copyright (C) 2007 Oracle. All rights reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public
* License v2 as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 021110-1307, USA.
*/
#include <stdio.h>
#include <stdlib.h>
#include "kerncompat.h"
#include "pending-extent.h"
void pending_tree_init(struct pending_tree *tree)
{
tree->root.rb_node = NULL;
}
static struct rb_node *tree_insert(struct rb_root *root, u64 offset,
u64 size, struct rb_node *node)
{
struct rb_node ** p = &root->rb_node;
struct rb_node * parent = NULL;
struct pending_extent *entry;
while(*p) {
parent = *p;
entry = rb_entry(parent, struct pending_extent, rb_node);
if (offset + size <= entry->start)
p = &(*p)->rb_left;
else if (offset >= entry->start + entry->size)
p = &(*p)->rb_right;
else
return parent;
}
entry = rb_entry(parent, struct pending_extent, rb_node);
rb_link_node(node, parent, p);
rb_insert_color(node, root);
return NULL;
}
static struct rb_node *__tree_search(struct rb_root *root, u64 offset,
u64 size, struct rb_node **prev_ret)
{
struct rb_node * n = root->rb_node;
struct rb_node *prev = NULL;
struct pending_extent *entry;
struct pending_extent *prev_entry = NULL;
while(n) {
entry = rb_entry(n, struct pending_extent, rb_node);
prev = n;
prev_entry = entry;
if (offset + size <= entry->start)
n = n->rb_left;
else if (offset >= entry->start + entry->size)
n = n->rb_right;
else
return n;
}
if (!prev_ret)
return NULL;
while(prev && offset >= prev_entry->start + prev_entry->size) {
prev = rb_next(prev);
prev_entry = rb_entry(prev, struct pending_extent, rb_node);
}
*prev_ret = prev;
return NULL;
}
struct pending_extent *alloc_pending_extent(u64 start, u64 size)
{
struct pending_extent *pe = malloc(sizeof(*pe));
if (!pe)
return pe;
pe->start = start;
pe->size = size;
return pe;
}
int insert_pending_extent(struct pending_tree *tree, u64 start, u64 size)
{
struct pending_extent *pe = alloc_pending_extent(start, size);
struct rb_node *found;
found = tree_insert(&tree->root, start, size, &pe->rb_node);
if (found)
return -EEXIST;
return 0;
}
struct pending_extent *find_pending_extent(struct pending_tree *tree,
u64 start, u64 size)
{
struct rb_node *prev;
struct rb_node *ret;
struct pending_extent *entry;
ret = __tree_search(&tree->root, start, size, &prev);
if (!ret)
return NULL;
entry = rb_entry(ret, struct pending_extent, rb_node);
return entry;
}
struct pending_extent *find_first_pending_extent(struct pending_tree *tree,
u64 start)
{
struct rb_node *prev;
struct rb_node *ret;
struct pending_extent *entry;
ret = __tree_search(&tree->root, start, 1, &prev);
if (!ret)
ret = prev;
if (!ret)
return NULL;
entry = rb_entry(ret, struct pending_extent, rb_node);
return entry;
}
struct pending_extent *next_pending_extent(struct pending_extent *pe)
{
struct rb_node *node = rb_next(&pe->rb_node);
if (!node)
return NULL;
return rb_entry(node, struct pending_extent, rb_node);
}
void remove_pending_extent(struct pending_tree *tree,
struct pending_extent *pe)
{
rb_erase(&pe->rb_node, &tree->root);
}
|
