sys/vfs/hammer/hammer_reblock.c

   1 /*
   2  * Copyright (c) 2008 The DragonFly Project.  All rights reserved.
   3  *
   4  * This code is derived from software contributed to The DragonFly Project
   5  * by Matthew Dillon <dillon@backplane.com>
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  *
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in
  15  *    the documentation and/or other materials provided with the
  16  *    distribution.
  17  * 3. Neither the name of The DragonFly Project nor the names of its
  18  *    contributors may be used to endorse or promote products derived
  19  *    from this software without specific, prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  24  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
  25  * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  26  * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
  27  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  28  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
  29  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  30  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  31  * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32  * SUCH DAMAGE.
  33  *
  34  * $DragonFly: src/sys/vfs/hammer/hammer_reblock.c,v 1.24 2008/07/05 18:59:28 dillon Exp $
  35  */
  36 /*
  37  * HAMMER reblocker - This code frees up fragmented physical space
  38  *
  39  * HAMMER only keeps track of free space on a big-block basis.  A big-block
  40  * containing holes can only be freed by migrating the remaining data in
  41  * that big-block into a new big-block, then freeing the big-block.
  42  *
  43  * This function is called from an ioctl or via the hammer support thread.
  44  */
  45
  46 #include "hammer.h"
  47
  48 static int hammer_reblock_helper(struct hammer_ioc_reblock *reblock,
  49                                  hammer_cursor_t cursor,
  50                                  hammer_btree_elm_t elm);
  51 static int hammer_reblock_data(struct hammer_ioc_reblock *reblock,
  52                                 hammer_cursor_t cursor, hammer_btree_elm_t elm);
  53 static int hammer_reblock_leaf_node(struct hammer_ioc_reblock *reblock,
  54                                 hammer_cursor_t cursor, hammer_btree_elm_t elm);
  55 static int hammer_reblock_int_node(struct hammer_ioc_reblock *reblock,
  56                                 hammer_cursor_t cursor, hammer_btree_elm_t elm);
  57
  58 int
  59 hammer_ioc_reblock(hammer_transaction_t trans, hammer_inode_t ip,
  60                struct hammer_ioc_reblock *reblock)
  61 {
  62         struct hammer_cursor cursor;
  63         hammer_btree_elm_t elm;
  64         int error;
  65         int checkspace_count;
  66
  67         if ((reblock->key_beg.localization | reblock->key_end.localization) &
  68             HAMMER_LOCALIZE_PSEUDOFS_MASK) {
  69                 return(EINVAL);
  70         }
  71         if (reblock->key_beg.obj_id >= reblock->key_end.obj_id)
  72                 return(EINVAL);
  73         if (reblock->free_level < 0)
  74                 return(EINVAL);
  75
  76         reblock->key_cur = reblock->key_beg;
  77         reblock->key_cur.localization += ip->obj_localization;
  78
  79         checkspace_count = 0;
  80 retry:
  81         error = hammer_init_cursor(trans, &cursor, NULL, NULL);
  82         if (error) {
  83                 hammer_done_cursor(&cursor);
  84                 goto failed;
  85         }
  86         cursor.key_beg.localization = reblock->key_cur.localization;
  87         cursor.key_beg.obj_id = reblock->key_cur.obj_id;
  88         cursor.key_beg.key = HAMMER_MIN_KEY;
  89         cursor.key_beg.create_tid = 1;
  90         cursor.key_beg.delete_tid = 0;
  91         cursor.key_beg.rec_type = HAMMER_MIN_RECTYPE;
  92         cursor.key_beg.obj_type = 0;
  93
  94         cursor.key_end.localization = reblock->key_end.localization +
  95                                       ip->obj_localization;
  96         cursor.key_end.obj_id = reblock->key_end.obj_id;
  97         cursor.key_end.key = HAMMER_MAX_KEY;
  98         cursor.key_end.create_tid = HAMMER_MAX_TID - 1;
  99         cursor.key_end.delete_tid = 0;
 100         cursor.key_end.rec_type = HAMMER_MAX_RECTYPE;
 101         cursor.key_end.obj_type = 0;
 102
 103         cursor.flags |= HAMMER_CURSOR_END_INCLUSIVE;
 104         cursor.flags |= HAMMER_CURSOR_BACKEND;
 105
 106         /*
 107          * This flag allows the btree scan code to return internal nodes,
 108          * so we can reblock them in addition to the leafs.  Only specify it
 109          * if we intend to reblock B-Tree nodes.
 110          */
 111         if (reblock->head.flags & HAMMER_IOC_DO_BTREE)
 112                 cursor.flags |= HAMMER_CURSOR_REBLOCKING;
 113
 114         error = hammer_btree_first(&cursor);
 115         while (error == 0) {
 116                 /*
 117                  * Internal or Leaf node
 118                  */
 119                 elm = &cursor.node->ondisk->elms[cursor.index];
 120                 reblock->key_cur.obj_id = elm->base.obj_id;
 121                 reblock->key_cur.localization = elm->base.localization;
 122
 123                 /*
 124                  * Yield to more important tasks
 125                  */
 126                 if ((error = hammer_signal_check(trans->hmp)) != 0)
 127                         break;
 128                 if (trans->hmp->sync_lock.wanted) {
 129                         tsleep(trans, 0, "hmrslo", hz / 10);
 130                 }
 131
 132                 /*
 133                  * If we build up too much meta-data we have to wait for
 134                  * a flush cycle.
 135                  */
 136                 if (hammer_flusher_meta_limit(trans->hmp) ||
 137                     hammer_flusher_undo_exhausted(trans, 2)) {
 138                         error = EWOULDBLOCK;
 139                         break;
 140                 }
 141
 142                 /*
 143                  * If there is insufficient free space it may be due to
 144                  * reserved bigblocks, which flushing might fix.
 145                  */
 146                 if (hammer_checkspace(trans->hmp, HAMMER_CHECKSPACE_SLOP_REBLOCK)) {
 147                         if (++checkspace_count == 10) {
 148                                 error = ENOSPC;
 149                         } else {
 150                                 error = EWOULDBLOCK;
 151                         }
 152                         break;
 153                 }
 154
 155                 /*
 156                  * Acquiring the sync_lock prevents the operation from
 157                  * crossing a synchronization boundary.
 158                  *
 159                  * NOTE: cursor.node may have changed on return.
 160                  */
 161                 hammer_sync_lock_sh(trans);
 162                 error = hammer_reblock_helper(reblock, &cursor, elm);
 163                 hammer_sync_unlock(trans);
 164                 if (error == 0) {
 165                         cursor.flags |= HAMMER_CURSOR_ATEDISK;
 166                         error = hammer_btree_iterate(&cursor);
 167                 }
 168
 169         }
 170         if (error == ENOENT)
 171                 error = 0;
 172         hammer_done_cursor(&cursor);
 173         if (error == EWOULDBLOCK) {
 174                 hammer_flusher_sync(trans->hmp);
 175                 goto retry;
 176         }
 177         if (error == EDEADLK)
 178                 goto retry;
 179         if (error == EINTR) {
 180                 reblock->head.flags |= HAMMER_IOC_HEAD_INTR;
 181                 error = 0;
 182         }
 183 failed:
 184         reblock->key_cur.localization &= HAMMER_LOCALIZE_MASK;
 185         return(error);
 186 }
 187
 188 /*
 189  * Reblock the B-Tree (leaf) node, record, and/or data if necessary.
 190  *
 191  * XXX We have no visibility into internal B-Tree nodes at the moment,
 192  * only leaf nodes.
 193  */
 194 static int
 195 hammer_reblock_helper(struct hammer_ioc_reblock *reblock,
 196                       hammer_cursor_t cursor, hammer_btree_elm_t elm)
 197 {
 198         hammer_mount_t hmp;
 199         hammer_off_t tmp_offset;
 200         int error;
 201         int bytes;
 202         int cur;
 203         int iocflags;
 204
 205         error = 0;
 206         hmp = cursor->trans->hmp;
 207
 208         /*
 209          * Reblock data.  Note that data embedded in a record is reblocked
 210          * by the record reblock code.  Data processing only occurs at leaf
 211          * nodes and for RECORD element types.
 212          */
 213         if (cursor->node->ondisk->type != HAMMER_BTREE_TYPE_LEAF)
 214                 goto skip;
 215         if (elm->leaf.base.btype != HAMMER_BTREE_TYPE_RECORD)
 216                 return(0);
 217         tmp_offset = elm->leaf.data_offset;
 218         if (tmp_offset == 0)
 219                 goto skip;
 220         if (error)
 221                 goto skip;
 222
 223         /*
 224          * NOTE: Localization restrictions may also have been set-up, we can't
 225          * just set the match flags willy-nilly here.
 226          */
 227         switch(elm->leaf.base.rec_type) {
 228         case HAMMER_RECTYPE_INODE:
 229                 iocflags = HAMMER_IOC_DO_INODES;
 230                 break;
 231         case HAMMER_RECTYPE_EXT:
 232         case HAMMER_RECTYPE_FIX:
 233         case HAMMER_RECTYPE_DIRENTRY:
 234                 iocflags = HAMMER_IOC_DO_DIRS;
 235                 break;
 236         case HAMMER_RECTYPE_DATA:
 237         case HAMMER_RECTYPE_DB:
 238                 iocflags = HAMMER_IOC_DO_DATA;
 239                 break;
 240         default:
 241                 iocflags = 0;
 242                 break;
 243         }
 244         if (reblock->head.flags & iocflags) {
 245                 ++reblock->data_count;
 246                 reblock->data_byte_count += elm->leaf.data_len;
 247                 bytes = hammer_blockmap_getfree(hmp, tmp_offset, &cur, &error);
 248                 if (hammer_debug_general & 0x4000)
 249                         kprintf("D %6d/%d\n", bytes, reblock->free_level);
 250                 if (error == 0 && (cur == 0 || reblock->free_level == 0) &&
 251                     bytes >= reblock->free_level) {
 252                         hammer_io_direct_uncache(hmp, &elm->leaf);
 253                         error = hammer_cursor_upgrade(cursor);
 254                         if (error == 0) {
 255                                 error = hammer_reblock_data(reblock,
 256                                                             cursor, elm);
 257                         }
 258                         if (error == 0) {
 259                                 ++reblock->data_moves;
 260                                 reblock->data_byte_moves += elm->leaf.data_len;
 261                         }
 262                 }
 263         }
 264
 265 skip:
 266         /*
 267          * Reblock a B-Tree internal or leaf node.
 268          */
 269         tmp_offset = cursor->node->node_offset;
 270         if (cursor->index == 0 &&
 271             error == 0 && (reblock->head.flags & HAMMER_IOC_DO_BTREE)) {
 272                 ++reblock->btree_count;
 273                 bytes = hammer_blockmap_getfree(hmp, tmp_offset, &cur, &error);
 274                 if (hammer_debug_general & 0x4000)
 275                         kprintf("B %6d/%d\n", bytes, reblock->free_level);
 276                 if (error == 0 && (cur == 0 || reblock->free_level == 0) &&
 277                     bytes >= reblock->free_level) {
 278                         error = hammer_cursor_upgrade(cursor);
 279                         if (error == 0) {
 280                                 if (cursor->parent)
 281                                         elm = &cursor->parent->ondisk->elms[cursor->parent_index];
 282                                 else
 283                                         elm = NULL;
 284                                 switch(cursor->node->ondisk->type) {
 285                                 case HAMMER_BTREE_TYPE_LEAF:
 286                                         error = hammer_reblock_leaf_node(
 287                                                         reblock, cursor, elm);
 288                                         break;
 289                                 case HAMMER_BTREE_TYPE_INTERNAL:
 290                                         error = hammer_reblock_int_node(
 291                                                         reblock, cursor, elm);
 292                                         break;
 293                                 default:
 294                                         panic("Illegal B-Tree node type");
 295                                 }
 296                         }
 297                         if (error == 0) {
 298                                 ++reblock->btree_moves;
 299                         }
 300                 }
 301         }
 302
 303         hammer_cursor_downgrade(cursor);
 304         return(error);
 305 }
 306
 307 /*
 308  * Reblock a record's data.  Both the B-Tree element and record pointers
 309  * to the data must be adjusted.
 310  */
 311 static int
 312 hammer_reblock_data(struct hammer_ioc_reblock *reblock,
 313                     hammer_cursor_t cursor, hammer_btree_elm_t elm)
 314 {
 315         struct hammer_buffer *data_buffer = NULL;
 316         hammer_off_t ndata_offset;
 317         int error;
 318         void *ndata;
 319
 320         error = hammer_btree_extract(cursor, HAMMER_CURSOR_GET_DATA |
 321                                              HAMMER_CURSOR_GET_LEAF);
 322         if (error)
 323                 return (error);
 324         ndata = hammer_alloc_data(cursor->trans, elm->leaf.data_len,
 325                                   elm->leaf.base.rec_type,
 326                                   &ndata_offset, &data_buffer, &error);
 327         if (error)
 328                 goto done;
 329
 330         /*
 331          * Move the data
 332          */
 333         hammer_modify_buffer(cursor->trans, data_buffer, NULL, 0);
 334         bcopy(cursor->data, ndata, elm->leaf.data_len);
 335         hammer_modify_buffer_done(data_buffer);
 336
 337         hammer_blockmap_free(cursor->trans,
 338                              elm->leaf.data_offset, elm->leaf.data_len);
 339
 340         hammer_modify_node(cursor->trans, cursor->node,
 341                            &elm->leaf.data_offset, sizeof(hammer_off_t));
 342         elm->leaf.data_offset = ndata_offset;
 343         hammer_modify_node_done(cursor->node);
 344
 345 done:
 346         if (data_buffer)
 347                 hammer_rel_buffer(data_buffer, 0);
 348         return (error);
 349 }
 350
 351 /*
 352  * Reblock a B-Tree leaf node.  The parent must be adjusted to point to
 353  * the new copy of the leaf node.
 354  *
 355  * elm is a pointer to the parent element pointing at cursor.node.
 356  */
 357 static int
 358 hammer_reblock_leaf_node(struct hammer_ioc_reblock *reblock,
 359                          hammer_cursor_t cursor, hammer_btree_elm_t elm)
 360 {
 361         hammer_node_t onode;
 362         hammer_node_t nnode;
 363         int error;
 364
 365         onode = cursor->node;
 366         nnode = hammer_alloc_btree(cursor->trans, &error);
 367
 368         if (nnode == NULL)
 369                 return (error);
 370
 371         /*
 372          * Move the node
 373          */
 374         hammer_lock_ex(&nnode->lock);
 375         hammer_modify_node_noundo(cursor->trans, nnode);
 376         bcopy(onode->ondisk, nnode->ondisk, sizeof(*nnode->ondisk));
 377
 378         if (elm) {
 379                 /*
 380                  * We are not the root of the B-Tree
 381                  */
 382                 hammer_modify_node(cursor->trans, cursor->parent,
 383                                    &elm->internal.subtree_offset,
 384                                    sizeof(elm->internal.subtree_offset));
 385                 elm->internal.subtree_offset = nnode->node_offset;
 386                 hammer_modify_node_done(cursor->parent);
 387         } else {
 388                 /*
 389                  * We are the root of the B-Tree
 390                  */
 391                 hammer_volume_t volume;
 392
 393                 volume = hammer_get_root_volume(cursor->trans->hmp, &error);
 394                 KKASSERT(error == 0);
 395
 396                 hammer_modify_volume_field(cursor->trans, volume,
 397                                            vol0_btree_root);
 398                 volume->ondisk->vol0_btree_root = nnode->node_offset;
 399                 hammer_modify_volume_done(volume);
 400                 hammer_rel_volume(volume, 0);
 401         }
 402
 403         hammer_cursor_replaced_node(onode, nnode);
 404         hammer_delete_node(cursor->trans, onode);
 405
 406         if (hammer_debug_general & 0x4000) {
 407                 kprintf("REBLOCK LNODE %016llx -> %016llx\n",
 408                         onode->node_offset, nnode->node_offset);
 409         }
 410         hammer_modify_node_done(nnode);
 411         cursor->node = nnode;
 412
 413         hammer_unlock(&onode->lock);
 414         hammer_rel_node(onode);
 415
 416         return (error);
 417 }
 418
 419 /*
 420  * Reblock a B-Tree internal node.  The parent must be adjusted to point to
 421  * the new copy of the internal node, and the node's children's parent
 422  * pointers must also be adjusted to point to the new copy.
 423  *
 424  * elm is a pointer to the parent element pointing at cursor.node.
 425  */
 426 static int
 427 hammer_reblock_int_node(struct hammer_ioc_reblock *reblock,
 428                          hammer_cursor_t cursor, hammer_btree_elm_t elm)
 429 {
 430         hammer_node_locklist_t locklist = NULL;
 431         hammer_node_t onode;
 432         hammer_node_t nnode;
 433         int error;
 434         int i;
 435
 436         error = hammer_btree_lock_children(cursor, &locklist);
 437         if (error)
 438                 goto done;
 439
 440         onode = cursor->node;
 441         nnode = hammer_alloc_btree(cursor->trans, &error);
 442
 443         if (nnode == NULL)
 444                 goto done;
 445
 446         /*
 447          * Move the node.  Adjust the parent's pointer to us first.
 448          */
 449         hammer_lock_ex(&nnode->lock);
 450         hammer_modify_node_noundo(cursor->trans, nnode);
 451         bcopy(onode->ondisk, nnode->ondisk, sizeof(*nnode->ondisk));
 452
 453         if (elm) {
 454                 /*
 455                  * We are not the root of the B-Tree
 456                  */
 457                 hammer_modify_node(cursor->trans, cursor->parent,
 458                                    &elm->internal.subtree_offset,
 459                                    sizeof(elm->internal.subtree_offset));
 460                 elm->internal.subtree_offset = nnode->node_offset;
 461                 hammer_modify_node_done(cursor->parent);
 462         } else {
 463                 /*
 464                  * We are the root of the B-Tree
 465                  */
 466                 hammer_volume_t volume;
 467
 468                 volume = hammer_get_root_volume(cursor->trans->hmp, &error);
 469                 KKASSERT(error == 0);
 470
 471                 hammer_modify_volume_field(cursor->trans, volume,
 472                                            vol0_btree_root);
 473                 volume->ondisk->vol0_btree_root = nnode->node_offset;
 474                 hammer_modify_volume_done(volume);
 475                 hammer_rel_volume(volume, 0);
 476         }
 477
 478         /*
 479          * Now adjust our children's pointers to us.
 480          */
 481         for (i = 0; i < nnode->ondisk->count; ++i) {
 482                 elm = &nnode->ondisk->elms[i];
 483                 error = btree_set_parent(cursor->trans, nnode, elm);
 484                 if (error)
 485                         panic("reblock internal node: fixup problem");
 486         }
 487
 488         /*
 489          * Clean up.
 490          *
 491          * The new node replaces the current node in the cursor.  The cursor
 492          * expects it to be locked so leave it locked.  Discard onode.
 493          */
 494         hammer_cursor_replaced_node(onode, nnode);
 495         hammer_delete_node(cursor->trans, onode);
 496
 497         if (hammer_debug_general & 0x4000) {
 498                 kprintf("REBLOCK INODE %016llx -> %016llx\n",
 499                         onode->node_offset, nnode->node_offset);
 500         }
 501         hammer_modify_node_done(nnode);
 502         cursor->node = nnode;
 503
 504         hammer_unlock(&onode->lock);
 505         hammer_rel_node(onode);
 506
 507 done:
 508         hammer_btree_unlock_children(&locklist);
 509         return (error);
 510 }
 511