2 * extent.c --- routines to implement extents support
4 * Copyright (C) 2007 Theodore Ts'o.
7 * This file may be redistributed under the terms of the GNU Library
8 * General Public License, version 2.
25 #include <sys/types.h>
33 * Definitions to be dropped in lib/ext2fs/ext2fs.h
52 struct ext2_extent_handle {
56 struct ext2_inode *inode;
57 struct ext2_inode inodebuf;
61 struct extent_path *path;
64 struct ext2_extent_path {
71 * Useful Debugging stuff
75 static void dbg_show_header(struct ext3_extent_header *eh)
77 printf("header: magic=%x entries=%u max=%u depth=%u generation=%u\n",
78 ext2fs_le16_to_cpu(eh->eh_magic),
79 ext2fs_le16_to_cpu(eh->eh_entries),
80 ext2fs_le16_to_cpu(eh->eh_max),
81 ext2fs_le16_to_cpu(eh->eh_depth),
82 ext2fs_le32_to_cpu(eh->eh_generation));
85 static void dbg_show_index(struct ext3_extent_idx *ix)
87 printf("index: block=%u leaf=%u leaf_hi=%u unused=%u\n",
88 ext2fs_le32_to_cpu(ix->ei_block),
89 ext2fs_le32_to_cpu(ix->ei_leaf),
90 ext2fs_le16_to_cpu(ix->ei_leaf_hi),
91 ext2fs_le16_to_cpu(ix->ei_unused));
94 static void dbg_show_extent(struct ext3_extent *ex)
96 printf("extent: block=%u-%u len=%u start=%u start_hi=%u\n",
97 ext2fs_le32_to_cpu(ex->ee_block),
98 ext2fs_le32_to_cpu(ex->ee_block) +
99 ext2fs_le16_to_cpu(ex->ee_len) - 1,
100 ext2fs_le16_to_cpu(ex->ee_len),
101 ext2fs_le32_to_cpu(ex->ee_start),
102 ext2fs_le16_to_cpu(ex->ee_start_hi));
105 static void dbg_print_extent(char *desc, struct ext2fs_extent *extent)
108 printf("%s: ", desc);
109 printf("extent: lblk %llu--%llu, len %u, pblk %llu, flags: ",
110 extent->e_lblk, extent->e_lblk + extent->e_len - 1,
111 extent->e_len, extent->e_pblk);
112 if (extent->e_flags & EXT2_EXTENT_FLAGS_LEAF)
113 fputs("LEAF ", stdout);
114 if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT)
115 fputs("UNINIT ", stdout);
116 if (extent->e_flags & EXT2_EXTENT_FLAGS_SECOND_VISIT)
117 fputs("2ND_VISIT ", stdout);
118 if (!extent->e_flags)
119 fputs("(none)", stdout);
125 #define dbg_show_header(eh) do { } while (0)
126 #define dbg_show_index(ix) do { } while (0)
127 #define dbg_show_extent(ex) do { } while (0)
128 #define dbg_print_extent(desc, ex) do { } while (0)
132 * Verify the extent header as being sane
134 errcode_t ext2fs_extent_header_verify(void *ptr, int size)
136 int eh_max, entry_size;
137 struct ext3_extent_header *eh = ptr;
140 if (ext2fs_le16_to_cpu(eh->eh_magic) != EXT3_EXT_MAGIC)
141 return EXT2_ET_EXTENT_HEADER_BAD;
142 if (ext2fs_le16_to_cpu(eh->eh_entries) > ext2fs_le16_to_cpu(eh->eh_max))
143 return EXT2_ET_EXTENT_HEADER_BAD;
144 if (eh->eh_depth == 0)
145 entry_size = sizeof(struct ext3_extent);
147 entry_size = sizeof(struct ext3_extent_idx);
149 eh_max = (size - sizeof(*eh)) / entry_size;
150 /* Allow two extent-sized items at the end of the block, for
151 * ext4_extent_tail with checksum in the future. */
152 if ((ext2fs_le16_to_cpu(eh->eh_max) > eh_max) ||
153 (ext2fs_le16_to_cpu(eh->eh_max) < (eh_max - 2)))
154 return EXT2_ET_EXTENT_HEADER_BAD;
161 * Begin functions to handle an inode's extent information
163 void ext2fs_extent_free(ext2_extent_handle_t handle)
171 for (i=1; i <= handle->max_depth; i++) {
172 if (handle->path[i].buf)
173 ext2fs_free_mem(&handle->path[i].buf);
175 ext2fs_free_mem(&handle->path);
177 ext2fs_free_mem(&handle);
180 errcode_t ext2fs_extent_open(ext2_filsys fs, ext2_ino_t ino,
181 ext2_extent_handle_t *ret_handle)
183 return ext2fs_extent_open2(fs, ino, NULL, ret_handle);
186 errcode_t ext2fs_extent_open2(ext2_filsys fs, ext2_ino_t ino,
187 struct ext2_inode *inode,
188 ext2_extent_handle_t *ret_handle)
190 struct ext2_extent_handle *handle;
193 struct ext3_extent_header *eh;
195 EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS);
198 if ((ino == 0) || (ino > fs->super->s_inodes_count))
199 return EXT2_ET_BAD_INODE_NUM;
201 retval = ext2fs_get_mem(sizeof(struct ext2_extent_handle), &handle);
204 memset(handle, 0, sizeof(struct ext2_extent_handle));
210 handle->inode = inode;
212 handle->inode = &handle->inodebuf;
213 retval = ext2fs_read_inode(fs, ino, handle->inode);
218 eh = (struct ext3_extent_header *) &handle->inode->i_block[0];
220 for (i=0; i < EXT2_N_BLOCKS; i++)
221 if (handle->inode->i_block[i])
223 if (i >= EXT2_N_BLOCKS) {
224 eh->eh_magic = ext2fs_cpu_to_le16(EXT3_EXT_MAGIC);
227 i = (sizeof(handle->inode->i_block) - sizeof(*eh)) /
228 sizeof(struct ext3_extent);
229 eh->eh_max = ext2fs_cpu_to_le16(i);
230 handle->inode->i_flags |= EXT4_EXTENTS_FL;
233 if (!(handle->inode->i_flags & EXT4_EXTENTS_FL)) {
234 retval = EXT2_ET_INODE_NOT_EXTENT;
238 retval = ext2fs_extent_header_verify(eh, sizeof(handle->inode->i_block));
242 handle->max_depth = ext2fs_le16_to_cpu(eh->eh_depth);
243 handle->type = ext2fs_le16_to_cpu(eh->eh_magic);
245 retval = ext2fs_get_mem(((handle->max_depth+1) *
246 sizeof(struct extent_path)),
248 memset(handle->path, 0,
249 (handle->max_depth+1) * sizeof(struct extent_path));
250 handle->path[0].buf = (char *) handle->inode->i_block;
252 handle->path[0].left = handle->path[0].entries =
253 ext2fs_le16_to_cpu(eh->eh_entries);
254 handle->path[0].max_entries = ext2fs_le16_to_cpu(eh->eh_max);
255 handle->path[0].curr = 0;
256 handle->path[0].end_blk =
257 (EXT2_I_SIZE(handle->inode) + fs->blocksize - 1) >>
258 EXT2_BLOCK_SIZE_BITS(fs->super);
259 handle->path[0].visit_num = 1;
261 handle->magic = EXT2_ET_MAGIC_EXTENT_HANDLE;
263 *ret_handle = handle;
267 ext2fs_extent_free(handle);
272 * This function is responsible for (optionally) moving through the
273 * extent tree and then returning the current extent
275 errcode_t ext2fs_extent_get(ext2_extent_handle_t handle,
276 int flags, struct ext2fs_extent *extent)
278 struct extent_path *path, *newpath;
279 struct ext3_extent_header *eh;
280 struct ext3_extent_idx *ix = 0;
281 struct ext3_extent *ex;
287 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
290 return EXT2_ET_NO_CURRENT_NODE;
292 orig_op = op = flags & EXT2_EXTENT_MOVE_MASK;
295 path = handle->path + handle->level;
296 if ((orig_op == EXT2_EXTENT_NEXT) ||
297 (orig_op == EXT2_EXTENT_NEXT_LEAF)) {
298 if (handle->level < handle->max_depth) {
300 if (path->visit_num == 0) {
302 op = EXT2_EXTENT_DOWN;
303 } else if (path->left > 0)
304 op = EXT2_EXTENT_NEXT_SIB;
305 else if (handle->level > 0)
308 return EXT2_ET_EXTENT_NO_NEXT;
312 op = EXT2_EXTENT_NEXT_SIB;
313 else if (handle->level > 0)
316 return EXT2_ET_EXTENT_NO_NEXT;
318 if (op != EXT2_EXTENT_NEXT_SIB) {
319 #ifdef DEBUG_GET_EXTENT
320 printf("<<<< OP = %s\n",
321 (op == EXT2_EXTENT_DOWN) ? "down" :
322 ((op == EXT2_EXTENT_UP) ? "up" : "unknown"));
327 if ((orig_op == EXT2_EXTENT_PREV) ||
328 (orig_op == EXT2_EXTENT_PREV_LEAF)) {
329 if (handle->level < handle->max_depth) {
331 if (path->visit_num > 0 ) {
332 /* path->visit_num = 0; */
333 op = EXT2_EXTENT_DOWN_AND_LAST;
334 } else if (path->left < path->entries-1)
335 op = EXT2_EXTENT_PREV_SIB;
336 else if (handle->level > 0)
339 return EXT2_ET_EXTENT_NO_PREV;
342 if (path->left < path->entries-1)
343 op = EXT2_EXTENT_PREV_SIB;
344 else if (handle->level > 0)
347 return EXT2_ET_EXTENT_NO_PREV;
349 if (op != EXT2_EXTENT_PREV_SIB) {
350 #ifdef DEBUG_GET_EXTENT
351 printf("<<<< OP = %s\n",
352 (op == EXT2_EXTENT_DOWN_AND_LAST) ? "down/last" :
353 ((op == EXT2_EXTENT_UP) ? "up" : "unknown"));
358 if (orig_op == EXT2_EXTENT_LAST_LEAF) {
359 if ((handle->level < handle->max_depth) &&
361 op = EXT2_EXTENT_DOWN;
363 op = EXT2_EXTENT_LAST_SIB;
364 #ifdef DEBUG_GET_EXTENT
365 printf("<<<< OP = %s\n",
366 (op == EXT2_EXTENT_DOWN) ? "down" : "last_sib");
371 case EXT2_EXTENT_CURRENT:
374 case EXT2_EXTENT_ROOT:
376 path = handle->path + handle->level;
378 case EXT2_EXTENT_FIRST_SIB:
379 path->left = path->entries;
382 case EXT2_EXTENT_NEXT_SIB:
384 return EXT2_ET_EXTENT_NO_NEXT;
389 eh = (struct ext3_extent_header *) path->buf;
390 ix = EXT_FIRST_INDEX(eh);
396 case EXT2_EXTENT_PREV_SIB:
398 path->left+1 >= path->entries)
399 return EXT2_ET_EXTENT_NO_PREV;
404 if (handle->level < handle->max_depth)
407 case EXT2_EXTENT_LAST_SIB:
408 eh = (struct ext3_extent_header *) path->buf;
409 path->curr = EXT_LAST_EXTENT(eh);
415 if (handle->level <= 0)
416 return EXT2_ET_EXTENT_NO_UP;
420 if ((orig_op == EXT2_EXTENT_PREV) ||
421 (orig_op == EXT2_EXTENT_PREV_LEAF))
424 case EXT2_EXTENT_DOWN:
425 case EXT2_EXTENT_DOWN_AND_LAST:
426 if (!path->curr ||(handle->level >= handle->max_depth))
427 return EXT2_ET_EXTENT_NO_DOWN;
432 retval = ext2fs_get_mem(handle->fs->blocksize,
437 blk = ext2fs_le32_to_cpu(ix->ei_leaf) +
438 ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32);
439 if ((handle->fs->flags & EXT2_FLAG_IMAGE_FILE) &&
440 (handle->fs->io != handle->fs->image_io))
441 memset(newpath->buf, 0, handle->fs->blocksize);
443 retval = io_channel_read_blk64(handle->fs->io,
444 blk, 1, newpath->buf);
450 eh = (struct ext3_extent_header *) newpath->buf;
452 retval = ext2fs_extent_header_verify(eh, handle->fs->blocksize);
458 if (!(handle->fs->flags & EXT2_FLAG_IGNORE_CSUM_ERRORS) &&
459 !ext2fs_extent_block_csum_verify(handle->fs, handle->ino,
462 return EXT2_ET_EXTENT_CSUM_INVALID;
465 newpath->left = newpath->entries =
466 ext2fs_le16_to_cpu(eh->eh_entries);
467 newpath->max_entries = ext2fs_le16_to_cpu(eh->eh_max);
469 if (path->left > 0) {
471 newpath->end_blk = ext2fs_le32_to_cpu(ix->ei_block);
473 newpath->end_blk = path->end_blk;
476 if (op == EXT2_EXTENT_DOWN) {
477 ix = EXT_FIRST_INDEX((struct ext3_extent_header *) eh);
479 path->left = path->entries - 1;
482 ix = EXT_LAST_INDEX((struct ext3_extent_header *) eh);
485 if (handle->level < handle->max_depth)
488 #ifdef DEBUG_GET_EXTENT
489 printf("Down to level %d/%d, end_blk=%llu\n",
490 handle->level, handle->max_depth,
495 return EXT2_ET_OP_NOT_SUPPORTED;
499 return EXT2_ET_NO_CURRENT_NODE;
502 #ifdef DEBUG_GET_EXTENT
503 printf("(Left %d)\n", path->left);
506 if (handle->level == handle->max_depth) {
507 ex = (struct ext3_extent *) ix;
509 extent->e_pblk = ext2fs_le32_to_cpu(ex->ee_start) +
510 ((__u64) ext2fs_le16_to_cpu(ex->ee_start_hi) << 32);
511 extent->e_lblk = ext2fs_le32_to_cpu(ex->ee_block);
512 extent->e_len = ext2fs_le16_to_cpu(ex->ee_len);
513 extent->e_flags |= EXT2_EXTENT_FLAGS_LEAF;
514 if (extent->e_len > EXT_INIT_MAX_LEN) {
515 extent->e_len -= EXT_INIT_MAX_LEN;
516 extent->e_flags |= EXT2_EXTENT_FLAGS_UNINIT;
519 extent->e_pblk = ext2fs_le32_to_cpu(ix->ei_leaf) +
520 ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32);
521 extent->e_lblk = ext2fs_le32_to_cpu(ix->ei_block);
522 if (path->left > 0) {
524 end_blk = ext2fs_le32_to_cpu(ix->ei_block);
526 end_blk = path->end_blk;
528 extent->e_len = end_blk - extent->e_lblk;
531 extent->e_flags |= EXT2_EXTENT_FLAGS_SECOND_VISIT;
533 if (((orig_op == EXT2_EXTENT_NEXT_LEAF) ||
534 (orig_op == EXT2_EXTENT_PREV_LEAF)) &&
535 (handle->level != handle->max_depth))
538 if ((orig_op == EXT2_EXTENT_LAST_LEAF) &&
539 ((handle->level != handle->max_depth) ||
546 static errcode_t update_path(ext2_extent_handle_t handle)
550 struct ext3_extent_idx *ix;
551 struct ext3_extent_header *eh;
553 if (handle->level == 0) {
554 retval = ext2fs_write_inode(handle->fs, handle->ino,
557 ix = handle->path[handle->level - 1].curr;
558 blk = ext2fs_le32_to_cpu(ix->ei_leaf) +
559 ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32);
561 /* then update the checksum */
562 eh = (struct ext3_extent_header *)
563 handle->path[handle->level].buf;
564 retval = ext2fs_extent_block_csum_set(handle->fs, handle->ino,
569 retval = io_channel_write_blk64(handle->fs->io,
570 blk, 1, handle->path[handle->level].buf);
576 errcode_t ext2fs_extent_save_path(ext2_extent_handle_t handle,
577 ext2_extent_path_t *ret_path)
579 ext2_extent_path_t save_path;
580 struct ext2fs_extent extent;
581 struct ext2_extent_info info;
584 retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
588 retval = ext2fs_extent_get_info(handle, &info);
592 retval = ext2fs_get_mem(sizeof(struct ext2_extent_path), &save_path);
595 memset(save_path, 0, sizeof(struct ext2_extent_path));
597 save_path->magic = EXT2_ET_MAGIC_EXTENT_PATH;
598 save_path->leaf_height = info.max_depth - info.curr_level - 1;
599 save_path->lblk = extent.e_lblk;
601 *ret_path = save_path;
605 errcode_t ext2fs_extent_free_path(ext2_extent_path_t path)
607 EXT2_CHECK_MAGIC(path, EXT2_ET_MAGIC_EXTENT_PATH);
609 ext2fs_free_mem(&path);
615 * Go to the node at leaf_level which contains logical block blk.
617 * leaf_level is height from the leaf node level, i.e.
618 * leaf_level 0 is at leaf node, leaf_level 1 is 1 above etc.
620 * If "blk" has no mapping (hole) then handle is left at last
623 errcode_t ext2fs_extent_goto2(ext2_extent_handle_t handle,
624 int leaf_level, blk64_t blk)
626 struct ext2fs_extent extent;
629 retval = ext2fs_extent_get(handle, EXT2_EXTENT_ROOT, &extent);
631 if (retval == EXT2_ET_EXTENT_NO_NEXT)
632 retval = EXT2_ET_EXTENT_NOT_FOUND;
636 if (leaf_level > handle->max_depth) {
638 printf("leaf level %d greater than tree depth %d\n",
639 leaf_level, handle->max_depth);
641 return EXT2_ET_OP_NOT_SUPPORTED;
645 printf("goto extent ino %u, level %d, %llu\n", handle->ino,
649 #ifdef DEBUG_GOTO_EXTENTS
650 dbg_print_extent("root", &extent);
653 if (handle->max_depth - handle->level == leaf_level) {
654 /* block is in this &extent */
655 if ((blk >= extent.e_lblk) &&
656 (blk < extent.e_lblk + extent.e_len))
658 if (blk < extent.e_lblk) {
659 retval = ext2fs_extent_get(handle,
660 EXT2_EXTENT_PREV_SIB,
662 return EXT2_ET_EXTENT_NOT_FOUND;
664 retval = ext2fs_extent_get(handle,
665 EXT2_EXTENT_NEXT_SIB,
667 if (retval == EXT2_ET_EXTENT_NO_NEXT)
668 return EXT2_ET_EXTENT_NOT_FOUND;
674 retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_SIB,
676 if (retval == EXT2_ET_EXTENT_NO_NEXT)
681 #ifdef DEBUG_GOTO_EXTENTS
682 dbg_print_extent("next", &extent);
684 if (blk == extent.e_lblk)
686 if (blk > extent.e_lblk)
689 retval = ext2fs_extent_get(handle, EXT2_EXTENT_PREV_SIB,
694 #ifdef DEBUG_GOTO_EXTENTS
695 dbg_print_extent("prev", &extent);
699 retval = ext2fs_extent_get(handle, EXT2_EXTENT_DOWN,
704 #ifdef DEBUG_GOTO_EXTENTS
705 dbg_print_extent("down", &extent);
710 errcode_t ext2fs_extent_goto(ext2_extent_handle_t handle,
713 return ext2fs_extent_goto2(handle, 0, blk);
717 * Traverse back up to root fixing parents of current node as needed.
719 * If we changed start of first entry in a node, fix parent index start
722 * Safe to call for any position in node; if not at the first entry,
723 * will simply return.
725 errcode_t ext2fs_extent_fix_parents(ext2_extent_handle_t handle)
730 struct extent_path *path;
731 struct ext2fs_extent extent;
732 struct ext2_extent_info info;
734 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
736 if (!(handle->fs->flags & EXT2_FLAG_RW))
737 return EXT2_ET_RO_FILSYS;
740 return EXT2_ET_NO_CURRENT_NODE;
742 path = handle->path + handle->level;
744 return EXT2_ET_NO_CURRENT_NODE;
746 retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
750 /* modified node's start block */
751 start = extent.e_lblk;
753 if ((retval = ext2fs_extent_get_info(handle, &info)))
755 orig_height = info.max_depth - info.curr_level;
757 /* traverse up until index not first, or startblk matches, or top */
758 while (handle->level > 0 &&
759 (path->left == path->entries - 1)) {
760 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent);
763 if (extent.e_lblk == start)
765 path = handle->path + handle->level;
766 extent.e_len += (extent.e_lblk - start);
767 extent.e_lblk = start;
768 retval = ext2fs_extent_replace(handle, 0, &extent);
774 /* put handle back to where we started */
775 retval = ext2fs_extent_goto2(handle, orig_height, start);
780 errcode_t ext2fs_extent_replace(ext2_extent_handle_t handle,
781 int flags EXT2FS_ATTR((unused)),
782 struct ext2fs_extent *extent)
784 struct extent_path *path;
785 struct ext3_extent_idx *ix;
786 struct ext3_extent *ex;
788 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
790 if (!(handle->fs->flags & EXT2_FLAG_RW))
791 return EXT2_ET_RO_FILSYS;
794 return EXT2_ET_NO_CURRENT_NODE;
796 path = handle->path + handle->level;
798 return EXT2_ET_NO_CURRENT_NODE;
801 printf("extent replace: %u ", handle->ino);
802 dbg_print_extent(0, extent);
805 if (handle->level == handle->max_depth) {
808 ex->ee_block = ext2fs_cpu_to_le32(extent->e_lblk);
809 ex->ee_start = ext2fs_cpu_to_le32(extent->e_pblk & 0xFFFFFFFF);
810 ex->ee_start_hi = ext2fs_cpu_to_le16(extent->e_pblk >> 32);
811 if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT) {
812 if (extent->e_len > EXT_UNINIT_MAX_LEN)
813 return EXT2_ET_EXTENT_INVALID_LENGTH;
814 ex->ee_len = ext2fs_cpu_to_le16(extent->e_len +
817 if (extent->e_len > EXT_INIT_MAX_LEN)
818 return EXT2_ET_EXTENT_INVALID_LENGTH;
819 ex->ee_len = ext2fs_cpu_to_le16(extent->e_len);
824 ix->ei_leaf = ext2fs_cpu_to_le32(extent->e_pblk & 0xFFFFFFFF);
825 ix->ei_leaf_hi = ext2fs_cpu_to_le16(extent->e_pblk >> 32);
826 ix->ei_block = ext2fs_cpu_to_le32(extent->e_lblk);
834 * allocate a new block, move half the current node to it, and update parent
836 * handle will be left pointing at original record.
838 errcode_t ext2fs_extent_node_split(ext2_extent_handle_t handle)
840 errcode_t retval = 0;
841 blk64_t new_node_pblk;
842 blk64_t new_node_start;
844 blk64_t goal_blk = 0;
846 char *block_buf = NULL;
847 struct ext2fs_extent extent;
848 struct extent_path *path, *newpath = 0;
849 struct ext3_extent_header *eh, *neweh;
852 struct ext2_extent_info info;
855 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
857 if (!(handle->fs->flags & EXT2_FLAG_RW))
858 return EXT2_ET_RO_FILSYS;
861 return EXT2_ET_NO_CURRENT_NODE;
864 printf("splitting node at level %d\n", handle->level);
866 retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
870 retval = ext2fs_extent_get_info(handle, &info);
874 /* save the position we were originally splitting... */
875 orig_height = info.max_depth - info.curr_level;
876 orig_lblk = extent.e_lblk;
878 /* Is there room in the parent for a new entry? */
880 (handle->path[handle->level - 1].entries >=
881 handle->path[handle->level - 1].max_entries)) {
884 printf("parent level %d full; splitting it too\n",
887 /* split the parent */
888 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent);
891 goal_blk = extent.e_pblk;
893 retval = ext2fs_extent_node_split(handle);
897 /* get handle back to our original split position */
898 retval = ext2fs_extent_goto2(handle, orig_height, orig_lblk);
903 /* At this point, parent should have room for this split */
904 path = handle->path + handle->level;
906 return EXT2_ET_NO_CURRENT_NODE;
908 /* extent header of the current node we'll split */
909 eh = (struct ext3_extent_header *)path->buf;
911 /* splitting root level means moving them all out */
912 if (handle->level == 0) {
914 tocopy = ext2fs_le16_to_cpu(eh->eh_entries);
915 retval = ext2fs_get_mem(((handle->max_depth+2) *
916 sizeof(struct extent_path)),
921 ((handle->max_depth+2) * sizeof(struct extent_path)));
923 tocopy = ext2fs_le16_to_cpu(eh->eh_entries) / 2;
927 printf("will copy out %d of %d entries at level %d\n",
928 tocopy, ext2fs_le16_to_cpu(eh->eh_entries),
934 printf("Nothing to copy to new block!\n");
936 retval = EXT2_ET_CANT_SPLIT_EXTENT;
940 /* first we need a new block, or can do nothing. */
941 block_buf = malloc(handle->fs->blocksize);
948 dgrp_t group = ext2fs_group_of_ino(handle->fs, handle->ino);
949 __u8 log_flex = handle->fs->super->s_log_groups_per_flex;
952 group = group & ~((1 << (log_flex)) - 1);
953 goal_blk = ext2fs_group_first_block2(handle->fs, group);
955 retval = ext2fs_alloc_block2(handle->fs, goal_blk, block_buf,
961 printf("will copy to new node at block %lu\n",
962 (unsigned long) new_node_pblk);
965 /* Copy data into new block buffer */
966 /* First the header for the new block... */
967 neweh = (struct ext3_extent_header *) block_buf;
968 memcpy(neweh, eh, sizeof(struct ext3_extent_header));
969 neweh->eh_entries = ext2fs_cpu_to_le16(tocopy);
970 neweh->eh_max = ext2fs_cpu_to_le16((handle->fs->blocksize -
971 sizeof(struct ext3_extent_header)) /
972 sizeof(struct ext3_extent));
974 /* then the entries for the new block... */
975 memcpy(EXT_FIRST_INDEX(neweh),
976 EXT_FIRST_INDEX(eh) +
977 (ext2fs_le16_to_cpu(eh->eh_entries) - tocopy),
978 sizeof(struct ext3_extent_idx) * tocopy);
980 new_node_start = ext2fs_le32_to_cpu(EXT_FIRST_INDEX(neweh)->ei_block);
982 /* then update the checksum */
983 retval = ext2fs_extent_block_csum_set(handle->fs, handle->ino, neweh);
987 /* ...and write the new node block out to disk. */
988 retval = io_channel_write_blk64(handle->fs->io, new_node_pblk, 1,
994 /* OK! we've created the new node; now adjust the tree */
996 /* current path now has fewer active entries, we copied some out */
997 if (handle->level == 0) {
998 memcpy(newpath, path,
999 sizeof(struct extent_path) * (handle->max_depth+1));
1000 handle->path = newpath;
1002 path = handle->path;
1004 path->left = path->max_entries - 1;
1005 handle->max_depth++;
1006 eh->eh_depth = ext2fs_cpu_to_le16(handle->max_depth);
1008 path->entries -= tocopy;
1009 path->left -= tocopy;
1012 eh->eh_entries = ext2fs_cpu_to_le16(path->entries);
1013 /* this writes out the node, incl. the modified header */
1014 retval = update_path(handle);
1018 /* now go up and insert/replace index for new node we created */
1020 retval = ext2fs_extent_get(handle, EXT2_EXTENT_FIRST_SIB, &extent);
1024 extent.e_lblk = new_node_start;
1025 extent.e_pblk = new_node_pblk;
1026 extent.e_len = handle->path[0].end_blk - extent.e_lblk;
1027 retval = ext2fs_extent_replace(handle, 0, &extent);
1031 __u32 new_node_length;
1033 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent);
1034 /* will insert after this one; it's length is shorter now */
1035 new_node_length = new_node_start - extent.e_lblk;
1036 extent.e_len -= new_node_length;
1037 retval = ext2fs_extent_replace(handle, 0, &extent);
1041 /* now set up the new extent and insert it */
1042 extent.e_lblk = new_node_start;
1043 extent.e_pblk = new_node_pblk;
1044 extent.e_len = new_node_length;
1045 retval = ext2fs_extent_insert(handle, EXT2_EXTENT_INSERT_AFTER, &extent);
1050 /* get handle back to our original position */
1051 retval = ext2fs_extent_goto2(handle, orig_height, orig_lblk);
1055 /* new node hooked in, so update inode block count (do this here?) */
1056 handle->inode->i_blocks += (handle->fs->blocksize *
1057 EXT2FS_CLUSTER_RATIO(handle->fs)) / 512;
1058 retval = ext2fs_write_inode(handle->fs, handle->ino,
1065 ext2fs_free_mem(&newpath);
1071 errcode_t ext2fs_extent_insert(ext2_extent_handle_t handle, int flags,
1072 struct ext2fs_extent *extent)
1074 struct extent_path *path;
1075 struct ext3_extent_idx *ix;
1076 struct ext3_extent_header *eh;
1079 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1081 if (!(handle->fs->flags & EXT2_FLAG_RW))
1082 return EXT2_ET_RO_FILSYS;
1085 return EXT2_ET_NO_CURRENT_NODE;
1088 printf("extent insert: %u ", handle->ino);
1089 dbg_print_extent(0, extent);
1092 path = handle->path + handle->level;
1094 if (path->entries >= path->max_entries) {
1095 if (flags & EXT2_EXTENT_INSERT_NOSPLIT) {
1096 return EXT2_ET_CANT_INSERT_EXTENT;
1099 printf("node full (level %d) - splitting\n",
1102 retval = ext2fs_extent_node_split(handle);
1105 path = handle->path + handle->level;
1109 eh = (struct ext3_extent_header *) path->buf;
1112 if (flags & EXT2_EXTENT_INSERT_AFTER) {
1117 ix = EXT_FIRST_INDEX(eh);
1123 if (path->left >= 0)
1125 (path->left+1) * sizeof(struct ext3_extent_idx));
1129 eh = (struct ext3_extent_header *) path->buf;
1130 eh->eh_entries = ext2fs_cpu_to_le16(path->entries);
1132 retval = ext2fs_extent_replace(handle, 0, extent);
1136 retval = update_path(handle);
1143 ext2fs_extent_delete(handle, 0);
1148 * Sets the physical block for a logical file block in the extent tree.
1150 * May: map unmapped, unmap mapped, or remap mapped blocks.
1152 * Mapping an unmapped block adds a single-block extent.
1154 * Unmapping first or last block modifies extent in-place
1155 * - But may need to fix parent's starts too in first-block case
1157 * Mapping any unmapped block requires adding a (single-block) extent
1158 * and inserting into proper point in tree.
1160 * Modifying (unmapping or remapping) a block in the middle
1161 * of an extent requires splitting the extent.
1162 * - Remapping case requires new single-block extent.
1164 * Remapping first or last block adds an extent.
1166 * We really need extent adding to be smart about merging.
1169 errcode_t ext2fs_extent_set_bmap(ext2_extent_handle_t handle,
1170 blk64_t logical, blk64_t physical, int flags)
1172 errcode_t ec, retval = 0;
1173 int mapped = 1; /* logical is mapped? */
1175 int extent_uninit = 0;
1176 int prev_uninit = 0;
1177 int next_uninit = 0;
1179 int max_len = EXT_INIT_MAX_LEN;
1180 int has_prev, has_next;
1182 struct extent_path *path;
1183 struct ext2fs_extent extent, next_extent, prev_extent;
1184 struct ext2fs_extent newextent;
1185 struct ext2_extent_info info;
1187 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1190 printf("set_bmap ino %u log %lld phys %lld flags %d\n",
1191 handle->ino, logical, physical, flags);
1194 if (!(handle->fs->flags & EXT2_FLAG_RW))
1195 return EXT2_ET_RO_FILSYS;
1198 return EXT2_ET_NO_CURRENT_NODE;
1200 path = handle->path + handle->level;
1202 if (flags & EXT2_EXTENT_SET_BMAP_UNINIT) {
1204 max_len = EXT_UNINIT_MAX_LEN;
1207 /* if (re)mapping, set up new extent to insert */
1209 newextent.e_len = 1;
1210 newextent.e_pblk = physical;
1211 newextent.e_lblk = logical;
1212 newextent.e_flags = EXT2_EXTENT_FLAGS_LEAF;
1214 newextent.e_flags |= EXT2_EXTENT_FLAGS_UNINIT;
1217 /* special case if the extent tree is completely empty */
1218 if ((handle->max_depth == 0) && (path->entries == 0)) {
1219 retval = ext2fs_extent_insert(handle, 0, &newextent);
1223 /* save our original location in the extent tree */
1224 if ((retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT,
1226 if (retval != EXT2_ET_NO_CURRENT_NODE)
1228 memset(&extent, 0, sizeof(extent));
1230 if ((retval = ext2fs_extent_get_info(handle, &info)))
1232 orig_height = info.max_depth - info.curr_level;
1233 orig_lblk = extent.e_lblk;
1235 /* go to the logical spot we want to (re/un)map */
1236 retval = ext2fs_extent_goto(handle, logical);
1238 if (retval == EXT2_ET_EXTENT_NOT_FOUND) {
1243 printf("block %llu already unmapped\n",
1253 * This may be the extent *before* the requested logical,
1254 * if it's currently unmapped.
1256 * Get the previous and next leaf extents, if they are present.
1258 retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
1261 if (extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT)
1263 retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_LEAF, &next_extent);
1266 if (retval != EXT2_ET_EXTENT_NO_NEXT)
1269 dbg_print_extent("set_bmap: next_extent",
1272 if (next_extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT)
1275 retval = ext2fs_extent_goto(handle, logical);
1276 if (retval && retval != EXT2_ET_EXTENT_NOT_FOUND)
1278 retval = ext2fs_extent_get(handle, EXT2_EXTENT_PREV_LEAF, &prev_extent);
1281 if (retval != EXT2_ET_EXTENT_NO_PREV)
1285 dbg_print_extent("set_bmap: prev_extent",
1287 if (prev_extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT)
1290 retval = ext2fs_extent_goto(handle, logical);
1291 if (retval && retval != EXT2_ET_EXTENT_NOT_FOUND)
1294 /* check if already pointing to the requested physical */
1295 if (mapped && (new_uninit == extent_uninit) &&
1296 (extent.e_pblk + (logical - extent.e_lblk) == physical)) {
1298 printf("physical block (at %llu) unchanged\n", logical);
1305 printf("mapping unmapped logical block %llu\n", logical);
1307 if ((logical == extent.e_lblk + extent.e_len) &&
1308 (physical == extent.e_pblk + extent.e_len) &&
1309 (new_uninit == extent_uninit) &&
1310 ((int) extent.e_len < max_len-1)) {
1312 retval = ext2fs_extent_replace(handle, 0, &extent);
1313 } else if ((logical == extent.e_lblk - 1) &&
1314 (physical == extent.e_pblk - 1) &&
1315 (new_uninit == extent_uninit) &&
1316 ((int) extent.e_len < max_len - 1)) {
1320 retval = ext2fs_extent_replace(handle, 0, &extent);
1321 } else if (has_next &&
1322 (logical == next_extent.e_lblk - 1) &&
1323 (physical == next_extent.e_pblk - 1) &&
1324 (new_uninit == next_uninit) &&
1325 ((int) next_extent.e_len < max_len - 1)) {
1326 retval = ext2fs_extent_get(handle,
1327 EXT2_EXTENT_NEXT_LEAF,
1331 next_extent.e_len++;
1332 next_extent.e_lblk--;
1333 next_extent.e_pblk--;
1334 retval = ext2fs_extent_replace(handle, 0, &next_extent);
1335 } else if (logical < extent.e_lblk)
1336 retval = ext2fs_extent_insert(handle, 0, &newextent);
1338 retval = ext2fs_extent_insert(handle,
1339 EXT2_EXTENT_INSERT_AFTER, &newextent);
1342 retval = ext2fs_extent_fix_parents(handle);
1345 } else if ((logical == extent.e_lblk) && (extent.e_len == 1)) {
1347 printf("(re/un)mapping only block in extent\n");
1350 retval = ext2fs_extent_replace(handle, 0, &newextent);
1352 retval = ext2fs_extent_delete(handle, 0);
1355 ec = ext2fs_extent_fix_parents(handle);
1356 if (ec != EXT2_ET_NO_CURRENT_NODE)
1362 } else if (logical == extent.e_lblk + extent.e_len - 1) {
1364 printf("(re/un)mapping last block in extent\n");
1368 (logical == (next_extent.e_lblk - 1)) &&
1369 (physical == (next_extent.e_pblk - 1)) &&
1370 (new_uninit == next_uninit) &&
1371 ((int) next_extent.e_len < max_len - 1)) {
1372 retval = ext2fs_extent_get(handle,
1373 EXT2_EXTENT_NEXT_LEAF, &next_extent);
1376 next_extent.e_len++;
1377 next_extent.e_lblk--;
1378 next_extent.e_pblk--;
1379 retval = ext2fs_extent_replace(handle, 0,
1383 retval = ext2fs_extent_fix_parents(handle);
1387 retval = ext2fs_extent_insert(handle,
1388 EXT2_EXTENT_INSERT_AFTER, &newextent);
1391 /* Now pointing at inserted extent; move back to prev */
1392 retval = ext2fs_extent_get(handle,
1393 EXT2_EXTENT_PREV_LEAF,
1399 retval = ext2fs_extent_replace(handle, 0, &extent);
1402 } else if (logical == extent.e_lblk) {
1404 printf("(re/un)mapping first block in extent\n");
1408 (logical == (prev_extent.e_lblk +
1409 prev_extent.e_len)) &&
1410 (physical == (prev_extent.e_pblk +
1411 prev_extent.e_len)) &&
1412 (new_uninit == prev_uninit) &&
1413 ((int) prev_extent.e_len < max_len-1)) {
1414 retval = ext2fs_extent_get(handle,
1415 EXT2_EXTENT_PREV_LEAF, &prev_extent);
1418 prev_extent.e_len++;
1419 retval = ext2fs_extent_replace(handle, 0,
1422 retval = ext2fs_extent_insert(handle,
1426 retval = ext2fs_extent_get(handle,
1427 EXT2_EXTENT_NEXT_LEAF,
1435 retval = ext2fs_extent_replace(handle, 0, &extent);
1438 retval = ext2fs_extent_fix_parents(handle);
1444 struct ext2fs_extent orig_extent;
1448 printf("(re/un)mapping in middle of extent\n");
1450 /* need to split this extent; later */
1451 orig_lblk = extent.e_lblk;
1452 orig_length = extent.e_len;
1453 orig_extent = extent;
1455 /* shorten pre-split extent */
1456 extent.e_len = (logical - extent.e_lblk);
1457 retval = ext2fs_extent_replace(handle, 0, &extent);
1460 /* insert our new extent, if any */
1462 /* insert new extent after current */
1463 retval = ext2fs_extent_insert(handle,
1464 EXT2_EXTENT_INSERT_AFTER, &newextent);
1466 r2 = ext2fs_extent_goto(handle, orig_lblk);
1468 ext2fs_extent_replace(handle, 0,
1473 /* add post-split extent */
1474 extent.e_pblk += extent.e_len + 1;
1475 extent.e_lblk += extent.e_len + 1;
1476 extent.e_len = orig_length - extent.e_len - 1;
1477 retval = ext2fs_extent_insert(handle,
1478 EXT2_EXTENT_INSERT_AFTER, &extent);
1481 r2 = ext2fs_extent_goto(handle,
1484 ext2fs_extent_delete(handle, 0);
1486 r2 = ext2fs_extent_goto(handle, orig_lblk);
1488 ext2fs_extent_replace(handle, 0, &orig_extent);
1494 /* get handle back to its position */
1495 if (orig_height > handle->max_depth)
1496 orig_height = handle->max_depth; /* In case we shortened the tree */
1497 ext2fs_extent_goto2(handle, orig_height, orig_lblk);
1501 errcode_t ext2fs_extent_delete(ext2_extent_handle_t handle, int flags)
1503 struct extent_path *path;
1505 struct ext3_extent_header *eh;
1506 errcode_t retval = 0;
1508 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1510 if (!(handle->fs->flags & EXT2_FLAG_RW))
1511 return EXT2_ET_RO_FILSYS;
1514 return EXT2_ET_NO_CURRENT_NODE;
1518 struct ext2fs_extent extent;
1520 retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT,
1523 printf("extent delete %u ", handle->ino);
1524 dbg_print_extent(0, &extent);
1529 path = handle->path + handle->level;
1531 return EXT2_ET_NO_CURRENT_NODE;
1536 memmove(cp, cp + sizeof(struct ext3_extent_idx),
1537 path->left * sizeof(struct ext3_extent_idx));
1540 struct ext3_extent_idx *ix = path->curr;
1544 if (--path->entries == 0)
1547 /* if non-root node has no entries left, remove it & parent ptr to it */
1548 if (path->entries == 0 && handle->level) {
1549 if (!(flags & EXT2_EXTENT_DELETE_KEEP_EMPTY)) {
1550 struct ext2fs_extent extent;
1552 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP,
1557 retval = ext2fs_extent_delete(handle, flags);
1558 handle->inode->i_blocks -=
1559 (handle->fs->blocksize *
1560 EXT2FS_CLUSTER_RATIO(handle->fs)) / 512;
1561 retval = ext2fs_write_inode(handle->fs, handle->ino,
1563 ext2fs_block_alloc_stats2(handle->fs,
1567 eh = (struct ext3_extent_header *) path->buf;
1568 eh->eh_entries = ext2fs_cpu_to_le16(path->entries);
1569 if ((path->entries == 0) && (handle->level == 0))
1570 eh->eh_depth = handle->max_depth = 0;
1571 retval = update_path(handle);
1576 errcode_t ext2fs_extent_get_info(ext2_extent_handle_t handle,
1577 struct ext2_extent_info *info)
1579 struct extent_path *path;
1581 EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1583 memset(info, 0, sizeof(struct ext2_extent_info));
1585 path = handle->path + handle->level;
1588 info->curr_entry = ((char *) path->curr - path->buf) /
1589 sizeof(struct ext3_extent_idx);
1591 info->curr_entry = 0;
1592 info->num_entries = path->entries;
1593 info->max_entries = path->max_entries;
1594 info->bytes_avail = (path->max_entries - path->entries) *
1595 sizeof(struct ext3_extent);
1598 info->curr_level = handle->level;
1599 info->max_depth = handle->max_depth;
1600 info->max_lblk = ((__u64) 1 << 32) - 1;
1601 info->max_pblk = ((__u64) 1 << 48) - 1;
1602 info->max_len = (1UL << 15);
1603 info->max_uninit_len = (1UL << 15) - 1;
1610 * Override debugfs's prompt
1612 const char *debug_prog_name = "tst_extents";