SAFE public projects git trees. - safe/jmp/linux-2.6/blob - fs/reiserfs/file.c

   1 /*
   2  * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
   3  */
   4
   5 #include <linux/time.h>
   6 #include <linux/reiserfs_fs.h>
   7 #include <linux/reiserfs_acl.h>
   8 #include <linux/reiserfs_xattr.h>
   9 #include <linux/smp_lock.h>
  10 #include <asm/uaccess.h>
  11 #include <linux/pagemap.h>
  12 #include <linux/swap.h>
  13 #include <linux/writeback.h>
  14 #include <linux/blkdev.h>
  15 #include <linux/buffer_head.h>
  16 #include <linux/quotaops.h>
  17
  18 /*
  19 ** We pack the tails of files on file close, not at the time they are written.
  20 ** This implies an unnecessary copy of the tail and an unnecessary indirect item
  21 ** insertion/balancing, for files that are written in one write.
  22 ** It avoids unnecessary tail packings (balances) for files that are written in
  23 ** multiple writes and are small enough to have tails.
  24 **
  25 ** file_release is called by the VFS layer when the file is closed.  If
  26 ** this is the last open file descriptor, and the file
  27 ** small enough to have a tail, and the tail is currently in an
  28 ** unformatted node, the tail is converted back into a direct item.
  29 **
  30 ** We use reiserfs_truncate_file to pack the tail, since it already has
  31 ** all the conditions coded.
  32 */
  33 static int reiserfs_file_release(struct inode *inode, struct file *filp)
  34 {
  35
  36         struct reiserfs_transaction_handle th;
  37         int err;
  38         int jbegin_failure = 0;
  39
  40         BUG_ON(!S_ISREG(inode->i_mode));
  41
  42         /* fast out for when nothing needs to be done */
  43         if ((atomic_read(&inode->i_count) > 1 ||
  44              !(REISERFS_I(inode)->i_flags & i_pack_on_close_mask) ||
  45              !tail_has_to_be_packed(inode)) &&
  46             REISERFS_I(inode)->i_prealloc_count <= 0) {
  47                 return 0;
  48         }
  49
  50         mutex_lock(&inode->i_mutex);
  51         reiserfs_write_lock(inode->i_sb);
  52         /* freeing preallocation only involves relogging blocks that
  53          * are already in the current transaction.  preallocation gets
  54          * freed at the end of each transaction, so it is impossible for
  55          * us to log any additional blocks (including quota blocks)
  56          */
  57         err = journal_begin(&th, inode->i_sb, 1);
  58         if (err) {
  59                 /* uh oh, we can't allow the inode to go away while there
  60                  * is still preallocation blocks pending.  Try to join the
  61                  * aborted transaction
  62                  */
  63                 jbegin_failure = err;
  64                 err = journal_join_abort(&th, inode->i_sb, 1);
  65
  66                 if (err) {
  67                         /* hmpf, our choices here aren't good.  We can pin the inode
  68                          * which will disallow unmount from every happening, we can
  69                          * do nothing, which will corrupt random memory on unmount,
  70                          * or we can forcibly remove the file from the preallocation
  71                          * list, which will leak blocks on disk.  Lets pin the inode
  72                          * and let the admin know what is going on.
  73                          */
  74                         igrab(inode);
  75                         reiserfs_warning(inode->i_sb,
  76                                          "pinning inode %lu because the "
  77                                          "preallocation can't be freed",
  78                                          inode->i_ino);
  79                         goto out;
  80                 }
  81         }
  82         reiserfs_update_inode_transaction(inode);
  83
  84 #ifdef REISERFS_PREALLOCATE
  85         reiserfs_discard_prealloc(&th, inode);
  86 #endif
  87         err = journal_end(&th, inode->i_sb, 1);
  88
  89         /* copy back the error code from journal_begin */
  90         if (!err)
  91                 err = jbegin_failure;
  92
  93         if (!err && atomic_read(&inode->i_count) <= 1 &&
  94             (REISERFS_I(inode)->i_flags & i_pack_on_close_mask) &&
  95             tail_has_to_be_packed(inode)) {
  96                 /* if regular file is released by last holder and it has been
  97                    appended (we append by unformatted node only) or its direct
  98                    item(s) had to be converted, then it may have to be
  99                    indirect2direct converted */
 100                 err = reiserfs_truncate_file(inode, 0);
 101         }
 102       out:
 103         mutex_unlock(&inode->i_mutex);
 104         reiserfs_write_unlock(inode->i_sb);
 105         return err;
 106 }
 107
 108 static void reiserfs_vfs_truncate_file(struct inode *inode)
 109 {
 110         reiserfs_truncate_file(inode, 1);
 111 }
 112
 113 /* Sync a reiserfs file. */
 114
 115 /*
 116  * FIXME: sync_mapping_buffers() never has anything to sync.  Can
 117  * be removed...
 118  */
 119
 120 static int reiserfs_sync_file(struct file *p_s_filp,
 121                               struct dentry *p_s_dentry, int datasync)
 122 {
 123         struct inode *p_s_inode = p_s_dentry->d_inode;
 124         int n_err;
 125         int barrier_done;
 126
 127         BUG_ON(!S_ISREG(p_s_inode->i_mode));
 128         n_err = sync_mapping_buffers(p_s_inode->i_mapping);
 129         reiserfs_write_lock(p_s_inode->i_sb);
 130         barrier_done = reiserfs_commit_for_inode(p_s_inode);
 131         reiserfs_write_unlock(p_s_inode->i_sb);
 132         if (barrier_done != 1 && reiserfs_barrier_flush(p_s_inode->i_sb))
 133                 blkdev_issue_flush(p_s_inode->i_sb->s_bdev, NULL);
 134         if (barrier_done < 0)
 135                 return barrier_done;
 136         return (n_err < 0) ? -EIO : 0;
 137 }
 138
 139 /* I really do not want to play with memory shortage right now, so
 140    to simplify the code, we are not going to write more than this much pages at
 141    a time. This still should considerably improve performance compared to 4k
 142    at a time case. This is 32 pages of 4k size. */
 143 #define REISERFS_WRITE_PAGES_AT_A_TIME (128 * 1024) / PAGE_CACHE_SIZE
 144
 145 /* Allocates blocks for a file to fulfil write request.
 146    Maps all unmapped but prepared pages from the list.
 147    Updates metadata with newly allocated blocknumbers as needed */
 148 static int reiserfs_allocate_blocks_for_region(struct reiserfs_transaction_handle *th, struct inode *inode,     /* Inode we work with */
 149                                                loff_t pos,      /* Writing position */
 150                                                int num_pages,   /* number of pages write going
 151                                                                    to touch */
 152                                                int write_bytes, /* amount of bytes to write */
 153                                                struct page **prepared_pages,    /* array of
 154                                                                                    prepared pages
 155                                                                                  */
 156                                                int blocks_to_allocate   /* Amount of blocks we
 157                                                                            need to allocate to
 158                                                                            fit the data into file
 159                                                                          */
 160     )
 161 {
 162         struct cpu_key key;     // cpu key of item that we are going to deal with
 163         struct item_head *ih;   // pointer to item head that we are going to deal with
 164         struct buffer_head *bh; // Buffer head that contains items that we are going to deal with
 165         __le32 *item;           // pointer to item we are going to deal with
 166         INITIALIZE_PATH(path);  // path to item, that we are going to deal with.
 167         b_blocknr_t *allocated_blocks;  // Pointer to a place where allocated blocknumbers would be stored.
 168         reiserfs_blocknr_hint_t hint;   // hint structure for block allocator.
 169         size_t res;             // return value of various functions that we call.
 170         int curr_block;         // current block used to keep track of unmapped blocks.
 171         int i;                  // loop counter
 172         int itempos;            // position in item
 173         unsigned int from = (pos & (PAGE_CACHE_SIZE - 1));      // writing position in
 174         // first page
 175         unsigned int to = ((pos + write_bytes - 1) & (PAGE_CACHE_SIZE - 1)) + 1;        /* last modified byte offset in last page */
 176         __u64 hole_size;        // amount of blocks for a file hole, if it needed to be created.
 177         int modifying_this_item = 0;    // Flag for items traversal code to keep track
 178         // of the fact that we already prepared
 179         // current block for journal
 180         int will_prealloc = 0;
 181         RFALSE(!blocks_to_allocate,
 182                "green-9004: tried to allocate zero blocks?");
 183
 184         /* only preallocate if this is a small write */
 185         if (REISERFS_I(inode)->i_prealloc_count ||
 186             (!(write_bytes & (inode->i_sb->s_blocksize - 1)) &&
 187              blocks_to_allocate <
 188              REISERFS_SB(inode->i_sb)->s_alloc_options.preallocsize))
 189                 will_prealloc =
 190                     REISERFS_SB(inode->i_sb)->s_alloc_options.preallocsize;
 191
 192         allocated_blocks = kmalloc((blocks_to_allocate + will_prealloc) *
 193                                    sizeof(b_blocknr_t), GFP_NOFS);
 194         if (!allocated_blocks)
 195                 return -ENOMEM;
 196
 197         /* First we compose a key to point at the writing position, we want to do
 198            that outside of any locking region. */
 199         make_cpu_key(&key, inode, pos + 1, TYPE_ANY, 3 /*key length */ );
 200
 201         /* If we came here, it means we absolutely need to open a transaction,
 202            since we need to allocate some blocks */
 203         reiserfs_write_lock(inode->i_sb);       // Journaling stuff and we need that.
 204         res = journal_begin(th, inode->i_sb, JOURNAL_PER_BALANCE_CNT * 3 + 1 + 2 * REISERFS_QUOTA_TRANS_BLOCKS(inode->i_sb));   // Wish I know if this number enough
 205         if (res)
 206                 goto error_exit;
 207         reiserfs_update_inode_transaction(inode);
 208
 209         /* Look for the in-tree position of our write, need path for block allocator */
 210         res = search_for_position_by_key(inode->i_sb, &key, &path);
 211         if (res == IO_ERROR) {
 212                 res = -EIO;
 213                 goto error_exit;
 214         }
 215
 216         /* Allocate blocks */
 217         /* First fill in "hint" structure for block allocator */
 218         hint.th = th;           // transaction handle.
 219         hint.path = &path;      // Path, so that block allocator can determine packing locality or whatever it needs to determine.
 220         hint.inode = inode;     // Inode is needed by block allocator too.
 221         hint.search_start = 0;  // We have no hint on where to search free blocks for block allocator.
 222         hint.key = key.on_disk_key;     // on disk key of file.
 223         hint.block = inode->i_blocks >> (inode->i_sb->s_blocksize_bits - 9);    // Number of disk blocks this file occupies already.
 224         hint.formatted_node = 0;        // We are allocating blocks for unformatted node.
 225         hint.preallocate = will_prealloc;
 226
 227         /* Call block allocator to allocate blocks */
 228         res =
 229             reiserfs_allocate_blocknrs(&hint, allocated_blocks,
 230                                        blocks_to_allocate, blocks_to_allocate);
 231         if (res != CARRY_ON) {
 232                 if (res == NO_DISK_SPACE) {
 233                         /* We flush the transaction in case of no space. This way some
 234                            blocks might become free */
 235                         SB_JOURNAL(inode->i_sb)->j_must_wait = 1;
 236                         res = restart_transaction(th, inode, &path);
 237                         if (res)
 238                                 goto error_exit;
 239
 240                         /* We might have scheduled, so search again */
 241                         res =
 242                             search_for_position_by_key(inode->i_sb, &key,
 243                                                        &path);
 244                         if (res == IO_ERROR) {
 245                                 res = -EIO;
 246                                 goto error_exit;
 247                         }
 248
 249                         /* update changed info for hint structure. */
 250                         res =
 251                             reiserfs_allocate_blocknrs(&hint, allocated_blocks,
 252                                                        blocks_to_allocate,
 253                                                        blocks_to_allocate);
 254                         if (res != CARRY_ON) {
 255                                 res = res == QUOTA_EXCEEDED ? -EDQUOT : -ENOSPC;
 256                                 pathrelse(&path);
 257                                 goto error_exit;
 258                         }
 259                 } else {
 260                         res = res == QUOTA_EXCEEDED ? -EDQUOT : -ENOSPC;
 261                         pathrelse(&path);
 262                         goto error_exit;
 263                 }
 264         }
 265 #ifdef __BIG_ENDIAN
 266         // Too bad, I have not found any way to convert a given region from
 267         // cpu format to little endian format
 268         {
 269                 int i;
 270                 for (i = 0; i < blocks_to_allocate; i++)
 271                         allocated_blocks[i] = cpu_to_le32(allocated_blocks[i]);
 272         }
 273 #endif
 274
 275         /* Blocks allocating well might have scheduled and tree might have changed,
 276            let's search the tree again */
 277         /* find where in the tree our write should go */
 278         res = search_for_position_by_key(inode->i_sb, &key, &path);
 279         if (res == IO_ERROR) {
 280                 res = -EIO;
 281                 goto error_exit_free_blocks;
 282         }
 283
 284         bh = get_last_bh(&path);        // Get a bufferhead for last element in path.
 285         ih = get_ih(&path);     // Get a pointer to last item head in path.
 286         item = get_item(&path); // Get a pointer to last item in path
 287
 288         /* Let's see what we have found */
 289         if (res != POSITION_FOUND) {    /* position not found, this means that we
 290                                            might need to append file with holes
 291                                            first */
 292                 // Since we are writing past the file's end, we need to find out if
 293                 // there is a hole that needs to be inserted before our writing
 294                 // position, and how many blocks it is going to cover (we need to
 295                 //  populate pointers to file blocks representing the hole with zeros)
 296
 297                 {
 298                         int item_offset = 1;
 299                         /*
 300                          * if ih is stat data, its offset is 0 and we don't want to
 301                          * add 1 to pos in the hole_size calculation
 302                          */
 303                         if (is_statdata_le_ih(ih))
 304                                 item_offset = 0;
 305                         hole_size = (pos + item_offset -
 306                                      (le_key_k_offset
 307                                       (get_inode_item_key_version(inode),
 308                                        &(ih->ih_key)) + op_bytes_number(ih,
 309                                                                         inode->
 310                                                                         i_sb->
 311                                                                         s_blocksize)))
 312                             >> inode->i_sb->s_blocksize_bits;
 313                 }
 314
 315                 if (hole_size > 0) {
 316                         int to_paste = min_t(__u64, hole_size, MAX_ITEM_LEN(inode->i_sb->s_blocksize) / UNFM_P_SIZE);   // How much data to insert first time.
 317                         /* area filled with zeroes, to supply as list of zero blocknumbers
 318                            We allocate it outside of loop just in case loop would spin for
 319                            several iterations. */
 320                         char *zeros = kmalloc(to_paste * UNFM_P_SIZE, GFP_ATOMIC);      // We cannot insert more than MAX_ITEM_LEN bytes anyway.
 321                         if (!zeros) {
 322                                 res = -ENOMEM;
 323                                 goto error_exit_free_blocks;
 324                         }
 325                         memset(zeros, 0, to_paste * UNFM_P_SIZE);
 326                         do {
 327                                 to_paste =
 328                                     min_t(__u64, hole_size,
 329                                           MAX_ITEM_LEN(inode->i_sb->
 330                                                        s_blocksize) /
 331                                           UNFM_P_SIZE);
 332                                 if (is_indirect_le_ih(ih)) {
 333                                         /* Ok, there is existing indirect item already. Need to append it */
 334                                         /* Calculate position past inserted item */
 335                                         make_cpu_key(&key, inode,
 336                                                      le_key_k_offset
 337                                                      (get_inode_item_key_version
 338                                                       (inode),
 339                                                       &(ih->ih_key)) +
 340                                                      op_bytes_number(ih,
 341                                                                      inode->
 342                                                                      i_sb->
 343                                                                      s_blocksize),
 344                                                      TYPE_INDIRECT, 3);
 345                                         res =
 346                                             reiserfs_paste_into_item(th, &path,
 347                                                                      &key,
 348                                                                      inode,
 349                                                                      (char *)
 350                                                                      zeros,
 351                                                                      UNFM_P_SIZE
 352                                                                      *
 353                                                                      to_paste);
 354                                         if (res) {
 355                                                 kfree(zeros);
 356                                                 goto error_exit_free_blocks;
 357                                         }
 358                                 } else if (is_statdata_le_ih(ih)) {
 359                                         /* No existing item, create it */
 360                                         /* item head for new item */
 361                                         struct item_head ins_ih;
 362
 363                                         /* create a key for our new item */
 364                                         make_cpu_key(&key, inode, 1,
 365                                                      TYPE_INDIRECT, 3);
 366
 367                                         /* Create new item head for our new item */
 368                                         make_le_item_head(&ins_ih, &key,
 369                                                           key.version, 1,
 370                                                           TYPE_INDIRECT,
 371                                                           to_paste *
 372                                                           UNFM_P_SIZE,
 373                                                           0 /* free space */ );
 374
 375                                         /* Find where such item should live in the tree */
 376                                         res =
 377                                             search_item(inode->i_sb, &key,
 378                                                         &path);
 379                                         if (res != ITEM_NOT_FOUND) {
 380                                                 /* item should not exist, otherwise we have error */
 381                                                 if (res != -ENOSPC) {
 382                                                         reiserfs_warning(inode->
 383                                                                          i_sb,
 384                                                                          "green-9008: search_by_key (%K) returned %d",
 385                                                                          &key,
 386                                                                          res);
 387                                                 }
 388                                                 res = -EIO;
 389                                                 kfree(zeros);
 390                                                 goto error_exit_free_blocks;
 391                                         }
 392                                         res =
 393                                             reiserfs_insert_item(th, &path,
 394                                                                  &key, &ins_ih,
 395                                                                  inode,
 396                                                                  (char *)zeros);
 397                                 } else {
 398                                         reiserfs_panic(inode->i_sb,
 399                                                        "green-9011: Unexpected key type %K\n",
 400                                                        &key);
 401                                 }
 402                                 if (res) {
 403                                         kfree(zeros);
 404                                         goto error_exit_free_blocks;
 405                                 }
 406                                 /* Now we want to check if transaction is too full, and if it is
 407                                    we restart it. This will also free the path. */
 408                                 if (journal_transaction_should_end
 409                                     (th, th->t_blocks_allocated)) {
 410                                         res =
 411                                             restart_transaction(th, inode,
 412                                                                 &path);
 413                                         if (res) {
 414                                                 pathrelse(&path);
 415                                                 kfree(zeros);
 416                                                 goto error_exit;
 417                                         }
 418                                 }
 419
 420                                 /* Well, need to recalculate path and stuff */
 421                                 set_cpu_key_k_offset(&key,
 422                                                      cpu_key_k_offset(&key) +
 423                                                      (to_paste << inode->
 424                                                       i_blkbits));
 425                                 res =
 426                                     search_for_position_by_key(inode->i_sb,
 427                                                                &key, &path);
 428                                 if (res == IO_ERROR) {
 429                                         res = -EIO;
 430                                         kfree(zeros);
 431                                         goto error_exit_free_blocks;
 432                                 }
 433                                 bh = get_last_bh(&path);
 434                                 ih = get_ih(&path);
 435                                 item = get_item(&path);
 436                                 hole_size -= to_paste;
 437                         } while (hole_size);
 438                         kfree(zeros);
 439                 }
 440         }
 441         // Go through existing indirect items first
 442         // replace all zeroes with blocknumbers from list
 443         // Note that if no corresponding item was found, by previous search,
 444         // it means there are no existing in-tree representation for file area
 445         // we are going to overwrite, so there is nothing to scan through for holes.
 446         for (curr_block = 0, itempos = path.pos_in_item;
 447              curr_block < blocks_to_allocate && res == POSITION_FOUND;) {
 448               retry:
 449
 450                 if (itempos >= ih_item_len(ih) / UNFM_P_SIZE) {
 451                         /* We run out of data in this indirect item, let's look for another
 452                            one. */
 453                         /* First if we are already modifying current item, log it */
 454                         if (modifying_this_item) {
 455                                 journal_mark_dirty(th, inode->i_sb, bh);
 456                                 modifying_this_item = 0;
 457                         }
 458                         /* Then set the key to look for a new indirect item (offset of old
 459                            item is added to old item length */
 460                         set_cpu_key_k_offset(&key,
 461                                              le_key_k_offset
 462                                              (get_inode_item_key_version(inode),
 463                                               &(ih->ih_key)) +
 464                                              op_bytes_number(ih,
 465                                                              inode->i_sb->
 466                                                              s_blocksize));
 467                         /* Search ofor position of new key in the tree. */
 468                         res =
 469                             search_for_position_by_key(inode->i_sb, &key,
 470                                                        &path);
 471                         if (res == IO_ERROR) {
 472                                 res = -EIO;
 473                                 goto error_exit_free_blocks;
 474                         }
 475                         bh = get_last_bh(&path);
 476                         ih = get_ih(&path);
 477                         item = get_item(&path);
 478                         itempos = path.pos_in_item;
 479                         continue;       // loop to check all kinds of conditions and so on.
 480                 }
 481                 /* Ok, we have correct position in item now, so let's see if it is
 482                    representing file hole (blocknumber is zero) and fill it if needed */
 483                 if (!item[itempos]) {
 484                         /* Ok, a hole. Now we need to check if we already prepared this
 485                            block to be journaled */
 486                         while (!modifying_this_item) {  // loop until succeed
 487                                 /* Well, this item is not journaled yet, so we must prepare
 488                                    it for journal first, before we can change it */
 489                                 struct item_head tmp_ih;        // We copy item head of found item,
 490                                 // here to detect if fs changed under
 491                                 // us while we were preparing for
 492                                 // journal.
 493                                 int fs_gen;     // We store fs generation here to find if someone
 494                                 // changes fs under our feet
 495
 496                                 copy_item_head(&tmp_ih, ih);    // Remember itemhead
 497                                 fs_gen = get_generation(inode->i_sb);   // remember fs generation
 498                                 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);       // Prepare a buffer within which indirect item is stored for changing.
 499                                 if (fs_changed(fs_gen, inode->i_sb)
 500                                     && item_moved(&tmp_ih, &path)) {
 501                                         // Sigh, fs was changed under us, we need to look for new
 502                                         // location of item we are working with
 503
 504                                         /* unmark prepaerd area as journaled and search for it's
 505                                            new position */
 506                                         reiserfs_restore_prepared_buffer(inode->
 507                                                                          i_sb,
 508                                                                          bh);
 509                                         res =
 510                                             search_for_position_by_key(inode->
 511                                                                        i_sb,
 512                                                                        &key,
 513                                                                        &path);
 514                                         if (res == IO_ERROR) {
 515                                                 res = -EIO;
 516                                                 goto error_exit_free_blocks;
 517                                         }
 518                                         bh = get_last_bh(&path);
 519                                         ih = get_ih(&path);
 520                                         item = get_item(&path);
 521                                         itempos = path.pos_in_item;
 522                                         goto retry;
 523                                 }
 524                                 modifying_this_item = 1;
 525                         }
 526                         item[itempos] = allocated_blocks[curr_block];   // Assign new block
 527                         curr_block++;
 528                 }
 529                 itempos++;
 530         }
 531
 532         if (modifying_this_item) {      // We need to log last-accessed block, if it
 533                 // was modified, but not logged yet.
 534                 journal_mark_dirty(th, inode->i_sb, bh);
 535         }
 536
 537         if (curr_block < blocks_to_allocate) {
 538                 // Oh, well need to append to indirect item, or to create indirect item
 539                 // if there weren't any
 540                 if (is_indirect_le_ih(ih)) {
 541                         // Existing indirect item - append. First calculate key for append
 542                         // position. We do not need to recalculate path as it should
 543                         // already point to correct place.
 544                         make_cpu_key(&key, inode,
 545                                      le_key_k_offset(get_inode_item_key_version
 546                                                      (inode),
 547                                                      &(ih->ih_key)) +
 548                                      op_bytes_number(ih,
 549                                                      inode->i_sb->s_blocksize),
 550                                      TYPE_INDIRECT, 3);
 551                         res =
 552                             reiserfs_paste_into_item(th, &path, &key, inode,
 553                                                      (char *)(allocated_blocks +
 554                                                               curr_block),
 555                                                      UNFM_P_SIZE *
 556                                                      (blocks_to_allocate -
 557                                                       curr_block));
 558                         if (res) {
 559                                 goto error_exit_free_blocks;
 560                         }
 561                 } else if (is_statdata_le_ih(ih)) {
 562                         // Last found item was statdata. That means we need to create indirect item.
 563                         struct item_head ins_ih;        /* itemhead for new item */
 564
 565                         /* create a key for our new item */
 566                         make_cpu_key(&key, inode, 1, TYPE_INDIRECT, 3); // Position one,
 567                         // because that's
 568                         // where first
 569                         // indirect item
 570                         // begins
 571                         /* Create new item head for our new item */
 572                         make_le_item_head(&ins_ih, &key, key.version, 1,
 573                                           TYPE_INDIRECT,
 574                                           (blocks_to_allocate -
 575                                            curr_block) * UNFM_P_SIZE,
 576                                           0 /* free space */ );
 577                         /* Find where such item should live in the tree */
 578                         res = search_item(inode->i_sb, &key, &path);
 579                         if (res != ITEM_NOT_FOUND) {
 580                                 /* Well, if we have found such item already, or some error
 581                                    occured, we need to warn user and return error */
 582                                 if (res != -ENOSPC) {
 583                                         reiserfs_warning(inode->i_sb,
 584                                                          "green-9009: search_by_key (%K) "
 585                                                          "returned %d", &key,
 586                                                          res);
 587                                 }
 588                                 res = -EIO;
 589                                 goto error_exit_free_blocks;
 590                         }
 591                         /* Insert item into the tree with the data as its body */
 592                         res =
 593                             reiserfs_insert_item(th, &path, &key, &ins_ih,
 594                                                  inode,
 595                                                  (char *)(allocated_blocks +
 596                                                           curr_block));
 597                 } else {
 598                         reiserfs_panic(inode->i_sb,
 599                                        "green-9010: unexpected item type for key %K\n",
 600                                        &key);
 601                 }
 602         }
 603         // the caller is responsible for closing the transaction
 604         // unless we return an error, they are also responsible for logging
 605         // the inode.
 606         //
 607         pathrelse(&path);
 608         /*
 609          * cleanup prellocation from previous writes
 610          * if this is a partial block write
 611          */
 612         if (write_bytes & (inode->i_sb->s_blocksize - 1))
 613                 reiserfs_discard_prealloc(th, inode);
 614         reiserfs_write_unlock(inode->i_sb);
 615
 616         // go through all the pages/buffers and map the buffers to newly allocated
 617         // blocks (so that system knows where to write these pages later).
 618         curr_block = 0;
 619         for (i = 0; i < num_pages; i++) {
 620                 struct page *page = prepared_pages[i];  //current page
 621                 struct buffer_head *head = page_buffers(page);  // first buffer for a page
 622                 int block_start, block_end;     // in-page offsets for buffers.
 623
 624                 if (!page_buffers(page))
 625                         reiserfs_panic(inode->i_sb,
 626                                        "green-9005: No buffers for prepared page???");
 627
 628                 /* For each buffer in page */
 629                 for (bh = head, block_start = 0; bh != head || !block_start;
 630                      block_start = block_end, bh = bh->b_this_page) {
 631                         if (!bh)
 632                                 reiserfs_panic(inode->i_sb,
 633                                                "green-9006: Allocated but absent buffer for a page?");
 634                         block_end = block_start + inode->i_sb->s_blocksize;
 635                         if (i == 0 && block_end <= from)
 636                                 /* if this buffer is before requested data to map, skip it */
 637                                 continue;
 638                         if (i == num_pages - 1 && block_start >= to)
 639                                 /* If this buffer is after requested data to map, abort
 640                                    processing of current page */
 641                                 break;
 642
 643                         if (!buffer_mapped(bh)) {       // Ok, unmapped buffer, need to map it
 644                                 map_bh(bh, inode->i_sb,
 645                                        le32_to_cpu(allocated_blocks
 646                                                    [curr_block]));
 647                                 curr_block++;
 648                                 set_buffer_new(bh);
 649                         }
 650                 }
 651         }
 652
 653         RFALSE(curr_block > blocks_to_allocate,
 654                "green-9007: Used too many blocks? weird");
 655
 656         kfree(allocated_blocks);
 657         return 0;
 658
 659 // Need to deal with transaction here.
 660       error_exit_free_blocks:
 661         pathrelse(&path);
 662         // free blocks
 663         for (i = 0; i < blocks_to_allocate; i++)
 664                 reiserfs_free_block(th, inode, le32_to_cpu(allocated_blocks[i]),
 665                                     1);
 666
 667       error_exit:
 668         if (th->t_trans_id) {
 669                 int err;
 670                 // update any changes we made to blk count
 671                 mark_inode_dirty(inode);
 672                 err =
 673                     journal_end(th, inode->i_sb,
 674                                 JOURNAL_PER_BALANCE_CNT * 3 + 1 +
 675                                 2 * REISERFS_QUOTA_TRANS_BLOCKS(inode->i_sb));
 676                 if (err)
 677                         res = err;
 678         }
 679         reiserfs_write_unlock(inode->i_sb);
 680         kfree(allocated_blocks);
 681
 682         return res;
 683 }
 684
 685 /* Unlock pages prepared by reiserfs_prepare_file_region_for_write */
 686 static void reiserfs_unprepare_pages(struct page **prepared_pages,      /* list of locked pages */
 687                                      size_t num_pages /* amount of pages */ )
 688 {
 689         int i;                  // loop counter
 690
 691         for (i = 0; i < num_pages; i++) {
 692                 struct page *page = prepared_pages[i];
 693
 694                 try_to_free_buffers(page);
 695                 unlock_page(page);
 696                 page_cache_release(page);
 697         }
 698 }
 699
 700 /* This function will copy data from userspace to specified pages within
 701    supplied byte range */
 702 static int reiserfs_copy_from_user_to_file_region(loff_t pos,   /* In-file position */
 703                                                   int num_pages,        /* Number of pages affected */
 704                                                   int write_bytes,      /* Amount of bytes to write */
 705                                                   struct page **prepared_pages, /* pointer to
 706                                                                                    array to
 707                                                                                    prepared pages
 708                                                                                  */
 709                                                   const char __user * buf       /* Pointer to user-supplied
 710                                                                                    data */
 711     )
 712 {
 713         long page_fault = 0;    // status of copy_from_user.
 714         int i;                  // loop counter.
 715         int offset;             // offset in page
 716
 717         for (i = 0, offset = (pos & (PAGE_CACHE_SIZE - 1)); i < num_pages;
 718              i++, offset = 0) {
 719                 size_t count = min_t(size_t, PAGE_CACHE_SIZE - offset, write_bytes);    // How much of bytes to write to this page
 720                 struct page *page = prepared_pages[i];  // Current page we process.
 721
 722                 fault_in_pages_readable(buf, count);
 723
 724                 /* Copy data from userspace to the current page */
 725                 kmap(page);
 726                 page_fault = __copy_from_user(page_address(page) + offset, buf, count); // Copy the data.
 727                 /* Flush processor's dcache for this page */
 728                 flush_dcache_page(page);
 729                 kunmap(page);
 730                 buf += count;
 731                 write_bytes -= count;
 732
 733                 if (page_fault)
 734                         break;  // Was there a fault? abort.
 735         }
 736
 737         return page_fault ? -EFAULT : 0;
 738 }
 739
 740 /* taken fs/buffer.c:__block_commit_write */
 741 int reiserfs_commit_page(struct inode *inode, struct page *page,
 742                          unsigned from, unsigned to)
 743 {
 744         unsigned block_start, block_end;
 745         int partial = 0;
 746         unsigned blocksize;
 747         struct buffer_head *bh, *head;
 748         unsigned long i_size_index = inode->i_size >> PAGE_CACHE_SHIFT;
 749         int new;
 750         int logit = reiserfs_file_data_log(inode);
 751         struct super_block *s = inode->i_sb;
 752         int bh_per_page = PAGE_CACHE_SIZE / s->s_blocksize;
 753         struct reiserfs_transaction_handle th;
 754         int ret = 0;
 755
 756         th.t_trans_id = 0;
 757         blocksize = 1 << inode->i_blkbits;
 758
 759         if (logit) {
 760                 reiserfs_write_lock(s);
 761                 ret = journal_begin(&th, s, bh_per_page + 1);
 762                 if (ret)
 763                         goto drop_write_lock;
 764                 reiserfs_update_inode_transaction(inode);
 765         }
 766         for (bh = head = page_buffers(page), block_start = 0;
 767              bh != head || !block_start;
 768              block_start = block_end, bh = bh->b_this_page) {
 769
 770                 new = buffer_new(bh);
 771                 clear_buffer_new(bh);
 772                 block_end = block_start + blocksize;
 773                 if (block_end <= from || block_start >= to) {
 774                         if (!buffer_uptodate(bh))
 775                                 partial = 1;
 776                 } else {
 777                         set_buffer_uptodate(bh);
 778                         if (logit) {
 779                                 reiserfs_prepare_for_journal(s, bh, 1);
 780                                 journal_mark_dirty(&th, s, bh);
 781                         } else if (!buffer_dirty(bh)) {
 782                                 mark_buffer_dirty(bh);
 783                                 /* do data=ordered on any page past the end
 784                                  * of file and any buffer marked BH_New.
 785                                  */
 786                                 if (reiserfs_data_ordered(inode->i_sb) &&
 787                                     (new || page->index >= i_size_index)) {
 788                                         reiserfs_add_ordered_list(inode, bh);
 789                                 }
 790                         }
 791                 }
 792         }
 793         if (logit) {
 794                 ret = journal_end(&th, s, bh_per_page + 1);
 795               drop_write_lock:
 796                 reiserfs_write_unlock(s);
 797         }
 798         /*
 799          * If this is a partial write which happened to make all buffers
 800          * uptodate then we can optimize away a bogus readpage() for
 801          * the next read(). Here we 'discover' whether the page went
 802          * uptodate as a result of this (potentially partial) write.
 803          */
 804         if (!partial)
 805                 SetPageUptodate(page);
 806         return ret;
 807 }
 808
 809 /* Submit pages for write. This was separated from actual file copying
 810    because we might want to allocate block numbers in-between.
 811    This function assumes that caller will adjust file size to correct value. */
 812 static int reiserfs_submit_file_region_for_write(struct reiserfs_transaction_handle *th, struct inode *inode, loff_t pos,       /* Writing position offset */
 813                                                  size_t num_pages,      /* Number of pages to write */
 814                                                  size_t write_bytes,    /* number of bytes to write */
 815                                                  struct page **prepared_pages   /* list of pages */
 816     )
 817 {
 818         int status;             // return status of block_commit_write.
 819         int retval = 0;         // Return value we are going to return.
 820         int i;                  // loop counter
 821         int offset;             // Writing offset in page.
 822         int orig_write_bytes = write_bytes;
 823         int sd_update = 0;
 824
 825         for (i = 0, offset = (pos & (PAGE_CACHE_SIZE - 1)); i < num_pages;
 826              i++, offset = 0) {
 827                 int count = min_t(int, PAGE_CACHE_SIZE - offset, write_bytes);  // How much of bytes to write to this page
 828                 struct page *page = prepared_pages[i];  // Current page we process.
 829
 830                 status =
 831                     reiserfs_commit_page(inode, page, offset, offset + count);
 832                 if (status)
 833                         retval = status;        // To not overcomplicate matters We are going to
 834                 // submit all the pages even if there was error.
 835                 // we only remember error status to report it on
 836                 // exit.
 837                 write_bytes -= count;
 838         }
 839         /* now that we've gotten all the ordered buffers marked dirty,
 840          * we can safely update i_size and close any running transaction
 841          */
 842         if (pos + orig_write_bytes > inode->i_size) {
 843                 inode->i_size = pos + orig_write_bytes; // Set new size
 844                 /* If the file have grown so much that tail packing is no
 845                  * longer possible, reset "need to pack" flag */
 846                 if ((have_large_tails(inode->i_sb) &&
 847                      inode->i_size > i_block_size(inode) * 4) ||
 848                     (have_small_tails(inode->i_sb) &&
 849                      inode->i_size > i_block_size(inode)))
 850                         REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
 851                 else if ((have_large_tails(inode->i_sb) &&
 852                           inode->i_size < i_block_size(inode) * 4) ||
 853                          (have_small_tails(inode->i_sb) &&
 854                           inode->i_size < i_block_size(inode)))
 855                         REISERFS_I(inode)->i_flags |= i_pack_on_close_mask;
 856
 857                 if (th->t_trans_id) {
 858                         reiserfs_write_lock(inode->i_sb);
 859                         // this sets the proper flags for O_SYNC to trigger a commit
 860                         mark_inode_dirty(inode);
 861                         reiserfs_write_unlock(inode->i_sb);
 862                 } else {
 863                         reiserfs_write_lock(inode->i_sb);
 864                         reiserfs_update_inode_transaction(inode);
 865                         mark_inode_dirty(inode);
 866                         reiserfs_write_unlock(inode->i_sb);
 867                 }
 868
 869                 sd_update = 1;
 870         }
 871         if (th->t_trans_id) {
 872                 reiserfs_write_lock(inode->i_sb);
 873                 if (!sd_update)
 874                         mark_inode_dirty(inode);
 875                 status = journal_end(th, th->t_super, th->t_blocks_allocated);
 876                 if (status)
 877                         retval = status;
 878                 reiserfs_write_unlock(inode->i_sb);
 879         }
 880         th->t_trans_id = 0;
 881
 882         /*
 883          * we have to unlock the pages after updating i_size, otherwise
 884          * we race with writepage
 885          */
 886         for (i = 0; i < num_pages; i++) {
 887                 struct page *page = prepared_pages[i];
 888                 unlock_page(page);
 889                 mark_page_accessed(page);
 890                 page_cache_release(page);
 891         }
 892         return retval;
 893 }
 894
 895 /* Look if passed writing region is going to touch file's tail
 896    (if it is present). And if it is, convert the tail to unformatted node */
 897 static int reiserfs_check_for_tail_and_convert(struct inode *inode,     /* inode to deal with */
 898                                                loff_t pos,      /* Writing position */
 899                                                int write_bytes  /* amount of bytes to write */
 900     )
 901 {
 902         INITIALIZE_PATH(path);  // needed for search_for_position
 903         struct cpu_key key;     // Key that would represent last touched writing byte.
 904         struct item_head *ih;   // item header of found block;
 905         int res;                // Return value of various functions we call.
 906         int cont_expand_offset; // We will put offset for generic_cont_expand here
 907         // This can be int just because tails are created
 908         // only for small files.
 909
 910 /* this embodies a dependency on a particular tail policy */
 911         if (inode->i_size >= inode->i_sb->s_blocksize * 4) {
 912                 /* such a big files do not have tails, so we won't bother ourselves
 913                    to look for tails, simply return */
 914                 return 0;
 915         }
 916
 917         reiserfs_write_lock(inode->i_sb);
 918         /* find the item containing the last byte to be written, or if
 919          * writing past the end of the file then the last item of the
 920          * file (and then we check its type). */
 921         make_cpu_key(&key, inode, pos + write_bytes + 1, TYPE_ANY,
 922                      3 /*key length */ );
 923         res = search_for_position_by_key(inode->i_sb, &key, &path);
 924         if (res == IO_ERROR) {
 925                 reiserfs_write_unlock(inode->i_sb);
 926                 return -EIO;
 927         }
 928         ih = get_ih(&path);
 929         res = 0;
 930         if (is_direct_le_ih(ih)) {
 931                 /* Ok, closest item is file tail (tails are stored in "direct"
 932                  * items), so we need to unpack it. */
 933                 /* To not overcomplicate matters, we just call generic_cont_expand
 934                    which will in turn call other stuff and finally will boil down to
 935                    reiserfs_get_block() that would do necessary conversion. */
 936                 cont_expand_offset =
 937                     le_key_k_offset(get_inode_item_key_version(inode),
 938                                     &(ih->ih_key));
 939                 pathrelse(&path);
 940                 res = generic_cont_expand(inode, cont_expand_offset);
 941         } else
 942                 pathrelse(&path);
 943
 944         reiserfs_write_unlock(inode->i_sb);
 945         return res;
 946 }
 947
 948 /* This function locks pages starting from @pos for @inode.
 949    @num_pages pages are locked and stored in
 950    @prepared_pages array. Also buffers are allocated for these pages.
 951    First and last page of the region is read if it is overwritten only
 952    partially. If last page did not exist before write (file hole or file
 953    append), it is zeroed, then.
 954    Returns number of unallocated blocks that should be allocated to cover
 955    new file data.*/
 956 static int reiserfs_prepare_file_region_for_write(struct inode *inode
 957                                                   /* Inode of the file */ ,
 958                                                   loff_t pos,   /* position in the file */
 959                                                   size_t num_pages,     /* number of pages to
 960                                                                            prepare */
 961                                                   size_t write_bytes,   /* Amount of bytes to be
 962                                                                            overwritten from
 963                                                                            @pos */
 964                                                   struct page **prepared_pages  /* pointer to array
 965                                                                                    where to store
 966                                                                                    prepared pages */
 967     )
 968 {
 969         int res = 0;            // Return values of different functions we call.
 970         unsigned long index = pos >> PAGE_CACHE_SHIFT;  // Offset in file in pages.
 971         int from = (pos & (PAGE_CACHE_SIZE - 1));       // Writing offset in first page
 972         int to = ((pos + write_bytes - 1) & (PAGE_CACHE_SIZE - 1)) + 1;
 973         /* offset of last modified byte in last
 974            page */
 975         struct address_space *mapping = inode->i_mapping;       // Pages are mapped here.
 976         int i;                  // Simple counter
 977         int blocks = 0;         /* Return value (blocks that should be allocated) */
 978         struct buffer_head *bh, *head;  // Current bufferhead and first bufferhead
 979         // of a page.
 980         unsigned block_start, block_end;        // Starting and ending offsets of current
 981         // buffer in the page.
 982         struct buffer_head *wait[2], **wait_bh = wait;  // Buffers for page, if
 983         // Page appeared to be not up
 984         // to date. Note how we have
 985         // at most 2 buffers, this is
 986         // because we at most may
 987         // partially overwrite two
 988         // buffers for one page. One at                                                 // the beginning of write area
 989         // and one at the end.
 990         // Everything inthe middle gets                                                 // overwritten totally.
 991
 992         struct cpu_key key;     // cpu key of item that we are going to deal with
 993         struct item_head *ih = NULL;    // pointer to item head that we are going to deal with
 994         struct buffer_head *itembuf = NULL;     // Buffer head that contains items that we are going to deal with
 995         INITIALIZE_PATH(path);  // path to item, that we are going to deal with.
 996         __le32 *item = NULL;    // pointer to item we are going to deal with
 997         int item_pos = -1;      /* Position in indirect item */
 998
 999         if (num_pages < 1) {
1000                 reiserfs_warning(inode->i_sb,
1001                                  "green-9001: reiserfs_prepare_file_region_for_write "
1002                                  "called with zero number of pages to process");
1003                 return -EFAULT;
1004         }
1005
1006         /* We have 2 loops for pages. In first loop we grab and lock the pages, so
1007            that nobody would touch these until we release the pages. Then
1008            we'd start to deal with mapping buffers to blocks. */
1009         for (i = 0; i < num_pages; i++) {
1010                 prepared_pages[i] = grab_cache_page(mapping, index + i);        // locks the page
1011                 if (!prepared_pages[i]) {
1012                         res = -ENOMEM;
1013                         goto failed_page_grabbing;
1014                 }
1015                 if (!page_has_buffers(prepared_pages[i]))
1016                         create_empty_buffers(prepared_pages[i],
1017                                              inode->i_sb->s_blocksize, 0);
1018         }
1019
1020         /* Let's count amount of blocks for a case where all the blocks
1021            overwritten are new (we will substract already allocated blocks later) */
1022         if (num_pages > 2)
1023                 /* These are full-overwritten pages so we count all the blocks in
1024                    these pages are counted as needed to be allocated */
1025                 blocks =
1026                     (num_pages - 2) << (PAGE_CACHE_SHIFT - inode->i_blkbits);
1027
1028         /* count blocks needed for first page (possibly partially written) */
1029         blocks += ((PAGE_CACHE_SIZE - from) >> inode->i_blkbits) + !!(from & (inode->i_sb->s_blocksize - 1));   /* roundup */
1030
1031         /* Now we account for last page. If last page == first page (we
1032            overwrite only one page), we substract all the blocks past the
1033            last writing position in a page out of already calculated number
1034            of blocks */
1035         blocks += ((num_pages > 1) << (PAGE_CACHE_SHIFT - inode->i_blkbits)) -
1036             ((PAGE_CACHE_SIZE - to) >> inode->i_blkbits);
1037         /* Note how we do not roundup here since partial blocks still
1038            should be allocated */
1039
1040         /* Now if all the write area lies past the file end, no point in
1041            maping blocks, since there is none, so we just zero out remaining
1042            parts of first and last pages in write area (if needed) */
1043         if ((pos & ~((loff_t) PAGE_CACHE_SIZE - 1)) > inode->i_size) {
1044                 if (from != 0) {        /* First page needs to be partially zeroed */
1045                         char *kaddr = kmap_atomic(prepared_pages[0], KM_USER0);
1046                         memset(kaddr, 0, from);
1047                         kunmap_atomic(kaddr, KM_USER0);
1048                         flush_dcache_page(prepared_pages[0]);
1049                 }
1050                 if (to != PAGE_CACHE_SIZE) {    /* Last page needs to be partially zeroed */
1051                         char *kaddr =
1052                             kmap_atomic(prepared_pages[num_pages - 1],
1053                                         KM_USER0);
1054                         memset(kaddr + to, 0, PAGE_CACHE_SIZE - to);
1055                         kunmap_atomic(kaddr, KM_USER0);
1056                         flush_dcache_page(prepared_pages[num_pages - 1]);
1057                 }
1058
1059                 /* Since all blocks are new - use already calculated value */
1060                 return blocks;
1061         }
1062
1063         /* Well, since we write somewhere into the middle of a file, there is
1064            possibility we are writing over some already allocated blocks, so
1065            let's map these blocks and substract number of such blocks out of blocks
1066            we need to allocate (calculated above) */
1067         /* Mask write position to start on blocksize, we do it out of the
1068            loop for performance reasons */
1069         pos &= ~((loff_t) inode->i_sb->s_blocksize - 1);
1070         /* Set cpu key to the starting position in a file (on left block boundary) */
1071         make_cpu_key(&key, inode,
1072                      1 + ((pos) & ~((loff_t) inode->i_sb->s_blocksize - 1)),
1073                      TYPE_ANY, 3 /*key length */ );
1074
1075         reiserfs_write_lock(inode->i_sb);       // We need that for at least search_by_key()
1076         for (i = 0; i < num_pages; i++) {
1077
1078                 head = page_buffers(prepared_pages[i]);
1079                 /* For each buffer in the page */
1080                 for (bh = head, block_start = 0; bh != head || !block_start;
1081                      block_start = block_end, bh = bh->b_this_page) {
1082                         if (!bh)
1083                                 reiserfs_panic(inode->i_sb,
1084                                                "green-9002: Allocated but absent buffer for a page?");
1085                         /* Find where this buffer ends */
1086                         block_end = block_start + inode->i_sb->s_blocksize;
1087                         if (i == 0 && block_end <= from)
1088                                 /* if this buffer is before requested data to map, skip it */
1089                                 continue;
1090
1091                         if (i == num_pages - 1 && block_start >= to) {
1092                                 /* If this buffer is after requested data to map, abort
1093                                    processing of current page */
1094                                 break;
1095                         }
1096
1097                         if (buffer_mapped(bh) && bh->b_blocknr != 0) {
1098                                 /* This is optimisation for a case where buffer is mapped
1099                                    and have blocknumber assigned. In case significant amount
1100                                    of such buffers are present, we may avoid some amount
1101                                    of search_by_key calls.
1102                                    Probably it would be possible to move parts of this code
1103                                    out of BKL, but I afraid that would overcomplicate code
1104                                    without any noticeable benefit.
1105                                  */
1106                                 item_pos++;
1107                                 /* Update the key */
1108                                 set_cpu_key_k_offset(&key,
1109                                                      cpu_key_k_offset(&key) +
1110                                                      inode->i_sb->s_blocksize);
1111                                 blocks--;       // Decrease the amount of blocks that need to be
1112                                 // allocated
1113                                 continue;       // Go to the next buffer
1114                         }
1115
1116                         if (!itembuf || /* if first iteration */
1117                             item_pos >= ih_item_len(ih) / UNFM_P_SIZE) {        /* or if we progressed past the
1118                                                                                    current unformatted_item */
1119                                 /* Try to find next item */
1120                                 res =
1121                                     search_for_position_by_key(inode->i_sb,
1122                                                                &key, &path);
1123                                 /* Abort if no more items */
1124                                 if (res != POSITION_FOUND) {
1125                                         /* make sure later loops don't use this item */
1126                                         itembuf = NULL;
1127                                         item = NULL;
1128                                         break;
1129                                 }
1130
1131                                 /* Update information about current indirect item */
1132                                 itembuf = get_last_bh(&path);
1133                                 ih = get_ih(&path);
1134                                 item = get_item(&path);
1135                                 item_pos = path.pos_in_item;
1136
1137                                 RFALSE(!is_indirect_le_ih(ih),
1138                                        "green-9003: indirect item expected");
1139                         }
1140
1141                         /* See if there is some block associated with the file
1142                            at that position, map the buffer to this block */
1143                         if (get_block_num(item, item_pos)) {
1144                                 map_bh(bh, inode->i_sb,
1145                                        get_block_num(item, item_pos));
1146                                 blocks--;       // Decrease the amount of blocks that need to be
1147                                 // allocated
1148                         }
1149                         item_pos++;
1150                         /* Update the key */
1151                         set_cpu_key_k_offset(&key,
1152                                              cpu_key_k_offset(&key) +
1153                                              inode->i_sb->s_blocksize);
1154                 }
1155         }
1156         pathrelse(&path);       // Free the path
1157         reiserfs_write_unlock(inode->i_sb);
1158
1159         /* Now zero out unmappend buffers for the first and last pages of
1160            write area or issue read requests if page is mapped. */
1161         /* First page, see if it is not uptodate */
1162         if (!PageUptodate(prepared_pages[0])) {
1163                 head = page_buffers(prepared_pages[0]);
1164
1165                 /* For each buffer in page */
1166                 for (bh = head, block_start = 0; bh != head || !block_start;
1167                      block_start = block_end, bh = bh->b_this_page) {
1168
1169                         if (!bh)
1170                                 reiserfs_panic(inode->i_sb,
1171                                                "green-9002: Allocated but absent buffer for a page?");
1172                         /* Find where this buffer ends */
1173                         block_end = block_start + inode->i_sb->s_blocksize;
1174                         if (block_end <= from)
1175                                 /* if this buffer is before requested data to map, skip it */
1176                                 continue;
1177                         if (block_start < from) {       /* Aha, our partial buffer */
1178                                 if (buffer_mapped(bh)) {        /* If it is mapped, we need to
1179                                                                    issue READ request for it to
1180                                                                    not loose data */
1181                                         ll_rw_block(READ, 1, &bh);
1182                                         *wait_bh++ = bh;
1183                                 } else {        /* Not mapped, zero it */
1184                                         char *kaddr =
1185                                             kmap_atomic(prepared_pages[0],
1186                                                         KM_USER0);
1187                                         memset(kaddr + block_start, 0,
1188                                                from - block_start);
1189                                         kunmap_atomic(kaddr, KM_USER0);
1190                                         flush_dcache_page(prepared_pages[0]);
1191                                         set_buffer_uptodate(bh);
1192                                 }
1193                         }
1194                 }
1195         }
1196
1197         /* Last page, see if it is not uptodate, or if the last page is past the end of the file. */
1198         if (!PageUptodate(prepared_pages[num_pages - 1]) ||
1199             ((pos + write_bytes) >> PAGE_CACHE_SHIFT) >
1200             (inode->i_size >> PAGE_CACHE_SHIFT)) {
1201                 head = page_buffers(prepared_pages[num_pages - 1]);
1202
1203                 /* for each buffer in page */
1204                 for (bh = head, block_start = 0; bh != head || !block_start;
1205                      block_start = block_end, bh = bh->b_this_page) {
1206
1207                         if (!bh)
1208                                 reiserfs_panic(inode->i_sb,
1209                                                "green-9002: Allocated but absent buffer for a page?");
1210                         /* Find where this buffer ends */
1211                         block_end = block_start + inode->i_sb->s_blocksize;
1212                         if (block_start >= to)
1213                                 /* if this buffer is after requested data to map, skip it */
1214                                 break;
1215                         if (block_end > to) {   /* Aha, our partial buffer */
1216                                 if (buffer_mapped(bh)) {        /* If it is mapped, we need to
1217                                                                    issue READ request for it to
1218                                                                    not loose data */
1219                                         ll_rw_block(READ, 1, &bh);
1220                                         *wait_bh++ = bh;
1221                                 } else {        /* Not mapped, zero it */
1222                                         char *kaddr =
1223                                             kmap_atomic(prepared_pages
1224                                                         [num_pages - 1],
1225                                                         KM_USER0);
1226                                         memset(kaddr + to, 0, block_end - to);
1227                                         kunmap_atomic(kaddr, KM_USER0);
1228                                         flush_dcache_page(prepared_pages[num_pages - 1]);
1229                                         set_buffer_uptodate(bh);
1230                                 }
1231                         }
1232                 }
1233         }
1234
1235         /* Wait for read requests we made to happen, if necessary */
1236         while (wait_bh > wait) {
1237                 wait_on_buffer(*--wait_bh);
1238                 if (!buffer_uptodate(*wait_bh)) {
1239                         res = -EIO;
1240                         goto failed_read;
1241                 }
1242         }
1243
1244         return blocks;
1245       failed_page_grabbing:
1246         num_pages = i;
1247       failed_read:
1248         reiserfs_unprepare_pages(prepared_pages, num_pages);
1249         return res;
1250 }
1251
1252 /* Write @count bytes at position @ppos in a file indicated by @file
1253    from the buffer @buf.
1254
1255    generic_file_write() is only appropriate for filesystems that are not seeking to optimize performance and want
1256    something simple that works.  It is not for serious use by general purpose filesystems, excepting the one that it was
1257    written for (ext2/3).  This is for several reasons:
1258
1259    * It has no understanding of any filesystem specific optimizations.
1260
1261    * It enters the filesystem repeatedly for each page that is written.
1262
1263    * It depends on reiserfs_get_block() function which if implemented by reiserfs performs costly search_by_key
1264    * operation for each page it is supplied with. By contrast reiserfs_file_write() feeds as much as possible at a time
1265    * to reiserfs which allows for fewer tree traversals.
1266
1267    * Each indirect pointer insertion takes a lot of cpu, because it involves memory moves inside of blocks.
1268
1269    * Asking the block allocation code for blocks one at a time is slightly less efficient.
1270
1271    All of these reasons for not using only generic file write were understood back when reiserfs was first miscoded to
1272    use it, but we were in a hurry to make code freeze, and so it couldn't be revised then.  This new code should make
1273    things right finally.
1274
1275    Future Features: providing search_by_key with hints.
1276
1277 */
1278 static ssize_t reiserfs_file_write(struct file *file,   /* the file we are going to write into */
1279                                    const char __user * buf,     /*  pointer to user supplied data
1280                                                                    (in userspace) */
1281                                    size_t count,        /* amount of bytes to write */
1282                                    loff_t * ppos        /* pointer to position in file that we start writing at. Should be updated to
1283                                                          * new current position before returning. */
1284                                    )
1285 {
1286         size_t already_written = 0;     // Number of bytes already written to the file.
1287         loff_t pos;             // Current position in the file.
1288         ssize_t res;            // return value of various functions that we call.
1289         int err = 0;
1290         struct inode *inode = file->f_dentry->d_inode;  // Inode of the file that we are writing to.
1291         /* To simplify coding at this time, we store
1292            locked pages in array for now */
1293         struct page *prepared_pages[REISERFS_WRITE_PAGES_AT_A_TIME];
1294         struct reiserfs_transaction_handle th;
1295         th.t_trans_id = 0;
1296
1297         /* If a filesystem is converted from 3.5 to 3.6, we'll have v3.5 items
1298         * lying around (most of the disk, in fact). Despite the filesystem
1299         * now being a v3.6 format, the old items still can't support large
1300         * file sizes. Catch this case here, as the rest of the VFS layer is
1301         * oblivious to the different limitations between old and new items.
1302         * reiserfs_setattr catches this for truncates. This chunk is lifted
1303         * from generic_write_checks. */
1304         if (get_inode_item_key_version (inode) == KEY_FORMAT_3_5 &&
1305             *ppos + count > MAX_NON_LFS) {
1306                 if (*ppos >= MAX_NON_LFS) {
1307                         send_sig(SIGXFSZ, current, 0);
1308                         return -EFBIG;
1309                 }
1310                 if (count > MAX_NON_LFS - (unsigned long)*ppos)
1311                         count = MAX_NON_LFS - (unsigned long)*ppos;
1312         }
1313
1314         if (file->f_flags & O_DIRECT) { // Direct IO needs treatment
1315                 ssize_t result, after_file_end = 0;
1316                 if ((*ppos + count >= inode->i_size)
1317                     || (file->f_flags & O_APPEND)) {
1318                         /* If we are appending a file, we need to put this savelink in here.
1319                            If we will crash while doing direct io, finish_unfinished will
1320                            cut the garbage from the file end. */
1321                         reiserfs_write_lock(inode->i_sb);
1322                         err =
1323                             journal_begin(&th, inode->i_sb,
1324                                           JOURNAL_PER_BALANCE_CNT);
1325                         if (err) {
1326                                 reiserfs_write_unlock(inode->i_sb);
1327                                 return err;
1328                         }
1329                         reiserfs_update_inode_transaction(inode);
1330                         add_save_link(&th, inode, 1 /* Truncate */ );
1331                         after_file_end = 1;
1332                         err =
1333                             journal_end(&th, inode->i_sb,
1334                                         JOURNAL_PER_BALANCE_CNT);
1335                         reiserfs_write_unlock(inode->i_sb);
1336                         if (err)
1337                                 return err;
1338                 }
1339                 result = do_sync_write(file, buf, count, ppos);
1340
1341                 if (after_file_end) {   /* Now update i_size and remove the savelink */
1342                         struct reiserfs_transaction_handle th;
1343                         reiserfs_write_lock(inode->i_sb);
1344                         err = journal_begin(&th, inode->i_sb, 1);
1345                         if (err) {
1346                                 reiserfs_write_unlock(inode->i_sb);
1347                                 return err;
1348                         }
1349                         reiserfs_update_inode_transaction(inode);
1350                         mark_inode_dirty(inode);
1351                         err = journal_end(&th, inode->i_sb, 1);
1352                         if (err) {
1353                                 reiserfs_write_unlock(inode->i_sb);
1354                                 return err;
1355                         }
1356                         err = remove_save_link(inode, 1 /* truncate */ );
1357                         reiserfs_write_unlock(inode->i_sb);
1358                         if (err)
1359                                 return err;
1360                 }
1361
1362                 return result;
1363         }
1364
1365         if (unlikely((ssize_t) count < 0))
1366                 return -EINVAL;
1367
1368         if (unlikely(!access_ok(VERIFY_READ, buf, count)))
1369                 return -EFAULT;
1370
1371         mutex_lock(&inode->i_mutex);    // locks the entire file for just us
1372
1373         pos = *ppos;
1374
1375         /* Check if we can write to specified region of file, file
1376            is not overly big and this kind of stuff. Adjust pos and
1377            count, if needed */
1378         res = generic_write_checks(file, &pos, &count, 0);
1379         if (res)
1380                 goto out;
1381
1382         if (count == 0)
1383                 goto out;
1384
1385         res = remove_suid(file->f_dentry);
1386         if (res)
1387                 goto out;
1388
1389         file_update_time(file);
1390
1391         // Ok, we are done with all the checks.
1392
1393         // Now we should start real work
1394
1395         /* If we are going to write past the file's packed tail or if we are going
1396            to overwrite part of the tail, we need that tail to be converted into
1397            unformatted node */
1398         res = reiserfs_check_for_tail_and_convert(inode, pos, count);
1399         if (res)
1400                 goto out;
1401
1402         while (count > 0) {
1403                 /* This is the main loop in which we running until some error occures
1404                    or until we write all of the data. */
1405                 size_t num_pages;       /* amount of pages we are going to write this iteration */
1406                 size_t write_bytes;     /* amount of bytes to write during this iteration */
1407                 size_t blocks_to_allocate;      /* how much blocks we need to allocate for this iteration */
1408
1409                 /*  (pos & (PAGE_CACHE_SIZE-1)) is an idiom for offset into a page of pos */
1410                 num_pages = !!((pos + count) & (PAGE_CACHE_SIZE - 1)) + /* round up partial
1411                                                                            pages */
1412                     ((count +
1413                       (pos & (PAGE_CACHE_SIZE - 1))) >> PAGE_CACHE_SHIFT);
1414                 /* convert size to amount of
1415                    pages */
1416                 reiserfs_write_lock(inode->i_sb);
1417                 if (num_pages > REISERFS_WRITE_PAGES_AT_A_TIME
1418                     || num_pages > reiserfs_can_fit_pages(inode->i_sb)) {
1419                         /* If we were asked to write more data than we want to or if there
1420                            is not that much space, then we shorten amount of data to write
1421                            for this iteration. */
1422                         num_pages =
1423                             min_t(size_t, REISERFS_WRITE_PAGES_AT_A_TIME,
1424                                   reiserfs_can_fit_pages(inode->i_sb));
1425                         /* Also we should not forget to set size in bytes accordingly */
1426                         write_bytes = (num_pages << PAGE_CACHE_SHIFT) -
1427                             (pos & (PAGE_CACHE_SIZE - 1));
1428                         /* If position is not on the
1429                            start of the page, we need
1430                            to substract the offset
1431                            within page */
1432                 } else
1433                         write_bytes = count;
1434
1435                 /* reserve the blocks to be allocated later, so that later on
1436                    we still have the space to write the blocks to */
1437                 reiserfs_claim_blocks_to_be_allocated(inode->i_sb,
1438                                                       num_pages <<
1439                                                       (PAGE_CACHE_SHIFT -
1440                                                        inode->i_blkbits));
1441                 reiserfs_write_unlock(inode->i_sb);
1442
1443                 if (!num_pages) {       /* If we do not have enough space even for a single page... */
1444                         if (pos >
1445                             inode->i_size + inode->i_sb->s_blocksize -
1446                             (pos & (inode->i_sb->s_blocksize - 1))) {
1447                                 res = -ENOSPC;
1448                                 break;  // In case we are writing past the end of the last file block, break.
1449                         }
1450                         // Otherwise we are possibly overwriting the file, so
1451                         // let's set write size to be equal or less than blocksize.
1452                         // This way we get it correctly for file holes.
1453                         // But overwriting files on absolutelly full volumes would not
1454                         // be very efficient. Well, people are not supposed to fill
1455                         // 100% of disk space anyway.
1456                         write_bytes =
1457                             min_t(size_t, count,
1458                                   inode->i_sb->s_blocksize -
1459                                   (pos & (inode->i_sb->s_blocksize - 1)));
1460                         num_pages = 1;
1461                         // No blocks were claimed before, so do it now.
1462                         reiserfs_claim_blocks_to_be_allocated(inode->i_sb,
1463                                                               1 <<
1464                                                               (PAGE_CACHE_SHIFT
1465                                                                -
1466                                                                inode->
1467                                                                i_blkbits));
1468                 }
1469
1470                 /* Prepare for writing into the region, read in all the
1471                    partially overwritten pages, if needed. And lock the pages,
1472                    so that nobody else can access these until we are done.
1473                    We get number of actual blocks needed as a result. */
1474                 res = reiserfs_prepare_file_region_for_write(inode, pos,
1475                                                              num_pages,
1476                                                              write_bytes,
1477                                                              prepared_pages);
1478                 if (res < 0) {
1479                         reiserfs_release_claimed_blocks(inode->i_sb,
1480                                                         num_pages <<
1481                                                         (PAGE_CACHE_SHIFT -
1482                                                          inode->i_blkbits));
1483                         break;
1484                 }
1485
1486                 blocks_to_allocate = res;
1487
1488                 /* First we correct our estimate of how many blocks we need */
1489                 reiserfs_release_claimed_blocks(inode->i_sb,
1490                                                 (num_pages <<
1491                                                  (PAGE_CACHE_SHIFT -
1492                                                   inode->i_sb->
1493                                                   s_blocksize_bits)) -
1494                                                 blocks_to_allocate);
1495
1496                 if (blocks_to_allocate > 0) {   /*We only allocate blocks if we need to */
1497                         /* Fill in all the possible holes and append the file if needed */
1498                         res =
1499                             reiserfs_allocate_blocks_for_region(&th, inode, pos,
1500                                                                 num_pages,
1501                                                                 write_bytes,
1502                                                                 prepared_pages,
1503                                                                 blocks_to_allocate);
1504                 }
1505
1506                 /* well, we have allocated the blocks, so it is time to free
1507                    the reservation we made earlier. */
1508                 reiserfs_release_claimed_blocks(inode->i_sb,
1509                                                 blocks_to_allocate);
1510                 if (res) {
1511                         reiserfs_unprepare_pages(prepared_pages, num_pages);
1512                         break;
1513                 }
1514
1515 /* NOTE that allocating blocks and filling blocks can be done in reverse order
1516    and probably we would do that just to get rid of garbage in files after a
1517    crash */
1518
1519                 /* Copy data from user-supplied buffer to file's pages */
1520                 res =
1521                     reiserfs_copy_from_user_to_file_region(pos, num_pages,
1522                                                            write_bytes,
1523                                                            prepared_pages, buf);
1524                 if (res) {
1525                         reiserfs_unprepare_pages(prepared_pages, num_pages);
1526                         break;
1527                 }
1528
1529                 /* Send the pages to disk and unlock them. */
1530                 res =
1531                     reiserfs_submit_file_region_for_write(&th, inode, pos,
1532                                                           num_pages,
1533                                                           write_bytes,
1534                                                           prepared_pages);
1535                 if (res)
1536                         break;
1537
1538                 already_written += write_bytes;
1539                 buf += write_bytes;
1540                 *ppos = pos += write_bytes;
1541                 count -= write_bytes;
1542                 balance_dirty_pages_ratelimited_nr(inode->i_mapping, num_pages);
1543         }
1544
1545         /* this is only true on error */
1546         if (th.t_trans_id) {
1547                 reiserfs_write_lock(inode->i_sb);
1548                 err = journal_end(&th, th.t_super, th.t_blocks_allocated);
1549                 reiserfs_write_unlock(inode->i_sb);
1550                 if (err) {
1551                         res = err;
1552                         goto out;
1553                 }
1554         }
1555
1556         if (likely(res >= 0) &&
1557             (unlikely((file->f_flags & O_SYNC) || IS_SYNC(inode))))
1558                 res = generic_osync_inode(inode, file->f_mapping,
1559                                           OSYNC_METADATA | OSYNC_DATA);
1560
1561         mutex_unlock(&inode->i_mutex);
1562         reiserfs_async_progress_wait(inode->i_sb);
1563         return (already_written != 0) ? already_written : res;
1564
1565       out:
1566         mutex_unlock(&inode->i_mutex);  // unlock the file on exit.
1567         return res;
1568 }
1569
1570 const struct file_operations reiserfs_file_operations = {
1571         .read = do_sync_read,
1572         .write = reiserfs_file_write,
1573         .ioctl = reiserfs_ioctl,
1574 #ifdef CONFIG_COMPAT
1575         .compat_ioctl = reiserfs_compat_ioctl,
1576 #endif
1577         .mmap = generic_file_mmap,
1578         .open = generic_file_open,
1579         .release = reiserfs_file_release,
1580         .fsync = reiserfs_sync_file,
1581         .sendfile = generic_file_sendfile,
1582         .aio_read = generic_file_aio_read,
1583         .aio_write = generic_file_aio_write,
1584         .splice_read = generic_file_splice_read,
1585         .splice_write = generic_file_splice_write,
1586 };
1587
1588 struct inode_operations reiserfs_file_inode_operations = {
1589         .truncate = reiserfs_vfs_truncate_file,
1590         .setattr = reiserfs_setattr,
1591         .setxattr = reiserfs_setxattr,
1592         .getxattr = reiserfs_getxattr,
1593         .listxattr = reiserfs_listxattr,
1594         .removexattr = reiserfs_removexattr,
1595         .permission = reiserfs_permission,
1596 };