1 | /*
|
---|
2 | * Copyright (c) 2011 Frantisek Princ
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup libext4
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 |
|
---|
33 | /**
|
---|
34 | * @file libext4_extent.c
|
---|
35 | * @brief Ext4 extent structures operations.
|
---|
36 | */
|
---|
37 |
|
---|
38 | #include <byteorder.h>
|
---|
39 | #include <errno.h>
|
---|
40 | #include <malloc.h>
|
---|
41 | #include "libext4.h"
|
---|
42 |
|
---|
43 | uint32_t ext4_extent_get_first_block(ext4_extent_t *extent)
|
---|
44 | {
|
---|
45 | return uint32_t_le2host(extent->first_block);
|
---|
46 | }
|
---|
47 |
|
---|
48 | void ext4_extent_set_first_block(ext4_extent_t *extent, uint32_t first_block)
|
---|
49 | {
|
---|
50 | extent->first_block = host2uint32_t_le(first_block);
|
---|
51 | }
|
---|
52 |
|
---|
53 | uint16_t ext4_extent_get_block_count(ext4_extent_t *extent)
|
---|
54 | {
|
---|
55 | return uint16_t_le2host(extent->block_count);
|
---|
56 | }
|
---|
57 |
|
---|
58 | void ext4_extent_set_block_count(ext4_extent_t *extent, uint16_t block_count)
|
---|
59 | {
|
---|
60 | extent->block_count = host2uint16_t_le(block_count);
|
---|
61 | }
|
---|
62 |
|
---|
63 | uint64_t ext4_extent_get_start(ext4_extent_t *extent)
|
---|
64 | {
|
---|
65 | return ((uint64_t)uint16_t_le2host(extent->start_hi)) << 32 |
|
---|
66 | ((uint64_t)uint32_t_le2host(extent->start_lo));
|
---|
67 | }
|
---|
68 |
|
---|
69 | void ext4_extent_set_start(ext4_extent_t *extent, uint64_t start)
|
---|
70 | {
|
---|
71 | extent->start_lo = host2uint32_t_le((start << 32) >> 32);
|
---|
72 | extent->start_hi = host2uint16_t_le((uint16_t)(start >> 32));
|
---|
73 | }
|
---|
74 |
|
---|
75 | uint32_t ext4_extent_index_get_first_block(ext4_extent_index_t *index)
|
---|
76 | {
|
---|
77 | return uint32_t_le2host(index->first_block);
|
---|
78 | }
|
---|
79 |
|
---|
80 | void ext4_extent_index_set_first_block(ext4_extent_index_t *index,
|
---|
81 | uint32_t first)
|
---|
82 | {
|
---|
83 | index->first_block = host2uint32_t_le(first);
|
---|
84 | }
|
---|
85 |
|
---|
86 | uint64_t ext4_extent_index_get_leaf(ext4_extent_index_t *index)
|
---|
87 | {
|
---|
88 | return ((uint64_t)uint16_t_le2host(index->leaf_hi)) << 32 |
|
---|
89 | ((uint64_t)uint32_t_le2host(index->leaf_lo));
|
---|
90 | }
|
---|
91 |
|
---|
92 | void ext4_extent_index_set_leaf(ext4_extent_index_t *index, uint64_t leaf)
|
---|
93 | {
|
---|
94 | index->leaf_lo = host2uint32_t_le((leaf << 32) >> 32);
|
---|
95 | index->leaf_hi = host2uint16_t_le((uint16_t)(leaf >> 32));
|
---|
96 | }
|
---|
97 |
|
---|
98 | uint16_t ext4_extent_header_get_magic(ext4_extent_header_t *header)
|
---|
99 | {
|
---|
100 | return uint16_t_le2host(header->magic);
|
---|
101 | }
|
---|
102 |
|
---|
103 | void ext4_extent_header_set_magic(ext4_extent_header_t *header, uint16_t magic)
|
---|
104 | {
|
---|
105 | header->magic = host2uint16_t_le(magic);
|
---|
106 | }
|
---|
107 |
|
---|
108 | uint16_t ext4_extent_header_get_entries_count(ext4_extent_header_t *header)
|
---|
109 | {
|
---|
110 | return uint16_t_le2host(header->entries_count);
|
---|
111 | }
|
---|
112 |
|
---|
113 | void ext4_extent_header_set_entries_count(ext4_extent_header_t *header,
|
---|
114 | uint16_t count)
|
---|
115 | {
|
---|
116 | header->entries_count = host2uint16_t_le(count);
|
---|
117 | }
|
---|
118 |
|
---|
119 | uint16_t ext4_extent_header_get_max_entries_count(ext4_extent_header_t *header)
|
---|
120 | {
|
---|
121 | return uint16_t_le2host(header->max_entries_count);
|
---|
122 | }
|
---|
123 |
|
---|
124 | void ext4_extent_header_set_max_entries_count(ext4_extent_header_t *header,
|
---|
125 | uint16_t max_count)
|
---|
126 | {
|
---|
127 | header->max_entries_count = host2uint16_t_le(max_count);
|
---|
128 | }
|
---|
129 |
|
---|
130 | uint16_t ext4_extent_header_get_depth(ext4_extent_header_t *header)
|
---|
131 | {
|
---|
132 | return uint16_t_le2host(header->depth);
|
---|
133 | }
|
---|
134 |
|
---|
135 | void ext4_extent_header_set_depth(ext4_extent_header_t *header, uint16_t depth)
|
---|
136 | {
|
---|
137 | header->depth = host2uint16_t_le(depth);
|
---|
138 | }
|
---|
139 |
|
---|
140 | uint32_t ext4_extent_header_get_generation(ext4_extent_header_t *header)
|
---|
141 | {
|
---|
142 | return uint32_t_le2host(header->generation);
|
---|
143 | }
|
---|
144 |
|
---|
145 | void ext4_extent_header_set_generation(ext4_extent_header_t *header,
|
---|
146 | uint32_t generation)
|
---|
147 | {
|
---|
148 | header->generation = host2uint32_t_le(generation);
|
---|
149 | }
|
---|
150 |
|
---|
151 | static void ext4_extent_binsearch_idx(ext4_extent_path_t *path, uint32_t iblock)
|
---|
152 | {
|
---|
153 | ext4_extent_header_t *header = path->header;
|
---|
154 | ext4_extent_index_t *r, *l, *m;
|
---|
155 |
|
---|
156 | uint16_t entries_count = ext4_extent_header_get_entries_count(header);
|
---|
157 | l = EXT4_EXTENT_FIRST_INDEX(header) + 1;
|
---|
158 | r = l + entries_count - 1;
|
---|
159 |
|
---|
160 | while (l <= r) {
|
---|
161 | m = l + (r - l) / 2;
|
---|
162 | uint32_t block = ext4_extent_index_get_first_block(m);
|
---|
163 | if (iblock < block) {
|
---|
164 | r = m - 1;
|
---|
165 | } else {
|
---|
166 | l = m + 1;
|
---|
167 | }
|
---|
168 | }
|
---|
169 |
|
---|
170 | path->index = l - 1;
|
---|
171 | }
|
---|
172 |
|
---|
173 | static void ext4_extent_binsearch(ext4_extent_path_t *path, uint32_t iblock)
|
---|
174 | {
|
---|
175 | ext4_extent_header_t *header = path->header;
|
---|
176 | ext4_extent_t *r, *l, *m;
|
---|
177 |
|
---|
178 | uint16_t entries_count = ext4_extent_header_get_entries_count(header);
|
---|
179 |
|
---|
180 | if (entries_count == 0) {
|
---|
181 | // this leaf is empty
|
---|
182 | return;
|
---|
183 | }
|
---|
184 |
|
---|
185 | l = EXT4_EXTENT_FIRST(header) + 1;
|
---|
186 | r = l + entries_count - 1;
|
---|
187 |
|
---|
188 | while (l <= r) {
|
---|
189 | m = l + (r - l) / 2;
|
---|
190 | uint32_t block = ext4_extent_get_first_block(m);
|
---|
191 | if (iblock < block) {
|
---|
192 | r = m - 1;
|
---|
193 | } else {
|
---|
194 | l = m + 1;
|
---|
195 | }
|
---|
196 | }
|
---|
197 |
|
---|
198 | path->extent = l - 1;
|
---|
199 |
|
---|
200 | }
|
---|
201 |
|
---|
202 | int ext4_extent_find_block(ext4_filesystem_t *fs, ext4_extent_path_t **path,
|
---|
203 | ext4_extent_header_t *header, uint32_t iblock)
|
---|
204 | {
|
---|
205 | int rc;
|
---|
206 |
|
---|
207 | uint16_t depth = ext4_extent_header_get_depth(header);
|
---|
208 |
|
---|
209 | ext4_extent_header_t *eh = header;
|
---|
210 |
|
---|
211 | ext4_extent_path_t *tmp_path;
|
---|
212 |
|
---|
213 | // Added 2 for possible tree growing
|
---|
214 | tmp_path = malloc(sizeof(ext4_extent_path_t) * (depth + 2));
|
---|
215 | if (tmp_path == NULL) {
|
---|
216 | *path = NULL;
|
---|
217 | return ENOMEM;
|
---|
218 | }
|
---|
219 |
|
---|
220 | tmp_path[0].block = NULL;
|
---|
221 | tmp_path[0].header = eh;
|
---|
222 |
|
---|
223 | uint16_t pos = 0, idx = depth;
|
---|
224 | while (idx > 0) {
|
---|
225 |
|
---|
226 | ext4_extent_binsearch_idx(tmp_path + pos, iblock);
|
---|
227 |
|
---|
228 | tmp_path[pos].depth = idx;
|
---|
229 | tmp_path[pos].extent = NULL;
|
---|
230 |
|
---|
231 | uint64_t fblock = ext4_extent_index_get_leaf(tmp_path[pos].index);
|
---|
232 | block_t *block;
|
---|
233 | rc = block_get(&block, fs->device, fblock, BLOCK_FLAGS_NONE);
|
---|
234 | if (rc != EOK) {
|
---|
235 | // TODO cleanup
|
---|
236 | }
|
---|
237 |
|
---|
238 | eh = (ext4_extent_header_t *)tmp_path[pos].block->data;
|
---|
239 | pos++;
|
---|
240 |
|
---|
241 | tmp_path[pos].block = block;
|
---|
242 | tmp_path[pos].header = eh;
|
---|
243 |
|
---|
244 | idx--;
|
---|
245 |
|
---|
246 | }
|
---|
247 |
|
---|
248 | tmp_path[pos].depth = idx;
|
---|
249 | tmp_path[pos].extent = NULL;
|
---|
250 | tmp_path[pos].index = NULL;
|
---|
251 |
|
---|
252 | /* find extent */
|
---|
253 | ext4_extent_binsearch(tmp_path + pos, iblock);
|
---|
254 |
|
---|
255 | /* if not an empty leaf */
|
---|
256 | if (tmp_path[pos].extent) {
|
---|
257 | uint64_t fblock = ext4_extent_get_start(tmp_path[pos].extent);
|
---|
258 | block_t *block;
|
---|
259 | rc = block_get(&block, fs->device, fblock, BLOCK_FLAGS_NONE);
|
---|
260 | if (rc != EOK) {
|
---|
261 | // TODO cleanup
|
---|
262 | }
|
---|
263 | tmp_path[pos].block = block;
|
---|
264 | }
|
---|
265 |
|
---|
266 | return EOK;
|
---|
267 | }
|
---|
268 |
|
---|
269 | /**
|
---|
270 | * @}
|
---|
271 | */
|
---|