| blob | 9857e50f85e723c00637ce6e26604cf8f07b6e7b |
1 /*
2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
3 */
5 #include <linux/config.h>
6 #include <linux/time.h>
7 #include <linux/fs.h>
8 #include <linux/reiserfs_fs.h>
9 #include <linux/reiserfs_acl.h>
10 #include <linux/reiserfs_xattr.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>
29 {
30 /* We need blocks for transaction + (user+group) quota update (possibly delete) */
41 /* The = 0 happens when we abort creating a new inode for some reason like lack of space.. */
42 if (!(inode->i_state & I_NEW) && INODE_PKEY(inode)->k_objectid != 0) { /* also handles bad_inode case */
50 }
55 /* Do quota update inside a transaction for journaled quotas. We must do that
56 * after delete_object so that quota updates go into the same transaction as
57 * stat data deletion */
64 }
68 /* check return value from reiserfs_delete_object after
69 * ending the transaction
70 */
74 /* all items of file are deleted, so we can remove "save" link */
76 * about an error here */
78 /* no object items are in the tree */
79 ;
80 }
81 out:
85 }
89 {
97 }
99 /* take base of inode_key (it comes from inode always) (dirid, objectid) and version from an inode, set
100 offset and type of key */
103 {
107 length);
108 }
110 //
111 // when key is 0, do not set version and short key
112 //
117 {
122 }
127 /* set_ih_free_space (ih, 0); */
128 // for directory items it is entry count, for directs and stat
129 // datas - 0xffff, for indirects - 0
131 }
133 //
134 // FIXME: we might cache recently accessed indirect item
136 // Ugh. Not too eager for that....
137 // I cut the code until such time as I see a convincing argument (benchmark).
138 // I don't want a bloated inode struct..., and I don't like code complexity....
140 /* cutting the code is fine, since it really isn't in use yet and is easy
141 ** to add back in. But, Vladimir has a really good idea here. Think
142 ** about what happens for reading a file. For each page,
143 ** The VFS layer calls reiserfs_readpage, who searches the tree to find
144 ** an indirect item. This indirect item has X number of pointers, where
145 ** X is a big number if we've done the block allocation right. But,
146 ** we only use one or two of these pointers during each call to readpage,
147 ** needlessly researching again later on.
148 **
149 ** The size of the cache could be dynamic based on the size of the file.
150 **
151 ** I'd also like to see us cache the location the stat data item, since
152 ** we are needlessly researching for that frequently.
153 **
154 ** --chris
155 */
157 /* If this page has a file tail in it, and
158 ** it was read in by get_block_create_0, the page data is valid,
159 ** but tail is still sitting in a direct item, and we can't write to
160 ** it. So, look through this page, and check all the mapped buffers
161 ** to make sure they have valid block numbers. Any that don't need
162 ** to be unmapped, so that block_prepare_write will correctly call
163 ** reiserfs_get_block to convert the tail into an unformatted node
164 */
166 {
176 }
179 }
180 }
182 /* reiserfs_get_block does not need to allocate a block only if it has been
183 done already or non-hole position has been found in the indirect item */
187 {
194 }
197 {
199 }
203 {
205 }
207 //
208 // files which were created in the earlier version can not be longer,
209 // than 2 gb
210 //
212 {
218 }
222 {
230 /* we cannot restart while nested */
233 }
241 }
243 }
245 // it is called by get_block when create == 0. Returns block number
246 // for 'block'-th logical block of file. When it hits direct item it
247 // returns 0 (being called from bmap) or read direct item into piece
248 // of page (bh_result)
250 // Please improve the english/clarity in the comment above, as it is
251 // hard to understand.
255 {
269 // prepare the key to look for the 'block'-th block of file
274 research:
282 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
283 // That there is some MMAPED data associated with it that is yet to be written to disk.
287 }
289 }
290 //
296 /* FIXME: here we could cache indirect item or part of it in
297 the inode to avoid search_by_key in case of subsequent
298 access to file */
306 }
308 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
309 // That there is some MMAPED data associated with it that is yet to be written to disk.
313 }
319 }
320 // requested data are in direct item(s)
322 // we are called by bmap. FIXME: we can not map block of file
323 // when it is stored in direct item(s)
328 }
330 /* if we've got a direct item, and the buffer or page was uptodate,
331 ** we don't want to pull data off disk again. skip to the
332 ** end, where we map the buffer and return
333 */
337 /*
338 ** grab_tail_page can trigger calls to reiserfs_get_block on up to date
339 ** pages without any buffers. If the page is up to date, we don't want
340 ** read old data off disk. Set the up to date bit on the buffer instead
341 ** and jump to the end
342 */
346 }
347 // read file tail into part of page
352 /* we only want to kmap if we are reading the tail into the page.
353 ** this is not the common case, so we don't kmap until we are
354 ** sure we need to. But, this means the item might move if
355 ** kmap schedules
356 */
362 }
363 }
369 }
370 /* make sure we don't read more bytes than actually exist in
371 ** the file. This can happen in odd cases where i_size isn't
372 ** correct, and when direct item padding results in a few
373 ** extra bytes at the end of the direct item
374 */
378 chars =
384 }
393 // we done, if read direct item is not the last item of
394 // node FIXME: we could try to check right delimiting key
395 // to see whether direct item continues in the right
396 // neighbor or rely on i_size
399 // update key to look for the next piece
403 // i/o error most likely
412 finished:
418 /* this buffer has valid data, but isn't valid for io. mapping it to
419 * block #0 tells the rest of reiserfs it just has a tail in it
420 */
424 }
426 // this is called to create file map. So, _get_block_create_0 will not
427 // read direct item
430 {
435 /* do not read the direct item */
439 }
441 /* special version of get_block that is only used by grab_tail_page right
442 ** now. It is sent to block_prepare_write, and when you try to get a
443 ** block past the end of the file (or a block from a hole) it returns
444 ** -ENOENT instead of a valid buffer. block_prepare_write expects to
445 ** be able to do i/o on the buffers returned, unless an error value
446 ** is also returned.
447 **
448 ** So, this allows block_prepare_write to be used for reading a single block
449 ** in a page. Where it does not produce a valid page for holes, or past the
450 ** end of the file. This turns out to be exactly what we need for reading
451 ** tails for conversion.
452 **
453 ** The point of the wrapper is forcing a certain value for create, even
454 ** though the VFS layer is calling this function with create==1. If you
455 ** don't want to send create == GET_BLOCK_NO_HOLE to reiserfs_get_block,
456 ** don't use this function.
457 */
461 {
463 }
465 /* This is special helper for reiserfs_get_block in case we are executing
466 direct_IO request. */
468 sector_t iblock,
471 {
476 /* We set the b_size before reiserfs_get_block call since it is
477 referenced in convert_tail_for_hole() that may be called from
478 reiserfs_get_block() */
486 /* don't allow direct io onto tail pages */
488 /* make sure future calls to the direct io funcs for this offset
489 ** in the file fail by unmapping the buffer
490 */
493 }
494 /* Possible unpacked tail. Flush the data before pages have
495 disappeared */
504 }
505 out:
507 }
509 /*
510 ** helper function for when reiserfs_get_block is called for a hole
511 ** but the file tail is still in a direct item
512 ** bh_result is the buffer head for the hole
513 ** tail_offset is the offset of the start of the tail in the file
514 **
515 ** This calls prepare_write, which will start a new transaction
516 ** you should not be in a transaction, or have any paths held when you
517 ** call this.
518 */
521 loff_t tail_offset)
522 {
533 /* always try to read until the end of the block */
538 /* hole_page can be zero in case of direct_io, we are sure
539 that we cannot get here if we write with O_DIRECT into
540 tail page */
546 }
549 }
551 /* we don't have to make sure the conversion did not happen while
552 ** we were locking the page because anyone that could convert
553 ** must first take i_mutex.
554 **
555 ** We must fix the tail page for writing because it might have buffers
556 ** that are mapped, but have a block number of 0. This indicates tail
557 ** data that has been read directly into the page, and block_prepare_write
558 ** won't trigger a get_block in this case.
559 */
565 /* tail conversion might change the data in the page */
570 unlock:
574 }
575 out:
577 }
584 {
587 #ifdef REISERFS_PREALLOCATE
591 }
592 #endif
594 block);
595 }
599 {
611 /* space reserved in transaction batch:
612 . 3 balancings in direct->indirect conversion
613 . 1 block involved into reiserfs_update_sd()
614 XXX in practically impossible worst case direct2indirect()
615 can incur (much) more than 3 balancings.
616 quota update for user, group */
622 loff_t new_offset =
625 /* bad.... */
632 }
634 /* if !create, we aren't changing the FS, so we don't need to
635 ** log anything, so we don't need to start a transaction
636 */
639 /* find number of block-th logical block of the file */
644 }
645 /*
646 * if we're already in a transaction, make sure to close
647 * any new transactions we start in this func
648 */
653 /* If file is of such a size, that it might have a tail and tails are enabled
654 ** we should mark it as possibly needing tail packing on close
655 */
662 /* set the key of the first byte in the 'block'-th block of file */
665 start_trans:
670 }
672 }
673 research:
679 }
691 /* we have to allocate block for the unformatted node */
695 }
697 repeat =
702 /* restart the transaction to give the journal a chance to free
703 ** some blocks. releases the path, so we have to go back to
704 ** research if we succeed on the second try
705 */
710 repeat =
716 }
719 else
722 }
727 }
728 }
731 b_blocknr_t unfm_ptr;
732 /* 'block'-th block is in the file already (there is
733 corresponding cell in some indirect item). But it may be
734 zero unformatted node pointer (hole) */
737 /* use allocated block to plug the hole */
742 bh);
744 }
753 }
762 /* the item was found, so new blocks were not added to the file
763 ** there is no need to make sure the inode is updated with this
764 ** transaction
765 */
767 }
772 }
774 /* desired position is not found or is in the direct item. We have
775 to append file with holes up to 'block'-th block converting
776 direct items to indirect one if necessary */
783 /* indirect item has to be inserted */
789 /* we are going to add 'block'-th block to the file. Use
790 allocated block for that */
796 }
801 retval =
808 }
809 //mark_tail_converted (inode);
811 /* direct item has to be converted */
812 loff_t tail_offset;
814 tail_offset =
818 /* direct item we just found fits into block we have
819 to map. Convert it into unformatted node: use
820 bh_result for the conversion */
826 /* we have to padd file tail stored in direct item(s)
827 up to block size and convert it to unformatted
828 node. FIXME: this should also get into page cache */
831 /*
832 * ugly, but we can only end the transaction if
833 * we aren't nested
834 */
837 retval =
838 reiserfs_end_persistent_transaction
843 }
845 retval =
847 tail_offset);
853 retval);
855 /* the bitmap, the super, and the stat data == 3 */
860 inode,
861 allocated_block_nr,
863 }
865 }
867 }
868 retval =
870 tail_offset);
876 }
877 /* it is important the set_buffer_uptodate is done after
878 ** the direct2indirect. The buffer might contain valid
879 ** data newer than the data on disk (read by readpage, changed,
880 ** and then sent here by writepage). direct2indirect needs
881 ** to know if unbh was already up to date, so it can decide
882 ** if the data in unbh needs to be replaced with data from
883 ** the disk
884 */
887 /* unbh->b_page == NULL in case of DIRECT_IO request, this means
888 buffer will disappear shortly, so it should not be added to
889 */
891 /* we've converted the tail, so we must
892 ** flush unbh before the transaction commits
893 */
896 /* mark it dirty now to prevent commit_write from adding
897 ** this buffer to the inode's dirty buffer list
898 */
899 /*
900 * AKPM: changed __mark_buffer_dirty to mark_buffer_dirty().
901 * It's still atomic, but it sets the page dirty too,
902 * which makes it eligible for writeback at any time by the
903 * VM (which was also the case with __mark_buffer_dirty())
904 */
906 }
908 /* append indirect item with holes if needed, when appending
909 pointer to 'block'-th block use block, which is already
910 allocated */
913 // one block which is a fastpath
915 __u64 max_to_insert =
917 UNFM_P_SIZE;
918 __u64 blocks_needed;
922 /* indirect item has to be appended, set up key of that position */
928 //pos_in_item * inode->i_sb->s_blocksize,
933 blocks_needed =
937 s_blocksize_bits);
942 un = kmalloc(min(blocks_needed, max_to_insert) * UNFM_P_SIZE, GFP_ATOMIC); // We need to avoid scheduling.
950 max_to_insert));
951 }
953 /* we are going to add target block to the file. Use allocated
954 block for that */
962 /* paste hole to the indirect item */
963 /* If kmalloc failed, max_to_insert becomes zero and it means we
964 only have space for one block */
965 blocks_needed =
967 }
968 retval =
971 UNFM_P_SIZE *
972 blocks_needed);
981 }
983 /* We need to mark new file size in case this function will be
984 interrupted/aborted later on. And we may do this only for
985 holes. */
988 }
989 }
994 /* this loop could log more blocks than we had originally asked
995 ** for. So, we have to allow the transaction to end if it is
996 ** too big or too full. Update the inode so things are
997 ** consistent if we crash before the function returns
998 **
999 ** release the path so that anybody waiting on the path before
1000 ** ending their transaction will be able to continue.
1001 */
1006 }
1007 /* inserting indirect pointers for a hole can take a
1008 ** long time. reschedule if needed
1009 */
1016 }
1019 "vs-825: reiserfs_get_block: "
1027 }
1036 failure:
1044 }
1049 }
1051 static int
1054 {
1056 }
1058 /* Compute real number of used bytes by file
1059 * Following three functions can go away when we'll have enough space in stat item
1060 */
1062 {
1069 /* End of file is also in full block with indirect reference, so round
1070 ** up to the next block.
1071 **
1072 ** there is just no way to know if the tail is actually packed
1073 ** on the file, so we have to assume it isn't. When we pack the
1074 ** tail, we add 4 bytes to pretend there really is an unformatted
1075 ** node pointer
1076 */
1077 bytes =
1080 sd_size;
1082 }
1086 {
1090 }
1093 }
1095 /* Compute number of blocks used by file in ReiserFS counting */
1097 {
1101 /* keeps fsck and non-quota versions of reiserfs happy */
1104 }
1106 /* files from before the quota patch might i_blocks such that
1107 ** bytes < real_space. Deal with that here to prevent it from
1108 ** going negative.
1109 */
1113 }
1115 //
1116 // BAD: new directories have stat data of new type and all other items
1117 // of old type. Version stored in the inode says about body items, so
1118 // in update_stat_data we can not rely on inode, but have to check
1119 // item version directly
1120 //
1122 // called by read_locked_inode
1124 {
1127 __u32 rdev;
1128 //int version = ITEM_VERSION_1;
1170 // there was a bug in <=3.5.23 when i_blocks could take negative
1171 // values. Starting from 3.5.17 this value could even be stored in
1172 // stat data. For such files we set i_blocks based on file
1173 // size. Just 2 notes: this can be wrong for sparce files. On-disk value will be
1174 // only updated if file's inode will ever change
1176 }
1181 /* an early bug in the quota code can give us an odd number for the
1182 ** block count. This is incorrect, fix it here.
1183 */
1186 }
1189 SD_V1_SIZE));
1190 /* nopack is initially zero for v1 objects. For v2 objects,
1191 nopack is initialised from sd_attrs */
1194 // new stat data found, but object may have old items
1195 // (directories and symlinks)
1214 else
1219 else
1225 SD_V2_SIZE));
1226 /* read persistent inode attributes from sd and initalise
1227 generic inode flags from them */
1230 }
1247 }
1248 }
1250 // update new stat data with inode fields
1252 {
1254 __u16 flags;
1267 else
1272 }
1274 // used to copy inode's fields to old stat data
1276 {
1290 else
1293 // Sigh. i_first_direct_byte is back
1296 }
1298 /* NOTE, you must prepare the buffer head before sending it here,
1299 ** and then log it after the call
1300 */
1302 loff_t size)
1303 {
1316 // path points to old stat data
1320 }
1323 }
1327 {
1341 /* look for the object's stat data */
1345 "vs-13050: reiserfs_update_sd: "
1349 }
1354 /*reiserfs_warning (inode->i_sb, "vs-13050: reiserfs_update_sd: i_nlink == 0, stat data not found"); */
1356 }
1358 "vs-13060: reiserfs_update_sd: "
1361 pos);
1364 }
1366 /* sigh, prepare_for_journal might schedule. When it schedules the
1367 ** FS might change. We have to detect that, and loop back to the
1368 ** search if the stat data item has moved
1369 */
1379 }
1381 }
1386 }
1388 /* reiserfs_read_locked_inode is called to read the inode off disk, and it
1389 ** does a make_bad_inode when things go wrong. But, we need to make sure
1390 ** and clear the key in the private portion of the inode, otherwise a
1391 ** corresponding iput might try to delete whatever object the inode last
1392 ** represented.
1393 */
1395 {
1398 }
1400 //
1401 // initially this function was derived from minix or ext2's analog and
1402 // evolved as the prototype did
1403 //
1406 {
1411 }
1413 /* looks for stat data in the tree, and fills up the fields of in-core
1414 inode stat data fields */
1417 {
1425 /* set version 1, version 2 could be used too, because stat data
1426 key is the same in both versions */
1433 /* look for the object's stat data */
1437 "vs-13070: reiserfs_read_locked_inode: "
1442 }
1444 /* a stale NFS handle can trigger this without it being an error */
1449 }
1453 /* It is possible that knfsd is trying to access inode of a file
1454 that is being removed from the disk by some other thread. As we
1455 update sd on unlink all that is required is to check for nlink
1456 here. This bug was first found by Sizif when debugging
1457 SquidNG/Butterfly, forgotten, and found again after Philippe
1458 Gramoulle <philippe.gramoulle@mmania.com> reproduced it.
1460 More logical fix would require changes in fs/inode.c:iput() to
1461 remove inode from hash-table _after_ fs cleaned disk stuff up and
1462 in iget() to return NULL if I_FREEING inode is found in
1463 hash-table. */
1464 /* Currently there is one place where it's ok to meet inode with
1465 nlink==0: processing of open-unlinked and half-truncated files
1466 during mount (fs/reiserfs/super.c:finish_unfinished()). */
1470 "vs-13075: reiserfs_read_locked_inode: "
1471 "dead inode read from disk %K. "
1475 }
1479 }
1481 /**
1482 * reiserfs_find_actor() - "find actor" reiserfs supplies to iget5_locked().
1483 *
1484 * @inode: inode from hash table to check
1485 * @opaque: "cookie" passed to iget5_locked(). This is &reiserfs_iget_args.
1486 *
1487 * This function is called by iget5_locked() to distinguish reiserfs inodes
1488 * having the same inode numbers. Such inodes can only exist due to some
1489 * error condition. One of them should be bad. Inodes with identical
1490 * inode numbers (objectids) are distinguished by parent directory ids.
1491 *
1492 */
1494 {
1498 /* args is already in CPU order */
1501 }
1504 {
1519 }
1522 /* either due to i/o error or a stale NFS handle */
1525 }
1527 }
1530 {
1544 }
1554 }
1556 }
1563 {
1566 /* fhtype happens to reflect the number of u32s encoded.
1567 * due to a bug in earlier code, fhtype might indicate there
1568 * are more u32s then actually fitted.
1569 * so if fhtype seems to be more than len, reduce fhtype.
1570 * Valid types are:
1571 * 2 - objectid + dir_id - legacy support
1572 * 3 - objectid + dir_id + generation
1573 * 4 - objectid + dir_id + objectid and dirid of parent - legacy
1574 * 5 - objectid + dir_id + generation + objectid and dirid of parent
1575 * 6 - as above plus generation of directory
1576 * 6 does not fit in NFSv2 handles
1577 */
1584 }
1590 else
1598 else
1600 }
1604 }
1608 {
1619 /* no room for directory info? return what we've stored so far */
1631 }
1634 }
1636 /* looks for stat data, then copies fields to it, marks the buffer
1637 containing stat data as dirty */
1638 /* reiserfs inodes are never really dirty, since the dirty inode call
1639 ** always logs them. This call allows the VFS inode marking routines
1640 ** to properly mark inodes for datasync and such, but only actually
1641 ** does something when called for a synchronous update.
1642 */
1644 {
1650 /* memory pressure can sometimes initiate write_inode calls with sync == 1,
1651 ** these cases are just when the system needs ram, not when the
1652 ** inode needs to reach disk for safety, and they can safely be
1653 ** ignored because the altered inode has already been logged.
1654 */
1660 }
1662 }
1664 }
1666 /* stat data of new object is inserted already, this inserts the item
1667 containing "." and ".." entries */
1672 {
1685 /* compose item head for new item. Directories consist of items of
1686 old type (ITEM_VERSION_1). Do not set key (second arg is 0), it
1687 is done by reiserfs_new_inode */
1704 }
1706 /* look for place in the tree for new item */
1712 }
1719 }
1721 /* insert item, that is empty directory item */
1723 }
1725 /* stat data of object has been inserted, this inserts the item
1726 containing the body of symlink */
1727 static int reiserfs_new_symlink(struct reiserfs_transaction_handle *th, struct inode *inode, /* Inode of symlink */
1731 {
1746 /* look for place in the tree for new item */
1752 }
1759 }
1761 /* insert item, that is body of symlink */
1763 }
1765 /* inserts the stat data into the tree, and then calls
1766 reiserfs_new_directory (to insert ".", ".." item if new object is
1767 directory) or reiserfs_new_symlink (to insert symlink body if new
1768 object is symlink) or nothing (if new object is regular file)
1770 NOTE! uid and gid must already be set in the inode. If we return
1771 non-zero due to an error, we have to drop the quota previously allocated
1772 for the fresh inode. This can only be done outside a transaction, so
1773 if we return non-zero, we also end the transaction. */
1776 /* 0 for regular, EMTRY_DIR_SIZE for dirs,
1777 strlen (symname) for symlinks) */
1780 {
1794 }
1798 }
1802 /* item head of new item */
1808 }
1810 /* not a perfect generation count, as object ids can be reused, but
1811 ** this is as good as reiserfs can do right now.
1812 ** note that the private part of inode isn't filled in yet, we have
1813 ** to use the directory.
1814 */
1816 else
1817 #if defined( USE_INODE_GENERATION_COUNTER )
1820 #else
1822 #endif
1824 /* fill stat data */
1827 /* uid and gid must already be set by the caller for quota init */
1829 /* symlink cannot be immutable or append only, right? */
1856 else
1860 /* key to search for correct place for new stat data */
1865 /* find proper place for inserting of stat data */
1870 }
1875 }
1879 /* i_uid or i_gid is too big to be stored in stat data v3.5 */
1882 }
1886 }
1887 // these do not go to on-disk stat data
1891 // store in in-core inode the key of stat data and version all
1892 // object items will have (directory items will have old offset
1893 // format, other new objects will consist of new items)
1897 else
1901 else
1904 /* insert the stat data into the tree */
1905 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1908 #endif
1909 retval =
1916 }
1917 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1920 #endif
1922 /* insert item with "." and ".." */
1923 retval =
1925 }
1928 /* insert body of symlink */
1931 retval =
1933 i_size);
1934 }
1940 }
1942 /* XXX CHECK THIS */
1950 }
1956 }
1964 /* it looks like you can easily compress these two goto targets into
1965 * one. Keeping it like this doesn't actually hurt anything, and they
1966 * are place holders for what the quota code actually needs.
1967 */
1968 out_bad_inode:
1969 /* Invalidate the object, nothing was inserted yet */
1972 /* Quota change must be inside a transaction for journaling */
1975 out_end_trans:
1977 /* Drop can be outside and it needs more credits so it's better to have it outside */
1982 out_inserted_sd:
1986 /* If we were inheriting an ACL, we need to release the lock so that
1987 * iput doesn't deadlock in reiserfs_delete_xattrs. The locking
1988 * code really needs to be reworked, but this will take care of it
1989 * for now. -jeffm */
1997 }
1999 /*
2000 ** finds the tail page in the page cache,
2001 ** reads the last block in.
2002 **
2003 ** On success, page_result is set to a locked, pinned page, and bh_result
2004 ** is set to an up to date buffer for the last block in the file. returns 0.
2005 **
2006 ** tail conversion is not done, so bh_result might not be valid for writing
2007 ** check buffer_mapped(bh_result) and bh_result->b_blocknr != 0 before
2008 ** trying to write the block.
2009 **
2010 ** on failure, nonzero is returned, page_result and bh_result are untouched.
2011 */
2015 {
2017 /* we want the page with the last byte in the file,
2018 ** not the page that will hold the next byte for appending
2019 */
2030 /* we know that we are only called with inode->i_size > 0.
2031 ** we also know that a file tail can never be as big as a block
2032 ** If i_size % blocksize == 0, our file is currently block aligned
2033 ** and it won't need converting or zeroing after a truncate.
2034 */
2037 }
2042 }
2043 /* start within the page of the last block in the file */
2047 reiserfs_get_block_create_0);
2056 }
2062 /* note, this should never happen, prepare_write should
2063 ** be taking care of this for us. If the buffer isn't up to date,
2064 ** I've screwed up the code to find the buffer, or the code to
2065 ** call prepare_write
2066 */
2073 }
2077 out:
2080 unlock:
2084 }
2086 /*
2087 ** vfs version of truncate file. Must NOT be called with
2088 ** a transaction already started.
2089 **
2090 ** some code taken from block_truncate_page
2091 */
2093 {
2095 /* we want the offset for the first byte after the end of the file */
2108 // -ENOENT means we truncated past the end of the file,
2109 // and get_block_create_0 could not find a block to read in,
2110 // which is ok.
2114 error);
2117 }
2118 }
2120 /* so, if page != NULL, we have a buffer head for the offset at
2121 ** the end of the file. if the bh is mapped, and bh->b_blocknr != 0,
2122 ** then we have an unformatted node. Otherwise, we have a direct item,
2123 ** and no zeroing is required on disk. We zero after the truncate,
2124 ** because the truncate might pack the item anyway
2125 ** (it will unmap bh if it packs).
2126 */
2127 /* it is enough to reserve space in transaction for 2 balancings:
2128 one for "save" link adding and another for the first
2129 cut_from_item. 1 is for update_sd */
2136 /* we are doing real truncate: if the system crashes before the last
2137 transaction of truncating gets committed - on reboot the file
2138 either appears truncated properly or not truncated at all */
2141 error =
2146 /* check reiserfs_do_truncate after ending the transaction */
2150 }
2156 }
2160 /* if we are not on a block boundary */
2171 }
2172 }
2175 }
2179 out:
2183 }
2186 }
2191 {
2209 /* catch places below that try to log something without starting a trans */
2214 }
2217 start_over:
2221 research:
2226 }
2233 /* we've found an unformatted node */
2238 bytes_copied);
2239 }
2241 /* crap, we are writing to a hole */
2244 }
2257 /* vs-3050 is gone, no need to drop the path */
2266 bh);
2268 }
2269 }
2277 }
2280 copy_size);
2286 /* are there still bytes left? */
2291 copy_size);
2293 }
2300 }
2303 out:
2310 }
2313 /* this is where we fill in holes in the file. */
2316 GET_BLOCK_CREATE | GET_BLOCK_NO_IMUX
2321 /* get_block failed to find a mapped unformatted node. */
2324 }
2325 }
2326 }
2330 /* we've copied data from the page into the direct item, so the
2331 * buffer in the page is now clean, mark it to reflect that.
2332 */
2336 }
2338 }
2340 /*
2341 * mason@suse.com: updated in 2.5.54 to follow the same general io
2342 * start/recovery path as __block_write_full_page, along with special
2343 * code to handle reiserfs tails.
2344 */
2347 {
2361 /* no logging allowed when nonblocking or from PF_MEMALLOC */
2366 }
2368 /* The page dirty bit is cleared before writepage is called, which
2369 * means we have to tell create_empty_buffers to make dirty buffers
2370 * The page really should be up to date at this point, so tossing
2371 * in the BH_Uptodate is just a sanity check.
2372 */
2376 }
2379 /* last page in the file, zero out any contents past the
2380 ** last byte in the file
2381 */
2387 /* no file contents in this page */
2391 }
2396 }
2399 /* first map all the buffers, logging any direct items we find */
2405 /* not mapped yet, or it points to a direct item, search
2406 * the btree for the mapping info, and log any direct
2407 * items found
2408 */
2411 }
2412 }
2414 block++;
2417 /*
2418 * we start the transaction after map_block_for_writepage,
2419 * because it can create holes in the file (an unbounded operation).
2420 * starting it here, we can make a reliable estimate for how many
2421 * blocks we're going to log
2422 */
2430 }
2432 }
2433 /* now go through and lock any dirty buffers on the page */
2445 }
2446 /* from this point on, we know the buffer is mapped to a
2447 * real block and not a direct item
2448 */
2455 }
2456 }
2461 }
2469 }
2474 /*
2475 * since any buffer might be the only dirty buffer on the page,
2476 * the first submit_bh can bring the page out of writeback.
2477 * be careful with the buffers.
2478 */
2483 nr++;
2484 }
2490 done:
2492 /*
2493 * if this page only had a direct item, it is very possible for
2494 * no io to be required without there being an error. Or,
2495 * someone else could have locked them and sent them down the
2496 * pipe without locking the page
2497 */
2503 }
2509 }
2512 fail:
2513 /* catches various errors, we need to make sure any valid dirty blocks
2514 * get to the media. The page is currently locked and not marked for
2515 * writeback
2516 */
2525 /*
2526 * clear any dirty bits that might have come from getting
2527 * attached to a dirty page
2528 */
2530 }
2542 nr++;
2543 }
2548 }
2551 {
2553 }
2556 {
2560 }
2564 {
2574 journal_info;
2579 }
2584 /* this gets a little ugly. If reiserfs_get_block returned an
2585 * error and left a transacstion running, we've got to close it,
2586 * and we've got to free handle if it was a persistent transaction.
2587 *
2588 * But, if we had nested into an existing transaction, we need
2589 * to just drop the ref count on the handle.
2590 *
2591 * If old_ref == 0, the transaction is from reiserfs_get_block,
2592 * and it was a persistent trans. Otherwise, it was nested above.
2593 */
2604 }
2605 }
2606 }
2609 }
2612 {
2614 }
2618 {
2628 }
2631 /* generic_commit_write does this for us, but does not update the
2632 ** transaction tracking stuff when the size changes. So, we have
2633 ** to do the i_size updates here.
2634 */
2638 /* If the file have grown beyond the border where it
2639 can have a tail, unmark it as needing a tail
2640 packing */
2651 }
2654 /*
2655 * this will just nest into our transaction. It's important
2656 * to use mark_inode_dirty so the inode gets pushed around on the
2657 * dirty lists, and so that O_SYNC works as expected
2658 */
2666 }
2675 }
2677 out:
2680 journal_error:
2687 }
2690 }
2693 {
2697 else
2701 else
2705 else
2709 else
2713 else
2715 }
2716 }
2719 {
2723 else
2727 else
2731 else
2735 else
2737 }
2738 }
2740 /* decide if this buffer needs to stay around for data logging or ordered
2741 ** write purposes
2742 */
2744 {
2752 }
2753 /* the page is locked, and the only places that log a data buffer
2754 * also lock the page.
2755 */
2757 /*
2758 * very conservative, leave the buffer pinned if
2759 * anyone might need it.
2760 */
2763 }
2768 /* why is this safe?
2769 * reiserfs_setattr updates i_size in the on disk
2770 * stat data before allowing vmtruncate to be called.
2771 *
2772 * If buffer was put onto the ordered list for this
2773 * transaction, we know for sure either this transaction
2774 * or an older one already has updated i_size on disk,
2775 * and this ordered data won't be referenced in the file
2776 * if we crash.
2777 *
2778 * if the buffer was put onto the ordered list for an older
2779 * transaction, we need to leave it around
2780 */
2784 }
2785 free_jh:
2788 }
2792 }
2794 /* clm -- taken from fs/buffer.c:block_invalidate_page */
2796 {
2816 /*
2817 * is this block fully invalidated?
2818 */
2822 else
2824 }
2829 /*
2830 * We release buffers only if the entire page is being invalidated.
2831 * The get_block cached value has been unconditionally invalidated,
2832 * so real IO is not possible anymore.
2833 */
2836 /* maybe should BUG_ON(!ret); - neilb */
2837 }
2838 out:
2840 }
2843 {
2848 }
2850 }
2852 /*
2853 * Returns 1 if the page's buffers were dropped. The page is locked.
2854 *
2855 * Takes j_dirty_buffers_lock to protect the b_assoc_buffers list_heads
2856 * in the buffers at page_buffers(page).
2857 *
2858 * even in -o notail mode, we can't be sure an old mount without -o notail
2859 * didn't create files with tails.
2860 */
2862 {
2880 }
2881 }
2888 }
2890 /* We thank Mingming Cao for helping us understand in great detail what
2891 to do in this section of the code. */
2895 {
2902 }
2905 {
2911 /* version 2 items will be caught by the s_maxbytes check
2912 ** done for us in vmtruncate
2913 */
2918 }
2919 /* fill in hole pointers in the expanding truncate case. */
2925 /* we're changing at most 2 bitmaps, inode + super */
2930 }
2933 }
2936 }
2937 }
2942 /* stat data of format v3.5 has 16 bit uid and gid */
2945 }
2961 /* (user+group)*(old+new) structure - we count quota info and , inode write (sb, inode) */
2962 error =
2964 jbegin_count);
2967 error =
2971 jbegin_count);
2973 }
2974 /* Update corresponding info in inode so that everything is in
2975 * one transaction */
2981 error =
2983 }
2984 }
2987 }
2992 }
2994 out:
2997 }
3011 };