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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
|
/*
* Copyright (c) 2013 Grzegorz Kostka (kostka.grzegorz@gmail.com)
* All rights reserved.
*
* 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.
* - The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
/** @addtogroup lwext4
* @{
*/
/**
* @file ext4_bcache.h
* @brief Block cache allocator.
*/
#ifndef EXT4_BCACHE_H_
#define EXT4_BCACHE_H_
#ifdef __cplusplus
extern "C" {
#endif
#include <ext4_config.h>
#include <stdint.h>
#include <stdbool.h>
#include <misc/tree.h>
#include <misc/queue.h>
#define EXT4_BLOCK_ZERO() \
{.lb_id = 0, .data = 0}
/**@brief Single block descriptor*/
struct ext4_block {
/**@brief Logical block ID*/
uint64_t lb_id;
/**@brief Buffer */
struct ext4_buf *buf;
/**@brief Data buffer.*/
uint8_t *data;
};
struct ext4_bcache;
/**@brief Single block descriptor*/
struct ext4_buf {
/**@brief Flags*/
int flags;
/**@brief Logical block address*/
uint64_t lba;
/**@brief Data buffer.*/
uint8_t *data;
/**@brief LRU priority. (unused) */
uint32_t lru_prio;
/**@brief LRU id.*/
uint32_t lru_id;
/**@brief Reference count table*/
uint32_t refctr;
/**@brief The block cache this buffer belongs to. */
struct ext4_bcache *bc;
/**@brief Whether or not buffer is on dirty list.*/
bool on_dirty_list;
/**@brief LBA tree node*/
RB_ENTRY(ext4_buf) lba_node;
/**@brief LRU tree node*/
RB_ENTRY(ext4_buf) lru_node;
/**@brief Dirty list node*/
SLIST_ENTRY(ext4_buf) dirty_node;
/**@brief Callback routine after a disk-write operation.
* @param bc block cache descriptor
* @param buf buffer descriptor
* @param standard error code returned by bdev->bwrite()
* @param arg argument passed to this routine*/
void (*end_write)(struct ext4_bcache *bc,
struct ext4_buf *buf,
int res,
void *arg);
/**@brief argument passed to end_write() callback.*/
void *end_write_arg;
};
/**@brief Block cache descriptor*/
struct ext4_bcache {
/**@brief Item count in block cache*/
uint32_t cnt;
/**@brief Item size in block cache*/
uint32_t itemsize;
/**@brief Last recently used counter*/
uint32_t lru_ctr;
/**@brief Currently referenced datablocks*/
uint32_t ref_blocks;
/**@brief Maximum referenced datablocks*/
uint32_t max_ref_blocks;
/**@brief The blockdev binded to this block cache*/
struct ext4_blockdev *bdev;
/**@brief The cache should not be shaked */
bool dont_shake;
/**@brief A tree holding all bufs*/
RB_HEAD(ext4_buf_lba, ext4_buf) lba_root;
/**@brief A tree holding unreferenced bufs*/
RB_HEAD(ext4_buf_lru, ext4_buf) lru_root;
/**@brief A singly-linked list holding dirty buffers*/
SLIST_HEAD(ext4_buf_dirty, ext4_buf) dirty_list;
};
/**@brief buffer state bits
*
* - BC♡UPTODATE: Buffer contains valid data.
* - BC_DIRTY: Buffer is dirty.
* - BC_FLUSH: Buffer will be immediately flushed,
* when no one references it.
* - BC_TMP: Buffer will be dropped once its refctr
* reaches zero.
*/
enum bcache_state_bits {
BC_UPTODATE,
BC_DIRTY,
BC_FLUSH,
BC_TMP
};
#define ext4_bcache_set_flag(buf, b) \
(buf)->flags |= 1 << (b)
#define ext4_bcache_clear_flag(buf, b) \
(buf)->flags &= ~(1 << (b))
#define ext4_bcache_test_flag(buf, b) \
(((buf)->flags & (1 << (b))) >> (b))
static inline void ext4_bcache_set_dirty(struct ext4_buf *buf) {
ext4_bcache_set_flag(buf, BC_UPTODATE);
ext4_bcache_set_flag(buf, BC_DIRTY);
}
static inline void ext4_bcache_clear_dirty(struct ext4_buf *buf) {
ext4_bcache_clear_flag(buf, BC_UPTODATE);
ext4_bcache_clear_flag(buf, BC_DIRTY);
}
/**@brief Increment reference counter of buf by 1.*/
#define ext4_bcache_inc_ref(buf) ((buf)->refctr++)
/**@brief Decrement reference counter of buf by 1.*/
#define ext4_bcache_dec_ref(buf) ((buf)->refctr--)
/**@brief Insert buffer to dirty cache list
* @param bc block cache descriptor
* @param buf buffer descriptor */
static inline void
ext4_bcache_insert_dirty_node(struct ext4_bcache *bc, struct ext4_buf *buf) {
if (!buf->on_dirty_list) {
SLIST_INSERT_HEAD(&bc->dirty_list, buf, dirty_node);
buf->on_dirty_list = true;
}
}
/**@brief Remove buffer to dirty cache list
* @param bc block cache descriptor
* @param buf buffer descriptor */
static inline void
ext4_bcache_remove_dirty_node(struct ext4_bcache *bc, struct ext4_buf *buf) {
if (buf->on_dirty_list) {
SLIST_REMOVE(&bc->dirty_list, buf, ext4_buf, dirty_node);
buf->on_dirty_list = false;
}
}
/**@brief Dynamic initialization of block cache.
* @param bc block cache descriptor
* @param cnt items count in block cache
* @param itemsize single item size (in bytes)
* @return standard error code*/
int ext4_bcache_init_dynamic(struct ext4_bcache *bc, uint32_t cnt,
uint32_t itemsize);
/**@brief Do cleanup works on block cache.
* @param bc block cache descriptor.*/
void ext4_bcache_cleanup(struct ext4_bcache *bc);
/**@brief Dynamic de-initialization of block cache.
* @param bc block cache descriptor
* @return standard error code*/
int ext4_bcache_fini_dynamic(struct ext4_bcache *bc);
/**@brief Get a buffer with the lowest LRU counter in bcache.
* @param bc block cache descriptor
* @return buffer with the lowest LRU counter*/
struct ext4_buf *ext4_buf_lowest_lru(struct ext4_bcache *bc);
/**@brief Drop unreferenced buffer from bcache.
* @param bc block cache descriptor
* @param buf buffer*/
void ext4_bcache_drop_buf(struct ext4_bcache *bc, struct ext4_buf *buf);
/**@brief Invalidate a buffer.
* @param bc block cache descriptor
* @param buf buffer*/
void ext4_bcache_invalidate_buf(struct ext4_bcache *bc,
struct ext4_buf *buf);
/**@brief Invalidate a range of buffers.
* @param bc block cache descriptor
* @param from starting lba
* @param cnt block counts
* @param buf buffer*/
void ext4_bcache_invalidate_lba(struct ext4_bcache *bc,
uint64_t from,
uint32_t cnt);
/**@brief Find existing buffer from block cache memory.
* Unreferenced block allocation is based on LRU
* (Last Recently Used) algorithm.
* @param bc block cache descriptor
* @param b block to alloc
* @param lba logical block address
* @return block cache buffer */
struct ext4_buf *
ext4_bcache_find_get(struct ext4_bcache *bc, struct ext4_block *b,
uint64_t lba);
/**@brief Allocate block from block cache memory.
* Unreferenced block allocation is based on LRU
* (Last Recently Used) algorithm.
* @param bc block cache descriptor
* @param b block to alloc
* @param is_new block is new (needs to be read)
* @return standard error code*/
int ext4_bcache_alloc(struct ext4_bcache *bc, struct ext4_block *b,
bool *is_new);
/**@brief Free block from cache memory (decrement reference counter).
* @param bc block cache descriptor
* @param b block to free
* @return standard error code*/
int ext4_bcache_free(struct ext4_bcache *bc, struct ext4_block *b);
/**@brief Return a full status of block cache.
* @param bc block cache descriptor
* @return full status*/
bool ext4_bcache_is_full(struct ext4_bcache *bc);
#ifdef __cplusplus
}
#endif
#endif /* EXT4_BCACHE_H_ */
/**
* @}
*/
|