| blob | 192269698a8ac44b3b7c58a327d7fde6d35db375 |
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/exportfs.h>
11 #include <linux/smp_lock.h>
12 #include <linux/pagemap.h>
13 #include <linux/highmem.h>
14 #include <asm/uaccess.h>
15 #include <asm/unaligned.h>
16 #include <linux/buffer_head.h>
17 #include <linux/mpage.h>
18 #include <linux/writeback.h>
19 #include <linux/quotaops.h>
20 #include <linux/swap.h>
28 {
29 /* We need blocks for transaction + (user+group) quota update (possibly delete) */
40 /* The = 0 happens when we abort creating a new inode for some reason like lack of space.. */
41 if (!(inode->i_state & I_NEW) && INODE_PKEY(inode)->k_objectid != 0) { /* also handles bad_inode case */
52 /* Do quota update inside a transaction for journaled quotas. We must do that
53 * after delete_object so that quota updates go into the same transaction as
54 * stat data deletion */
61 /* check return value from reiserfs_delete_object after
62 * ending the transaction
63 */
67 /* all items of file are deleted, so we can remove "save" link */
69 * about an error here */
71 /* no object items are in the tree */
72 ;
73 }
74 out:
78 }
82 {
90 }
92 /* take base of inode_key (it comes from inode always) (dirid, objectid) and version from an inode, set
93 offset and type of key */
96 {
100 length);
101 }
103 //
104 // when key is 0, do not set version and short key
105 //
110 {
115 }
120 /* set_ih_free_space (ih, 0); */
121 // for directory items it is entry count, for directs and stat
122 // datas - 0xffff, for indirects - 0
124 }
126 //
127 // FIXME: we might cache recently accessed indirect item
129 // Ugh. Not too eager for that....
130 // I cut the code until such time as I see a convincing argument (benchmark).
131 // I don't want a bloated inode struct..., and I don't like code complexity....
133 /* cutting the code is fine, since it really isn't in use yet and is easy
134 ** to add back in. But, Vladimir has a really good idea here. Think
135 ** about what happens for reading a file. For each page,
136 ** The VFS layer calls reiserfs_readpage, who searches the tree to find
137 ** an indirect item. This indirect item has X number of pointers, where
138 ** X is a big number if we've done the block allocation right. But,
139 ** we only use one or two of these pointers during each call to readpage,
140 ** needlessly researching again later on.
141 **
142 ** The size of the cache could be dynamic based on the size of the file.
143 **
144 ** I'd also like to see us cache the location the stat data item, since
145 ** we are needlessly researching for that frequently.
146 **
147 ** --chris
148 */
150 /* If this page has a file tail in it, and
151 ** it was read in by get_block_create_0, the page data is valid,
152 ** but tail is still sitting in a direct item, and we can't write to
153 ** it. So, look through this page, and check all the mapped buffers
154 ** to make sure they have valid block numbers. Any that don't need
155 ** to be unmapped, so that block_prepare_write will correctly call
156 ** reiserfs_get_block to convert the tail into an unformatted node
157 */
159 {
169 }
172 }
173 }
175 /* reiserfs_get_block does not need to allocate a block only if it has been
176 done already or non-hole position has been found in the indirect item */
180 {
187 }
190 {
192 }
196 {
198 }
200 //
201 // files which were created in the earlier version can not be longer,
202 // than 2 gb
203 //
205 {
211 }
215 {
225 /* we cannot restart while nested */
228 }
235 }
237 }
239 // it is called by get_block when create == 0. Returns block number
240 // for 'block'-th logical block of file. When it hits direct item it
241 // returns 0 (being called from bmap) or read direct item into piece
242 // of page (bh_result)
244 // Please improve the english/clarity in the comment above, as it is
245 // hard to understand.
249 {
255 b_blocknr_t blocknr;
263 // prepare the key to look for the 'block'-th block of file
268 research:
276 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
277 // That there is some MMAPED data associated with it that is yet to be written to disk.
281 }
283 }
284 //
290 /* FIXME: here we could cache indirect item or part of it in
291 the inode to avoid search_by_key in case of subsequent
292 access to file */
300 }
302 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
303 // That there is some MMAPED data associated with it that is yet to be written to disk.
307 }
313 }
314 // requested data are in direct item(s)
316 // we are called by bmap. FIXME: we can not map block of file
317 // when it is stored in direct item(s)
322 }
324 /* if we've got a direct item, and the buffer or page was uptodate,
325 ** we don't want to pull data off disk again. skip to the
326 ** end, where we map the buffer and return
327 */
331 /*
332 ** grab_tail_page can trigger calls to reiserfs_get_block on up to date
333 ** pages without any buffers. If the page is up to date, we don't want
334 ** read old data off disk. Set the up to date bit on the buffer instead
335 ** and jump to the end
336 */
340 }
341 // read file tail into part of page
346 /* we only want to kmap if we are reading the tail into the page.
347 ** this is not the common case, so we don't kmap until we are
348 ** sure we need to. But, this means the item might move if
349 ** kmap schedules
350 */
356 }
357 }
363 }
364 /* make sure we don't read more bytes than actually exist in
365 ** the file. This can happen in odd cases where i_size isn't
366 ** correct, and when direct item padding results in a few
367 ** extra bytes at the end of the direct item
368 */
372 chars =
378 }
387 // we done, if read direct item is not the last item of
388 // node FIXME: we could try to check right delimiting key
389 // to see whether direct item continues in the right
390 // neighbor or rely on i_size
393 // update key to look for the next piece
397 // i/o error most likely
406 finished:
412 /* this buffer has valid data, but isn't valid for io. mapping it to
413 * block #0 tells the rest of reiserfs it just has a tail in it
414 */
418 }
420 // this is called to create file map. So, _get_block_create_0 will not
421 // read direct item
424 {
429 /* do not read the direct item */
433 }
435 /* special version of get_block that is only used by grab_tail_page right
436 ** now. It is sent to block_prepare_write, and when you try to get a
437 ** block past the end of the file (or a block from a hole) it returns
438 ** -ENOENT instead of a valid buffer. block_prepare_write expects to
439 ** be able to do i/o on the buffers returned, unless an error value
440 ** is also returned.
441 **
442 ** So, this allows block_prepare_write to be used for reading a single block
443 ** in a page. Where it does not produce a valid page for holes, or past the
444 ** end of the file. This turns out to be exactly what we need for reading
445 ** tails for conversion.
446 **
447 ** The point of the wrapper is forcing a certain value for create, even
448 ** though the VFS layer is calling this function with create==1. If you
449 ** don't want to send create == GET_BLOCK_NO_HOLE to reiserfs_get_block,
450 ** don't use this function.
451 */
455 {
457 }
459 /* This is special helper for reiserfs_get_block in case we are executing
460 direct_IO request. */
462 sector_t iblock,
465 {
470 /* We set the b_size before reiserfs_get_block call since it is
471 referenced in convert_tail_for_hole() that may be called from
472 reiserfs_get_block() */
480 /* don't allow direct io onto tail pages */
482 /* make sure future calls to the direct io funcs for this offset
483 ** in the file fail by unmapping the buffer
484 */
487 }
488 /* Possible unpacked tail. Flush the data before pages have
489 disappeared */
498 }
499 out:
501 }
503 /*
504 ** helper function for when reiserfs_get_block is called for a hole
505 ** but the file tail is still in a direct item
506 ** bh_result is the buffer head for the hole
507 ** tail_offset is the offset of the start of the tail in the file
508 **
509 ** This calls prepare_write, which will start a new transaction
510 ** you should not be in a transaction, or have any paths held when you
511 ** call this.
512 */
515 loff_t tail_offset)
516 {
527 /* always try to read until the end of the block */
532 /* hole_page can be zero in case of direct_io, we are sure
533 that we cannot get here if we write with O_DIRECT into
534 tail page */
540 }
543 }
545 /* we don't have to make sure the conversion did not happen while
546 ** we were locking the page because anyone that could convert
547 ** must first take i_mutex.
548 **
549 ** We must fix the tail page for writing because it might have buffers
550 ** that are mapped, but have a block number of 0. This indicates tail
551 ** data that has been read directly into the page, and block_prepare_write
552 ** won't trigger a get_block in this case.
553 */
559 /* tail conversion might change the data in the page */
564 unlock:
568 }
569 out:
571 }
574 sector_t block,
578 {
581 #ifdef REISERFS_PREALLOCATE
585 }
586 #endif
588 block);
589 }
593 {
605 /* space reserved in transaction batch:
606 . 3 balancings in direct->indirect conversion
607 . 1 block involved into reiserfs_update_sd()
608 XXX in practically impossible worst case direct2indirect()
609 can incur (much) more than 3 balancings.
610 quota update for user, group */
616 loff_t new_offset =
619 /* bad.... */
626 }
628 /* if !create, we aren't changing the FS, so we don't need to
629 ** log anything, so we don't need to start a transaction
630 */
633 /* find number of block-th logical block of the file */
638 }
639 /*
640 * if we're already in a transaction, make sure to close
641 * any new transactions we start in this func
642 */
647 /* If file is of such a size, that it might have a tail and tails are enabled
648 ** we should mark it as possibly needing tail packing on close
649 */
656 /* set the key of the first byte in the 'block'-th block of file */
659 start_trans:
664 }
666 }
667 research:
673 }
685 /* we have to allocate block for the unformatted node */
689 }
691 repeat =
696 /* restart the transaction to give the journal a chance to free
697 ** some blocks. releases the path, so we have to go back to
698 ** research if we succeed on the second try
699 */
704 repeat =
710 }
713 else
716 }
721 }
722 }
725 b_blocknr_t unfm_ptr;
726 /* 'block'-th block is in the file already (there is
727 corresponding cell in some indirect item). But it may be
728 zero unformatted node pointer (hole) */
731 /* use allocated block to plug the hole */
736 bh);
738 }
747 }
756 /* the item was found, so new blocks were not added to the file
757 ** there is no need to make sure the inode is updated with this
758 ** transaction
759 */
761 }
766 }
768 /* desired position is not found or is in the direct item. We have
769 to append file with holes up to 'block'-th block converting
770 direct items to indirect one if necessary */
777 /* indirect item has to be inserted */
783 /* we are going to add 'block'-th block to the file. Use
784 allocated block for that */
790 }
795 retval =
802 }
803 //mark_tail_converted (inode);
805 /* direct item has to be converted */
806 loff_t tail_offset;
808 tail_offset =
812 /* direct item we just found fits into block we have
813 to map. Convert it into unformatted node: use
814 bh_result for the conversion */
820 /* we have to padd file tail stored in direct item(s)
821 up to block size and convert it to unformatted
822 node. FIXME: this should also get into page cache */
825 /*
826 * ugly, but we can only end the transaction if
827 * we aren't nested
828 */
831 retval =
832 reiserfs_end_persistent_transaction
837 }
839 retval =
841 tail_offset);
847 retval);
849 /* the bitmap, the super, and the stat data == 3 */
854 inode,
855 allocated_block_nr,
857 }
859 }
861 }
862 retval =
864 tail_offset);
870 }
871 /* it is important the set_buffer_uptodate is done after
872 ** the direct2indirect. The buffer might contain valid
873 ** data newer than the data on disk (read by readpage, changed,
874 ** and then sent here by writepage). direct2indirect needs
875 ** to know if unbh was already up to date, so it can decide
876 ** if the data in unbh needs to be replaced with data from
877 ** the disk
878 */
881 /* unbh->b_page == NULL in case of DIRECT_IO request, this means
882 buffer will disappear shortly, so it should not be added to
883 */
885 /* we've converted the tail, so we must
886 ** flush unbh before the transaction commits
887 */
890 /* mark it dirty now to prevent commit_write from adding
891 ** this buffer to the inode's dirty buffer list
892 */
893 /*
894 * AKPM: changed __mark_buffer_dirty to mark_buffer_dirty().
895 * It's still atomic, but it sets the page dirty too,
896 * which makes it eligible for writeback at any time by the
897 * VM (which was also the case with __mark_buffer_dirty())
898 */
900 }
902 /* append indirect item with holes if needed, when appending
903 pointer to 'block'-th block use block, which is already
904 allocated */
907 // one block which is a fastpath
909 __u64 max_to_insert =
911 UNFM_P_SIZE;
912 __u64 blocks_needed;
916 /* indirect item has to be appended, set up key of that position */
922 //pos_in_item * inode->i_sb->s_blocksize,
927 blocks_needed =
931 s_blocksize_bits);
936 un = kzalloc(min(blocks_needed, max_to_insert) * UNFM_P_SIZE, GFP_ATOMIC); // We need to avoid scheduling.
941 }
942 }
944 /* we are going to add target block to the file. Use allocated
945 block for that */
953 /* paste hole to the indirect item */
954 /* If kmalloc failed, max_to_insert becomes zero and it means we
955 only have space for one block */
956 blocks_needed =
958 }
959 retval =
962 UNFM_P_SIZE *
963 blocks_needed);
972 }
974 /* We need to mark new file size in case this function will be
975 interrupted/aborted later on. And we may do this only for
976 holes. */
979 }
980 }
985 /* this loop could log more blocks than we had originally asked
986 ** for. So, we have to allow the transaction to end if it is
987 ** too big or too full. Update the inode so things are
988 ** consistent if we crash before the function returns
989 **
990 ** release the path so that anybody waiting on the path before
991 ** ending their transaction will be able to continue.
992 */
997 }
998 /* inserting indirect pointers for a hole can take a
999 ** long time. reschedule if needed
1000 */
1007 }
1010 "vs-825: reiserfs_get_block: "
1018 }
1027 failure:
1035 }
1040 }
1042 static int
1045 {
1047 }
1049 /* Compute real number of used bytes by file
1050 * Following three functions can go away when we'll have enough space in stat item
1051 */
1053 {
1060 /* End of file is also in full block with indirect reference, so round
1061 ** up to the next block.
1062 **
1063 ** there is just no way to know if the tail is actually packed
1064 ** on the file, so we have to assume it isn't. When we pack the
1065 ** tail, we add 4 bytes to pretend there really is an unformatted
1066 ** node pointer
1067 */
1068 bytes =
1071 sd_size;
1073 }
1077 {
1081 }
1084 }
1086 /* Compute number of blocks used by file in ReiserFS counting */
1088 {
1092 /* keeps fsck and non-quota versions of reiserfs happy */
1095 }
1097 /* files from before the quota patch might i_blocks such that
1098 ** bytes < real_space. Deal with that here to prevent it from
1099 ** going negative.
1100 */
1104 }
1106 //
1107 // BAD: new directories have stat data of new type and all other items
1108 // of old type. Version stored in the inode says about body items, so
1109 // in update_stat_data we can not rely on inode, but have to check
1110 // item version directly
1111 //
1113 // called by read_locked_inode
1115 {
1118 __u32 rdev;
1119 //int version = ITEM_VERSION_1;
1161 // there was a bug in <=3.5.23 when i_blocks could take negative
1162 // values. Starting from 3.5.17 this value could even be stored in
1163 // stat data. For such files we set i_blocks based on file
1164 // size. Just 2 notes: this can be wrong for sparce files. On-disk value will be
1165 // only updated if file's inode will ever change
1167 }
1172 /* an early bug in the quota code can give us an odd number for the
1173 ** block count. This is incorrect, fix it here.
1174 */
1177 }
1180 SD_V1_SIZE));
1181 /* nopack is initially zero for v1 objects. For v2 objects,
1182 nopack is initialised from sd_attrs */
1185 // new stat data found, but object may have old items
1186 // (directories and symlinks)
1205 else
1210 else
1216 SD_V2_SIZE));
1217 /* read persistent inode attributes from sd and initalise
1218 generic inode flags from them */
1221 }
1238 }
1239 }
1241 // update new stat data with inode fields
1243 {
1245 __u16 flags;
1258 else
1263 }
1265 // used to copy inode's fields to old stat data
1267 {
1281 else
1284 // Sigh. i_first_direct_byte is back
1287 }
1289 /* NOTE, you must prepare the buffer head before sending it here,
1290 ** and then log it after the call
1291 */
1293 loff_t size)
1294 {
1307 // path points to old stat data
1311 }
1314 }
1318 {
1332 /* look for the object's stat data */
1336 "vs-13050: reiserfs_update_sd: "
1340 }
1345 /*reiserfs_warning (inode->i_sb, "vs-13050: reiserfs_update_sd: i_nlink == 0, stat data not found"); */
1347 }
1349 "vs-13060: reiserfs_update_sd: "
1352 pos);
1355 }
1357 /* sigh, prepare_for_journal might schedule. When it schedules the
1358 ** FS might change. We have to detect that, and loop back to the
1359 ** search if the stat data item has moved
1360 */
1370 }
1372 }
1377 }
1379 /* reiserfs_read_locked_inode is called to read the inode off disk, and it
1380 ** does a make_bad_inode when things go wrong. But, we need to make sure
1381 ** and clear the key in the private portion of the inode, otherwise a
1382 ** corresponding iput might try to delete whatever object the inode last
1383 ** represented.
1384 */
1386 {
1389 }
1391 //
1392 // initially this function was derived from minix or ext2's analog and
1393 // evolved as the prototype did
1394 //
1397 {
1402 }
1404 /* looks for stat data in the tree, and fills up the fields of in-core
1405 inode stat data fields */
1408 {
1416 /* set version 1, version 2 could be used too, because stat data
1417 key is the same in both versions */
1424 /* look for the object's stat data */
1428 "vs-13070: reiserfs_read_locked_inode: "
1433 }
1435 /* a stale NFS handle can trigger this without it being an error */
1440 }
1444 /* It is possible that knfsd is trying to access inode of a file
1445 that is being removed from the disk by some other thread. As we
1446 update sd on unlink all that is required is to check for nlink
1447 here. This bug was first found by Sizif when debugging
1448 SquidNG/Butterfly, forgotten, and found again after Philippe
1449 Gramoulle <philippe.gramoulle@mmania.com> reproduced it.
1451 More logical fix would require changes in fs/inode.c:iput() to
1452 remove inode from hash-table _after_ fs cleaned disk stuff up and
1453 in iget() to return NULL if I_FREEING inode is found in
1454 hash-table. */
1455 /* Currently there is one place where it's ok to meet inode with
1456 nlink==0: processing of open-unlinked and half-truncated files
1457 during mount (fs/reiserfs/super.c:finish_unfinished()). */
1461 "vs-13075: reiserfs_read_locked_inode: "
1462 "dead inode read from disk %K. "
1466 }
1470 }
1472 /**
1473 * reiserfs_find_actor() - "find actor" reiserfs supplies to iget5_locked().
1474 *
1475 * @inode: inode from hash table to check
1476 * @opaque: "cookie" passed to iget5_locked(). This is &reiserfs_iget_args.
1477 *
1478 * This function is called by iget5_locked() to distinguish reiserfs inodes
1479 * having the same inode numbers. Such inodes can only exist due to some
1480 * error condition. One of them should be bad. Inodes with identical
1481 * inode numbers (objectids) are distinguished by parent directory ids.
1482 *
1483 */
1485 {
1489 /* args is already in CPU order */
1492 }
1495 {
1510 }
1513 /* either due to i/o error or a stale NFS handle */
1516 }
1518 }
1523 {
1536 }
1546 }
1548 }
1552 {
1553 /* fhtype happens to reflect the number of u32s encoded.
1554 * due to a bug in earlier code, fhtype might indicate there
1555 * are more u32s then actually fitted.
1556 * so if fhtype seems to be more than len, reduce fhtype.
1557 * Valid types are:
1558 * 2 - objectid + dir_id - legacy support
1559 * 3 - objectid + dir_id + generation
1560 * 4 - objectid + dir_id + objectid and dirid of parent - legacy
1561 * 5 - objectid + dir_id + generation + objectid and dirid of parent
1562 * 6 - as above plus generation of directory
1563 * 6 does not fit in NFSv2 handles
1564 */
1571 }
1575 }
1579 {
1587 }
1591 {
1602 /* no room for directory info? return what we've stored so far */
1614 }
1617 }
1619 /* looks for stat data, then copies fields to it, marks the buffer
1620 containing stat data as dirty */
1621 /* reiserfs inodes are never really dirty, since the dirty inode call
1622 ** always logs them. This call allows the VFS inode marking routines
1623 ** to properly mark inodes for datasync and such, but only actually
1624 ** does something when called for a synchronous update.
1625 */
1627 {
1633 /* memory pressure can sometimes initiate write_inode calls with sync == 1,
1634 ** these cases are just when the system needs ram, not when the
1635 ** inode needs to reach disk for safety, and they can safely be
1636 ** ignored because the altered inode has already been logged.
1637 */
1643 }
1645 }
1647 }
1649 /* stat data of new object is inserted already, this inserts the item
1650 containing "." and ".." entries */
1655 {
1668 /* compose item head for new item. Directories consist of items of
1669 old type (ITEM_VERSION_1). Do not set key (second arg is 0), it
1670 is done by reiserfs_new_inode */
1687 }
1689 /* look for place in the tree for new item */
1695 }
1702 }
1704 /* insert item, that is empty directory item */
1706 }
1708 /* stat data of object has been inserted, this inserts the item
1709 containing the body of symlink */
1710 static int reiserfs_new_symlink(struct reiserfs_transaction_handle *th, struct inode *inode, /* Inode of symlink */
1714 {
1729 /* look for place in the tree for new item */
1735 }
1742 }
1744 /* insert item, that is body of symlink */
1746 }
1748 /* inserts the stat data into the tree, and then calls
1749 reiserfs_new_directory (to insert ".", ".." item if new object is
1750 directory) or reiserfs_new_symlink (to insert symlink body if new
1751 object is symlink) or nothing (if new object is regular file)
1753 NOTE! uid and gid must already be set in the inode. If we return
1754 non-zero due to an error, we have to drop the quota previously allocated
1755 for the fresh inode. This can only be done outside a transaction, so
1756 if we return non-zero, we also end the transaction. */
1759 /* 0 for regular, EMTRY_DIR_SIZE for dirs,
1760 strlen (symname) for symlinks) */
1763 {
1777 }
1781 }
1785 /* item head of new item */
1791 }
1793 /* not a perfect generation count, as object ids can be reused, but
1794 ** this is as good as reiserfs can do right now.
1795 ** note that the private part of inode isn't filled in yet, we have
1796 ** to use the directory.
1797 */
1799 else
1800 #if defined( USE_INODE_GENERATION_COUNTER )
1803 #else
1805 #endif
1807 /* fill stat data */
1810 /* uid and gid must already be set by the caller for quota init */
1812 /* symlink cannot be immutable or append only, right? */
1840 else
1844 /* key to search for correct place for new stat data */
1849 /* find proper place for inserting of stat data */
1854 }
1859 }
1863 /* i_uid or i_gid is too big to be stored in stat data v3.5 */
1866 }
1870 }
1871 // these do not go to on-disk stat data
1874 // store in in-core inode the key of stat data and version all
1875 // object items will have (directory items will have old offset
1876 // format, other new objects will consist of new items)
1880 else
1884 else
1887 /* insert the stat data into the tree */
1888 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1891 #endif
1892 retval =
1899 }
1900 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1903 #endif
1905 /* insert item with "." and ".." */
1906 retval =
1908 }
1911 /* insert body of symlink */
1914 retval =
1916 i_size);
1917 }
1923 }
1925 /* XXX CHECK THIS */
1933 }
1939 }
1947 /* it looks like you can easily compress these two goto targets into
1948 * one. Keeping it like this doesn't actually hurt anything, and they
1949 * are place holders for what the quota code actually needs.
1950 */
1951 out_bad_inode:
1952 /* Invalidate the object, nothing was inserted yet */
1955 /* Quota change must be inside a transaction for journaling */
1958 out_end_trans:
1960 /* Drop can be outside and it needs more credits so it's better to have it outside */
1965 out_inserted_sd:
1969 /* If we were inheriting an ACL, we need to release the lock so that
1970 * iput doesn't deadlock in reiserfs_delete_xattrs. The locking
1971 * code really needs to be reworked, but this will take care of it
1972 * for now. -jeffm */
1973 #ifdef CONFIG_REISERFS_FS_POSIX_ACL
1979 #endif
1982 }
1984 /*
1985 ** finds the tail page in the page cache,
1986 ** reads the last block in.
1987 **
1988 ** On success, page_result is set to a locked, pinned page, and bh_result
1989 ** is set to an up to date buffer for the last block in the file. returns 0.
1990 **
1991 ** tail conversion is not done, so bh_result might not be valid for writing
1992 ** check buffer_mapped(bh_result) and bh_result->b_blocknr != 0 before
1993 ** trying to write the block.
1994 **
1995 ** on failure, nonzero is returned, page_result and bh_result are untouched.
1996 */
2000 {
2002 /* we want the page with the last byte in the file,
2003 ** not the page that will hold the next byte for appending
2004 */
2015 /* we know that we are only called with inode->i_size > 0.
2016 ** we also know that a file tail can never be as big as a block
2017 ** If i_size % blocksize == 0, our file is currently block aligned
2018 ** and it won't need converting or zeroing after a truncate.
2019 */
2022 }
2027 }
2028 /* start within the page of the last block in the file */
2032 reiserfs_get_block_create_0);
2041 }
2047 /* note, this should never happen, prepare_write should
2048 ** be taking care of this for us. If the buffer isn't up to date,
2049 ** I've screwed up the code to find the buffer, or the code to
2050 ** call prepare_write
2051 */
2058 }
2062 out:
2065 unlock:
2069 }
2071 /*
2072 ** vfs version of truncate file. Must NOT be called with
2073 ** a transaction already started.
2074 **
2075 ** some code taken from block_truncate_page
2076 */
2078 {
2080 /* we want the offset for the first byte after the end of the file */
2093 // -ENOENT means we truncated past the end of the file,
2094 // and get_block_create_0 could not find a block to read in,
2095 // which is ok.
2099 error);
2102 }
2103 }
2105 /* so, if page != NULL, we have a buffer head for the offset at
2106 ** the end of the file. if the bh is mapped, and bh->b_blocknr != 0,
2107 ** then we have an unformatted node. Otherwise, we have a direct item,
2108 ** and no zeroing is required on disk. We zero after the truncate,
2109 ** because the truncate might pack the item anyway
2110 ** (it will unmap bh if it packs).
2111 */
2112 /* it is enough to reserve space in transaction for 2 balancings:
2113 one for "save" link adding and another for the first
2114 cut_from_item. 1 is for update_sd */
2121 /* we are doing real truncate: if the system crashes before the last
2122 transaction of truncating gets committed - on reboot the file
2123 either appears truncated properly or not truncated at all */
2126 error =
2131 /* check reiserfs_do_truncate after ending the transaction */
2135 }
2141 }
2145 /* if we are not on a block boundary */
2151 }
2152 }
2155 }
2159 out:
2163 }
2166 }
2171 {
2189 /* catch places below that try to log something without starting a trans */
2194 }
2197 start_over:
2201 research:
2206 }
2213 /* we've found an unformatted node */
2218 bytes_copied);
2219 }
2221 /* crap, we are writing to a hole */
2224 }
2237 /* vs-3050 is gone, no need to drop the path */
2246 bh);
2248 }
2249 }
2257 }
2260 copy_size);
2266 /* are there still bytes left? */
2271 copy_size);
2273 }
2280 }
2283 out:
2290 }
2293 /* this is where we fill in holes in the file. */
2296 GET_BLOCK_CREATE | GET_BLOCK_NO_IMUX
2301 /* get_block failed to find a mapped unformatted node. */
2304 }
2305 }
2306 }
2310 /* we've copied data from the page into the direct item, so the
2311 * buffer in the page is now clean, mark it to reflect that.
2312 */
2316 }
2318 }
2320 /*
2321 * mason@suse.com: updated in 2.5.54 to follow the same general io
2322 * start/recovery path as __block_write_full_page, along with special
2323 * code to handle reiserfs tails.
2324 */
2327 {
2332 sector_t last_block;
2342 /* no logging allowed when nonblocking or from PF_MEMALLOC */
2347 }
2349 /* The page dirty bit is cleared before writepage is called, which
2350 * means we have to tell create_empty_buffers to make dirty buffers
2351 * The page really should be up to date at this point, so tossing
2352 * in the BH_Uptodate is just a sanity check.
2353 */
2357 }
2360 /* last page in the file, zero out any contents past the
2361 ** last byte in the file
2362 */
2367 /* no file contents in this page */
2371 }
2373 }
2377 /* first map all the buffers, logging any direct items we find */
2380 /*
2381 * This can happen when the block size is less than
2382 * the page size. The corresponding bytes in the page
2383 * were zero filled above
2384 */
2391 /* not mapped yet, or it points to a direct item, search
2392 * the btree for the mapping info, and log any direct
2393 * items found
2394 */
2397 }
2398 }
2400 block++;
2403 /*
2404 * we start the transaction after map_block_for_writepage,
2405 * because it can create holes in the file (an unbounded operation).
2406 * starting it here, we can make a reliable estimate for how many
2407 * blocks we're going to log
2408 */
2416 }
2418 }
2419 /* now go through and lock any dirty buffers on the page */
2431 }
2432 /* from this point on, we know the buffer is mapped to a
2433 * real block and not a direct item
2434 */
2441 }
2442 }
2447 }
2455 }
2460 /*
2461 * since any buffer might be the only dirty buffer on the page,
2462 * the first submit_bh can bring the page out of writeback.
2463 * be careful with the buffers.
2464 */
2469 nr++;
2470 }
2476 done:
2478 /*
2479 * if this page only had a direct item, it is very possible for
2480 * no io to be required without there being an error. Or,
2481 * someone else could have locked them and sent them down the
2482 * pipe without locking the page
2483 */
2489 }
2495 }
2498 fail:
2499 /* catches various errors, we need to make sure any valid dirty blocks
2500 * get to the media. The page is currently locked and not marked for
2501 * writeback
2502 */
2511 /*
2512 * clear any dirty bits that might have come from getting
2513 * attached to a dirty page
2514 */
2516 }
2528 nr++;
2529 }
2534 }
2537 {
2539 }
2542 {
2546 }
2552 {
2555 pgoff_t index;
2563 pos ++;
2565 }
2578 journal_info;
2583 }
2585 reiserfs_get_block);
2588 /* this gets a little ugly. If reiserfs_get_block returned an
2589 * error and left a transacstion running, we've got to close it,
2590 * and we've got to free handle if it was a persistent transaction.
2591 *
2592 * But, if we had nested into an existing transaction, we need
2593 * to just drop the ref count on the handle.
2594 *
2595 * If old_ref == 0, the transaction is from reiserfs_get_block,
2596 * and it was a persistent trans. Otherwise, it was nested above.
2597 */
2608 }
2609 }
2610 }
2614 }
2616 }
2620 {
2630 journal_info;
2635 }
2640 /* this gets a little ugly. If reiserfs_get_block returned an
2641 * error and left a transacstion running, we've got to close it,
2642 * and we've got to free handle if it was a persistent transaction.
2643 *
2644 * But, if we had nested into an existing transaction, we need
2645 * to just drop the ref count on the handle.
2646 *
2647 * If old_ref == 0, the transaction is from reiserfs_get_block,
2648 * and it was a persistent trans. Otherwise, it was nested above.
2649 */
2660 }
2661 }
2662 }
2665 }
2668 {
2670 }
2675 {
2683 pos ++;
2688 else
2697 }
2702 /* generic_commit_write does this for us, but does not update the
2703 ** transaction tracking stuff when the size changes. So, we have
2704 ** to do the i_size updates here.
2705 */
2710 /* If the file have grown beyond the border where it
2711 can have a tail, unmark it as needing a tail
2712 packing */
2723 }
2726 /*
2727 * this will just nest into our transaction. It's important
2728 * to use mark_inode_dirty so the inode gets pushed around on the
2729 * dirty lists, and so that O_SYNC works as expected
2730 */
2738 }
2747 }
2749 out:
2754 journal_error:
2761 }
2764 }
2768 {
2778 }
2781 /* generic_commit_write does this for us, but does not update the
2782 ** transaction tracking stuff when the size changes. So, we have
2783 ** to do the i_size updates here.
2784 */
2788 /* If the file have grown beyond the border where it
2789 can have a tail, unmark it as needing a tail
2790 packing */
2801 }
2804 /*
2805 * this will just nest into our transaction. It's important
2806 * to use mark_inode_dirty so the inode gets pushed around on the
2807 * dirty lists, and so that O_SYNC works as expected
2808 */
2816 }
2825 }
2827 out:
2830 journal_error:
2837 }
2840 }
2843 {
2847 else
2851 else
2855 else
2859 else
2863 else
2865 }
2866 }
2869 {
2873 else
2877 else
2881 else
2885 else
2887 }
2888 }
2890 /* decide if this buffer needs to stay around for data logging or ordered
2891 ** write purposes
2892 */
2894 {
2902 }
2903 /* the page is locked, and the only places that log a data buffer
2904 * also lock the page.
2905 */
2907 /*
2908 * very conservative, leave the buffer pinned if
2909 * anyone might need it.
2910 */
2913 }
2918 /* why is this safe?
2919 * reiserfs_setattr updates i_size in the on disk
2920 * stat data before allowing vmtruncate to be called.
2921 *
2922 * If buffer was put onto the ordered list for this
2923 * transaction, we know for sure either this transaction
2924 * or an older one already has updated i_size on disk,
2925 * and this ordered data won't be referenced in the file
2926 * if we crash.
2927 *
2928 * if the buffer was put onto the ordered list for an older
2929 * transaction, we need to leave it around
2930 */
2934 }
2935 free_jh:
2938 }
2942 }
2944 /* clm -- taken from fs/buffer.c:block_invalidate_page */
2946 {
2966 /*
2967 * is this block fully invalidated?
2968 */
2972 else
2974 }
2979 /*
2980 * We release buffers only if the entire page is being invalidated.
2981 * The get_block cached value has been unconditionally invalidated,
2982 * so real IO is not possible anymore.
2983 */
2986 /* maybe should BUG_ON(!ret); - neilb */
2987 }
2988 out:
2990 }
2993 {
2998 }
3000 }
3002 /*
3003 * Returns 1 if the page's buffers were dropped. The page is locked.
3004 *
3005 * Takes j_dirty_buffers_lock to protect the b_assoc_buffers list_heads
3006 * in the buffers at page_buffers(page).
3007 *
3008 * even in -o notail mode, we can't be sure an old mount without -o notail
3009 * didn't create files with tails.
3010 */
3012 {
3030 }
3031 }
3038 }
3040 /* We thank Mingming Cao for helping us understand in great detail what
3041 to do in this section of the code. */
3045 {
3052 }
3055 {
3060 /* must be turned off for recursive notify_change calls */
3065 /* version 2 items will be caught by the s_maxbytes check
3066 ** done for us in vmtruncate
3067 */
3072 }
3073 /* fill in hole pointers in the expanding truncate case. */
3079 /* we're changing at most 2 bitmaps, inode + super */
3084 }
3087 }
3090 /*
3091 * file size is changed, ctime and mtime are
3092 * to be updated
3093 */
3095 }
3096 }
3101 /* stat data of format v3.5 has 16 bit uid and gid */
3104 }
3120 /* (user+group)*(old+new) structure - we count quota info and , inode write (sb, inode) */
3121 error =
3123 jbegin_count);
3126 error =
3130 jbegin_count);
3132 }
3133 /* Update corresponding info in inode so that everything is in
3134 * one transaction */
3140 error =
3142 }
3143 }
3146 }
3151 }
3153 out:
3156 }
3170 };