source: mainline/uspace/lib/ext4/libext4_extent.c@ 1196df6

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 1196df6 was 1196df6, checked in by Frantisek Princ <frantisek.princ@…>, 13 years ago

extents: hotfix with writing to an existing empty file

  • Property mode set to 100644
File size: 14.8 KB
RevLine 
[829d238]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
[c25e39b]35 * @brief Ext4 extent structures operations.
[829d238]36 */
37
[acd869e]38#include <byteorder.h>
[e2629b08]39#include <errno.h>
40#include <malloc.h>
41#include "libext4.h"
[829d238]42
[8958a26]43uint32_t ext4_extent_get_first_block(ext4_extent_t *extent)
44{
45 return uint32_t_le2host(extent->first_block);
46}
47
[343ccfd]48void 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
[8958a26]53uint16_t ext4_extent_get_block_count(ext4_extent_t *extent)
54{
55 return uint16_t_le2host(extent->block_count);
56}
57
[343ccfd]58void 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
[8958a26]63uint64_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));
[343ccfd]67}
[8958a26]68
[343ccfd]69void 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));
[8958a26]73}
74
[1a7756a]75uint32_t ext4_extent_index_get_first_block(ext4_extent_index_t *index)
76{
77 return uint32_t_le2host(index->first_block);
78}
79
[343ccfd]80void 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
[1a7756a]86uint64_t ext4_extent_index_get_leaf(ext4_extent_index_t *index)
87{
88 return ((uint64_t)uint16_t_le2host(index->leaf_hi)) << 32 |
[343ccfd]89 ((uint64_t)uint32_t_le2host(index->leaf_lo));
90}
91
92void 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));
[1a7756a]96}
97
[acd869e]98uint16_t ext4_extent_header_get_magic(ext4_extent_header_t *header)
99{
100 return uint16_t_le2host(header->magic);
101}
102
[343ccfd]103void ext4_extent_header_set_magic(ext4_extent_header_t *header, uint16_t magic)
104{
105 header->magic = host2uint16_t_le(magic);
106}
107
[acd869e]108uint16_t ext4_extent_header_get_entries_count(ext4_extent_header_t *header)
109{
110 return uint16_t_le2host(header->entries_count);
111}
112
[343ccfd]113void 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
[acd869e]119uint16_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
[343ccfd]124void 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
[acd869e]130uint16_t ext4_extent_header_get_depth(ext4_extent_header_t *header)
131{
132 return uint16_t_le2host(header->depth);
133}
134
[343ccfd]135void ext4_extent_header_set_depth(ext4_extent_header_t *header, uint16_t depth)
136{
137 header->depth = host2uint16_t_le(depth);
138}
139
[acd869e]140uint32_t ext4_extent_header_get_generation(ext4_extent_header_t *header)
141{
142 return uint32_t_le2host(header->generation);
143}
[829d238]144
[343ccfd]145void ext4_extent_header_set_generation(ext4_extent_header_t *header,
146 uint32_t generation)
147{
148 header->generation = host2uint32_t_le(generation);
149}
150
[fffb061]151/**
152 * Binary search in extent index node
153 */
[47faec1]154static void ext4_extent_binsearch_idx(ext4_extent_header_t *header,
155 ext4_extent_index_t **index, uint32_t iblock)
156{
157 ext4_extent_index_t *r, *l, *m;
158
159 uint16_t entries_count = ext4_extent_header_get_entries_count(header);
160
161 if (entries_count == 1) {
162 *index = EXT4_EXTENT_FIRST_INDEX(header);
163 return;
164 }
165
166 l = EXT4_EXTENT_FIRST_INDEX(header) + 1;
167 r = l + entries_count - 1;
168
169 while (l <= r) {
170 m = l + (r - l) / 2;
171 uint32_t first_block = ext4_extent_index_get_first_block(m);
172 if (iblock < first_block) {
173 r = m - 1;
174 } else {
175 l = m + 1;
176 }
177 }
178
179 *index = l - 1;
180}
181
[fffb061]182/**
183 * Binary search in extent leaf node
184 */
[30ac3c3]185static void ext4_extent_binsearch(ext4_extent_header_t *header,
186 ext4_extent_t **extent, uint32_t iblock)
[a4419e7]187{
188 ext4_extent_t *r, *l, *m;
189
190 uint16_t entries_count = ext4_extent_header_get_entries_count(header);
191
192 if (entries_count == 0) {
193 // this leaf is empty
[47faec1]194 EXT4FS_DBG("EMPTY LEAF");
195 *extent = NULL;
196 return;
197 }
198
199 if (entries_count == 1) {
200 *extent = EXT4_EXTENT_FIRST(header);
[a4419e7]201 return;
202 }
203
204 l = EXT4_EXTENT_FIRST(header) + 1;
205 r = l + entries_count - 1;
[9104bb5]206
[0d4db0f]207 while (l < r) {
[a4419e7]208 m = l + (r - l) / 2;
[47faec1]209 uint32_t first_block = ext4_extent_get_first_block(m);
210 if (iblock < first_block) {
[a4419e7]211 r = m - 1;
212 } else {
213 l = m + 1;
214 }
215 }
216
[30ac3c3]217 *extent = l - 1;
[a4419e7]218}
219
[1ac1ab4]220// Reading routine without saving blocks to path - for saving memory during finding block
221int ext4_extent_find_block(ext4_inode_ref_t *inode_ref, uint32_t iblock, uint32_t *fblock)
[e2629b08]222{
[9104bb5]223 int rc;
[e2629b08]224
[1ac1ab4]225 block_t* block = NULL;
[e2629b08]226
[1ac1ab4]227 ext4_extent_header_t *header = ext4_inode_get_extent_header(inode_ref->inode);
228 while (ext4_extent_header_get_depth(header) != 0) {
[e2629b08]229
[1ac1ab4]230 ext4_extent_index_t *index;
231 ext4_extent_binsearch_idx(header, &index, iblock);
[fffb061]232
[1ac1ab4]233 uint64_t child = ext4_extent_index_get_leaf(index);
[fffb061]234
[1ac1ab4]235 if (block != NULL) {
236 block_put(block);
237 }
[e2629b08]238
[1ac1ab4]239 rc = block_get(&block, inode_ref->fs->device, child, BLOCK_FLAGS_NONE);
[47faec1]240 if (rc != EOK) {
241 return rc;
242 }
[e2629b08]243
[1ac1ab4]244 header = (ext4_extent_header_t *)block->data;
[47faec1]245 }
[e2629b08]246
247
[0d4db0f]248 ext4_extent_t* extent = NULL;
[1ac1ab4]249 ext4_extent_binsearch(header, &extent, iblock);
[e2629b08]250
[1196df6]251 if (extent == NULL) {
252 *fblock = 0;
253 } else {
254 uint32_t phys_block;
255 phys_block = ext4_extent_get_start(extent) + iblock;
256 phys_block -= ext4_extent_get_first_block(extent);
[e2629b08]257
[1196df6]258 *fblock = phys_block;
259 }
[e2629b08]260
[1ac1ab4]261 if (block != NULL) {
262 block_put(block);
[fffb061]263 }
[9104bb5]264
[fffb061]265 return EOK;
[e2629b08]266}
267
[0d4db0f]268static int ext4_extent_find_extent(ext4_inode_ref_t *inode_ref,
269 uint32_t iblock, ext4_extent_path_t **ret_path)
270{
271 int rc;
272
273 ext4_extent_header_t *eh =
274 ext4_inode_get_extent_header(inode_ref->inode);
275
276 uint16_t depth = ext4_extent_header_get_depth(eh);
277
278 ext4_extent_path_t *tmp_path;
279
280 // Added 2 for possible tree growing
281 tmp_path = malloc(sizeof(ext4_extent_path_t) * (depth + 2));
282 if (tmp_path == NULL) {
283 return ENOMEM;
284 }
285
286 tmp_path[0].block = inode_ref->block;
287 tmp_path[0].header = eh;
288
289 uint16_t pos = 0;
290 while (ext4_extent_header_get_depth(eh) != 0) {
291
292 ext4_extent_binsearch_idx(tmp_path[pos].header, &tmp_path[pos].index, iblock);
293
294 tmp_path[pos].depth = depth;
295 tmp_path[pos].extent = NULL;
296
297 assert(tmp_path[pos].index != NULL);
298
299 uint64_t fblock = ext4_extent_index_get_leaf(tmp_path[pos].index);
300
301 block_t *block;
302 rc = block_get(&block, inode_ref->fs->device, fblock, BLOCK_FLAGS_NONE);
303 if (rc != EOK) {
304 // TODO cleanup
305 EXT4FS_DBG("ERRRR");
306 return rc;
307 }
308
309 pos++;
310
311 eh = (ext4_extent_header_t *)block->data;
312 tmp_path[pos].block = block;
313 tmp_path[pos].header = eh;
314
315 }
316
317 tmp_path[pos].depth = 0;
318 tmp_path[pos].extent = NULL;
319 tmp_path[pos].index = NULL;
320
321 /* find extent */
322 ext4_extent_binsearch(tmp_path[pos].header, &tmp_path[pos].extent, iblock);
323
324 *ret_path = tmp_path;
325
326 return EOK;
327}
328
[5b0a3946]329static int ext4_extent_release(ext4_inode_ref_t *inode_ref, ext4_extent_t* extent)
[0d4db0f]330{
331 int rc;
332
[5b0a3946]333 uint64_t start = ext4_extent_get_start(extent);
334 uint16_t block_count = ext4_extent_get_block_count(extent);
335
336 rc = ext4_balloc_free_blocks(inode_ref, start, block_count);
337 if (rc != EOK) {
338 EXT4FS_DBG("ERROR");
339 return rc;
340 }
341
342 return EOK;
343}
344
345// Recursive release
346static int ext4_extent_release_branch(ext4_inode_ref_t *inode_ref,
347 ext4_extent_index_t *index)
348{
349 int rc;
350
351 block_t* block;
352
353 uint32_t fblock = ext4_extent_index_get_leaf(index);
354
355 EXT4FS_DBG("fblock = \%u", fblock);
356
357 rc = block_get(&block, inode_ref->fs->device, fblock, BLOCK_FLAGS_NOREAD);
358 if (rc != EOK) {
359 EXT4FS_DBG("ERROR get_block");
360 return rc;
361 }
362
363 ext4_extent_header_t *header = block->data;
364
365 if (ext4_extent_header_get_depth(header)) {
366
367 ext4_extent_index_t *idx = EXT4_EXTENT_FIRST_INDEX(header);
368
369 for (uint32_t i = 0; i < ext4_extent_header_get_entries_count(header); ++i, ++idx) {
370 rc = ext4_extent_release_branch(inode_ref, idx);
371 if (rc != EOK) {
372 EXT4FS_DBG("error recursion");
373 return rc;
374 }
375 }
376 } else {
377 ext4_extent_t *ext = EXT4_EXTENT_FIRST(header);
378
379 for (uint32_t i = 0; i < ext4_extent_header_get_entries_count(header); ++i, ++ext) {
380 rc = ext4_extent_release(inode_ref, ext);
381 if (rc != EOK) {
382 EXT4FS_DBG("error recursion");
383 return rc;
384 }
385 }
386 }
387
388 rc = block_put(block);
389 if (rc != EOK) {
390 EXT4FS_DBG("ERROR put_block");
391 return rc;
392 }
393
394 ext4_balloc_free_block(inode_ref, fblock);
395
396 return EOK;
397}
398
[1196df6]399int ext4_extent_release_blocks_from(ext4_inode_ref_t *inode_ref,
400 uint32_t iblock_from)
[5b0a3946]401{
402 int rc;
403
[3e2952b]404 // Find the first extent to modify
[0d4db0f]405 ext4_extent_path_t *path;
[5b0a3946]406 rc = ext4_extent_find_extent(inode_ref, iblock_from, &path);
[0d4db0f]407 if (rc != EOK) {
408 return rc;
409 }
410
[3e2952b]411 // Jump to last item of the path (extent)
[0d4db0f]412 ext4_extent_path_t *path_ptr = path;
413 while (path_ptr->depth != 0) {
414 path_ptr++;
415 }
416
417 assert(path_ptr->extent != NULL);
418
[3e2952b]419 // First extent maybe released partially
[5b0a3946]420 uint32_t first_fblock;
421 first_fblock = ext4_extent_get_start(path_ptr->extent) + iblock_from;
422 first_fblock -= ext4_extent_get_first_block(path_ptr->extent);
[0d4db0f]423
424 uint16_t block_count = ext4_extent_get_block_count(path_ptr->extent);
425
[5b0a3946]426 uint16_t delete_count = block_count - first_fblock +
427 ext4_extent_get_start(path_ptr->extent);
428
429 rc = ext4_balloc_free_blocks(inode_ref, first_fblock, delete_count);
[3e2952b]430 if (rc != EOK) {
431 // TODO goto cleanup
432 EXT4FS_DBG("ERROR");
433 return rc;
434 }
[0d4db0f]435
[5b0a3946]436 block_count -= delete_count;
[0d4db0f]437 ext4_extent_set_block_count(path_ptr->extent, block_count);
438
[3e2952b]439 uint16_t entries = ext4_extent_header_get_entries_count(path_ptr->header);
440 ext4_extent_t *tmp_ext = path_ptr->extent + 1;
441 ext4_extent_t *stop_ext = EXT4_EXTENT_FIRST(path_ptr->header) + entries;
[5b0a3946]442
[3e2952b]443 // If first extent empty, release it
[0d4db0f]444 if (block_count == 0) {
445 entries--;
446 ext4_extent_header_set_entries_count(path_ptr->header, entries);
447 }
448
[3e2952b]449 // Release all successors of the first extent in the same node
450 while (tmp_ext < stop_ext) {
451 first_fblock = ext4_extent_get_start(tmp_ext);
452 delete_count = ext4_extent_get_block_count(tmp_ext);
[5b0a3946]453
[3e2952b]454 rc = ext4_balloc_free_blocks(inode_ref, first_fblock, delete_count);
455 if (rc != EOK) {
456 // TODO goto cleanup
457 EXT4FS_DBG("ERROR");
458 return rc;
459 }
[5b0a3946]460
[3e2952b]461 entries--;
462 ext4_extent_header_set_entries_count(path_ptr->header, entries);
[5b0a3946]463
[3e2952b]464 tmp_ext++;
465 }
[5b0a3946]466
[3e2952b]467 // If leaf node is empty, the whole tree must be checked and the node will be released
468 bool check_tree = false;
[5b0a3946]469
[3e2952b]470 // Don't release root block (including inode data) !!!
471 if ((path_ptr != path) && (entries == 0)) {
472 rc = ext4_balloc_free_block(inode_ref, path_ptr->block->lba);
473 if (rc != EOK) {
474 EXT4FS_DBG("ERROR");
475 // TODO goto cleanup
476 return rc;
[001307cf]477 }
[3e2952b]478 check_tree = true;
[5b0a3946]479 }
[001307cf]480
[3e2952b]481 // Jump to the parent
482 --path_ptr;
[5b0a3946]483
[3e2952b]484 // release all successors in all levels
485 while(path_ptr >= path) {
486 entries = ext4_extent_header_get_entries_count(path_ptr->header);
487 ext4_extent_index_t *index = path_ptr->index + 1;
488 ext4_extent_index_t *stop =
489 EXT4_EXTENT_FIRST_INDEX(path_ptr->header) + entries;
[001307cf]490
[3e2952b]491 if (check_tree) {
492 entries--;
493 ext4_extent_header_set_entries_count(path_ptr->header, entries);
[001307cf]494 }
[0d4db0f]495
[5b0a3946]496 while (index < stop) {
497 rc = ext4_extent_release_branch(inode_ref, index);
498 if (rc != EOK) {
499 EXT4FS_DBG("ERR");
[3e2952b]500 // TODO goto cleanup
501 return rc;
[5b0a3946]502 }
503 ++index;
[3e2952b]504 --entries;
505 ext4_extent_header_set_entries_count(path_ptr->header, entries);
[5b0a3946]506 }
507
[3e2952b]508 path_ptr->block->dirty = true;
[5b0a3946]509
[3e2952b]510 if ((entries == 0) && (path_ptr != path)) {
511 rc = ext4_balloc_free_block(inode_ref, path_ptr->block->lba);
[5b0a3946]512 if (rc != EOK) {
[3e2952b]513 EXT4FS_DBG("ERROR");
514 // TODO goto cleanup
515 return rc;
[5b0a3946]516 }
[3e2952b]517 check_tree = true;
518 } else {
519 check_tree = false;
[5b0a3946]520 }
[3e2952b]521
522 --path_ptr;
[0d4db0f]523 }
524
[3e2952b]525
526 // Finish
[0d4db0f]527 uint16_t depth = path->depth;
528
529 // Put loaded blocks
530 // From 1 -> 0 is a block with inode data
531 for (uint16_t i = 1; i < depth; ++i) {
532 if (path[i].block) {
533 block_put(path[i].block);
534 }
535 }
536
537 // Destroy temporary data structure
538 free(path);
539
540 return EOK;
541}
[1ac1ab4]542
[ce6de59]543int ext4_extent_append_block(ext4_inode_ref_t *inode_ref,
544 uint32_t *iblock, uint32_t *fblock)
545{
546 int rc;
547
548 ext4_superblock_t *sb = inode_ref->fs->superblock;
549 uint64_t inode_size = ext4_inode_get_size(sb, inode_ref->inode);
550
551 ext4_extent_header_t *header =
552 ext4_inode_get_extent_header(inode_ref->inode);
553
554 // Initialize if empty inode
555 if (inode_size == 0) {
556 ext4_extent_t *first = EXT4_EXTENT_FIRST(header);
557 ext4_extent_set_block_count(first, 0);
558 ext4_extent_set_first_block(first, 0);
559 ext4_extent_set_start(first, 0);
560
561 ext4_extent_header_set_depth(header, 0);
562 ext4_extent_header_set_entries_count(header, 1);
563 }
564
565 uint32_t block_size = ext4_superblock_get_block_size(sb);
566 uint32_t new_block_idx = inode_size / block_size;
567
568 ext4_extent_path_t *path;
569 rc = ext4_extent_find_extent(inode_ref, new_block_idx, &path);
570 if (rc != EOK) {
571 EXT4FS_DBG("find extent ERROR");
572 return rc;
573 }
574
575 // Jump to last item of the path (extent)
576 ext4_extent_path_t *path_ptr = path;
577 while (path_ptr->depth != 0) {
578 path_ptr++;
579 }
580
581 // Check if extent exists
582 assert(path_ptr->extent != NULL);
583
584 uint32_t phys_block;
585
586 if (ext4_extent_get_block_count(path_ptr->extent) == 0) {
587
588 // Add first block to the extent
589
590 rc = ext4_balloc_alloc_block(inode_ref, &phys_block);
591 if (rc != EOK) {
592 EXT4FS_DBG("ERRO in balloc");
593 return rc;
594 }
595
596 ext4_extent_set_block_count(path_ptr->extent, 1);
597 ext4_extent_set_start(path_ptr->extent, phys_block);
598
599 path_ptr->block->dirty = true;
600
601 goto finish;
602
603 } else {
[1196df6]604 // try allocate scceeding extent block
[ce6de59]605
606 // TODO
607 assert(false);
608
609 }
610
611
612finish:
[1196df6]613
614 *iblock = new_block_idx;
615 *fblock = phys_block;
616
[ce6de59]617 // Put loaded blocks
618 // From 1 -> 0 is a block with inode data
619 for (uint16_t i = 1; i < path->depth; ++i) {
620 if (path[i].block) {
621 block_put(path[i].block);
622 }
623 }
624
625 // Destroy temporary data structure
626 free(path);
627
628 return EOK;
629}
630
[829d238]631/**
632 * @}
633 */
Note: See TracBrowser for help on using the repository browser.