| blob | f3d1c4a77979d1506903c88df9c8cdc76c388a09 |
1 /*
2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
3 */
5 #include <linux/time.h>
6 #include <linux/fs.h>
7 #include <linux/reiserfs_fs.h>
8 #include <linux/reiserfs_acl.h>
9 #include <linux/reiserfs_xattr.h>
10 #include <linux/smp_lock.h>
11 #include <linux/pagemap.h>
12 #include <linux/highmem.h>
13 #include <asm/uaccess.h>
14 #include <asm/unaligned.h>
15 #include <linux/buffer_head.h>
16 #include <linux/mpage.h>
17 #include <linux/writeback.h>
18 #include <linux/quotaops.h>
26 {
27 /* We need blocks for transaction + (user+group) quota update (possibly delete) */
38 /* The = 0 happens when we abort creating a new inode for some reason like lack of space.. */
39 if (!(inode->i_state & I_NEW) && INODE_PKEY(inode)->k_objectid != 0) { /* also handles bad_inode case */
48 /* Do quota update inside a transaction for journaled quotas. We must do that
49 * after delete_object so that quota updates go into the same transaction as
50 * stat data deletion */
57 /* check return value from reiserfs_delete_object after
58 * ending the transaction
59 */
63 /* all items of file are deleted, so we can remove "save" link */
65 * about an error here */
67 /* no object items are in the tree */
68 ;
69 }
70 out:
74 }
78 {
86 }
88 /* take base of inode_key (it comes from inode always) (dirid, objectid) and version from an inode, set
89 offset and type of key */
92 {
96 length);
97 }
99 //
100 // when key is 0, do not set version and short key
101 //
106 {
111 }
116 /* set_ih_free_space (ih, 0); */
117 // for directory items it is entry count, for directs and stat
118 // datas - 0xffff, for indirects - 0
120 }
122 //
123 // FIXME: we might cache recently accessed indirect item
125 // Ugh. Not too eager for that....
126 // I cut the code until such time as I see a convincing argument (benchmark).
127 // I don't want a bloated inode struct..., and I don't like code complexity....
129 /* cutting the code is fine, since it really isn't in use yet and is easy
130 ** to add back in. But, Vladimir has a really good idea here. Think
131 ** about what happens for reading a file. For each page,
132 ** The VFS layer calls reiserfs_readpage, who searches the tree to find
133 ** an indirect item. This indirect item has X number of pointers, where
134 ** X is a big number if we've done the block allocation right. But,
135 ** we only use one or two of these pointers during each call to readpage,
136 ** needlessly researching again later on.
137 **
138 ** The size of the cache could be dynamic based on the size of the file.
139 **
140 ** I'd also like to see us cache the location the stat data item, since
141 ** we are needlessly researching for that frequently.
142 **
143 ** --chris
144 */
146 /* If this page has a file tail in it, and
147 ** it was read in by get_block_create_0, the page data is valid,
148 ** but tail is still sitting in a direct item, and we can't write to
149 ** it. So, look through this page, and check all the mapped buffers
150 ** to make sure they have valid block numbers. Any that don't need
151 ** to be unmapped, so that block_prepare_write will correctly call
152 ** reiserfs_get_block to convert the tail into an unformatted node
153 */
155 {
165 }
168 }
169 }
171 /* reiserfs_get_block does not need to allocate a block only if it has been
172 done already or non-hole position has been found in the indirect item */
176 {
183 }
186 {
188 }
192 {
194 }
196 //
197 // files which were created in the earlier version can not be longer,
198 // than 2 gb
199 //
201 {
207 }
211 {
221 /* we cannot restart while nested */
224 }
231 }
233 }
235 // it is called by get_block when create == 0. Returns block number
236 // for 'block'-th logical block of file. When it hits direct item it
237 // returns 0 (being called from bmap) or read direct item into piece
238 // of page (bh_result)
240 // Please improve the english/clarity in the comment above, as it is
241 // hard to understand.
245 {
259 // prepare the key to look for the 'block'-th block of file
264 research:
272 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
273 // That there is some MMAPED data associated with it that is yet to be written to disk.
277 }
279 }
280 //
286 /* FIXME: here we could cache indirect item or part of it in
287 the inode to avoid search_by_key in case of subsequent
288 access to file */
296 }
298 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
299 // That there is some MMAPED data associated with it that is yet to be written to disk.
303 }
309 }
310 // requested data are in direct item(s)
312 // we are called by bmap. FIXME: we can not map block of file
313 // when it is stored in direct item(s)
318 }
320 /* if we've got a direct item, and the buffer or page was uptodate,
321 ** we don't want to pull data off disk again. skip to the
322 ** end, where we map the buffer and return
323 */
327 /*
328 ** grab_tail_page can trigger calls to reiserfs_get_block on up to date
329 ** pages without any buffers. If the page is up to date, we don't want
330 ** read old data off disk. Set the up to date bit on the buffer instead
331 ** and jump to the end
332 */
336 }
337 // read file tail into part of page
342 /* we only want to kmap if we are reading the tail into the page.
343 ** this is not the common case, so we don't kmap until we are
344 ** sure we need to. But, this means the item might move if
345 ** kmap schedules
346 */
352 }
353 }
359 }
360 /* make sure we don't read more bytes than actually exist in
361 ** the file. This can happen in odd cases where i_size isn't
362 ** correct, and when direct item padding results in a few
363 ** extra bytes at the end of the direct item
364 */
368 chars =
374 }
383 // we done, if read direct item is not the last item of
384 // node FIXME: we could try to check right delimiting key
385 // to see whether direct item continues in the right
386 // neighbor or rely on i_size
389 // update key to look for the next piece
393 // i/o error most likely
402 finished:
408 /* this buffer has valid data, but isn't valid for io. mapping it to
409 * block #0 tells the rest of reiserfs it just has a tail in it
410 */
414 }
416 // this is called to create file map. So, _get_block_create_0 will not
417 // read direct item
420 {
425 /* do not read the direct item */
429 }
431 /* special version of get_block that is only used by grab_tail_page right
432 ** now. It is sent to block_prepare_write, and when you try to get a
433 ** block past the end of the file (or a block from a hole) it returns
434 ** -ENOENT instead of a valid buffer. block_prepare_write expects to
435 ** be able to do i/o on the buffers returned, unless an error value
436 ** is also returned.
437 **
438 ** So, this allows block_prepare_write to be used for reading a single block
439 ** in a page. Where it does not produce a valid page for holes, or past the
440 ** end of the file. This turns out to be exactly what we need for reading
441 ** tails for conversion.
442 **
443 ** The point of the wrapper is forcing a certain value for create, even
444 ** though the VFS layer is calling this function with create==1. If you
445 ** don't want to send create == GET_BLOCK_NO_HOLE to reiserfs_get_block,
446 ** don't use this function.
447 */
451 {
453 }
455 /* This is special helper for reiserfs_get_block in case we are executing
456 direct_IO request. */
458 sector_t iblock,
461 {
466 /* We set the b_size before reiserfs_get_block call since it is
467 referenced in convert_tail_for_hole() that may be called from
468 reiserfs_get_block() */
476 /* don't allow direct io onto tail pages */
478 /* make sure future calls to the direct io funcs for this offset
479 ** in the file fail by unmapping the buffer
480 */
483 }
484 /* Possible unpacked tail. Flush the data before pages have
485 disappeared */
494 }
495 out:
497 }
499 /*
500 ** helper function for when reiserfs_get_block is called for a hole
501 ** but the file tail is still in a direct item
502 ** bh_result is the buffer head for the hole
503 ** tail_offset is the offset of the start of the tail in the file
504 **
505 ** This calls prepare_write, which will start a new transaction
506 ** you should not be in a transaction, or have any paths held when you
507 ** call this.
508 */
511 loff_t tail_offset)
512 {
523 /* always try to read until the end of the block */
528 /* hole_page can be zero in case of direct_io, we are sure
529 that we cannot get here if we write with O_DIRECT into
530 tail page */
536 }
539 }
541 /* we don't have to make sure the conversion did not happen while
542 ** we were locking the page because anyone that could convert
543 ** must first take i_mutex.
544 **
545 ** We must fix the tail page for writing because it might have buffers
546 ** that are mapped, but have a block number of 0. This indicates tail
547 ** data that has been read directly into the page, and block_prepare_write
548 ** won't trigger a get_block in this case.
549 */
555 /* tail conversion might change the data in the page */
560 unlock:
564 }
565 out:
567 }
574 {
577 #ifdef REISERFS_PREALLOCATE
581 }
582 #endif
584 block);
585 }
589 {
601 /* space reserved in transaction batch:
602 . 3 balancings in direct->indirect conversion
603 . 1 block involved into reiserfs_update_sd()
604 XXX in practically impossible worst case direct2indirect()
605 can incur (much) more than 3 balancings.
606 quota update for user, group */
612 loff_t new_offset =
615 /* bad.... */
622 }
624 /* if !create, we aren't changing the FS, so we don't need to
625 ** log anything, so we don't need to start a transaction
626 */
629 /* find number of block-th logical block of the file */
634 }
635 /*
636 * if we're already in a transaction, make sure to close
637 * any new transactions we start in this func
638 */
643 /* If file is of such a size, that it might have a tail and tails are enabled
644 ** we should mark it as possibly needing tail packing on close
645 */
652 /* set the key of the first byte in the 'block'-th block of file */
655 start_trans:
660 }
662 }
663 research:
669 }
681 /* we have to allocate block for the unformatted node */
685 }
687 repeat =
692 /* restart the transaction to give the journal a chance to free
693 ** some blocks. releases the path, so we have to go back to
694 ** research if we succeed on the second try
695 */
700 repeat =
706 }
709 else
712 }
717 }
718 }
721 b_blocknr_t unfm_ptr;
722 /* 'block'-th block is in the file already (there is
723 corresponding cell in some indirect item). But it may be
724 zero unformatted node pointer (hole) */
727 /* use allocated block to plug the hole */
732 bh);
734 }
743 }
752 /* the item was found, so new blocks were not added to the file
753 ** there is no need to make sure the inode is updated with this
754 ** transaction
755 */
757 }
762 }
764 /* desired position is not found or is in the direct item. We have
765 to append file with holes up to 'block'-th block converting
766 direct items to indirect one if necessary */
773 /* indirect item has to be inserted */
779 /* we are going to add 'block'-th block to the file. Use
780 allocated block for that */
786 }
791 retval =
798 }
799 //mark_tail_converted (inode);
801 /* direct item has to be converted */
802 loff_t tail_offset;
804 tail_offset =
808 /* direct item we just found fits into block we have
809 to map. Convert it into unformatted node: use
810 bh_result for the conversion */
816 /* we have to padd file tail stored in direct item(s)
817 up to block size and convert it to unformatted
818 node. FIXME: this should also get into page cache */
821 /*
822 * ugly, but we can only end the transaction if
823 * we aren't nested
824 */
827 retval =
828 reiserfs_end_persistent_transaction
833 }
835 retval =
837 tail_offset);
843 retval);
845 /* the bitmap, the super, and the stat data == 3 */
850 inode,
851 allocated_block_nr,
853 }
855 }
857 }
858 retval =
860 tail_offset);
866 }
867 /* it is important the set_buffer_uptodate is done after
868 ** the direct2indirect. The buffer might contain valid
869 ** data newer than the data on disk (read by readpage, changed,
870 ** and then sent here by writepage). direct2indirect needs
871 ** to know if unbh was already up to date, so it can decide
872 ** if the data in unbh needs to be replaced with data from
873 ** the disk
874 */
877 /* unbh->b_page == NULL in case of DIRECT_IO request, this means
878 buffer will disappear shortly, so it should not be added to
879 */
881 /* we've converted the tail, so we must
882 ** flush unbh before the transaction commits
883 */
886 /* mark it dirty now to prevent commit_write from adding
887 ** this buffer to the inode's dirty buffer list
888 */
889 /*
890 * AKPM: changed __mark_buffer_dirty to mark_buffer_dirty().
891 * It's still atomic, but it sets the page dirty too,
892 * which makes it eligible for writeback at any time by the
893 * VM (which was also the case with __mark_buffer_dirty())
894 */
896 }
898 /* append indirect item with holes if needed, when appending
899 pointer to 'block'-th block use block, which is already
900 allocated */
903 // one block which is a fastpath
905 __u64 max_to_insert =
907 UNFM_P_SIZE;
908 __u64 blocks_needed;
912 /* indirect item has to be appended, set up key of that position */
918 //pos_in_item * inode->i_sb->s_blocksize,
923 blocks_needed =
927 s_blocksize_bits);
932 un = kzalloc(min(blocks_needed, max_to_insert) * UNFM_P_SIZE, GFP_ATOMIC); // We need to avoid scheduling.
937 }
938 }
940 /* we are going to add target block to the file. Use allocated
941 block for that */
949 /* paste hole to the indirect item */
950 /* If kmalloc failed, max_to_insert becomes zero and it means we
951 only have space for one block */
952 blocks_needed =
954 }
955 retval =
958 UNFM_P_SIZE *
959 blocks_needed);
968 }
970 /* We need to mark new file size in case this function will be
971 interrupted/aborted later on. And we may do this only for
972 holes. */
975 }
976 }
981 /* this loop could log more blocks than we had originally asked
982 ** for. So, we have to allow the transaction to end if it is
983 ** too big or too full. Update the inode so things are
984 ** consistent if we crash before the function returns
985 **
986 ** release the path so that anybody waiting on the path before
987 ** ending their transaction will be able to continue.
988 */
993 }
994 /* inserting indirect pointers for a hole can take a
995 ** long time. reschedule if needed
996 */
1003 }
1006 "vs-825: reiserfs_get_block: "
1014 }
1023 failure:
1031 }
1036 }
1038 static int
1041 {
1043 }
1045 /* Compute real number of used bytes by file
1046 * Following three functions can go away when we'll have enough space in stat item
1047 */
1049 {
1056 /* End of file is also in full block with indirect reference, so round
1057 ** up to the next block.
1058 **
1059 ** there is just no way to know if the tail is actually packed
1060 ** on the file, so we have to assume it isn't. When we pack the
1061 ** tail, we add 4 bytes to pretend there really is an unformatted
1062 ** node pointer
1063 */
1064 bytes =
1067 sd_size;
1069 }
1073 {
1077 }
1080 }
1082 /* Compute number of blocks used by file in ReiserFS counting */
1084 {
1088 /* keeps fsck and non-quota versions of reiserfs happy */
1091 }
1093 /* files from before the quota patch might i_blocks such that
1094 ** bytes < real_space. Deal with that here to prevent it from
1095 ** going negative.
1096 */
1100 }
1102 //
1103 // BAD: new directories have stat data of new type and all other items
1104 // of old type. Version stored in the inode says about body items, so
1105 // in update_stat_data we can not rely on inode, but have to check
1106 // item version directly
1107 //
1109 // called by read_locked_inode
1111 {
1114 __u32 rdev;
1115 //int version = ITEM_VERSION_1;
1156 // there was a bug in <=3.5.23 when i_blocks could take negative
1157 // values. Starting from 3.5.17 this value could even be stored in
1158 // stat data. For such files we set i_blocks based on file
1159 // size. Just 2 notes: this can be wrong for sparce files. On-disk value will be
1160 // only updated if file's inode will ever change
1162 }
1167 /* an early bug in the quota code can give us an odd number for the
1168 ** block count. This is incorrect, fix it here.
1169 */
1172 }
1175 SD_V1_SIZE));
1176 /* nopack is initially zero for v1 objects. For v2 objects,
1177 nopack is initialised from sd_attrs */
1180 // new stat data found, but object may have old items
1181 // (directories and symlinks)
1200 else
1205 else
1211 SD_V2_SIZE));
1212 /* read persistent inode attributes from sd and initalise
1213 generic inode flags from them */
1216 }
1233 }
1234 }
1236 // update new stat data with inode fields
1238 {
1240 __u16 flags;
1253 else
1258 }
1260 // used to copy inode's fields to old stat data
1262 {
1276 else
1279 // Sigh. i_first_direct_byte is back
1282 }
1284 /* NOTE, you must prepare the buffer head before sending it here,
1285 ** and then log it after the call
1286 */
1288 loff_t size)
1289 {
1302 // path points to old stat data
1306 }
1309 }
1313 {
1327 /* look for the object's stat data */
1331 "vs-13050: reiserfs_update_sd: "
1335 }
1340 /*reiserfs_warning (inode->i_sb, "vs-13050: reiserfs_update_sd: i_nlink == 0, stat data not found"); */
1342 }
1344 "vs-13060: reiserfs_update_sd: "
1347 pos);
1350 }
1352 /* sigh, prepare_for_journal might schedule. When it schedules the
1353 ** FS might change. We have to detect that, and loop back to the
1354 ** search if the stat data item has moved
1355 */
1365 }
1367 }
1372 }
1374 /* reiserfs_read_locked_inode is called to read the inode off disk, and it
1375 ** does a make_bad_inode when things go wrong. But, we need to make sure
1376 ** and clear the key in the private portion of the inode, otherwise a
1377 ** corresponding iput might try to delete whatever object the inode last
1378 ** represented.
1379 */
1381 {
1384 }
1386 //
1387 // initially this function was derived from minix or ext2's analog and
1388 // evolved as the prototype did
1389 //
1392 {
1397 }
1399 /* looks for stat data in the tree, and fills up the fields of in-core
1400 inode stat data fields */
1403 {
1411 /* set version 1, version 2 could be used too, because stat data
1412 key is the same in both versions */
1419 /* look for the object's stat data */
1423 "vs-13070: reiserfs_read_locked_inode: "
1428 }
1430 /* a stale NFS handle can trigger this without it being an error */
1435 }
1439 /* It is possible that knfsd is trying to access inode of a file
1440 that is being removed from the disk by some other thread. As we
1441 update sd on unlink all that is required is to check for nlink
1442 here. This bug was first found by Sizif when debugging
1443 SquidNG/Butterfly, forgotten, and found again after Philippe
1444 Gramoulle <philippe.gramoulle@mmania.com> reproduced it.
1446 More logical fix would require changes in fs/inode.c:iput() to
1447 remove inode from hash-table _after_ fs cleaned disk stuff up and
1448 in iget() to return NULL if I_FREEING inode is found in
1449 hash-table. */
1450 /* Currently there is one place where it's ok to meet inode with
1451 nlink==0: processing of open-unlinked and half-truncated files
1452 during mount (fs/reiserfs/super.c:finish_unfinished()). */
1456 "vs-13075: reiserfs_read_locked_inode: "
1457 "dead inode read from disk %K. "
1461 }
1465 }
1467 /**
1468 * reiserfs_find_actor() - "find actor" reiserfs supplies to iget5_locked().
1469 *
1470 * @inode: inode from hash table to check
1471 * @opaque: "cookie" passed to iget5_locked(). This is &reiserfs_iget_args.
1472 *
1473 * This function is called by iget5_locked() to distinguish reiserfs inodes
1474 * having the same inode numbers. Such inodes can only exist due to some
1475 * error condition. One of them should be bad. Inodes with identical
1476 * inode numbers (objectids) are distinguished by parent directory ids.
1477 *
1478 */
1480 {
1484 /* args is already in CPU order */
1487 }
1490 {
1505 }
1508 /* either due to i/o error or a stale NFS handle */
1511 }
1513 }
1516 {
1530 }
1540 }
1542 }
1549 {
1552 /* fhtype happens to reflect the number of u32s encoded.
1553 * due to a bug in earlier code, fhtype might indicate there
1554 * are more u32s then actually fitted.
1555 * so if fhtype seems to be more than len, reduce fhtype.
1556 * Valid types are:
1557 * 2 - objectid + dir_id - legacy support
1558 * 3 - objectid + dir_id + generation
1559 * 4 - objectid + dir_id + objectid and dirid of parent - legacy
1560 * 5 - objectid + dir_id + generation + objectid and dirid of parent
1561 * 6 - as above plus generation of directory
1562 * 6 does not fit in NFSv2 handles
1563 */
1570 }
1576 else
1584 else
1586 }
1590 }
1594 {
1605 /* no room for directory info? return what we've stored so far */
1617 }
1620 }
1622 /* looks for stat data, then copies fields to it, marks the buffer
1623 containing stat data as dirty */
1624 /* reiserfs inodes are never really dirty, since the dirty inode call
1625 ** always logs them. This call allows the VFS inode marking routines
1626 ** to properly mark inodes for datasync and such, but only actually
1627 ** does something when called for a synchronous update.
1628 */
1630 {
1636 /* memory pressure can sometimes initiate write_inode calls with sync == 1,
1637 ** these cases are just when the system needs ram, not when the
1638 ** inode needs to reach disk for safety, and they can safely be
1639 ** ignored because the altered inode has already been logged.
1640 */
1646 }
1648 }
1650 }
1652 /* stat data of new object is inserted already, this inserts the item
1653 containing "." and ".." entries */
1658 {
1671 /* compose item head for new item. Directories consist of items of
1672 old type (ITEM_VERSION_1). Do not set key (second arg is 0), it
1673 is done by reiserfs_new_inode */
1690 }
1692 /* look for place in the tree for new item */
1698 }
1705 }
1707 /* insert item, that is empty directory item */
1709 }
1711 /* stat data of object has been inserted, this inserts the item
1712 containing the body of symlink */
1713 static int reiserfs_new_symlink(struct reiserfs_transaction_handle *th, struct inode *inode, /* Inode of symlink */
1717 {
1732 /* look for place in the tree for new item */
1738 }
1745 }
1747 /* insert item, that is body of symlink */
1749 }
1751 /* inserts the stat data into the tree, and then calls
1752 reiserfs_new_directory (to insert ".", ".." item if new object is
1753 directory) or reiserfs_new_symlink (to insert symlink body if new
1754 object is symlink) or nothing (if new object is regular file)
1756 NOTE! uid and gid must already be set in the inode. If we return
1757 non-zero due to an error, we have to drop the quota previously allocated
1758 for the fresh inode. This can only be done outside a transaction, so
1759 if we return non-zero, we also end the transaction. */
1762 /* 0 for regular, EMTRY_DIR_SIZE for dirs,
1763 strlen (symname) for symlinks) */
1766 {
1780 }
1784 }
1788 /* item head of new item */
1794 }
1796 /* not a perfect generation count, as object ids can be reused, but
1797 ** this is as good as reiserfs can do right now.
1798 ** note that the private part of inode isn't filled in yet, we have
1799 ** to use the directory.
1800 */
1802 else
1803 #if defined( USE_INODE_GENERATION_COUNTER )
1806 #else
1808 #endif
1810 /* fill stat data */
1813 /* uid and gid must already be set by the caller for quota init */
1815 /* symlink cannot be immutable or append only, right? */
1842 else
1846 /* key to search for correct place for new stat data */
1851 /* find proper place for inserting of stat data */
1856 }
1861 }
1865 /* i_uid or i_gid is too big to be stored in stat data v3.5 */
1868 }
1872 }
1873 // these do not go to on-disk stat data
1876 // store in in-core inode the key of stat data and version all
1877 // object items will have (directory items will have old offset
1878 // format, other new objects will consist of new items)
1882 else
1886 else
1889 /* insert the stat data into the tree */
1890 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1893 #endif
1894 retval =
1901 }
1902 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1905 #endif
1907 /* insert item with "." and ".." */
1908 retval =
1910 }
1913 /* insert body of symlink */
1916 retval =
1918 i_size);
1919 }
1925 }
1927 /* XXX CHECK THIS */
1935 }
1941 }
1949 /* it looks like you can easily compress these two goto targets into
1950 * one. Keeping it like this doesn't actually hurt anything, and they
1951 * are place holders for what the quota code actually needs.
1952 */
1953 out_bad_inode:
1954 /* Invalidate the object, nothing was inserted yet */
1957 /* Quota change must be inside a transaction for journaling */
1960 out_end_trans:
1962 /* Drop can be outside and it needs more credits so it's better to have it outside */
1967 out_inserted_sd:
1971 /* If we were inheriting an ACL, we need to release the lock so that
1972 * iput doesn't deadlock in reiserfs_delete_xattrs. The locking
1973 * code really needs to be reworked, but this will take care of it
1974 * for now. -jeffm */
1975 #ifdef CONFIG_REISERFS_FS_POSIX_ACL
1981 #endif
1984 }
1986 /*
1987 ** finds the tail page in the page cache,
1988 ** reads the last block in.
1989 **
1990 ** On success, page_result is set to a locked, pinned page, and bh_result
1991 ** is set to an up to date buffer for the last block in the file. returns 0.
1992 **
1993 ** tail conversion is not done, so bh_result might not be valid for writing
1994 ** check buffer_mapped(bh_result) and bh_result->b_blocknr != 0 before
1995 ** trying to write the block.
1996 **
1997 ** on failure, nonzero is returned, page_result and bh_result are untouched.
1998 */
2002 {
2004 /* we want the page with the last byte in the file,
2005 ** not the page that will hold the next byte for appending
2006 */
2017 /* we know that we are only called with inode->i_size > 0.
2018 ** we also know that a file tail can never be as big as a block
2019 ** If i_size % blocksize == 0, our file is currently block aligned
2020 ** and it won't need converting or zeroing after a truncate.
2021 */
2024 }
2029 }
2030 /* start within the page of the last block in the file */
2034 reiserfs_get_block_create_0);
2043 }
2049 /* note, this should never happen, prepare_write should
2050 ** be taking care of this for us. If the buffer isn't up to date,
2051 ** I've screwed up the code to find the buffer, or the code to
2052 ** call prepare_write
2053 */
2060 }
2064 out:
2067 unlock:
2071 }
2073 /*
2074 ** vfs version of truncate file. Must NOT be called with
2075 ** a transaction already started.
2076 **
2077 ** some code taken from block_truncate_page
2078 */
2080 {
2082 /* we want the offset for the first byte after the end of the file */
2095 // -ENOENT means we truncated past the end of the file,
2096 // and get_block_create_0 could not find a block to read in,
2097 // which is ok.
2101 error);
2104 }
2105 }
2107 /* so, if page != NULL, we have a buffer head for the offset at
2108 ** the end of the file. if the bh is mapped, and bh->b_blocknr != 0,
2109 ** then we have an unformatted node. Otherwise, we have a direct item,
2110 ** and no zeroing is required on disk. We zero after the truncate,
2111 ** because the truncate might pack the item anyway
2112 ** (it will unmap bh if it packs).
2113 */
2114 /* it is enough to reserve space in transaction for 2 balancings:
2115 one for "save" link adding and another for the first
2116 cut_from_item. 1 is for update_sd */
2123 /* we are doing real truncate: if the system crashes before the last
2124 transaction of truncating gets committed - on reboot the file
2125 either appears truncated properly or not truncated at all */
2128 error =
2133 /* check reiserfs_do_truncate after ending the transaction */
2137 }
2143 }
2147 /* if we are not on a block boundary */
2158 }
2159 }
2162 }
2166 out:
2170 }
2173 }
2178 {
2196 /* catch places below that try to log something without starting a trans */
2201 }
2204 start_over:
2208 research:
2213 }
2220 /* we've found an unformatted node */
2225 bytes_copied);
2226 }
2228 /* crap, we are writing to a hole */
2231 }
2244 /* vs-3050 is gone, no need to drop the path */
2253 bh);
2255 }
2256 }
2264 }
2267 copy_size);
2273 /* are there still bytes left? */
2278 copy_size);
2280 }
2287 }
2290 out:
2297 }
2300 /* this is where we fill in holes in the file. */
2303 GET_BLOCK_CREATE | GET_BLOCK_NO_IMUX
2308 /* get_block failed to find a mapped unformatted node. */
2311 }
2312 }
2313 }
2317 /* we've copied data from the page into the direct item, so the
2318 * buffer in the page is now clean, mark it to reflect that.
2319 */
2323 }
2325 }
2327 /*
2328 * mason@suse.com: updated in 2.5.54 to follow the same general io
2329 * start/recovery path as __block_write_full_page, along with special
2330 * code to handle reiserfs tails.
2331 */
2334 {
2339 sector_t last_block;
2349 /* no logging allowed when nonblocking or from PF_MEMALLOC */
2354 }
2356 /* The page dirty bit is cleared before writepage is called, which
2357 * means we have to tell create_empty_buffers to make dirty buffers
2358 * The page really should be up to date at this point, so tossing
2359 * in the BH_Uptodate is just a sanity check.
2360 */
2364 }
2367 /* last page in the file, zero out any contents past the
2368 ** last byte in the file
2369 */
2375 /* no file contents in this page */
2379 }
2384 }
2388 /* first map all the buffers, logging any direct items we find */
2391 /*
2392 * This can happen when the block size is less than
2393 * the page size. The corresponding bytes in the page
2394 * were zero filled above
2395 */
2402 /* not mapped yet, or it points to a direct item, search
2403 * the btree for the mapping info, and log any direct
2404 * items found
2405 */
2408 }
2409 }
2411 block++;
2414 /*
2415 * we start the transaction after map_block_for_writepage,
2416 * because it can create holes in the file (an unbounded operation).
2417 * starting it here, we can make a reliable estimate for how many
2418 * blocks we're going to log
2419 */
2427 }
2429 }
2430 /* now go through and lock any dirty buffers on the page */
2442 }
2443 /* from this point on, we know the buffer is mapped to a
2444 * real block and not a direct item
2445 */
2452 }
2453 }
2458 }
2466 }
2471 /*
2472 * since any buffer might be the only dirty buffer on the page,
2473 * the first submit_bh can bring the page out of writeback.
2474 * be careful with the buffers.
2475 */
2480 nr++;
2481 }
2487 done:
2489 /*
2490 * if this page only had a direct item, it is very possible for
2491 * no io to be required without there being an error. Or,
2492 * someone else could have locked them and sent them down the
2493 * pipe without locking the page
2494 */
2500 }
2506 }
2509 fail:
2510 /* catches various errors, we need to make sure any valid dirty blocks
2511 * get to the media. The page is currently locked and not marked for
2512 * writeback
2513 */
2522 /*
2523 * clear any dirty bits that might have come from getting
2524 * attached to a dirty page
2525 */
2527 }
2539 nr++;
2540 }
2545 }
2548 {
2550 }
2553 {
2557 }
2561 {
2571 journal_info;
2576 }
2581 /* this gets a little ugly. If reiserfs_get_block returned an
2582 * error and left a transacstion running, we've got to close it,
2583 * and we've got to free handle if it was a persistent transaction.
2584 *
2585 * But, if we had nested into an existing transaction, we need
2586 * to just drop the ref count on the handle.
2587 *
2588 * If old_ref == 0, the transaction is from reiserfs_get_block,
2589 * and it was a persistent trans. Otherwise, it was nested above.
2590 */
2601 }
2602 }
2603 }
2606 }
2609 {
2611 }
2615 {
2625 }
2628 /* generic_commit_write does this for us, but does not update the
2629 ** transaction tracking stuff when the size changes. So, we have
2630 ** to do the i_size updates here.
2631 */
2635 /* If the file have grown beyond the border where it
2636 can have a tail, unmark it as needing a tail
2637 packing */
2648 }
2651 /*
2652 * this will just nest into our transaction. It's important
2653 * to use mark_inode_dirty so the inode gets pushed around on the
2654 * dirty lists, and so that O_SYNC works as expected
2655 */
2663 }
2672 }
2674 out:
2677 journal_error:
2684 }
2687 }
2690 {
2694 else
2698 else
2702 else
2706 else
2710 else
2712 }
2713 }
2716 {
2720 else
2724 else
2728 else
2732 else
2734 }
2735 }
2737 /* decide if this buffer needs to stay around for data logging or ordered
2738 ** write purposes
2739 */
2741 {
2749 }
2750 /* the page is locked, and the only places that log a data buffer
2751 * also lock the page.
2752 */
2754 /*
2755 * very conservative, leave the buffer pinned if
2756 * anyone might need it.
2757 */
2760 }
2765 /* why is this safe?
2766 * reiserfs_setattr updates i_size in the on disk
2767 * stat data before allowing vmtruncate to be called.
2768 *
2769 * If buffer was put onto the ordered list for this
2770 * transaction, we know for sure either this transaction
2771 * or an older one already has updated i_size on disk,
2772 * and this ordered data won't be referenced in the file
2773 * if we crash.
2774 *
2775 * if the buffer was put onto the ordered list for an older
2776 * transaction, we need to leave it around
2777 */
2781 }
2782 free_jh:
2785 }
2789 }
2791 /* clm -- taken from fs/buffer.c:block_invalidate_page */
2793 {
2813 /*
2814 * is this block fully invalidated?
2815 */
2819 else
2821 }
2826 /*
2827 * We release buffers only if the entire page is being invalidated.
2828 * The get_block cached value has been unconditionally invalidated,
2829 * so real IO is not possible anymore.
2830 */
2833 /* maybe should BUG_ON(!ret); - neilb */
2834 }
2835 out:
2837 }
2840 {
2845 }
2847 }
2849 /*
2850 * Returns 1 if the page's buffers were dropped. The page is locked.
2851 *
2852 * Takes j_dirty_buffers_lock to protect the b_assoc_buffers list_heads
2853 * in the buffers at page_buffers(page).
2854 *
2855 * even in -o notail mode, we can't be sure an old mount without -o notail
2856 * didn't create files with tails.
2857 */
2859 {
2877 }
2878 }
2885 }
2887 /* We thank Mingming Cao for helping us understand in great detail what
2888 to do in this section of the code. */
2892 {
2899 }
2902 {
2908 /* version 2 items will be caught by the s_maxbytes check
2909 ** done for us in vmtruncate
2910 */
2915 }
2916 /* fill in hole pointers in the expanding truncate case. */
2922 /* we're changing at most 2 bitmaps, inode + super */
2927 }
2930 }
2933 /*
2934 * file size is changed, ctime and mtime are
2935 * to be updated
2936 */
2938 }
2939 }
2944 /* stat data of format v3.5 has 16 bit uid and gid */
2947 }
2963 /* (user+group)*(old+new) structure - we count quota info and , inode write (sb, inode) */
2964 error =
2966 jbegin_count);
2969 error =
2973 jbegin_count);
2975 }
2976 /* Update corresponding info in inode so that everything is in
2977 * one transaction */
2983 error =
2985 }
2986 }
2989 }
2994 }
2996 out:
2999 }
3013 };