-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsuperblock.py
More file actions
180 lines (143 loc) · 6.56 KB
/
Copy pathsuperblock.py
File metadata and controls
180 lines (143 loc) · 6.56 KB
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
from object_accessor import ObjectAccessor
from construct import Container
import constants as C
import disk_params as DiskParams
from free_block_interface import FreeBlockInterface
from utils import timestamp, get_superblock_hash
from structures import SuperBlockStruct
from utils import debug_print
class Superblock(FreeBlockInterface):
def __init__(self, data: Container, object_accessor: ObjectAccessor, new: bool = True):
self.data = data
self.object_accessor = object_accessor
# 计算hash,并根据是否是新建磁盘来决定是写入hash,还是校验hash
if new: # 对新磁盘,初始化额外信息
self._fill_inode()
self.data.files = DiskParams.INODE_COUNT
self.data.ffree = DiskParams.INODE_COUNT - 1
self.data.bfree = 0
for i in range(DiskParams.DATA_START, DiskParams.DISK_BLOCKS):
self.release_block(i)
self.flush()
return
# 对已有磁盘,校验hash
encoded = SuperBlockStruct.build(self.data)
hash = get_superblock_hash(encoded)
if self.data.hash == hash:
# 如果此磁盘上一次是用本程序读写的,那就不需要再计算空闲盘块数啥的了
debug_print("找到附加信息。")
return
debug_print("未找到附加信息,将重新计算...")
# 我也不知道为啥那个c.img里面s_ninode会大于100......
# 我读了superblock一看,s_ninode是六千多,人都给我看傻了
if self.data.s_ninode > C.SUPERBLOCK_FREE_INODE or self.data.s_ninode <= 0:
self.data.s_ninode = 0
self._fill_inode()
self.recount()
debug_print("重新计算完毕。")
self.flush()
def recount(self) -> None:
# 计算空闲盘块数
self.data.bfree = self.data.s_nfree
index = self.data.s_free[0]
while index != 0:
self.data.bfree += self.object_accessor.free_index_blocks[index].s_nfree
index = self.object_accessor.free_index_blocks[index].s_free[0]
# 最后一个索引块的最后一项是0,并不是有效的空闲块,所以bfree要减去1
self.data.bfree -= 1
# 写入总inode数
self.data.files = DiskParams.INODE_COUNT
# 计算空闲inode数
self.data.ffree = 0
for i in range(1, DiskParams.INODE_COUNT):
if not self.object_accessor.inodes[i].d_mode.IALLOC:
self.data.ffree += 1
@classmethod
def new(cls, object_accessor: ObjectAccessor):
data = Container(
s_isize = DiskParams.INODE_BLOCKS,
s_fsize = DiskParams.DISK_BLOCKS,
s_nfree = 1,
s_free = [0] * C.SUPERBLOCK_FREE_BLOCK,
s_flock = 0,
s_ninode = 0,
s_inode = [0] * C.SUPERBLOCK_FREE_INODE,
s_ilock = 0,
s_fmod = 0,
s_ronly = 0,
s_time = timestamp(),
bfree = 0,
files = 0,
ffree = 0,
hash = 0,
magic = 0,)
object = cls(data, object_accessor, new=True)
return object
def flush(self) -> None:
# 计算并写入hash
encoded = SuperBlockStruct.build(self.data)
hash = get_superblock_hash(encoded)
self.data.hash = hash
# 写入MAGIC
self.data.magic = C.MAGIC
self.object_accessor.superblock = self.data
def allocate_block(self, zero=False) -> int:
if self.data.s_nfree == 1 and self.data.s_free[0] == 0:
raise Exception("No free block")
self.data.s_nfree -= 1
index = self.data.s_free[self.data.s_nfree]
# 如果superblock里的表已用完,那就将下一个空闲块索引块读入superblock
if self.data.s_nfree == 0:
if self.data.s_free[0] == 0:
raise Exception("No free block")
next_block = self.object_accessor.free_index_blocks[self.data.s_free[0]]
self.data.s_nfree = next_block.s_nfree
self.data.s_free = next_block.s_free
if zero: # 是否清零
self.object_accessor.clear_data_block(index)
# debug_print(f"allocate block {index}")
self.data.bfree -= 1
return index
def release_block(self, block_index: int) -> None:
if self.data.s_nfree < C.FREE_INDEX_PER_BLOCK:
self.data.s_free[self.data.s_nfree] = block_index
self.data.s_nfree += 1
else:
# 写入下一个空闲块索引块
new_block = Container(s_nfree=self.data.s_nfree, s_free=self.data.s_free)
self.object_accessor.free_index_blocks[block_index] = new_block
self.data.s_nfree = 1
self.data.s_free = [0] * C.FREE_INDEX_PER_BLOCK
self.data.s_free[0] = block_index
# debug_print(f"release block {block_index}")
self.data.bfree += 1
def _fill_inode(self) -> None:
assert self.data.s_ninode == 0 or self.data.s_ninode == 1 and self.data.s_inode[0] == 0
for index in range(1, DiskParams.INODE_COUNT):
if self.object_accessor.inodes[index].d_mode.IALLOC:
continue
self.data.s_inode[self.data.s_ninode] = index
self.data.s_ninode += 1
if self.data.s_ninode == C.SUPERBLOCK_FREE_INODE:
break
def allocate_inode(self) -> int:
self.data.s_ninode -= 1
index = self.data.s_inode[self.data.s_ninode]
# 设置IALLOC位
# inode = self.object_accessor.inodes[index]
# inode.d_mode.IALLOC = 1
# 如果用完了缓存的空白inode表,就一次性把它填充满
if self.data.s_ninode == 0:
self._fill_inode()
self.data.ffree -= 1
return index
def release_inode(self, inode_index: int) -> None:
# 清除IALLOC位
inode = self.object_accessor.inodes[inode_index]
inode.d_mode.IALLOC = 0
self.object_accessor.inodes[inode_index] = inode
# 如果缓存的空白inode表没装满,就把这个空出来的inode塞进去
if self.data.s_ninode < C.INODE_PER_BLOCK:
self.data.s_inode[self.data.s_ninode] = inode_index
self.data.s_ninode += 1
self.data.ffree += 1