fs/btrfs/file-item.c

   1 /*
   2  * Copyright (C) 2007 Oracle.  All rights reserved.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public
   6  * License v2 as published by the Free Software Foundation.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11  * General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public
  14  * License along with this program; if not, write to the
  15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16  * Boston, MA 021110-1307, USA.
  17  */
  18
  19 #include <linux/bio.h>
  20 #include <linux/slab.h>
  21 #include <linux/pagemap.h>
  22 #include <linux/highmem.h>
  23 #include "ctree.h"
  24 #include "disk-io.h"
  25 #include "transaction.h"
  26 #include "print-tree.h"
  27
  28 #define MAX_CSUM_ITEMS(r, size) ((((BTRFS_LEAF_DATA_SIZE(r) - \
  29                                    sizeof(struct btrfs_item) * 2) / \
  30                                   size) - 1))
  31
  32 #define MAX_ORDERED_SUM_BYTES(r) ((PAGE_SIZE - \
  33                                    sizeof(struct btrfs_ordered_sum)) / \
  34                                    sizeof(struct btrfs_sector_sum) * \
  35                                    (r)->sectorsize - (r)->sectorsize)
  36
  37 int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
  38                              struct btrfs_root *root,
  39                              u64 objectid, u64 pos,
  40                              u64 disk_offset, u64 disk_num_bytes,
  41                              u64 num_bytes, u64 offset, u64 ram_bytes,
  42                              u8 compression, u8 encryption, u16 other_encoding)
  43 {
  44         int ret = 0;
  45         struct btrfs_file_extent_item *item;
  46         struct btrfs_key file_key;
  47         struct btrfs_path *path;
  48         struct extent_buffer *leaf;
  49
  50         path = btrfs_alloc_path();
  51         if (!path)
  52                 return -ENOMEM;
  53         file_key.objectid = objectid;
  54         file_key.offset = pos;
  55         btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
  56
  57         path->leave_spinning = 1;
  58         ret = btrfs_insert_empty_item(trans, root, path, &file_key,
  59                                       sizeof(*item));
  60         if (ret < 0)
  61                 goto out;
  62         BUG_ON(ret);
  63         leaf = path->nodes[0];
  64         item = btrfs_item_ptr(leaf, path->slots[0],
  65                               struct btrfs_file_extent_item);
  66         btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
  67         btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
  68         btrfs_set_file_extent_offset(leaf, item, offset);
  69         btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
  70         btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes);
  71         btrfs_set_file_extent_generation(leaf, item, trans->transid);
  72         btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
  73         btrfs_set_file_extent_compression(leaf, item, compression);
  74         btrfs_set_file_extent_encryption(leaf, item, encryption);
  75         btrfs_set_file_extent_other_encoding(leaf, item, other_encoding);
  76
  77         btrfs_mark_buffer_dirty(leaf);
  78 out:
  79         btrfs_free_path(path);
  80         return ret;
  81 }
  82
  83 struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans,
  84                                           struct btrfs_root *root,
  85                                           struct btrfs_path *path,
  86                                           u64 bytenr, int cow)
  87 {
  88         int ret;
  89         struct btrfs_key file_key;
  90         struct btrfs_key found_key;
  91         struct btrfs_csum_item *item;
  92         struct extent_buffer *leaf;
  93         u64 csum_offset = 0;
  94         u16 csum_size =
  95                 btrfs_super_csum_size(&root->fs_info->super_copy);
  96         int csums_in_item;
  97
  98         file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
  99         file_key.offset = bytenr;
 100         btrfs_set_key_type(&file_key, BTRFS_EXTENT_CSUM_KEY);
 101         ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
 102         if (ret < 0)
 103                 goto fail;
 104         leaf = path->nodes[0];
 105         if (ret > 0) {
 106                 ret = 1;
 107                 if (path->slots[0] == 0)
 108                         goto fail;
 109                 path->slots[0]--;
 110                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
 111                 if (btrfs_key_type(&found_key) != BTRFS_EXTENT_CSUM_KEY)
 112                         goto fail;
 113
 114                 csum_offset = (bytenr - found_key.offset) >>
 115                                 root->fs_info->sb->s_blocksize_bits;
 116                 csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
 117                 csums_in_item /= csum_size;
 118
 119                 if (csum_offset >= csums_in_item) {
 120                         ret = -EFBIG;
 121                         goto fail;
 122                 }
 123         }
 124         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
 125         item = (struct btrfs_csum_item *)((unsigned char *)item +
 126                                           csum_offset * csum_size);
 127         return item;
 128 fail:
 129         if (ret > 0)
 130                 ret = -ENOENT;
 131         return ERR_PTR(ret);
 132 }
 133
 134
 135 int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
 136                              struct btrfs_root *root,
 137                              struct btrfs_path *path, u64 objectid,
 138                              u64 offset, int mod)
 139 {
 140         int ret;
 141         struct btrfs_key file_key;
 142         int ins_len = mod < 0 ? -1 : 0;
 143         int cow = mod != 0;
 144
 145         file_key.objectid = objectid;
 146         file_key.offset = offset;
 147         btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
 148         ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
 149         return ret;
 150 }
 151
 152
 153 static int __btrfs_lookup_bio_sums(struct btrfs_root *root,
 154                                    struct inode *inode, struct bio *bio,
 155                                    u64 logical_offset, u32 *dst, int dio)
 156 {
 157         u32 sum;
 158         struct bio_vec *bvec = bio->bi_io_vec;
 159         int bio_index = 0;
 160         u64 offset = 0;
 161         u64 item_start_offset = 0;
 162         u64 item_last_offset = 0;
 163         u64 disk_bytenr;
 164         u32 diff;
 165         u16 csum_size =
 166                 btrfs_super_csum_size(&root->fs_info->super_copy);
 167         int ret;
 168         struct btrfs_path *path;
 169         struct btrfs_csum_item *item = NULL;
 170         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
 171
 172         path = btrfs_alloc_path();
 173         if (!path)
 174                 return -ENOMEM;
 175         if (bio->bi_size > PAGE_CACHE_SIZE * 8)
 176                 path->reada = 2;
 177
 178         WARN_ON(bio->bi_vcnt <= 0);
 179
 180         disk_bytenr = (u64)bio->bi_sector << 9;
 181         if (dio)
 182                 offset = logical_offset;
 183         while (bio_index < bio->bi_vcnt) {
 184                 if (!dio)
 185                         offset = page_offset(bvec->bv_page) + bvec->bv_offset;
 186                 ret = btrfs_find_ordered_sum(inode, offset, disk_bytenr, &sum);
 187                 if (ret == 0)
 188                         goto found;
 189
 190                 if (!item || disk_bytenr < item_start_offset ||
 191                     disk_bytenr >= item_last_offset) {
 192                         struct btrfs_key found_key;
 193                         u32 item_size;
 194
 195                         if (item)
 196                                 btrfs_release_path(root, path);
 197                         item = btrfs_lookup_csum(NULL, root->fs_info->csum_root,
 198                                                  path, disk_bytenr, 0);
 199                         if (IS_ERR(item)) {
 200                                 ret = PTR_ERR(item);
 201                                 if (ret == -ENOENT || ret == -EFBIG)
 202                                         ret = 0;
 203                                 sum = 0;
 204                                 if (BTRFS_I(inode)->root->root_key.objectid ==
 205                                     BTRFS_DATA_RELOC_TREE_OBJECTID) {
 206                                         set_extent_bits(io_tree, offset,
 207                                                 offset + bvec->bv_len - 1,
 208                                                 EXTENT_NODATASUM, GFP_NOFS);
 209                                 } else {
 210                                         printk(KERN_INFO "btrfs no csum found "
 211                                                "for inode %lu start %llu\n",
 212                                                inode->i_ino,
 213                                                (unsigned long long)offset);
 214                                 }
 215                                 item = NULL;
 216                                 btrfs_release_path(root, path);
 217                                 goto found;
 218                         }
 219                         btrfs_item_key_to_cpu(path->nodes[0], &found_key,
 220                                               path->slots[0]);
 221
 222                         item_start_offset = found_key.offset;
 223                         item_size = btrfs_item_size_nr(path->nodes[0],
 224                                                        path->slots[0]);
 225                         item_last_offset = item_start_offset +
 226                                 (item_size / csum_size) *
 227                                 root->sectorsize;
 228                         item = btrfs_item_ptr(path->nodes[0], path->slots[0],
 229                                               struct btrfs_csum_item);
 230                 }
 231                 /*
 232                  * this byte range must be able to fit inside
 233                  * a single leaf so it will also fit inside a u32
 234                  */
 235                 diff = disk_bytenr - item_start_offset;
 236                 diff = diff / root->sectorsize;
 237                 diff = diff * csum_size;
 238
 239                 read_extent_buffer(path->nodes[0], &sum,
 240                                    ((unsigned long)item) + diff,
 241                                    csum_size);
 242 found:
 243                 if (dst)
 244                         *dst++ = sum;
 245                 else
 246                         set_state_private(io_tree, offset, sum);
 247                 disk_bytenr += bvec->bv_len;
 248                 offset += bvec->bv_len;
 249                 bio_index++;
 250                 bvec++;
 251         }
 252         btrfs_free_path(path);
 253         return 0;
 254 }
 255
 256 int btrfs_lookup_bio_sums(struct btrfs_root *root, struct inode *inode,
 257                           struct bio *bio, u32 *dst)
 258 {
 259         return __btrfs_lookup_bio_sums(root, inode, bio, 0, dst, 0);
 260 }
 261
 262 int btrfs_lookup_bio_sums_dio(struct btrfs_root *root, struct inode *inode,
 263                               struct bio *bio, u64 offset, u32 *dst)
 264 {
 265         return __btrfs_lookup_bio_sums(root, inode, bio, offset, dst, 1);
 266 }
 267
 268 int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end,
 269                              struct list_head *list)
 270 {
 271         struct btrfs_key key;
 272         struct btrfs_path *path;
 273         struct extent_buffer *leaf;
 274         struct btrfs_ordered_sum *sums;
 275         struct btrfs_sector_sum *sector_sum;
 276         struct btrfs_csum_item *item;
 277         unsigned long offset;
 278         int ret;
 279         size_t size;
 280         u64 csum_end;
 281         u16 csum_size = btrfs_super_csum_size(&root->fs_info->super_copy);
 282
 283         path = btrfs_alloc_path();
 284         BUG_ON(!path);
 285
 286         key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
 287         key.offset = start;
 288         key.type = BTRFS_EXTENT_CSUM_KEY;
 289
 290         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
 291         if (ret < 0)
 292                 goto fail;
 293         if (ret > 0 && path->slots[0] > 0) {
 294                 leaf = path->nodes[0];
 295                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
 296                 if (key.objectid == BTRFS_EXTENT_CSUM_OBJECTID &&
 297                     key.type == BTRFS_EXTENT_CSUM_KEY) {
 298                         offset = (start - key.offset) >>
 299                                  root->fs_info->sb->s_blocksize_bits;
 300                         if (offset * csum_size <
 301                             btrfs_item_size_nr(leaf, path->slots[0] - 1))
 302                                 path->slots[0]--;
 303                 }
 304         }
 305
 306         while (start <= end) {
 307                 leaf = path->nodes[0];
 308                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
 309                         ret = btrfs_next_leaf(root, path);
 310                         if (ret < 0)
 311                                 goto fail;
 312                         if (ret > 0)
 313                                 break;
 314                         leaf = path->nodes[0];
 315                 }
 316
 317                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 318                 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
 319                     key.type != BTRFS_EXTENT_CSUM_KEY)
 320                         break;
 321
 322                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 323                 if (key.offset > end)
 324                         break;
 325
 326                 if (key.offset > start)
 327                         start = key.offset;
 328
 329                 size = btrfs_item_size_nr(leaf, path->slots[0]);
 330                 csum_end = key.offset + (size / csum_size) * root->sectorsize;
 331                 if (csum_end <= start) {
 332                         path->slots[0]++;
 333                         continue;
 334                 }
 335
 336                 csum_end = min(csum_end, end + 1);
 337                 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
 338                                       struct btrfs_csum_item);
 339                 while (start < csum_end) {
 340                         size = min_t(size_t, csum_end - start,
 341                                         MAX_ORDERED_SUM_BYTES(root));
 342                         sums = kzalloc(btrfs_ordered_sum_size(root, size),
 343                                         GFP_NOFS);
 344                         BUG_ON(!sums);
 345
 346                         sector_sum = sums->sums;
 347                         sums->bytenr = start;
 348                         sums->len = size;
 349
 350                         offset = (start - key.offset) >>
 351                                 root->fs_info->sb->s_blocksize_bits;
 352                         offset *= csum_size;
 353
 354                         while (size > 0) {
 355                                 read_extent_buffer(path->nodes[0],
 356                                                 &sector_sum->sum,
 357                                                 ((unsigned long)item) +
 358                                                 offset, csum_size);
 359                                 sector_sum->bytenr = start;
 360
 361                                 size -= root->sectorsize;
 362                                 start += root->sectorsize;
 363                                 offset += csum_size;
 364                                 sector_sum++;
 365                         }
 366                         list_add_tail(&sums->list, list);
 367                 }
 368                 path->slots[0]++;
 369         }
 370         ret = 0;
 371 fail:
 372         btrfs_free_path(path);
 373         return ret;
 374 }
 375
 376 int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode,
 377                        struct bio *bio, u64 file_start, int contig)
 378 {
 379         struct btrfs_ordered_sum *sums;
 380         struct btrfs_sector_sum *sector_sum;
 381         struct btrfs_ordered_extent *ordered;
 382         char *data;
 383         struct bio_vec *bvec = bio->bi_io_vec;
 384         int bio_index = 0;
 385         unsigned long total_bytes = 0;
 386         unsigned long this_sum_bytes = 0;
 387         u64 offset;
 388         u64 disk_bytenr;
 389
 390         WARN_ON(bio->bi_vcnt <= 0);
 391         sums = kzalloc(btrfs_ordered_sum_size(root, bio->bi_size), GFP_NOFS);
 392         if (!sums)
 393                 return -ENOMEM;
 394
 395         sector_sum = sums->sums;
 396         disk_bytenr = (u64)bio->bi_sector << 9;
 397         sums->len = bio->bi_size;
 398         INIT_LIST_HEAD(&sums->list);
 399
 400         if (contig)
 401                 offset = file_start;
 402         else
 403                 offset = page_offset(bvec->bv_page) + bvec->bv_offset;
 404
 405         ordered = btrfs_lookup_ordered_extent(inode, offset);
 406         BUG_ON(!ordered);
 407         sums->bytenr = ordered->start;
 408
 409         while (bio_index < bio->bi_vcnt) {
 410                 if (!contig)
 411                         offset = page_offset(bvec->bv_page) + bvec->bv_offset;
 412
 413                 if (!contig && (offset >= ordered->file_offset + ordered->len ||
 414                     offset < ordered->file_offset)) {
 415                         unsigned long bytes_left;
 416                         sums->len = this_sum_bytes;
 417                         this_sum_bytes = 0;
 418                         btrfs_add_ordered_sum(inode, ordered, sums);
 419                         btrfs_put_ordered_extent(ordered);
 420
 421                         bytes_left = bio->bi_size - total_bytes;
 422
 423                         sums = kzalloc(btrfs_ordered_sum_size(root, bytes_left),
 424                                        GFP_NOFS);
 425                         BUG_ON(!sums);
 426                         sector_sum = sums->sums;
 427                         sums->len = bytes_left;
 428                         ordered = btrfs_lookup_ordered_extent(inode, offset);
 429                         BUG_ON(!ordered);
 430                         sums->bytenr = ordered->start;
 431                 }
 432
 433                 data = kmap_atomic(bvec->bv_page, KM_USER0);
 434                 sector_sum->sum = ~(u32)0;
 435                 sector_sum->sum = btrfs_csum_data(root,
 436                                                   data + bvec->bv_offset,
 437                                                   sector_sum->sum,
 438                                                   bvec->bv_len);
 439                 kunmap_atomic(data, KM_USER0);
 440                 btrfs_csum_final(sector_sum->sum,
 441                                  (char *)&sector_sum->sum);
 442                 sector_sum->bytenr = disk_bytenr;
 443
 444                 sector_sum++;
 445                 bio_index++;
 446                 total_bytes += bvec->bv_len;
 447                 this_sum_bytes += bvec->bv_len;
 448                 disk_bytenr += bvec->bv_len;
 449                 offset += bvec->bv_len;
 450                 bvec++;
 451         }
 452         this_sum_bytes = 0;
 453         btrfs_add_ordered_sum(inode, ordered, sums);
 454         btrfs_put_ordered_extent(ordered);
 455         return 0;
 456 }
 457
 458 /*
 459  * helper function for csum removal, this expects the
 460  * key to describe the csum pointed to by the path, and it expects
 461  * the csum to overlap the range [bytenr, len]
 462  *
 463  * The csum should not be entirely contained in the range and the
 464  * range should not be entirely contained in the csum.
 465  *
 466  * This calls btrfs_truncate_item with the correct args based on the
 467  * overlap, and fixes up the key as required.
 468  */
 469 static noinline int truncate_one_csum(struct btrfs_trans_handle *trans,
 470                                       struct btrfs_root *root,
 471                                       struct btrfs_path *path,
 472                                       struct btrfs_key *key,
 473                                       u64 bytenr, u64 len)
 474 {
 475         struct extent_buffer *leaf;
 476         u16 csum_size =
 477                 btrfs_super_csum_size(&root->fs_info->super_copy);
 478         u64 csum_end;
 479         u64 end_byte = bytenr + len;
 480         u32 blocksize_bits = root->fs_info->sb->s_blocksize_bits;
 481         int ret;
 482
 483         leaf = path->nodes[0];
 484         csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
 485         csum_end <<= root->fs_info->sb->s_blocksize_bits;
 486         csum_end += key->offset;
 487
 488         if (key->offset < bytenr && csum_end <= end_byte) {
 489                 /*
 490                  *         [ bytenr - len ]
 491                  *         [   ]
 492                  *   [csum     ]
 493                  *   A simple truncate off the end of the item
 494                  */
 495                 u32 new_size = (bytenr - key->offset) >> blocksize_bits;
 496                 new_size *= csum_size;
 497                 ret = btrfs_truncate_item(trans, root, path, new_size, 1);
 498                 BUG_ON(ret);
 499         } else if (key->offset >= bytenr && csum_end > end_byte &&
 500                    end_byte > key->offset) {
 501                 /*
 502                  *         [ bytenr - len ]
 503                  *                 [ ]
 504                  *                 [csum     ]
 505                  * we need to truncate from the beginning of the csum
 506                  */
 507                 u32 new_size = (csum_end - end_byte) >> blocksize_bits;
 508                 new_size *= csum_size;
 509
 510                 ret = btrfs_truncate_item(trans, root, path, new_size, 0);
 511                 BUG_ON(ret);
 512
 513                 key->offset = end_byte;
 514                 ret = btrfs_set_item_key_safe(trans, root, path, key);
 515                 BUG_ON(ret);
 516         } else {
 517                 BUG();
 518         }
 519         return 0;
 520 }
 521
 522 /*
 523  * deletes the csum items from the csum tree for a given
 524  * range of bytes.
 525  */
 526 int btrfs_del_csums(struct btrfs_trans_handle *trans,
 527                     struct btrfs_root *root, u64 bytenr, u64 len)
 528 {
 529         struct btrfs_path *path;
 530         struct btrfs_key key;
 531         u64 end_byte = bytenr + len;
 532         u64 csum_end;
 533         struct extent_buffer *leaf;
 534         int ret;
 535         u16 csum_size =
 536                 btrfs_super_csum_size(&root->fs_info->super_copy);
 537         int blocksize_bits = root->fs_info->sb->s_blocksize_bits;
 538
 539         root = root->fs_info->csum_root;
 540
 541         path = btrfs_alloc_path();
 542         if (!path)
 543                 return -ENOMEM;
 544
 545         while (1) {
 546                 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
 547                 key.offset = end_byte - 1;
 548                 key.type = BTRFS_EXTENT_CSUM_KEY;
 549
 550                 path->leave_spinning = 1;
 551                 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
 552                 if (ret > 0) {
 553                         if (path->slots[0] == 0)
 554                                 break;
 555                         path->slots[0]--;
 556                 } else if (ret < 0) {
 557                         break;
 558                 }
 559
 560                 leaf = path->nodes[0];
 561                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 562
 563                 if (key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
 564                     key.type != BTRFS_EXTENT_CSUM_KEY) {
 565                         break;
 566                 }
 567
 568                 if (key.offset >= end_byte)
 569                         break;
 570
 571                 csum_end = btrfs_item_size_nr(leaf, path->slots[0]) / csum_size;
 572                 csum_end <<= blocksize_bits;
 573                 csum_end += key.offset;
 574
 575                 /* this csum ends before we start, we're done */
 576                 if (csum_end <= bytenr)
 577                         break;
 578
 579                 /* delete the entire item, it is inside our range */
 580                 if (key.offset >= bytenr && csum_end <= end_byte) {
 581                         ret = btrfs_del_item(trans, root, path);
 582                         if (ret)
 583                                 goto out;
 584                         if (key.offset == bytenr)
 585                                 break;
 586                 } else if (key.offset < bytenr && csum_end > end_byte) {
 587                         unsigned long offset;
 588                         unsigned long shift_len;
 589                         unsigned long item_offset;
 590                         /*
 591                          *        [ bytenr - len ]
 592                          *     [csum                ]
 593                          *
 594                          * Our bytes are in the middle of the csum,
 595                          * we need to split this item and insert a new one.
 596                          *
 597                          * But we can't drop the path because the
 598                          * csum could change, get removed, extended etc.
 599                          *
 600                          * The trick here is the max size of a csum item leaves
 601                          * enough room in the tree block for a single
 602                          * item header.  So, we split the item in place,
 603                          * adding a new header pointing to the existing
 604                          * bytes.  Then we loop around again and we have
 605                          * a nicely formed csum item that we can neatly
 606                          * truncate.
 607                          */
 608                         offset = (bytenr - key.offset) >> blocksize_bits;
 609                         offset *= csum_size;
 610
 611                         shift_len = (len >> blocksize_bits) * csum_size;
 612
 613                         item_offset = btrfs_item_ptr_offset(leaf,
 614                                                             path->slots[0]);
 615
 616                         memset_extent_buffer(leaf, 0, item_offset + offset,
 617                                              shift_len);
 618                         key.offset = bytenr;
 619
 620                         /*
 621                          * btrfs_split_item returns -EAGAIN when the
 622                          * item changed size or key
 623                          */
 624                         ret = btrfs_split_item(trans, root, path, &key, offset);
 625                         BUG_ON(ret && ret != -EAGAIN);
 626
 627                         key.offset = end_byte - 1;
 628                 } else {
 629                         ret = truncate_one_csum(trans, root, path,
 630                                                 &key, bytenr, len);
 631                         BUG_ON(ret);
 632                         if (key.offset < bytenr)
 633                                 break;
 634                 }
 635                 btrfs_release_path(root, path);
 636         }
 637         ret = 0;
 638 out:
 639         btrfs_free_path(path);
 640         return ret;
 641 }
 642
 643 int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
 644                            struct btrfs_root *root,
 645                            struct btrfs_ordered_sum *sums)
 646 {
 647         u64 bytenr;
 648         int ret;
 649         struct btrfs_key file_key;
 650         struct btrfs_key found_key;
 651         u64 next_offset;
 652         u64 total_bytes = 0;
 653         int found_next;
 654         struct btrfs_path *path;
 655         struct btrfs_csum_item *item;
 656         struct btrfs_csum_item *item_end;
 657         struct extent_buffer *leaf = NULL;
 658         u64 csum_offset;
 659         struct btrfs_sector_sum *sector_sum;
 660         u32 nritems;
 661         u32 ins_size;
 662         char *eb_map;
 663         char *eb_token;
 664         unsigned long map_len;
 665         unsigned long map_start;
 666         u16 csum_size =
 667                 btrfs_super_csum_size(&root->fs_info->super_copy);
 668
 669         path = btrfs_alloc_path();
 670         BUG_ON(!path);
 671         sector_sum = sums->sums;
 672 again:
 673         next_offset = (u64)-1;
 674         found_next = 0;
 675         file_key.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
 676         file_key.offset = sector_sum->bytenr;
 677         bytenr = sector_sum->bytenr;
 678         btrfs_set_key_type(&file_key, BTRFS_EXTENT_CSUM_KEY);
 679
 680         item = btrfs_lookup_csum(trans, root, path, sector_sum->bytenr, 1);
 681         if (!IS_ERR(item)) {
 682                 leaf = path->nodes[0];
 683                 ret = 0;
 684                 goto found;
 685         }
 686         ret = PTR_ERR(item);
 687         if (ret != -EFBIG && ret != -ENOENT)
 688                 goto fail_unlock;
 689
 690         if (ret == -EFBIG) {
 691                 u32 item_size;
 692                 /* we found one, but it isn't big enough yet */
 693                 leaf = path->nodes[0];
 694                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
 695                 if ((item_size / csum_size) >=
 696                     MAX_CSUM_ITEMS(root, csum_size)) {
 697                         /* already at max size, make a new one */
 698                         goto insert;
 699                 }
 700         } else {
 701                 int slot = path->slots[0] + 1;
 702                 /* we didn't find a csum item, insert one */
 703                 nritems = btrfs_header_nritems(path->nodes[0]);
 704                 if (path->slots[0] >= nritems - 1) {
 705                         ret = btrfs_next_leaf(root, path);
 706                         if (ret == 1)
 707                                 found_next = 1;
 708                         if (ret != 0)
 709                                 goto insert;
 710                         slot = 0;
 711                 }
 712                 btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
 713                 if (found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
 714                     found_key.type != BTRFS_EXTENT_CSUM_KEY) {
 715                         found_next = 1;
 716                         goto insert;
 717                 }
 718                 next_offset = found_key.offset;
 719                 found_next = 1;
 720                 goto insert;
 721         }
 722
 723         /*
 724          * at this point, we know the tree has an item, but it isn't big
 725          * enough yet to put our csum in.  Grow it
 726          */
 727         btrfs_release_path(root, path);
 728         ret = btrfs_search_slot(trans, root, &file_key, path,
 729                                 csum_size, 1);
 730         if (ret < 0)
 731                 goto fail_unlock;
 732
 733         if (ret > 0) {
 734                 if (path->slots[0] == 0)
 735                         goto insert;
 736                 path->slots[0]--;
 737         }
 738
 739         leaf = path->nodes[0];
 740         btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
 741         csum_offset = (bytenr - found_key.offset) >>
 742                         root->fs_info->sb->s_blocksize_bits;
 743
 744         if (btrfs_key_type(&found_key) != BTRFS_EXTENT_CSUM_KEY ||
 745             found_key.objectid != BTRFS_EXTENT_CSUM_OBJECTID ||
 746             csum_offset >= MAX_CSUM_ITEMS(root, csum_size)) {
 747                 goto insert;
 748         }
 749
 750         if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) /
 751             csum_size) {
 752                 u32 diff = (csum_offset + 1) * csum_size;
 753
 754                 /*
 755                  * is the item big enough already?  we dropped our lock
 756                  * before and need to recheck
 757                  */
 758                 if (diff < btrfs_item_size_nr(leaf, path->slots[0]))
 759                         goto csum;
 760
 761                 diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
 762                 if (diff != csum_size)
 763                         goto insert;
 764
 765                 ret = btrfs_extend_item(trans, root, path, diff);
 766                 BUG_ON(ret);
 767                 goto csum;
 768         }
 769
 770 insert:
 771         btrfs_release_path(root, path);
 772         csum_offset = 0;
 773         if (found_next) {
 774                 u64 tmp = total_bytes + root->sectorsize;
 775                 u64 next_sector = sector_sum->bytenr;
 776                 struct btrfs_sector_sum *next = sector_sum + 1;
 777
 778                 while (tmp < sums->len) {
 779                         if (next_sector + root->sectorsize != next->bytenr)
 780                                 break;
 781                         tmp += root->sectorsize;
 782                         next_sector = next->bytenr;
 783                         next++;
 784                 }
 785                 tmp = min(tmp, next_offset - file_key.offset);
 786                 tmp >>= root->fs_info->sb->s_blocksize_bits;
 787                 tmp = max((u64)1, tmp);
 788                 tmp = min(tmp, (u64)MAX_CSUM_ITEMS(root, csum_size));
 789                 ins_size = csum_size * tmp;
 790         } else {
 791                 ins_size = csum_size;
 792         }
 793         path->leave_spinning = 1;
 794         ret = btrfs_insert_empty_item(trans, root, path, &file_key,
 795                                       ins_size);
 796         path->leave_spinning = 0;
 797         if (ret < 0)
 798                 goto fail_unlock;
 799         if (ret != 0) {
 800                 WARN_ON(1);
 801                 goto fail_unlock;
 802         }
 803 csum:
 804         leaf = path->nodes[0];
 805         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
 806         ret = 0;
 807         item = (struct btrfs_csum_item *)((unsigned char *)item +
 808                                           csum_offset * csum_size);
 809 found:
 810         item_end = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
 811         item_end = (struct btrfs_csum_item *)((unsigned char *)item_end +
 812                                       btrfs_item_size_nr(leaf, path->slots[0]));
 813         eb_token = NULL;
 814 next_sector:
 815
 816         if (!eb_token ||
 817            (unsigned long)item + csum_size >= map_start + map_len) {
 818                 int err;
 819
 820                 if (eb_token)
 821                         unmap_extent_buffer(leaf, eb_token, KM_USER1);
 822                 eb_token = NULL;
 823                 err = map_private_extent_buffer(leaf, (unsigned long)item,
 824                                                 csum_size,
 825                                                 &eb_token, &eb_map,
 826                                                 &map_start, &map_len, KM_USER1);
 827                 if (err)
 828                         eb_token = NULL;
 829         }
 830         if (eb_token) {
 831                 memcpy(eb_token + ((unsigned long)item & (PAGE_CACHE_SIZE - 1)),
 832                        &sector_sum->sum, csum_size);
 833         } else {
 834                 write_extent_buffer(leaf, &sector_sum->sum,
 835                                     (unsigned long)item, csum_size);
 836         }
 837
 838         total_bytes += root->sectorsize;
 839         sector_sum++;
 840         if (total_bytes < sums->len) {
 841                 item = (struct btrfs_csum_item *)((char *)item +
 842                                                   csum_size);
 843                 if (item < item_end && bytenr + PAGE_CACHE_SIZE ==
 844                     sector_sum->bytenr) {
 845                         bytenr = sector_sum->bytenr;
 846                         goto next_sector;
 847                 }
 848         }
 849         if (eb_token) {
 850                 unmap_extent_buffer(leaf, eb_token, KM_USER1);
 851                 eb_token = NULL;
 852         }
 853         btrfs_mark_buffer_dirty(path->nodes[0]);
 854         if (total_bytes < sums->len) {
 855                 btrfs_release_path(root, path);
 856                 cond_resched();
 857                 goto again;
 858         }
 859 out:
 860         btrfs_free_path(path);
 861         return ret;
 862
 863 fail_unlock:
 864         goto out;
 865 }