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
|
use crate::block_device::{BlockDevice, BLOCK_SIZE};
use crate::disk::block::Block;
use crate::AyaFS;
use and_then_some::BoolExt;
use lru::LruCache;
use std::num::NonZeroUsize;
use std::sync::Arc;
#[derive(Clone)]
pub struct CachedBlock<T: Block> {
pub block: T,
pub index: usize,
pub dirty: bool,
}
impl<T: Block> CachedBlock<T> {
fn cast<U: Block>(&self) -> CachedBlock<U> {
unsafe { std::mem::transmute_copy(&self) }
}
}
pub fn convert_mut<U: Block, T: Block>(input_block: &mut CachedBlock<U>) -> &mut CachedBlock<T> {
let ptr = input_block as *const CachedBlock<U> as *mut u8;
let block = ptr.cast::<CachedBlock<T>>();
unsafe { &mut *block }
}
pub fn convert<U: Block, T: Block>(input_block: &CachedBlock<U>) -> &CachedBlock<T> {
let ptr = input_block as *const CachedBlock<U> as *mut u8;
let block = ptr.cast::<CachedBlock<T>>();
unsafe { &*block }
}
pub(crate) struct BlockCache<T: Block> {
device: Arc<dyn BlockDevice>,
cache: LruCache<usize, CachedBlock<T>>,
}
impl<T: Block> BlockCache<T> {
pub(crate) fn new(device: Arc<dyn BlockDevice>, cache_size: usize) -> Self {
Self {
device,
cache: LruCache::new(NonZeroUsize::new(cache_size).unwrap()),
}
}
pub(crate) fn load_block(&mut self, index: usize) -> bool {
if self.cache.contains(&index) == false {
let block = T::default();
let buffer = unsafe {
std::slice::from_raw_parts_mut(&block as *const T as *mut u8, BLOCK_SIZE)
};
self.device.read(index, buffer);
let cached_block = CachedBlock {
block,
index,
dirty: false,
};
if let Some((old_index, old_block)) = self.cache.push(index, cached_block) {
assert_ne!(old_index, index); // 只有 block 不在 cache 里的时候才会插入
if old_block.dirty {
let old_block_ptr = &old_block.block as *const T as *mut u8;
let old_block_buffer =
unsafe { std::slice::from_raw_parts(old_block_ptr, BLOCK_SIZE) };
self.device.write(old_index, old_block_buffer);
}
}
}
true
}
/// 从 LRU cache 里获取一个 block 的引用, 如果没有在 cache 中会加载.
pub(crate) fn get_block<U: Block>(&mut self, index: usize) -> Option<&CachedBlock<U>> {
self.load_block(index)
.and_then(|| self.cache.get(&index).map(convert::<T, U>))
}
/// 从 LRU cache 里获取一个 block 的可变引用, 如果没有在 cache 中会加载.
pub(crate) fn get_block_mut<U: Block>(&mut self, index: usize) -> Option<&mut CachedBlock<U>> {
self.load_block(index)
.and_then(|| self.cache.get_mut(&index).map(convert_mut::<T, U>))
}
/// 从 LRU cache 中读取一个 block 的引用, *不会* 影响 LRU cache 的结构, 如果没有在 cache 中不会加载.
pub(crate) fn peek_block<U: Block>(&self, index: usize) -> Option<&CachedBlock<U>> {
self.cache.peek(&index).map(convert::<T, U>)
}
/// 从 LRU cache 中读取一个 block 的可变引用, *不会* 影响 LRU cache 的结构, 如果没有在 cache 中不会加载.
pub(crate) fn peek_block_mut<U: Block>(&mut self, index: usize) -> Option<&mut CachedBlock<U>> {
self.cache.peek_mut(&index).map(convert_mut::<T, U>)
}
pub(crate) fn update_block<U: Block>(&mut self, block: CachedBlock<U>) -> bool {
if self.cache.contains(&block.index) {
let data_block = convert::<U, T>(&block).clone();
self.cache.push(block.index, data_block);
true
} else {
false
}
}
fn pop(&mut self, entry: &usize) -> Option<CachedBlock<T>> {
self.cache.pop(entry)
}
}
impl AyaFS {
pub(crate) fn load_block(&mut self, index: usize) -> bool {
if !self.data_bitmap.query(index) {
self.cached_blocks.pop(&index);
// deallocate 时只更新 bitmap 没有动 cache, lazy 地驱逐 cache 中的无效 entry.
return false;
}
self.cached_blocks.load_block(index)
}
pub(crate) fn get_block<T: Block>(&mut self, index: usize) -> Option<&CachedBlock<T>> {
self.data_bitmap
.query(index)
.and_then(|| self.cached_blocks.get_block::<T>(index))
}
pub(crate) fn get_block_mut<T: Block>(&mut self, index: usize) -> Option<&mut CachedBlock<T>> {
self.data_bitmap
.query(index)
.and_then(|| self.cached_blocks.get_block_mut::<T>(index))
}
pub(crate) fn peek_block<T: Block>(&self, index: usize) -> Option<&CachedBlock<T>> {
self.data_bitmap
.query(index)
.and_then(|| self.cached_blocks.peek_block::<T>(index))
}
pub(crate) fn peek_block_mut<T: Block>(&mut self, index: usize) -> Option<&mut CachedBlock<T>> {
self.data_bitmap
.query(index)
.and_then(|| self.cached_blocks.peek_block_mut::<T>(index))
}
pub(crate) fn update_block<T: Block>(&mut self, block: CachedBlock<T>) -> bool {
self.cached_blocks.update_block(block)
}
// pub(crate) fn update_block<T: Block>(&mut self, block: CachedBlock<T>) -> bool {
// if self.cached_blocks.contains(&block.index) {
// let data_block = convert::<T, DataBlock>(&block).clone();
// self.cached_blocks.push(block.index, data_block);
// true
// } else {
// false
// }
// }
//
// /// 从 LRU cache 里获取一个 block 的引用, 如果没有在 cache 中会加载.
// pub(crate) fn get_block<T: Block>(&mut self, index: usize) -> Option<&CachedBlock<T>> {
// self.load_block(index)
// .and_then(|| self.cached_blocks.get(&index).map(convert::<DataBlock, T>))
// }
//
// /// 从 LRU cache 里获取一个 block 的可变引用, 如果没有在 cache 中会加载.
// pub(crate) fn get_block_mut<T: Block>(&mut self, index: usize) -> Option<&mut CachedBlock<T>> {
// self.load_block(index).and_then(|| {
// self.cached_blocks
// .get_mut(&index)
// .map(convert_mut::<DataBlock, T>)
// })
// }
//
// /// 从 LRU cache 中读取一个 block 的引用, *不会* 影响 LRU cache 的结构, 如果没有在 cache 中不会加载.
// pub(crate) fn peek_block<T: Block>(&self, index: usize) -> Option<&CachedBlock<T>> {
// self.cached_blocks.peek(&index).map(convert::<DataBlock, T>)
// }
//
// /// 从 LRU cache 中读取一个 block 的可变引用, *不会* 影响 LRU cache 的结构, 如果没有在 cache 中不会加载.
// pub(crate) fn peek_block_mut<T: Block>(&mut self, index: usize) -> Option<&mut CachedBlock<T>> {
// self.cached_blocks.peek_mut(&index).map(convert_mut::<DataBlock, T>)
// }
//
// pub(crate) fn load_block(&mut self, index: usize) -> bool {
// // 先看这个 block 是不是 valid, 不 valid 直接返回 false.
// if !self.data_bitmap.query(index) {
// self.cached_blocks.pop(&index);
// // deallocate 时只更新 bitmap 没有动 cache, lazy 地驱逐 cache 中的无效 entry.
// return false;
// }
//
// // 接下来这个 block 一定 valid. 如果 cache 里没有这个 block 就把它 load 到 cache 里
// if self.cached_blocks.contains(&index) == false {
// let block = DataBlock::default();
// let buffer = unsafe {
// std::slice::from_raw_parts_mut(&block as *const DataBlock as *mut u8, BLOCK_SIZE)
// };
// self.device.read(index, buffer);
// let cached_block = CachedBlock {
// block,
// index,
// dirty: false,
// };
// if let Some((old_index, old_block)) = self.cached_blocks.push(index, cached_block) {
// assert_ne!(old_index, index); // 只有 block 不在 cache 里的时候才会插入
// if old_block.dirty {
// let old_block_ptr = &old_block.block as *const DataBlock as *mut u8;
// let old_block_buffer =
// unsafe { std::slice::from_raw_parts(old_block_ptr, BLOCK_SIZE) };
// self.device.write(old_index, old_block_buffer);
// }
// }
// }
//
// true
// }
}
|
