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
use std::collections::BTreeMap;
use std::fmt::{Debug, Display, Formatter};
use std::sync::atomic::{AtomicU64, Ordering};
use std::sync::RwLock;
#[derive(Default)]
pub struct InodeBitmap {
map: RwLock<BTreeMap<u64, AtomicU64>>,
}
impl Debug for InodeBitmap {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
f.write_str(self.to_string().as_str())
}
}
impl Display for InodeBitmap {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
f.write_str(
serde_json::json!({"inode_range": self.bitmap_to_array()})
.to_string()
.as_str(),
)
}
}
impl InodeBitmap {
pub fn new() -> Self {
Self::default()
}
#[inline(always)]
fn get_index_and_mask(ino: u64) -> (u64, u64) {
(ino >> 6, 1_u64 << (ino & 0x3f_u64))
}
#[inline(always)]
fn range_to_vec(start: u64, end: u64) -> Vec<u64> {
if start == end {
vec![start]
} else {
vec![start, end]
}
}
pub fn set(&self, ino: u64) {
let (index, mask) = Self::get_index_and_mask(ino);
let m = self.map.read().unwrap();
if let Some(v) = m.get(&index) {
v.fetch_or(mask, Ordering::Relaxed);
return;
}
drop(m);
let mut m = self.map.write().unwrap();
m.entry(index)
.or_insert_with(|| AtomicU64::new(0))
.fetch_or(mask, Ordering::Relaxed);
}
pub fn is_set(&self, ino: u64) -> bool {
let (index, mask) = InodeBitmap::get_index_and_mask(ino);
self.map
.read()
.unwrap()
.get(&index)
.map_or(false, |v| v.load(Ordering::Relaxed) & mask != 0)
}
pub fn clear(&self, ino: u64) {
let (index, mask) = InodeBitmap::get_index_and_mask(ino);
let m = self.map.read().unwrap();
if let Some(v) = m.get(&index) {
v.fetch_and(!mask, Ordering::Relaxed);
}
}
pub fn clear_all(&self) {
let m = self.map.read().unwrap();
for it in m.values() {
it.store(0_u64, Ordering::Relaxed);
}
}
fn bitmap_to_vec(&self, load: fn(&AtomicU64) -> u64) -> Vec<Vec<u64>> {
let m = self.map.read().unwrap();
let mut ret: Vec<Vec<u64>> = Vec::new();
let mut start: Option<u64> = None;
let mut last: u64 = 0;
for it in m.iter() {
let base = it.0 << 6;
let mut v = load(it.1);
while v != 0 {
let ino = base + v.trailing_zeros() as u64;
v &= v - 1;
start = match start {
None => Some(ino),
Some(s) => {
if ino != last + 1 {
ret.push(InodeBitmap::range_to_vec(s, last));
Some(ino)
} else {
Some(s)
}
}
};
last = ino;
}
}
if let Some(s) = start {
ret.push(InodeBitmap::range_to_vec(s, last));
}
ret
}
pub fn bitmap_to_array(&self) -> Vec<Vec<u64>> {
self.bitmap_to_vec(|v| v.load(Ordering::Relaxed))
}
pub fn bitmap_to_array_and_clear(&self) -> Vec<Vec<u64>> {
self.bitmap_to_vec(|v| v.fetch_and(0_u64, Ordering::Relaxed))
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_inode_bitmap() {
let empty: Vec<Vec<u64>> = Vec::new();
let m = InodeBitmap::new();
m.set(1);
m.set(2);
m.set(5);
assert_eq!(m.bitmap_to_array(), [vec![1, 2], vec![5]]);
assert!(m.is_set(2));
m.clear(2);
assert!(!m.is_set(2));
assert_eq!(m.bitmap_to_array(), [[1], [5]]);
m.set(65);
m.set(66);
m.set(4000);
m.set(40001);
m.set(40002);
m.set(40003);
assert_eq!(
m.bitmap_to_array(),
[
vec![1],
vec![5],
vec![65, 66],
vec![4000],
vec![40001, 40003]
]
);
m.clear_all();
assert_eq!(m.bitmap_to_array(), empty);
m.set(65);
m.set(40001);
assert_eq!(m.bitmap_to_array(), [vec![65], vec![40001]]);
for i in 0..100000 {
m.set(i);
}
m.set(100002);
assert_eq!(
m.bitmap_to_array_and_clear(),
[vec![0, 99999], vec![100002]]
);
assert!(!m.is_set(9000));
assert_eq!(m.bitmap_to_array(), empty);
}
}