-
Notifications
You must be signed in to change notification settings - Fork 509
/
container_ctree.c
229 lines (196 loc) · 6.87 KB
/
container_ctree.c
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
/*
* Copyright 2015-2016, Intel Corporation
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* * Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* container_ctree.c -- implementation of ctree-based block container
*/
#include "container_ctree.h"
#include "ctree.h"
#include "out.h"
#include "sys_util.h"
/*
* The elements in the tree are sorted by the key and it's vital that the
* order is by size, hence the order of the pack arguments.
*/
#define CHUNK_KEY_PACK(z, c, b, s)\
((uint64_t)(s) << 48 | (uint64_t)(b) << 32 | (uint64_t)(c) << 16 | (z))
#define CHUNK_KEY_GET_ZONE_ID(k)\
((uint16_t)((k & 0xFFFF)))
#define CHUNK_KEY_GET_CHUNK_ID(k)\
((uint16_t)((k & 0xFFFF0000) >> 16))
#define CHUNK_KEY_GET_BLOCK_OFF(k)\
((uint16_t)((k & 0xFFFF00000000) >> 32))
#define CHUNK_KEY_GET_SIZE_IDX(k)\
((uint16_t)((k & 0xFFFF000000000000) >> 48))
struct block_container_ctree {
struct block_container super;
struct ctree *tree;
};
/*
* container_ctree_insert_block -- (internal) inserts a new memory block
* into the container
*/
static int
container_ctree_insert_block(struct block_container *bc,
const struct memory_block *m)
{
/*
* Even though the memory block representation of an object uses
* relatively large types in practise the entire memory block structure
* needs to fit in a single 64 bit value - the type of the key in the
* container tree.
* Given those limitations a reasonable idea might be to make the
* memory_block structure be the size of single uint64_t, which would
* work for now, but if someday someone decides there's a need for
* larger objects the current implementation would allow them to simply
* replace this container instead of making little changes all over
* the heap code.
*/
ASSERT(m->chunk_id < MAX_CHUNK);
ASSERT(m->zone_id < UINT16_MAX);
ASSERTne(m->size_idx, 0);
struct block_container_ctree *c = (struct block_container_ctree *)bc;
uint64_t key = CHUNK_KEY_PACK(m->zone_id, m->chunk_id, m->block_off,
m->size_idx);
return ctree_insert_unlocked(c->tree, key, 0);
}
/*
* container_ctree_get_rm_block_bestfit -- (internal) removes and returns the
* best-fit memory block for size
*/
static int
container_ctree_get_rm_block_bestfit(struct block_container *bc,
struct memory_block *m)
{
uint64_t key = CHUNK_KEY_PACK(m->zone_id, m->chunk_id, m->block_off,
m->size_idx);
struct block_container_ctree *c = (struct block_container_ctree *)bc;
if ((key = ctree_remove_unlocked(c->tree, key, 0)) == 0)
return ENOMEM;
m->chunk_id = CHUNK_KEY_GET_CHUNK_ID(key);
m->zone_id = CHUNK_KEY_GET_ZONE_ID(key);
m->block_off = CHUNK_KEY_GET_BLOCK_OFF(key);
m->size_idx = CHUNK_KEY_GET_SIZE_IDX(key);
memblock_rebuild_state(bc->heap, m);
return 0;
}
/*
* container_ctree_get_rm_block_exact --
* (internal) removes exact match memory block
*/
static int
container_ctree_get_rm_block_exact(struct block_container *bc,
const struct memory_block *m)
{
uint64_t key = CHUNK_KEY_PACK(m->zone_id, m->chunk_id, m->block_off,
m->size_idx);
struct block_container_ctree *c = (struct block_container_ctree *)bc;
if ((key = ctree_remove_unlocked(c->tree, key, 1)) == 0)
return ENOMEM;
return 0;
}
/*
* container_ctree_get_block_exact -- (internal) finds exact match memory block
*/
static int
container_ctree_get_block_exact(struct block_container *bc,
const struct memory_block *m)
{
uint64_t key = CHUNK_KEY_PACK(m->zone_id, m->chunk_id, m->block_off,
m->size_idx);
struct block_container_ctree *c = (struct block_container_ctree *)bc;
return ctree_find_unlocked(c->tree, key) == key ? 0 : ENOMEM;
}
/*
* container_ctree_is_empty -- (internal) checks whether the bucket is empty
*/
static int
container_ctree_is_empty(struct block_container *bc)
{
struct block_container_ctree *c = (struct block_container_ctree *)bc;
return ctree_is_empty_unlocked(c->tree);
}
/*
* container_ctree_rm_all -- (internal) removes all elements from the tree
*/
static void
container_ctree_rm_all(struct block_container *bc)
{
struct block_container_ctree *c = (struct block_container_ctree *)bc;
ctree_clear_unlocked(c->tree);
}
/*
* container_ctree_delete -- (internal) deletes the container
*/
static void
container_ctree_destroy(struct block_container *bc)
{
struct block_container_ctree *c = (struct block_container_ctree *)bc;
ctree_delete(c->tree);
Free(c);
}
/*
* Tree-based block container used to provide best-fit functionality to the
* bucket. The time complexity for this particular container is O(k) where k is
* the length of the key.
*
* The get methods also guarantee that the block with lowest possible address
* that best matches the requirements is provided.
*/
static struct block_container_ops container_ctree_ops = {
.insert = container_ctree_insert_block,
.get_rm_exact = container_ctree_get_rm_block_exact,
.get_rm_bestfit = container_ctree_get_rm_block_bestfit,
.get_exact = container_ctree_get_block_exact,
.is_empty = container_ctree_is_empty,
.rm_all = container_ctree_rm_all,
.destroy = container_ctree_destroy,
};
/*
* container_new_ctree -- allocates and initializes a ctree container
*/
struct block_container *
container_new_ctree(struct palloc_heap *heap)
{
struct block_container_ctree *bc = Malloc(sizeof(*bc));
if (bc == NULL)
goto error_container_malloc;
bc->super.heap = heap;
bc->super.c_ops = &container_ctree_ops;
bc->tree = ctree_new();
if (bc->tree == NULL)
goto error_ctree_new;
return (struct block_container *)&bc->super;
error_ctree_new:
Free(bc);
error_container_malloc:
return NULL;
}