lib/ext2fs/extent.c

   1 /*
   2  * extent.c --- routines to implement extents support
   3  *
   4  * Copyright (C) 2007 Theodore Ts'o.
   5  *
   6  * %Begin-Header%
   7  * This file may be redistributed under the terms of the GNU Library
   8  * General Public License, version 2.
   9  * %End-Header%
  10  */
  11
  12 #include "config.h"
  13 #include <stdio.h>
  14 #include <string.h>
  15 #if HAVE_UNISTD_H
  16 #include <unistd.h>
  17 #endif
  18 #if HAVE_ERRNO_H
  19 #include <errno.h>
  20 #endif
  21 #if HAVE_SYS_STAT_H
  22 #include <sys/stat.h>
  23 #endif
  24 #if HAVE_SYS_TYPES_H
  25 #include <sys/types.h>
  26 #endif
  27
  28 #include "ext2_fs.h"
  29 #include "ext2fsP.h"
  30 #include "e2image.h"
  31
  32 #undef DEBUG
  33
  34 /*
  35  * Definitions to be dropped in lib/ext2fs/ext2fs.h
  36  */
  37
  38 /*
  39  * Private definitions
  40  */
  41
  42 struct extent_path {
  43         char            *buf;
  44         int             entries;
  45         int             max_entries;
  46         int             left;
  47         int             visit_num;
  48         int             flags;
  49         blk64_t         end_blk;
  50         void            *curr;
  51 };
  52
  53
  54 struct ext2_extent_handle {
  55         errcode_t               magic;
  56         ext2_filsys             fs;
  57         ext2_ino_t              ino;
  58         struct ext2_inode       *inode;
  59         struct ext2_inode       inodebuf;
  60         int                     type;
  61         int                     level;
  62         int                     max_depth;
  63         struct extent_path      *path;
  64 };
  65
  66 struct ext2_extent_path {
  67         errcode_t               magic;
  68         int                     leaf_height;
  69         blk64_t                 lblk;
  70 };
  71
  72 /*
  73  *  Useful Debugging stuff
  74  */
  75
  76 #ifdef DEBUG
  77 static void dbg_show_header(struct ext3_extent_header *eh)
  78 {
  79         printf("header: magic=%x entries=%u max=%u depth=%u generation=%u\n",
  80                         ext2fs_le16_to_cpu(eh->eh_magic),
  81                         ext2fs_le16_to_cpu(eh->eh_entries),
  82                         ext2fs_le16_to_cpu(eh->eh_max),
  83                         ext2fs_le16_to_cpu(eh->eh_depth),
  84                         ext2fs_le32_to_cpu(eh->eh_generation));
  85 }
  86
  87 static void dbg_show_index(struct ext3_extent_idx *ix)
  88 {
  89         printf("index: block=%u leaf=%u leaf_hi=%u unused=%u\n",
  90                         ext2fs_le32_to_cpu(ix->ei_block),
  91                         ext2fs_le32_to_cpu(ix->ei_leaf),
  92                         ext2fs_le16_to_cpu(ix->ei_leaf_hi),
  93                         ext2fs_le16_to_cpu(ix->ei_unused));
  94 }
  95
  96 static void dbg_show_extent(struct ext3_extent *ex)
  97 {
  98         printf("extent: block=%u-%u len=%u start=%u start_hi=%u\n",
  99                         ext2fs_le32_to_cpu(ex->ee_block),
 100                         ext2fs_le32_to_cpu(ex->ee_block) +
 101                         ext2fs_le16_to_cpu(ex->ee_len) - 1,
 102                         ext2fs_le16_to_cpu(ex->ee_len),
 103                         ext2fs_le32_to_cpu(ex->ee_start),
 104                         ext2fs_le16_to_cpu(ex->ee_start_hi));
 105 }
 106
 107 static void dbg_print_extent(char *desc, struct ext2fs_extent *extent)
 108 {
 109         if (desc)
 110                 printf("%s: ", desc);
 111         printf("extent: lblk %llu--%llu, len %u, pblk %llu, flags: ",
 112                extent->e_lblk, extent->e_lblk + extent->e_len - 1,
 113                extent->e_len, extent->e_pblk);
 114         if (extent->e_flags & EXT2_EXTENT_FLAGS_LEAF)
 115                 fputs("LEAF ", stdout);
 116         if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT)
 117                 fputs("UNINIT ", stdout);
 118         if (extent->e_flags & EXT2_EXTENT_FLAGS_SECOND_VISIT)
 119                 fputs("2ND_VISIT ", stdout);
 120         if (!extent->e_flags)
 121                 fputs("(none)", stdout);
 122         fputc('\n', stdout);
 123
 124 }
 125
 126 static void dump_path(const char *tag, struct ext2_extent_handle *handle,
 127                       struct extent_path *path)
 128 {
 129         struct extent_path *ppp = path;
 130         printf("%s: level=%d\n", tag, handle->level);
 131
 132         do {
 133                 printf("%s: path=%ld buf=%p entries=%d max_entries=%d left=%d "
 134                        "visit_num=%d flags=0x%x end_blk=%llu curr=%p(%ld)\n",
 135                        tag, (ppp - handle->path), ppp->buf, ppp->entries,
 136                        ppp->max_entries, ppp->left, ppp->visit_num, ppp->flags,
 137                        ppp->end_blk, ppp->curr, ppp->curr - (void *)ppp->buf);
 138                 printf("  ");
 139                 dbg_show_header((struct ext3_extent_header *)ppp->buf);
 140                 if (ppp->curr) {
 141                         printf("  ");
 142                         dbg_show_index(ppp->curr);
 143                         printf("  ");
 144                         dbg_show_extent(ppp->curr);
 145                 }
 146                 ppp--;
 147         } while (ppp >= handle->path);
 148         fflush(stdout);
 149
 150         return;
 151 }
 152
 153 #else
 154 #define dbg_show_header(eh) do { } while (0)
 155 #define dbg_show_index(ix) do { } while (0)
 156 #define dbg_show_extent(ex) do { } while (0)
 157 #define dbg_print_extent(desc, ex) do { } while (0)
 158 #define dump_path(tag, handle, path) do { } while (0)
 159 #endif
 160
 161 /*
 162  * Verify the extent header as being sane
 163  */
 164 errcode_t ext2fs_extent_header_verify(void *ptr, int size)
 165 {
 166         int eh_max, entry_size;
 167         struct ext3_extent_header *eh = ptr;
 168
 169         dbg_show_header(eh);
 170         if (ext2fs_le16_to_cpu(eh->eh_magic) != EXT3_EXT_MAGIC)
 171                 return EXT2_ET_EXTENT_HEADER_BAD;
 172         if (ext2fs_le16_to_cpu(eh->eh_entries) > ext2fs_le16_to_cpu(eh->eh_max))
 173                 return EXT2_ET_EXTENT_HEADER_BAD;
 174         if (eh->eh_depth == 0)
 175                 entry_size = sizeof(struct ext3_extent);
 176         else
 177                 entry_size = sizeof(struct ext3_extent_idx);
 178
 179         eh_max = (size - sizeof(*eh)) / entry_size;
 180         /* Allow two extent-sized items at the end of the block, for
 181          * ext4_extent_tail with checksum in the future. */
 182         if ((ext2fs_le16_to_cpu(eh->eh_max) > eh_max) ||
 183             (ext2fs_le16_to_cpu(eh->eh_max) < (eh_max - 2)))
 184                 return EXT2_ET_EXTENT_HEADER_BAD;
 185
 186         return 0;
 187 }
 188
 189
 190 /*
 191  * Begin functions to handle an inode's extent information
 192  */
 193 void ext2fs_extent_free(ext2_extent_handle_t handle)
 194 {
 195         int                     i;
 196
 197         if (!handle)
 198                 return;
 199
 200         if (handle->path) {
 201                 for (i=1; i <= handle->max_depth; i++) {
 202                         if (handle->path[i].buf)
 203                                 ext2fs_free_mem(&handle->path[i].buf);
 204                 }
 205                 ext2fs_free_mem(&handle->path);
 206         }
 207         ext2fs_free_mem(&handle);
 208 }
 209
 210 errcode_t ext2fs_extent_open(ext2_filsys fs, ext2_ino_t ino,
 211                                     ext2_extent_handle_t *ret_handle)
 212 {
 213         return ext2fs_extent_open2(fs, ino, NULL, ret_handle);
 214 }
 215
 216 errcode_t ext2fs_extent_open2(ext2_filsys fs, ext2_ino_t ino,
 217                                     struct ext2_inode *inode,
 218                                     ext2_extent_handle_t *ret_handle)
 219 {
 220         struct ext2_extent_handle       *handle;
 221         errcode_t                       retval;
 222         int                             i;
 223         struct ext3_extent_header       *eh;
 224
 225         EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS);
 226
 227         if (!inode)
 228                 if ((ino == 0) || (ino > fs->super->s_inodes_count))
 229                         return EXT2_ET_BAD_INODE_NUM;
 230
 231         retval = ext2fs_get_mem(sizeof(struct ext2_extent_handle), &handle);
 232         if (retval)
 233                 return retval;
 234         memset(handle, 0, sizeof(struct ext2_extent_handle));
 235
 236         handle->ino = ino;
 237         handle->fs = fs;
 238
 239         if (inode) {
 240                 handle->inode = inode;
 241         } else {
 242                 handle->inode = &handle->inodebuf;
 243                 retval = ext2fs_read_inode(fs, ino, handle->inode);
 244                 if (retval)
 245                         goto errout;
 246         }
 247
 248         eh = (struct ext3_extent_header *) &handle->inode->i_block[0];
 249
 250         for (i=0; i < EXT2_N_BLOCKS; i++)
 251                 if (handle->inode->i_block[i])
 252                         break;
 253         if (i >= EXT2_N_BLOCKS) {
 254                 eh->eh_magic = ext2fs_cpu_to_le16(EXT3_EXT_MAGIC);
 255                 eh->eh_depth = 0;
 256                 eh->eh_entries = 0;
 257                 i = (sizeof(handle->inode->i_block) - sizeof(*eh)) /
 258                         sizeof(struct ext3_extent);
 259                 eh->eh_max = ext2fs_cpu_to_le16(i);
 260                 handle->inode->i_flags |= EXT4_EXTENTS_FL;
 261         }
 262
 263         if (!(handle->inode->i_flags & EXT4_EXTENTS_FL)) {
 264                 retval = EXT2_ET_INODE_NOT_EXTENT;
 265                 goto errout;
 266         }
 267
 268         retval = ext2fs_extent_header_verify(eh, sizeof(handle->inode->i_block));
 269         if (retval)
 270                 goto errout;
 271
 272         handle->max_depth = ext2fs_le16_to_cpu(eh->eh_depth);
 273         handle->type = ext2fs_le16_to_cpu(eh->eh_magic);
 274
 275         retval = ext2fs_get_mem(((handle->max_depth+1) *
 276                                  sizeof(struct extent_path)),
 277                                 &handle->path);
 278         memset(handle->path, 0,
 279                (handle->max_depth+1) * sizeof(struct extent_path));
 280         handle->path[0].buf = (char *) handle->inode->i_block;
 281
 282         handle->path[0].left = handle->path[0].entries =
 283                 ext2fs_le16_to_cpu(eh->eh_entries);
 284         handle->path[0].max_entries = ext2fs_le16_to_cpu(eh->eh_max);
 285         handle->path[0].curr = 0;
 286         handle->path[0].end_blk =
 287                 (EXT2_I_SIZE(handle->inode) + fs->blocksize - 1) >>
 288                  EXT2_BLOCK_SIZE_BITS(fs->super);
 289         handle->path[0].visit_num = 1;
 290         handle->level = 0;
 291         handle->magic = EXT2_ET_MAGIC_EXTENT_HANDLE;
 292
 293         *ret_handle = handle;
 294         return 0;
 295
 296 errout:
 297         ext2fs_extent_free(handle);
 298         return retval;
 299 }
 300
 301 /*
 302  * This function is responsible for (optionally) moving through the
 303  * extent tree and then returning the current extent
 304  */
 305 errcode_t ext2fs_extent_get(ext2_extent_handle_t handle,
 306                             int flags, struct ext2fs_extent *extent)
 307 {
 308         struct extent_path      *path, *newpath;
 309         struct ext3_extent_header       *eh;
 310         struct ext3_extent_idx          *ix = 0;
 311         struct ext3_extent              *ex;
 312         errcode_t                       retval;
 313         blk64_t                         blk;
 314         blk64_t                         end_blk;
 315         int                             orig_op, op;
 316
 317         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
 318
 319         if (!handle->path)
 320                 return EXT2_ET_NO_CURRENT_NODE;
 321
 322         orig_op = op = flags & EXT2_EXTENT_MOVE_MASK;
 323
 324 retry:
 325         path = handle->path + handle->level;
 326         if ((orig_op == EXT2_EXTENT_NEXT) ||
 327             (orig_op == EXT2_EXTENT_NEXT_LEAF)) {
 328                 if (handle->level < handle->max_depth) {
 329                         /* interior node */
 330                         if (path->visit_num == 0) {
 331                                 path->visit_num++;
 332                                 op = EXT2_EXTENT_DOWN;
 333                         } else if (path->left > 0)
 334                                 op = EXT2_EXTENT_NEXT_SIB;
 335                         else if (handle->level > 0)
 336                                 op = EXT2_EXTENT_UP;
 337                         else
 338                                 return EXT2_ET_EXTENT_NO_NEXT;
 339                 } else {
 340                         /* leaf node */
 341                         if (path->left > 0)
 342                                 op = EXT2_EXTENT_NEXT_SIB;
 343                         else if (handle->level > 0)
 344                                 op = EXT2_EXTENT_UP;
 345                         else
 346                                 return EXT2_ET_EXTENT_NO_NEXT;
 347                 }
 348                 if (op != EXT2_EXTENT_NEXT_SIB) {
 349 #ifdef DEBUG_GET_EXTENT
 350                         printf("<<<< OP = %s\n",
 351                                (op == EXT2_EXTENT_DOWN) ? "down" :
 352                                ((op == EXT2_EXTENT_UP) ? "up" : "unknown"));
 353 #endif
 354                 }
 355         }
 356
 357         if ((orig_op == EXT2_EXTENT_PREV) ||
 358             (orig_op == EXT2_EXTENT_PREV_LEAF)) {
 359                 if (handle->level < handle->max_depth) {
 360                         /* interior node */
 361                         if (path->visit_num > 0 ) {
 362                                 /* path->visit_num = 0; */
 363                                 op = EXT2_EXTENT_DOWN_AND_LAST;
 364                         } else if (path->left < path->entries-1)
 365                                 op = EXT2_EXTENT_PREV_SIB;
 366                         else if (handle->level > 0)
 367                                 op = EXT2_EXTENT_UP;
 368                         else
 369                                 return EXT2_ET_EXTENT_NO_PREV;
 370                 } else {
 371                         /* leaf node */
 372                         if (path->left < path->entries-1)
 373                                 op = EXT2_EXTENT_PREV_SIB;
 374                         else if (handle->level > 0)
 375                                 op = EXT2_EXTENT_UP;
 376                         else
 377                                 return EXT2_ET_EXTENT_NO_PREV;
 378                 }
 379                 if (op != EXT2_EXTENT_PREV_SIB) {
 380 #ifdef DEBUG_GET_EXTENT
 381                         printf("<<<< OP = %s\n",
 382                                (op == EXT2_EXTENT_DOWN_AND_LAST) ? "down/last" :
 383                                ((op == EXT2_EXTENT_UP) ? "up" : "unknown"));
 384 #endif
 385                 }
 386         }
 387
 388         if (orig_op == EXT2_EXTENT_LAST_LEAF) {
 389                 if ((handle->level < handle->max_depth) &&
 390                     (path->left == 0))
 391                         op = EXT2_EXTENT_DOWN;
 392                 else
 393                         op = EXT2_EXTENT_LAST_SIB;
 394 #ifdef DEBUG_GET_EXTENT
 395                 printf("<<<< OP = %s\n",
 396                            (op == EXT2_EXTENT_DOWN) ? "down" : "last_sib");
 397 #endif
 398         }
 399
 400         switch (op) {
 401         case EXT2_EXTENT_CURRENT:
 402                 ix = path->curr;
 403                 break;
 404         case EXT2_EXTENT_ROOT:
 405                 handle->level = 0;
 406                 path = handle->path + handle->level;
 407                 /* fallthrough */
 408         case EXT2_EXTENT_FIRST_SIB:
 409                 path->left = path->entries;
 410                 path->curr = 0;
 411                 /* fallthrough */
 412         case EXT2_EXTENT_NEXT_SIB:
 413                 if (path->left <= 0)
 414                         return EXT2_ET_EXTENT_NO_NEXT;
 415                 if (path->curr) {
 416                         ix = path->curr;
 417                         ix++;
 418                 } else {
 419                         eh = (struct ext3_extent_header *) path->buf;
 420                         ix = EXT_FIRST_INDEX(eh);
 421                 }
 422                 path->left--;
 423                 path->curr = ix;
 424                 path->visit_num = 0;
 425                 break;
 426         case EXT2_EXTENT_PREV_SIB:
 427                 if (!path->curr ||
 428                     path->left+1 >= path->entries)
 429                         return EXT2_ET_EXTENT_NO_PREV;
 430                 ix = path->curr;
 431                 ix--;
 432                 path->curr = ix;
 433                 path->left++;
 434                 if (handle->level < handle->max_depth)
 435                         path->visit_num = 1;
 436                 break;
 437         case EXT2_EXTENT_LAST_SIB:
 438                 eh = (struct ext3_extent_header *) path->buf;
 439                 path->curr = EXT_LAST_EXTENT(eh);
 440                 ix = path->curr;
 441                 path->left = 0;
 442                 path->visit_num = 0;
 443                 break;
 444         case EXT2_EXTENT_UP:
 445                 if (handle->level <= 0)
 446                         return EXT2_ET_EXTENT_NO_UP;
 447                 handle->level--;
 448                 path--;
 449                 ix = path->curr;
 450                 if ((orig_op == EXT2_EXTENT_PREV) ||
 451                     (orig_op == EXT2_EXTENT_PREV_LEAF))
 452                         path->visit_num = 0;
 453                 break;
 454         case EXT2_EXTENT_DOWN:
 455         case EXT2_EXTENT_DOWN_AND_LAST:
 456                 if (!path->curr ||(handle->level >= handle->max_depth))
 457                         return EXT2_ET_EXTENT_NO_DOWN;
 458
 459                 ix = path->curr;
 460                 newpath = path + 1;
 461                 if (!newpath->buf) {
 462                         retval = ext2fs_get_mem(handle->fs->blocksize,
 463                                                 &newpath->buf);
 464                         if (retval)
 465                                 return retval;
 466                 }
 467                 blk = ext2fs_le32_to_cpu(ix->ei_leaf) +
 468                         ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32);
 469                 if ((handle->fs->flags & EXT2_FLAG_IMAGE_FILE) &&
 470                     (handle->fs->io != handle->fs->image_io))
 471                         memset(newpath->buf, 0, handle->fs->blocksize);
 472                 else {
 473                         retval = io_channel_read_blk64(handle->fs->io,
 474                                                      blk, 1, newpath->buf);
 475                         if (retval)
 476                                 return retval;
 477                 }
 478                 handle->level++;
 479
 480                 eh = (struct ext3_extent_header *) newpath->buf;
 481
 482                 retval = ext2fs_extent_header_verify(eh, handle->fs->blocksize);
 483                 if (retval) {
 484                         handle->level--;
 485                         return retval;
 486                 }
 487
 488                 newpath->left = newpath->entries =
 489                         ext2fs_le16_to_cpu(eh->eh_entries);
 490                 newpath->max_entries = ext2fs_le16_to_cpu(eh->eh_max);
 491
 492                 if (path->left > 0) {
 493                         ix++;
 494                         newpath->end_blk = ext2fs_le32_to_cpu(ix->ei_block);
 495                 } else
 496                         newpath->end_blk = path->end_blk;
 497
 498                 path = newpath;
 499                 if (op == EXT2_EXTENT_DOWN) {
 500                         ix = EXT_FIRST_INDEX((struct ext3_extent_header *) eh);
 501                         path->curr = ix;
 502                         path->left = path->entries - 1;
 503                         path->visit_num = 0;
 504                 } else {
 505                         ix = EXT_LAST_INDEX((struct ext3_extent_header *) eh);
 506                         path->curr = ix;
 507                         path->left = 0;
 508                         if (handle->level < handle->max_depth)
 509                                 path->visit_num = 1;
 510                 }
 511 #ifdef DEBUG_GET_EXTENT
 512                 printf("Down to level %d/%d, end_blk=%llu\n",
 513                            handle->level, handle->max_depth,
 514                            path->end_blk);
 515 #endif
 516                 break;
 517         default:
 518                 return EXT2_ET_OP_NOT_SUPPORTED;
 519         }
 520
 521         if (!ix)
 522                 return EXT2_ET_NO_CURRENT_NODE;
 523
 524         extent->e_flags = 0;
 525 #ifdef DEBUG_GET_EXTENT
 526         printf("(Left %d)\n", path->left);
 527 #endif
 528
 529         if (handle->level == handle->max_depth) {
 530                 ex = (struct ext3_extent *) ix;
 531
 532                 extent->e_pblk = ext2fs_le32_to_cpu(ex->ee_start) +
 533                         ((__u64) ext2fs_le16_to_cpu(ex->ee_start_hi) << 32);
 534                 extent->e_lblk = ext2fs_le32_to_cpu(ex->ee_block);
 535                 extent->e_len = ext2fs_le16_to_cpu(ex->ee_len);
 536                 extent->e_flags |= EXT2_EXTENT_FLAGS_LEAF;
 537                 if (extent->e_len > EXT_INIT_MAX_LEN) {
 538                         extent->e_len -= EXT_INIT_MAX_LEN;
 539                         extent->e_flags |= EXT2_EXTENT_FLAGS_UNINIT;
 540                 }
 541         } else {
 542                 extent->e_pblk = ext2fs_le32_to_cpu(ix->ei_leaf) +
 543                         ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32);
 544                 extent->e_lblk = ext2fs_le32_to_cpu(ix->ei_block);
 545                 if (path->left > 0) {
 546                         ix++;
 547                         end_blk = ext2fs_le32_to_cpu(ix->ei_block);
 548                 } else
 549                         end_blk = path->end_blk;
 550
 551                 extent->e_len = end_blk - extent->e_lblk;
 552         }
 553         if (path->visit_num)
 554                 extent->e_flags |= EXT2_EXTENT_FLAGS_SECOND_VISIT;
 555
 556         if (((orig_op == EXT2_EXTENT_NEXT_LEAF) ||
 557              (orig_op == EXT2_EXTENT_PREV_LEAF)) &&
 558             (handle->level != handle->max_depth))
 559                 goto retry;
 560
 561         if ((orig_op == EXT2_EXTENT_LAST_LEAF) &&
 562             ((handle->level != handle->max_depth) ||
 563              (path->left != 0)))
 564                 goto retry;
 565
 566         return 0;
 567 }
 568
 569 static errcode_t update_path(ext2_extent_handle_t handle)
 570 {
 571         blk64_t                         blk;
 572         errcode_t                       retval;
 573         struct ext3_extent_idx          *ix;
 574
 575         if (handle->level == 0) {
 576                 retval = ext2fs_write_inode(handle->fs, handle->ino,
 577                                             handle->inode);
 578         } else {
 579                 ix = handle->path[handle->level - 1].curr;
 580                 blk = ext2fs_le32_to_cpu(ix->ei_leaf) +
 581                         ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32);
 582
 583                 retval = io_channel_write_blk64(handle->fs->io,
 584                                       blk, 1, handle->path[handle->level].buf);
 585         }
 586         return retval;
 587 }
 588
 589 #if 0
 590 errcode_t ext2fs_extent_save_path(ext2_extent_handle_t handle,
 591                                   ext2_extent_path_t *ret_path)
 592 {
 593         ext2_extent_path_t      save_path;
 594         struct ext2fs_extent    extent;
 595         struct ext2_extent_info info;
 596         errcode_t               retval;
 597
 598         retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
 599         if (retval)
 600                 return retval;
 601
 602         retval = ext2fs_extent_get_info(handle, &info);
 603         if (retval)
 604                 return retval;
 605
 606         retval = ext2fs_get_mem(sizeof(struct ext2_extent_path), &save_path);
 607         if (retval)
 608                 return retval;
 609         memset(save_path, 0, sizeof(struct ext2_extent_path));
 610
 611         save_path->magic = EXT2_ET_MAGIC_EXTENT_PATH;
 612         save_path->leaf_height = info.max_depth - info.curr_level - 1;
 613         save_path->lblk = extent.e_lblk;
 614
 615         *ret_path = save_path;
 616         return 0;
 617 }
 618
 619 errcode_t ext2fs_extent_free_path(ext2_extent_path_t path)
 620 {
 621         EXT2_CHECK_MAGIC(path, EXT2_ET_MAGIC_EXTENT_PATH);
 622
 623         ext2fs_free_mem(&path);
 624         return 0;
 625 }
 626 #endif
 627
 628 /*
 629  * Go to the node at leaf_level which contains logical block blk.
 630  *
 631  * leaf_level is height from the leaf node level, i.e.
 632  * leaf_level 0 is at leaf node, leaf_level 1 is 1 above etc.
 633  *
 634  * If "blk" has no mapping (hole) then handle is left at last
 635  * extent before blk.
 636  */
 637 errcode_t ext2fs_extent_goto2(ext2_extent_handle_t handle,
 638                               int leaf_level, blk64_t blk)
 639 {
 640         struct ext2fs_extent    extent;
 641         errcode_t               retval;
 642
 643         retval = ext2fs_extent_get(handle, EXT2_EXTENT_ROOT, &extent);
 644         if (retval) {
 645                 if (retval == EXT2_ET_EXTENT_NO_NEXT)
 646                         retval = EXT2_ET_EXTENT_NOT_FOUND;
 647                 return retval;
 648         }
 649
 650         if (leaf_level > handle->max_depth) {
 651 #ifdef DEBUG
 652                 printf("leaf level %d greater than tree depth %d\n",
 653                         leaf_level, handle->max_depth);
 654 #endif
 655                 return EXT2_ET_OP_NOT_SUPPORTED;
 656         }
 657
 658 #ifdef DEBUG
 659         printf("goto extent ino %u, level %d, %llu\n", handle->ino,
 660                leaf_level, blk);
 661 #endif
 662
 663 #ifdef DEBUG_GOTO_EXTENTS
 664         dbg_print_extent("root", &extent);
 665 #endif
 666         while (1) {
 667                 if (handle->max_depth - handle->level == leaf_level) {
 668                         /* block is in this &extent */
 669                         if ((blk >= extent.e_lblk) &&
 670                             (blk < extent.e_lblk + extent.e_len))
 671                                 return 0;
 672                         if (blk < extent.e_lblk) {
 673                                 retval = ext2fs_extent_get(handle,
 674                                                            EXT2_EXTENT_PREV_SIB,
 675                                                            &extent);
 676                                 return EXT2_ET_EXTENT_NOT_FOUND;
 677                         }
 678                         retval = ext2fs_extent_get(handle,
 679                                                    EXT2_EXTENT_NEXT_SIB,
 680                                                    &extent);
 681                         if (retval == EXT2_ET_EXTENT_NO_NEXT)
 682                                 return EXT2_ET_EXTENT_NOT_FOUND;
 683                         if (retval)
 684                                 return retval;
 685                         continue;
 686                 }
 687
 688                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_SIB,
 689                                            &extent);
 690                 if (retval == EXT2_ET_EXTENT_NO_NEXT)
 691                         goto go_down;
 692                 if (retval)
 693                         return retval;
 694
 695 #ifdef DEBUG_GOTO_EXTENTS
 696                 dbg_print_extent("next", &extent);
 697 #endif
 698                 if (blk == extent.e_lblk)
 699                         goto go_down;
 700                 if (blk > extent.e_lblk)
 701                         continue;
 702
 703                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_PREV_SIB,
 704                                            &extent);
 705                 if (retval)
 706                         return retval;
 707
 708 #ifdef DEBUG_GOTO_EXTENTS
 709                 dbg_print_extent("prev", &extent);
 710 #endif
 711
 712         go_down:
 713                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_DOWN,
 714                                            &extent);
 715                 if (retval)
 716                         return retval;
 717
 718 #ifdef DEBUG_GOTO_EXTENTS
 719                 dbg_print_extent("down", &extent);
 720 #endif
 721         }
 722 }
 723
 724 errcode_t ext2fs_extent_goto(ext2_extent_handle_t handle,
 725                              blk64_t blk)
 726 {
 727         return ext2fs_extent_goto2(handle, 0, blk);
 728 }
 729
 730 /*
 731  * Traverse back up to root fixing parents of current node as needed.
 732  *
 733  * If we changed start of first entry in a node, fix parent index start
 734  * and so on.
 735  *
 736  * Safe to call for any position in node; if not at the first entry,
 737  * will  simply return.
 738  */
 739 errcode_t ext2fs_extent_fix_parents(ext2_extent_handle_t handle)
 740 {
 741         int                             retval = 0;
 742         int                             orig_height;
 743         blk64_t                         start;
 744         struct extent_path              *path;
 745         struct ext2fs_extent            extent;
 746         struct ext2_extent_info         info;
 747
 748         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
 749
 750         if (!(handle->fs->flags & EXT2_FLAG_RW))
 751                 return EXT2_ET_RO_FILSYS;
 752
 753         if (!handle->path)
 754                 return EXT2_ET_NO_CURRENT_NODE;
 755
 756         path = handle->path + handle->level;
 757         if (!path->curr)
 758                 return EXT2_ET_NO_CURRENT_NODE;
 759
 760         retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
 761         if (retval)
 762                 goto done;
 763
 764         /* modified node's start block */
 765         start = extent.e_lblk;
 766
 767         if ((retval = ext2fs_extent_get_info(handle, &info)))
 768                 return retval;
 769         orig_height = info.max_depth - info.curr_level;
 770
 771         /* traverse up until index not first, or startblk matches, or top */
 772         while (handle->level > 0 &&
 773                (path->left == path->entries - 1)) {
 774                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent);
 775                 if (retval)
 776                         goto done;
 777                 if (extent.e_lblk == start)
 778                         break;
 779                 path = handle->path + handle->level;
 780                 extent.e_len += (extent.e_lblk - start);
 781                 extent.e_lblk = start;
 782                 retval = ext2fs_extent_replace(handle, 0, &extent);
 783                 if (retval)
 784                         goto done;
 785                 update_path(handle);
 786         }
 787
 788         /* put handle back to where we started */
 789         retval = ext2fs_extent_goto2(handle, orig_height, start);
 790 done:
 791         return retval;
 792 }
 793
 794 errcode_t ext2fs_extent_replace(ext2_extent_handle_t handle,
 795                                 int flags EXT2FS_ATTR((unused)),
 796                                 struct ext2fs_extent *extent)
 797 {
 798         struct extent_path              *path;
 799         struct ext3_extent_idx          *ix;
 800         struct ext3_extent              *ex;
 801
 802         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
 803
 804         if (!(handle->fs->flags & EXT2_FLAG_RW))
 805                 return EXT2_ET_RO_FILSYS;
 806
 807         if (!handle->path)
 808                 return EXT2_ET_NO_CURRENT_NODE;
 809
 810         path = handle->path + handle->level;
 811         if (!path->curr)
 812                 return EXT2_ET_NO_CURRENT_NODE;
 813
 814 #ifdef DEBUG
 815         printf("extent replace: %u ", handle->ino);
 816         dbg_print_extent(0, extent);
 817 #endif
 818
 819         if (handle->level == handle->max_depth) {
 820                 ex = path->curr;
 821
 822                 ex->ee_block = ext2fs_cpu_to_le32(extent->e_lblk);
 823                 ex->ee_start = ext2fs_cpu_to_le32(extent->e_pblk & 0xFFFFFFFF);
 824                 ex->ee_start_hi = ext2fs_cpu_to_le16(extent->e_pblk >> 32);
 825                 if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT) {
 826                         if (extent->e_len > EXT_UNINIT_MAX_LEN)
 827                                 return EXT2_ET_EXTENT_INVALID_LENGTH;
 828                         ex->ee_len = ext2fs_cpu_to_le16(extent->e_len +
 829                                                         EXT_INIT_MAX_LEN);
 830                 } else {
 831                         if (extent->e_len > EXT_INIT_MAX_LEN)
 832                                 return EXT2_ET_EXTENT_INVALID_LENGTH;
 833                         ex->ee_len = ext2fs_cpu_to_le16(extent->e_len);
 834                 }
 835         } else {
 836                 ix = path->curr;
 837
 838                 ix->ei_leaf = ext2fs_cpu_to_le32(extent->e_pblk & 0xFFFFFFFF);
 839                 ix->ei_leaf_hi = ext2fs_cpu_to_le16(extent->e_pblk >> 32);
 840                 ix->ei_block = ext2fs_cpu_to_le32(extent->e_lblk);
 841                 ix->ei_unused = 0;
 842         }
 843         update_path(handle);
 844         return 0;
 845 }
 846
 847 static int splitting_at_eof(struct ext2_extent_handle *handle,
 848                             struct extent_path *path)
 849 {
 850         struct extent_path *ppp = path;
 851         dump_path(__func__, handle, path);
 852
 853         if (handle->level == 0)
 854                 return 0;
 855
 856         do {
 857                 if (ppp->left)
 858                         return 0;
 859                 ppp--;
 860         } while (ppp >= handle->path);
 861
 862         return 1;
 863 }
 864
 865 /*
 866  * allocate a new block, move half the current node to it, and update parent
 867  *
 868  * handle will be left pointing at original record.
 869  */
 870 static errcode_t extent_node_split(ext2_extent_handle_t handle,
 871                                    int expand_allowed)
 872 {
 873         errcode_t                       retval = 0;
 874         blk64_t                         new_node_pblk;
 875         blk64_t                         new_node_start;
 876         blk64_t                         orig_lblk;
 877         blk64_t                         goal_blk = 0;
 878         int                             orig_height;
 879         char                            *block_buf = NULL;
 880         struct ext2fs_extent            extent;
 881         struct extent_path              *path, *newpath = 0;
 882         struct ext3_extent_header       *eh, *neweh;
 883         int                             tocopy;
 884         int                             new_root = 0;
 885         struct ext2_extent_info         info;
 886         int                             no_balance;
 887
 888         /* basic sanity */
 889         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
 890
 891         if (!(handle->fs->flags & EXT2_FLAG_RW))
 892                 return EXT2_ET_RO_FILSYS;
 893
 894         if (!handle->path)
 895                 return EXT2_ET_NO_CURRENT_NODE;
 896
 897 #ifdef DEBUG
 898         printf("splitting node at level %d\n", handle->level);
 899 #endif
 900         retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
 901         if (retval)
 902                 goto done;
 903
 904         retval = ext2fs_extent_get_info(handle, &info);
 905         if (retval)
 906                 goto done;
 907
 908         /* save the position we were originally splitting... */
 909         orig_height = info.max_depth - info.curr_level;
 910         orig_lblk = extent.e_lblk;
 911
 912         /* Is there room in the parent for a new entry? */
 913         if (handle->level &&
 914                         (handle->path[handle->level - 1].entries >=
 915                          handle->path[handle->level - 1].max_entries)) {
 916
 917 #ifdef DEBUG
 918                 printf("parent level %d full; splitting it too\n",
 919                                                         handle->level - 1);
 920 #endif
 921                 /* split the parent */
 922                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent);
 923                 if (retval)
 924                         goto done;
 925                 goal_blk = extent.e_pblk;
 926
 927                 retval = extent_node_split(handle, expand_allowed);
 928                 if (retval)
 929                         goto done;
 930
 931                 /* get handle back to our original split position */
 932                 retval = ext2fs_extent_goto2(handle, orig_height, orig_lblk);
 933                 if (retval)
 934                         goto done;
 935         }
 936
 937         /* At this point, parent should have room for this split */
 938         path = handle->path + handle->level;
 939         if (!path->curr)
 940                 return EXT2_ET_NO_CURRENT_NODE;
 941
 942         /*
 943          * Normally, we try to split a full node in half.  This doesn't turn
 944          * out so well if we're tacking extents on the end of the file because
 945          * then we're stuck with a tree of half-full extent blocks.  This of
 946          * course doesn't apply to the root level.
 947          */
 948         no_balance = expand_allowed ? splitting_at_eof(handle, path) : 0;
 949
 950         /* extent header of the current node we'll split */
 951         eh = (struct ext3_extent_header *)path->buf;
 952
 953         /* splitting root level means moving them all out */
 954         if (handle->level == 0) {
 955                 new_root = 1;
 956                 tocopy = ext2fs_le16_to_cpu(eh->eh_entries);
 957                 retval = ext2fs_get_mem(((handle->max_depth+2) *
 958                                          sizeof(struct extent_path)),
 959                                         &newpath);
 960                 if (retval)
 961                         goto done;
 962                 memset(newpath, 0,
 963                        ((handle->max_depth+2) * sizeof(struct extent_path)));
 964         } else {
 965                 if (no_balance)
 966                         tocopy = 1;
 967                 else
 968                         tocopy = ext2fs_le16_to_cpu(eh->eh_entries) / 2;
 969         }
 970
 971 #ifdef DEBUG
 972         printf("will copy out %d of %d entries at level %d\n",
 973                                 tocopy, ext2fs_le16_to_cpu(eh->eh_entries),
 974                                 handle->level);
 975 #endif
 976
 977         if (!tocopy && !no_balance) {
 978 #ifdef DEBUG
 979                 printf("Nothing to copy to new block!\n");
 980 #endif
 981                 retval = EXT2_ET_CANT_SPLIT_EXTENT;
 982                 goto done;
 983         }
 984
 985         /* first we need a new block, or can do nothing. */
 986         block_buf = malloc(handle->fs->blocksize);
 987         if (!block_buf) {
 988                 retval = ENOMEM;
 989                 goto done;
 990         }
 991
 992         if (!goal_blk) {
 993                 dgrp_t  group = ext2fs_group_of_ino(handle->fs, handle->ino);
 994                 __u8    log_flex = handle->fs->super->s_log_groups_per_flex;
 995
 996                 if (log_flex)
 997                         group = group & ~((1 << (log_flex)) - 1);
 998                 goal_blk = ext2fs_group_first_block2(handle->fs, group);
 999         }
1000         retval = ext2fs_alloc_block2(handle->fs, goal_blk, block_buf,
1001                                     &new_node_pblk);
1002         if (retval)
1003                 goto done;
1004
1005 #ifdef DEBUG
1006         printf("will copy to new node at block %lu\n",
1007                (unsigned long) new_node_pblk);
1008 #endif
1009
1010         /* Copy data into new block buffer */
1011         /* First the header for the new block... */
1012         neweh = (struct ext3_extent_header *) block_buf;
1013         memcpy(neweh, eh, sizeof(struct ext3_extent_header));
1014         neweh->eh_entries = ext2fs_cpu_to_le16(tocopy);
1015         neweh->eh_max = ext2fs_cpu_to_le16((handle->fs->blocksize -
1016                          sizeof(struct ext3_extent_header)) /
1017                                 sizeof(struct ext3_extent));
1018
1019         /* then the entries for the new block... */
1020         memcpy(EXT_FIRST_INDEX(neweh),
1021                 EXT_FIRST_INDEX(eh) +
1022                         (ext2fs_le16_to_cpu(eh->eh_entries) - tocopy),
1023                 sizeof(struct ext3_extent_idx) * tocopy);
1024
1025         new_node_start = ext2fs_le32_to_cpu(EXT_FIRST_INDEX(neweh)->ei_block);
1026
1027         /* ...and write the new node block out to disk. */
1028         retval = io_channel_write_blk64(handle->fs->io, new_node_pblk, 1,
1029                                         block_buf);
1030
1031         if (retval)
1032                 goto done;
1033
1034         /* OK! we've created the new node; now adjust the tree */
1035
1036         /* current path now has fewer active entries, we copied some out */
1037         if (handle->level == 0) {
1038                 memcpy(newpath, path,
1039                        sizeof(struct extent_path) * (handle->max_depth+1));
1040                 handle->path = newpath;
1041                 newpath = path;
1042                 path = handle->path;
1043                 path->entries = 1;
1044                 path->left = path->max_entries - 1;
1045                 handle->max_depth++;
1046                 eh->eh_depth = ext2fs_cpu_to_le16(handle->max_depth);
1047         } else {
1048                 path->entries -= tocopy;
1049                 path->left -= tocopy;
1050         }
1051
1052         eh->eh_entries = ext2fs_cpu_to_le16(path->entries);
1053         /* this writes out the node, incl. the modified header */
1054         retval = update_path(handle);
1055         if (retval)
1056                 goto done;
1057
1058         /* now go up and insert/replace index for new node we created */
1059         if (new_root) {
1060                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_FIRST_SIB, &extent);
1061                 if (retval)
1062                         goto done;
1063
1064                 extent.e_lblk = new_node_start;
1065                 extent.e_pblk = new_node_pblk;
1066                 extent.e_len = handle->path[0].end_blk - extent.e_lblk;
1067                 retval = ext2fs_extent_replace(handle, 0, &extent);
1068                 if (retval)
1069                         goto done;
1070         } else {
1071                 __u32 new_node_length;
1072
1073                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent);
1074                 /* will insert after this one; it's length is shorter now */
1075                 new_node_length = new_node_start - extent.e_lblk;
1076                 extent.e_len -= new_node_length;
1077                 retval = ext2fs_extent_replace(handle, 0, &extent);
1078                 if (retval)
1079                         goto done;
1080
1081                 /* now set up the new extent and insert it */
1082                 extent.e_lblk = new_node_start;
1083                 extent.e_pblk = new_node_pblk;
1084                 extent.e_len = new_node_length;
1085                 retval = ext2fs_extent_insert(handle, EXT2_EXTENT_INSERT_AFTER, &extent);
1086                 if (retval)
1087                         goto done;
1088         }
1089
1090         /* get handle back to our original position */
1091         retval = ext2fs_extent_goto2(handle, orig_height, orig_lblk);
1092         if (retval)
1093                 goto done;
1094
1095         /* new node hooked in, so update inode block count (do this here?) */
1096         ext2fs_iblk_add_blocks(handle->fs, handle->inode, 1);
1097         retval = ext2fs_write_inode(handle->fs, handle->ino,
1098                                     handle->inode);
1099         if (retval)
1100                 goto done;
1101
1102 done:
1103         if (newpath)
1104                 ext2fs_free_mem(&newpath);
1105         free(block_buf);
1106
1107         return retval;
1108 }
1109
1110 errcode_t ext2fs_extent_node_split(ext2_extent_handle_t handle)
1111 {
1112         return extent_node_split(handle, 0);
1113 }
1114
1115 errcode_t ext2fs_extent_insert(ext2_extent_handle_t handle, int flags,
1116                                       struct ext2fs_extent *extent)
1117 {
1118         struct extent_path              *path;
1119         struct ext3_extent_idx          *ix;
1120         struct ext3_extent_header       *eh;
1121         errcode_t                       retval;
1122
1123         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1124
1125         if (!(handle->fs->flags & EXT2_FLAG_RW))
1126                 return EXT2_ET_RO_FILSYS;
1127
1128         if (!handle->path)
1129                 return EXT2_ET_NO_CURRENT_NODE;
1130
1131 #ifdef DEBUG
1132         printf("extent insert: %u ", handle->ino);
1133         dbg_print_extent(0, extent);
1134 #endif
1135
1136         path = handle->path + handle->level;
1137
1138         if (path->entries >= path->max_entries) {
1139                 if (flags & EXT2_EXTENT_INSERT_NOSPLIT) {
1140                         return EXT2_ET_CANT_INSERT_EXTENT;
1141                 } else {
1142 #ifdef DEBUG
1143                         printf("node full (level %d) - splitting\n",
1144                                    handle->level);
1145 #endif
1146                         retval = extent_node_split(handle, 1);
1147                         if (retval)
1148                                 return retval;
1149                         path = handle->path + handle->level;
1150                 }
1151         }
1152
1153         eh = (struct ext3_extent_header *) path->buf;
1154         if (path->curr) {
1155                 ix = path->curr;
1156                 if (flags & EXT2_EXTENT_INSERT_AFTER) {
1157                         ix++;
1158                         path->left--;
1159                 }
1160         } else {
1161                 ix = EXT_FIRST_INDEX(eh);
1162                 path->left = -1;
1163         }
1164
1165         path->curr = ix;
1166
1167         if (path->left >= 0)
1168                 memmove(ix + 1, ix,
1169                         (path->left+1) * sizeof(struct ext3_extent_idx));
1170         path->left++;
1171         path->entries++;
1172
1173         eh = (struct ext3_extent_header *) path->buf;
1174         eh->eh_entries = ext2fs_cpu_to_le16(path->entries);
1175
1176         retval = ext2fs_extent_replace(handle, 0, extent);
1177         if (retval)
1178                 goto errout;
1179
1180         retval = update_path(handle);
1181         if (retval)
1182                 goto errout;
1183
1184         return 0;
1185
1186 errout:
1187         ext2fs_extent_delete(handle, 0);
1188         return retval;
1189 }
1190
1191 /*
1192  * Sets the physical block for a logical file block in the extent tree.
1193  *
1194  * May: map unmapped, unmap mapped, or remap mapped blocks.
1195  *
1196  * Mapping an unmapped block adds a single-block extent.
1197  *
1198  * Unmapping first or last block modifies extent in-place
1199  *  - But may need to fix parent's starts too in first-block case
1200  *
1201  * Mapping any unmapped block requires adding a (single-block) extent
1202  * and inserting into proper point in tree.
1203  *
1204  * Modifying (unmapping or remapping) a block in the middle
1205  * of an extent requires splitting the extent.
1206  *  - Remapping case requires new single-block extent.
1207  *
1208  * Remapping first or last block adds an extent.
1209  *
1210  * We really need extent adding to be smart about merging.
1211  */
1212
1213 errcode_t ext2fs_extent_set_bmap(ext2_extent_handle_t handle,
1214                                  blk64_t logical, blk64_t physical, int flags)
1215 {
1216         errcode_t               ec, retval = 0;
1217         int                     mapped = 1; /* logical is mapped? */
1218         int                     orig_height;
1219         int                     extent_uninit = 0;
1220         int                     prev_uninit = 0;
1221         int                     next_uninit = 0;
1222         int                     new_uninit = 0;
1223         int                     max_len = EXT_INIT_MAX_LEN;
1224         int                     has_prev, has_next;
1225         blk64_t                 orig_lblk;
1226         struct extent_path      *path;
1227         struct ext2fs_extent    extent, next_extent, prev_extent;
1228         struct ext2fs_extent    newextent;
1229         struct ext2_extent_info info;
1230
1231         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1232
1233 #ifdef DEBUG
1234         printf("set_bmap ino %u log %lld phys %lld flags %d\n",
1235                handle->ino, logical, physical, flags);
1236 #endif
1237
1238         if (!(handle->fs->flags & EXT2_FLAG_RW))
1239                 return EXT2_ET_RO_FILSYS;
1240
1241         if (!handle->path)
1242                 return EXT2_ET_NO_CURRENT_NODE;
1243
1244         path = handle->path + handle->level;
1245
1246         if (flags & EXT2_EXTENT_SET_BMAP_UNINIT) {
1247                 new_uninit = 1;
1248                 max_len = EXT_UNINIT_MAX_LEN;
1249         }
1250
1251         /* if (re)mapping, set up new extent to insert */
1252         if (physical) {
1253                 newextent.e_len = 1;
1254                 newextent.e_pblk = physical;
1255                 newextent.e_lblk = logical;
1256                 newextent.e_flags = EXT2_EXTENT_FLAGS_LEAF;
1257                 if (new_uninit)
1258                         newextent.e_flags |= EXT2_EXTENT_FLAGS_UNINIT;
1259         }
1260
1261         /* special case if the extent tree is completely empty */
1262         if ((handle->max_depth == 0) && (path->entries == 0)) {
1263                 retval = ext2fs_extent_insert(handle, 0, &newextent);
1264                 return retval;
1265         }
1266
1267         /* save our original location in the extent tree */
1268         if ((retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT,
1269                                         &extent))) {
1270                 if (retval != EXT2_ET_NO_CURRENT_NODE)
1271                         return retval;
1272                 memset(&extent, 0, sizeof(extent));
1273         }
1274         if ((retval = ext2fs_extent_get_info(handle, &info)))
1275                 return retval;
1276         orig_height = info.max_depth - info.curr_level;
1277         orig_lblk = extent.e_lblk;
1278
1279         /* go to the logical spot we want to (re/un)map */
1280         retval = ext2fs_extent_goto(handle, logical);
1281         if (retval) {
1282                 if (retval == EXT2_ET_EXTENT_NOT_FOUND) {
1283                         retval = 0;
1284                         mapped = 0;
1285                         if (!physical) {
1286 #ifdef DEBUG
1287                                 printf("block %llu already unmapped\n",
1288                                         logical);
1289 #endif
1290                                 goto done;
1291                         }
1292                 } else
1293                         goto done;
1294         }
1295
1296         /*
1297          * This may be the extent *before* the requested logical,
1298          * if it's currently unmapped.
1299          *
1300          * Get the previous and next leaf extents, if they are present.
1301          */
1302         retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent);
1303         if (retval)
1304                 goto done;
1305         if (extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT)
1306                 extent_uninit = 1;
1307         retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_LEAF, &next_extent);
1308         if (retval) {
1309                 has_next = 0;
1310                 if (retval != EXT2_ET_EXTENT_NO_NEXT)
1311                         goto done;
1312         } else {
1313                 dbg_print_extent("set_bmap: next_extent",
1314                                  &next_extent);
1315                 has_next = 1;
1316                 if (next_extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT)
1317                         next_uninit = 1;
1318         }
1319         retval = ext2fs_extent_goto(handle, logical);
1320         if (retval && retval != EXT2_ET_EXTENT_NOT_FOUND)
1321                 goto done;
1322         retval = ext2fs_extent_get(handle, EXT2_EXTENT_PREV_LEAF, &prev_extent);
1323         if (retval) {
1324                 has_prev = 0;
1325                 if (retval != EXT2_ET_EXTENT_NO_PREV)
1326                         goto done;
1327         } else {
1328                 has_prev = 1;
1329                 dbg_print_extent("set_bmap: prev_extent",
1330                                  &prev_extent);
1331                 if (prev_extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT)
1332                         prev_uninit = 1;
1333         }
1334         retval = ext2fs_extent_goto(handle, logical);
1335         if (retval && retval != EXT2_ET_EXTENT_NOT_FOUND)
1336                 goto done;
1337
1338         /* check if already pointing to the requested physical */
1339         if (mapped && (new_uninit == extent_uninit) &&
1340             (extent.e_pblk + (logical - extent.e_lblk) == physical)) {
1341 #ifdef DEBUG
1342                 printf("physical block (at %llu) unchanged\n", logical);
1343 #endif
1344                 goto done;
1345         }
1346
1347         if (!mapped) {
1348 #ifdef DEBUG
1349                 printf("mapping unmapped logical block %llu\n", logical);
1350 #endif
1351                 if ((logical == extent.e_lblk + extent.e_len) &&
1352                     (physical == extent.e_pblk + extent.e_len) &&
1353                     (new_uninit == extent_uninit) &&
1354                     ((int) extent.e_len < max_len-1)) {
1355                         extent.e_len++;
1356                         retval = ext2fs_extent_replace(handle, 0, &extent);
1357                 } else if ((logical == extent.e_lblk - 1) &&
1358                            (physical == extent.e_pblk - 1) &&
1359                            (new_uninit == extent_uninit) &&
1360                            ((int) extent.e_len < max_len - 1)) {
1361                         extent.e_len++;
1362                         extent.e_lblk--;
1363                         extent.e_pblk--;
1364                         retval = ext2fs_extent_replace(handle, 0, &extent);
1365                 } else if (has_next &&
1366                            (logical == next_extent.e_lblk - 1) &&
1367                            (physical == next_extent.e_pblk - 1) &&
1368                            (new_uninit == next_uninit) &&
1369                            ((int) next_extent.e_len < max_len - 1)) {
1370                         retval = ext2fs_extent_get(handle,
1371                                                    EXT2_EXTENT_NEXT_LEAF,
1372                                                    &next_extent);
1373                         if (retval)
1374                                 goto done;
1375                         next_extent.e_len++;
1376                         next_extent.e_lblk--;
1377                         next_extent.e_pblk--;
1378                         retval = ext2fs_extent_replace(handle, 0, &next_extent);
1379                 } else if (logical < extent.e_lblk)
1380                         retval = ext2fs_extent_insert(handle, 0, &newextent);
1381                 else
1382                         retval = ext2fs_extent_insert(handle,
1383                                       EXT2_EXTENT_INSERT_AFTER, &newextent);
1384                 if (retval)
1385                         goto done;
1386                 retval = ext2fs_extent_fix_parents(handle);
1387                 if (retval)
1388                         goto done;
1389         } else if ((logical == extent.e_lblk) && (extent.e_len == 1))  {
1390 #ifdef DEBUG
1391                 printf("(re/un)mapping only block in extent\n");
1392 #endif
1393                 if (physical) {
1394                         retval = ext2fs_extent_replace(handle, 0, &newextent);
1395                 } else {
1396                         retval = ext2fs_extent_delete(handle, 0);
1397                         if (retval)
1398                                 goto done;
1399                         ec = ext2fs_extent_fix_parents(handle);
1400                         if (ec != EXT2_ET_NO_CURRENT_NODE)
1401                                 retval = ec;
1402                 }
1403
1404                 if (retval)
1405                         goto done;
1406         } else if (logical == extent.e_lblk + extent.e_len - 1)  {
1407 #ifdef DEBUG
1408                 printf("(re/un)mapping last block in extent\n");
1409 #endif
1410                 if (physical) {
1411                         if (has_next &&
1412                             (logical == (next_extent.e_lblk - 1)) &&
1413                             (physical == (next_extent.e_pblk - 1)) &&
1414                             (new_uninit == next_uninit) &&
1415                             ((int) next_extent.e_len < max_len - 1)) {
1416                                 retval = ext2fs_extent_get(handle,
1417                                         EXT2_EXTENT_NEXT_LEAF, &next_extent);
1418                                 if (retval)
1419                                         goto done;
1420                                 next_extent.e_len++;
1421                                 next_extent.e_lblk--;
1422                                 next_extent.e_pblk--;
1423                                 retval = ext2fs_extent_replace(handle, 0,
1424                                                                &next_extent);
1425                                 if (retval)
1426                                         goto done;
1427                                 retval = ext2fs_extent_fix_parents(handle);
1428                                 if (retval)
1429                                         goto done;
1430                         } else
1431                                 retval = ext2fs_extent_insert(handle,
1432                                       EXT2_EXTENT_INSERT_AFTER, &newextent);
1433                         if (retval)
1434                                 goto done;
1435                         /* Now pointing at inserted extent; move back to prev */
1436                         retval = ext2fs_extent_get(handle,
1437                                                    EXT2_EXTENT_PREV_LEAF,
1438                                                    &extent);
1439                         if (retval)
1440                                 goto done;
1441                 }
1442                 extent.e_len--;
1443                 retval = ext2fs_extent_replace(handle, 0, &extent);
1444                 if (retval)
1445                         goto done;
1446         } else if (logical == extent.e_lblk) {
1447 #ifdef DEBUG
1448                 printf("(re/un)mapping first block in extent\n");
1449 #endif
1450                 if (physical) {
1451                         if (has_prev &&
1452                             (logical == (prev_extent.e_lblk +
1453                                          prev_extent.e_len)) &&
1454                             (physical == (prev_extent.e_pblk +
1455                                           prev_extent.e_len)) &&
1456                             (new_uninit == prev_uninit) &&
1457                             ((int) prev_extent.e_len < max_len-1)) {
1458                                 retval = ext2fs_extent_get(handle,
1459                                         EXT2_EXTENT_PREV_LEAF, &prev_extent);
1460                                 if (retval)
1461                                         goto done;
1462                                 prev_extent.e_len++;
1463                                 retval = ext2fs_extent_replace(handle, 0,
1464                                                                &prev_extent);
1465                         } else
1466                                 retval = ext2fs_extent_insert(handle,
1467                                                               0, &newextent);
1468                         if (retval)
1469                                 goto done;
1470                         retval = ext2fs_extent_get(handle,
1471                                                    EXT2_EXTENT_NEXT_LEAF,
1472                                                    &extent);
1473                         if (retval)
1474                                 goto done;
1475                 }
1476                 extent.e_pblk++;
1477                 extent.e_lblk++;
1478                 extent.e_len--;
1479                 retval = ext2fs_extent_replace(handle, 0, &extent);
1480                 if (retval)
1481                         goto done;
1482                 retval = ext2fs_extent_fix_parents(handle);
1483                 if (retval)
1484                         goto done;
1485         } else {
1486                 __u32   orig_length;
1487                 blk64_t orig_lblk;
1488                 struct ext2fs_extent orig_extent;
1489                 errcode_t r2;
1490
1491 #ifdef DEBUG
1492                 printf("(re/un)mapping in middle of extent\n");
1493 #endif
1494                 /* need to split this extent; later */
1495                 orig_lblk = extent.e_lblk;
1496                 orig_length = extent.e_len;
1497                 orig_extent = extent;
1498
1499                 /* shorten pre-split extent */
1500                 extent.e_len = (logical - extent.e_lblk);
1501                 retval = ext2fs_extent_replace(handle, 0, &extent);
1502                 if (retval)
1503                         goto done;
1504                 /* insert our new extent, if any */
1505                 if (physical) {
1506                         /* insert new extent after current */
1507                         retval = ext2fs_extent_insert(handle,
1508                                         EXT2_EXTENT_INSERT_AFTER, &newextent);
1509                         if (retval) {
1510                                 r2 = ext2fs_extent_goto(handle, orig_lblk);
1511                                 if (r2 == 0)
1512                                         ext2fs_extent_replace(handle, 0,
1513                                                               &orig_extent);
1514                                 goto done;
1515                         }
1516                 }
1517                 /* add post-split extent */
1518                 extent.e_pblk += extent.e_len + 1;
1519                 extent.e_lblk += extent.e_len + 1;
1520                 extent.e_len = orig_length - extent.e_len - 1;
1521                 retval = ext2fs_extent_insert(handle,
1522                                 EXT2_EXTENT_INSERT_AFTER, &extent);
1523                 if (retval) {
1524                         if (physical) {
1525                                 r2 = ext2fs_extent_goto(handle,
1526                                                         newextent.e_lblk);
1527                                 if (r2 == 0)
1528                                         ext2fs_extent_delete(handle, 0);
1529                         }
1530                         r2 = ext2fs_extent_goto(handle, orig_lblk);
1531                         if (r2 == 0)
1532                                 ext2fs_extent_replace(handle, 0, &orig_extent);
1533                         goto done;
1534                 }
1535         }
1536
1537 done:
1538         /* get handle back to its position */
1539         if (orig_height > handle->max_depth)
1540                 orig_height = handle->max_depth; /* In case we shortened the tree */
1541         ext2fs_extent_goto2(handle, orig_height, orig_lblk);
1542         return retval;
1543 }
1544
1545 errcode_t ext2fs_extent_delete(ext2_extent_handle_t handle, int flags)
1546 {
1547         struct extent_path              *path;
1548         char                            *cp;
1549         struct ext3_extent_header       *eh;
1550         errcode_t                       retval = 0;
1551
1552         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1553
1554         if (!(handle->fs->flags & EXT2_FLAG_RW))
1555                 return EXT2_ET_RO_FILSYS;
1556
1557         if (!handle->path)
1558                 return EXT2_ET_NO_CURRENT_NODE;
1559
1560 #ifdef DEBUG
1561         {
1562                 struct ext2fs_extent    extent;
1563
1564                 retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT,
1565                                            &extent);
1566                 if (retval == 0) {
1567                         printf("extent delete %u ", handle->ino);
1568                         dbg_print_extent(0, &extent);
1569                 }
1570         }
1571 #endif
1572
1573         path = handle->path + handle->level;
1574         if (!path->curr)
1575                 return EXT2_ET_NO_CURRENT_NODE;
1576
1577         cp = path->curr;
1578
1579         if (path->left) {
1580                 memmove(cp, cp + sizeof(struct ext3_extent_idx),
1581                         path->left * sizeof(struct ext3_extent_idx));
1582                 path->left--;
1583         } else {
1584                 struct ext3_extent_idx  *ix = path->curr;
1585                 ix--;
1586                 path->curr = ix;
1587         }
1588         if (--path->entries == 0)
1589                 path->curr = 0;
1590
1591         /* if non-root node has no entries left, remove it & parent ptr to it */
1592         if (path->entries == 0 && handle->level) {
1593                 if (!(flags & EXT2_EXTENT_DELETE_KEEP_EMPTY)) {
1594                         struct ext2fs_extent    extent;
1595
1596                         retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP,
1597                                                                 &extent);
1598                         if (retval)
1599                                 return retval;
1600
1601                         retval = ext2fs_extent_delete(handle, flags);
1602                         handle->inode->i_blocks -=
1603                                 (handle->fs->blocksize *
1604                                  EXT2FS_CLUSTER_RATIO(handle->fs)) / 512;
1605                         retval = ext2fs_write_inode(handle->fs, handle->ino,
1606                                                     handle->inode);
1607                         ext2fs_block_alloc_stats2(handle->fs,
1608                                                   extent.e_pblk, -1);
1609                 }
1610         } else {
1611                 eh = (struct ext3_extent_header *) path->buf;
1612                 eh->eh_entries = ext2fs_cpu_to_le16(path->entries);
1613                 if ((path->entries == 0) && (handle->level == 0))
1614                         eh->eh_depth = handle->max_depth = 0;
1615                 retval = update_path(handle);
1616         }
1617         return retval;
1618 }
1619
1620 errcode_t ext2fs_extent_get_info(ext2_extent_handle_t handle,
1621                                  struct ext2_extent_info *info)
1622 {
1623         struct extent_path              *path;
1624
1625         EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE);
1626
1627         memset(info, 0, sizeof(struct ext2_extent_info));
1628
1629         path = handle->path + handle->level;
1630         if (path) {
1631                 if (path->curr)
1632                         info->curr_entry = ((char *) path->curr - path->buf) /
1633                                 sizeof(struct ext3_extent_idx);
1634                 else
1635                         info->curr_entry = 0;
1636                 info->num_entries = path->entries;
1637                 info->max_entries = path->max_entries;
1638                 info->bytes_avail = (path->max_entries - path->entries) *
1639                         sizeof(struct ext3_extent);
1640         }
1641
1642         info->curr_level = handle->level;
1643         info->max_depth = handle->max_depth;
1644         info->max_lblk = ((__u64) 1 << 32) - 1;
1645         info->max_pblk = ((__u64) 1 << 48) - 1;
1646         info->max_len = (1UL << 15);
1647         info->max_uninit_len = (1UL << 15) - 1;
1648
1649         return 0;
1650 }
1651
1652 #ifdef DEBUG
1653 /*
1654  * Override debugfs's prompt
1655  */
1656 const char *debug_prog_name = "tst_extents";
1657
1658 #endif
1659