2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
5 #include <linux/time.h>
10 #include <linux/exportfs.h>
11 #include <linux/pagemap.h>
12 #include <linux/highmem.h>
13 #include <linux/slab.h>
14 #include <linux/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>
21 #include <linux/uio.h>
22 #include <linux/bio.h>
24 int reiserfs_commit_write(struct file *f, struct page *page,
25 unsigned from, unsigned to);
27 void reiserfs_evict_inode(struct inode *inode)
30 * We need blocks for transaction + (user+group) quota
31 * update (possibly delete)
34 JOURNAL_PER_BALANCE_CNT * 2 +
35 2 * REISERFS_QUOTA_INIT_BLOCKS(inode->i_sb);
36 struct reiserfs_transaction_handle th;
39 if (!inode->i_nlink && !is_bad_inode(inode))
40 dquot_initialize(inode);
42 truncate_inode_pages_final(&inode->i_data);
47 * The = 0 happens when we abort creating a new inode
48 * for some reason like lack of space..
49 * also handles bad_inode case
51 if (!(inode->i_state & I_NEW) && INODE_PKEY(inode)->k_objectid != 0) {
53 reiserfs_delete_xattrs(inode);
55 reiserfs_write_lock(inode->i_sb);
57 if (journal_begin(&th, inode->i_sb, jbegin_count))
59 reiserfs_update_inode_transaction(inode);
61 reiserfs_discard_prealloc(&th, inode);
63 err = reiserfs_delete_object(&th, inode);
66 * Do quota update inside a transaction for journaled quotas.
67 * We must do that after delete_object so that quota updates
68 * go into the same transaction as stat data deletion
71 int depth = reiserfs_write_unlock_nested(inode->i_sb);
72 dquot_free_inode(inode);
73 reiserfs_write_lock_nested(inode->i_sb, depth);
80 * check return value from reiserfs_delete_object after
81 * ending the transaction
87 * all items of file are deleted, so we can remove
89 * we can't do anything about an error here
91 remove_save_link(inode, 0 /* not truncate */);
93 reiserfs_write_unlock(inode->i_sb);
95 /* no object items are in the tree */
99 /* note this must go after the journal_end to prevent deadlock */
111 static void _make_cpu_key(struct cpu_key *key, int version, __u32 dirid,
112 __u32 objectid, loff_t offset, int type, int length)
114 key->version = version;
116 key->on_disk_key.k_dir_id = dirid;
117 key->on_disk_key.k_objectid = objectid;
118 set_cpu_key_k_offset(key, offset);
119 set_cpu_key_k_type(key, type);
120 key->key_length = length;
124 * take base of inode_key (it comes from inode always) (dirid, objectid)
125 * and version from an inode, set offset and type of key
127 void make_cpu_key(struct cpu_key *key, struct inode *inode, loff_t offset,
128 int type, int length)
130 _make_cpu_key(key, get_inode_item_key_version(inode),
131 le32_to_cpu(INODE_PKEY(inode)->k_dir_id),
132 le32_to_cpu(INODE_PKEY(inode)->k_objectid), offset, type,
136 /* when key is 0, do not set version and short key */
137 inline void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
139 loff_t offset, int type, int length,
140 int entry_count /*or ih_free_space */ )
143 ih->ih_key.k_dir_id = cpu_to_le32(key->on_disk_key.k_dir_id);
144 ih->ih_key.k_objectid =
145 cpu_to_le32(key->on_disk_key.k_objectid);
147 put_ih_version(ih, version);
148 set_le_ih_k_offset(ih, offset);
149 set_le_ih_k_type(ih, type);
150 put_ih_item_len(ih, length);
151 /* set_ih_free_space (ih, 0); */
153 * for directory items it is entry count, for directs and stat
154 * datas - 0xffff, for indirects - 0
156 put_ih_entry_count(ih, entry_count);
160 * FIXME: we might cache recently accessed indirect item
161 * Ugh. Not too eager for that....
162 * I cut the code until such time as I see a convincing argument (benchmark).
163 * I don't want a bloated inode struct..., and I don't like code complexity....
167 * cutting the code is fine, since it really isn't in use yet and is easy
168 * to add back in. But, Vladimir has a really good idea here. Think
169 * about what happens for reading a file. For each page,
170 * The VFS layer calls reiserfs_readpage, who searches the tree to find
171 * an indirect item. This indirect item has X number of pointers, where
172 * X is a big number if we've done the block allocation right. But,
173 * we only use one or two of these pointers during each call to readpage,
174 * needlessly researching again later on.
176 * The size of the cache could be dynamic based on the size of the file.
178 * I'd also like to see us cache the location the stat data item, since
179 * we are needlessly researching for that frequently.
185 * If this page has a file tail in it, and
186 * it was read in by get_block_create_0, the page data is valid,
187 * but tail is still sitting in a direct item, and we can't write to
188 * it. So, look through this page, and check all the mapped buffers
189 * to make sure they have valid block numbers. Any that don't need
190 * to be unmapped, so that __block_write_begin will correctly call
191 * reiserfs_get_block to convert the tail into an unformatted node
193 static inline void fix_tail_page_for_writing(struct page *page)
195 struct buffer_head *head, *next, *bh;
197 if (page && page_has_buffers(page)) {
198 head = page_buffers(page);
201 next = bh->b_this_page;
202 if (buffer_mapped(bh) && bh->b_blocknr == 0) {
203 reiserfs_unmap_buffer(bh);
206 } while (bh != head);
211 * reiserfs_get_block does not need to allocate a block only if it has been
212 * done already or non-hole position has been found in the indirect item
214 static inline int allocation_needed(int retval, b_blocknr_t allocated,
215 struct item_head *ih,
216 __le32 * item, int pos_in_item)
220 if (retval == POSITION_FOUND && is_indirect_le_ih(ih) &&
221 get_block_num(item, pos_in_item))
226 static inline int indirect_item_found(int retval, struct item_head *ih)
228 return (retval == POSITION_FOUND) && is_indirect_le_ih(ih);
231 static inline void set_block_dev_mapped(struct buffer_head *bh,
232 b_blocknr_t block, struct inode *inode)
234 map_bh(bh, inode->i_sb, block);
238 * files which were created in the earlier version can not be longer,
241 static int file_capable(struct inode *inode, sector_t block)
243 /* it is new file. */
244 if (get_inode_item_key_version(inode) != KEY_FORMAT_3_5 ||
245 /* old file, but 'block' is inside of 2gb */
246 block < (1 << (31 - inode->i_sb->s_blocksize_bits)))
252 static int restart_transaction(struct reiserfs_transaction_handle *th,
253 struct inode *inode, struct treepath *path)
255 struct super_block *s = th->t_super;
258 BUG_ON(!th->t_trans_id);
259 BUG_ON(!th->t_refcount);
263 /* we cannot restart while nested */
264 if (th->t_refcount > 1) {
267 reiserfs_update_sd(th, inode);
268 err = journal_end(th);
270 err = journal_begin(th, s, JOURNAL_PER_BALANCE_CNT * 6);
272 reiserfs_update_inode_transaction(inode);
278 * it is called by get_block when create == 0. Returns block number
279 * for 'block'-th logical block of file. When it hits direct item it
280 * returns 0 (being called from bmap) or read direct item into piece
281 * of page (bh_result)
282 * Please improve the english/clarity in the comment above, as it is
283 * hard to understand.
285 static int _get_block_create_0(struct inode *inode, sector_t block,
286 struct buffer_head *bh_result, int args)
288 INITIALIZE_PATH(path);
290 struct buffer_head *bh;
291 struct item_head *ih, tmp_ih;
298 unsigned long offset;
300 /* prepare the key to look for the 'block'-th block of file */
301 make_cpu_key(&key, inode,
302 (loff_t) block * inode->i_sb->s_blocksize + 1, TYPE_ANY,
305 result = search_for_position_by_key(inode->i_sb, &key, &path);
306 if (result != POSITION_FOUND) {
309 kunmap(bh_result->b_page);
310 if (result == IO_ERROR)
313 * We do not return -ENOENT if there is a hole but page is
314 * uptodate, because it means that there is some MMAPED data
315 * associated with it that is yet to be written to disk.
317 if ((args & GET_BLOCK_NO_HOLE)
318 && !PageUptodate(bh_result->b_page)) {
324 bh = get_last_bh(&path);
325 ih = tp_item_head(&path);
326 if (is_indirect_le_ih(ih)) {
327 __le32 *ind_item = (__le32 *) ih_item_body(bh, ih);
330 * FIXME: here we could cache indirect item or part of it in
331 * the inode to avoid search_by_key in case of subsequent
334 blocknr = get_block_num(ind_item, path.pos_in_item);
337 map_bh(bh_result, inode->i_sb, blocknr);
338 if (path.pos_in_item ==
339 ((ih_item_len(ih) / UNFM_P_SIZE) - 1)) {
340 set_buffer_boundary(bh_result);
344 * We do not return -ENOENT if there is a hole but
345 * page is uptodate, because it means that there is
346 * some MMAPED data associated with it that is
347 * yet to be written to disk.
349 if ((args & GET_BLOCK_NO_HOLE)
350 && !PageUptodate(bh_result->b_page)) {
356 kunmap(bh_result->b_page);
359 /* requested data are in direct item(s) */
360 if (!(args & GET_BLOCK_READ_DIRECT)) {
362 * we are called by bmap. FIXME: we can not map block of file
363 * when it is stored in direct item(s)
367 kunmap(bh_result->b_page);
372 * if we've got a direct item, and the buffer or page was uptodate,
373 * we don't want to pull data off disk again. skip to the
374 * end, where we map the buffer and return
376 if (buffer_uptodate(bh_result)) {
380 * grab_tail_page can trigger calls to reiserfs_get_block on
381 * up to date pages without any buffers. If the page is up
382 * to date, we don't want read old data off disk. Set the up
383 * to date bit on the buffer instead and jump to the end
385 if (!bh_result->b_page || PageUptodate(bh_result->b_page)) {
386 set_buffer_uptodate(bh_result);
389 /* read file tail into part of page */
390 offset = (cpu_key_k_offset(&key) - 1) & (PAGE_SIZE - 1);
391 copy_item_head(&tmp_ih, ih);
394 * we only want to kmap if we are reading the tail into the page.
395 * this is not the common case, so we don't kmap until we are
396 * sure we need to. But, this means the item might move if
400 p = (char *)kmap(bh_result->b_page);
403 memset(p, 0, inode->i_sb->s_blocksize);
405 if (!is_direct_le_ih(ih)) {
409 * make sure we don't read more bytes than actually exist in
410 * the file. This can happen in odd cases where i_size isn't
411 * correct, and when direct item padding results in a few
412 * extra bytes at the end of the direct item
414 if ((le_ih_k_offset(ih) + path.pos_in_item) > inode->i_size)
416 if ((le_ih_k_offset(ih) - 1 + ih_item_len(ih)) > inode->i_size) {
418 inode->i_size - (le_ih_k_offset(ih) - 1) -
422 chars = ih_item_len(ih) - path.pos_in_item;
424 memcpy(p, ih_item_body(bh, ih) + path.pos_in_item, chars);
432 * we done, if read direct item is not the last item of
433 * node FIXME: we could try to check right delimiting key
434 * to see whether direct item continues in the right
435 * neighbor or rely on i_size
437 if (PATH_LAST_POSITION(&path) != (B_NR_ITEMS(bh) - 1))
440 /* update key to look for the next piece */
441 set_cpu_key_k_offset(&key, cpu_key_k_offset(&key) + chars);
442 result = search_for_position_by_key(inode->i_sb, &key, &path);
443 if (result != POSITION_FOUND)
444 /* i/o error most likely */
446 bh = get_last_bh(&path);
447 ih = tp_item_head(&path);
450 flush_dcache_page(bh_result->b_page);
451 kunmap(bh_result->b_page);
456 if (result == IO_ERROR)
460 * this buffer has valid data, but isn't valid for io. mapping it to
461 * block #0 tells the rest of reiserfs it just has a tail in it
463 map_bh(bh_result, inode->i_sb, 0);
464 set_buffer_uptodate(bh_result);
469 * this is called to create file map. So, _get_block_create_0 will not
472 static int reiserfs_bmap(struct inode *inode, sector_t block,
473 struct buffer_head *bh_result, int create)
475 if (!file_capable(inode, block))
478 reiserfs_write_lock(inode->i_sb);
479 /* do not read the direct item */
480 _get_block_create_0(inode, block, bh_result, 0);
481 reiserfs_write_unlock(inode->i_sb);
486 * special version of get_block that is only used by grab_tail_page right
487 * now. It is sent to __block_write_begin, and when you try to get a
488 * block past the end of the file (or a block from a hole) it returns
489 * -ENOENT instead of a valid buffer. __block_write_begin expects to
490 * be able to do i/o on the buffers returned, unless an error value
493 * So, this allows __block_write_begin to be used for reading a single block
494 * in a page. Where it does not produce a valid page for holes, or past the
495 * end of the file. This turns out to be exactly what we need for reading
496 * tails for conversion.
498 * The point of the wrapper is forcing a certain value for create, even
499 * though the VFS layer is calling this function with create==1. If you
500 * don't want to send create == GET_BLOCK_NO_HOLE to reiserfs_get_block,
501 * don't use this function.
503 static int reiserfs_get_block_create_0(struct inode *inode, sector_t block,
504 struct buffer_head *bh_result,
507 return reiserfs_get_block(inode, block, bh_result, GET_BLOCK_NO_HOLE);
511 * This is special helper for reiserfs_get_block in case we are executing
514 static int reiserfs_get_blocks_direct_io(struct inode *inode,
516 struct buffer_head *bh_result,
521 bh_result->b_page = NULL;
524 * We set the b_size before reiserfs_get_block call since it is
525 * referenced in convert_tail_for_hole() that may be called from
526 * reiserfs_get_block()
528 bh_result->b_size = i_blocksize(inode);
530 ret = reiserfs_get_block(inode, iblock, bh_result,
531 create | GET_BLOCK_NO_DANGLE);
535 /* don't allow direct io onto tail pages */
536 if (buffer_mapped(bh_result) && bh_result->b_blocknr == 0) {
538 * make sure future calls to the direct io funcs for this
539 * offset in the file fail by unmapping the buffer
541 clear_buffer_mapped(bh_result);
546 * Possible unpacked tail. Flush the data before pages have
549 if (REISERFS_I(inode)->i_flags & i_pack_on_close_mask) {
552 reiserfs_write_lock(inode->i_sb);
554 err = reiserfs_commit_for_inode(inode);
555 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
557 reiserfs_write_unlock(inode->i_sb);
567 * helper function for when reiserfs_get_block is called for a hole
568 * but the file tail is still in a direct item
569 * bh_result is the buffer head for the hole
570 * tail_offset is the offset of the start of the tail in the file
572 * This calls prepare_write, which will start a new transaction
573 * you should not be in a transaction, or have any paths held when you
576 static int convert_tail_for_hole(struct inode *inode,
577 struct buffer_head *bh_result,
581 unsigned long tail_end;
582 unsigned long tail_start;
583 struct page *tail_page;
584 struct page *hole_page = bh_result->b_page;
587 if ((tail_offset & (bh_result->b_size - 1)) != 1)
590 /* always try to read until the end of the block */
591 tail_start = tail_offset & (PAGE_SIZE - 1);
592 tail_end = (tail_start | (bh_result->b_size - 1)) + 1;
594 index = tail_offset >> PAGE_SHIFT;
596 * hole_page can be zero in case of direct_io, we are sure
597 * that we cannot get here if we write with O_DIRECT into tail page
599 if (!hole_page || index != hole_page->index) {
600 tail_page = grab_cache_page(inode->i_mapping, index);
606 tail_page = hole_page;
610 * we don't have to make sure the conversion did not happen while
611 * we were locking the page because anyone that could convert
612 * must first take i_mutex.
614 * We must fix the tail page for writing because it might have buffers
615 * that are mapped, but have a block number of 0. This indicates tail
616 * data that has been read directly into the page, and
617 * __block_write_begin won't trigger a get_block in this case.
619 fix_tail_page_for_writing(tail_page);
620 retval = __reiserfs_write_begin(tail_page, tail_start,
621 tail_end - tail_start);
625 /* tail conversion might change the data in the page */
626 flush_dcache_page(tail_page);
628 retval = reiserfs_commit_write(NULL, tail_page, tail_start, tail_end);
631 if (tail_page != hole_page) {
632 unlock_page(tail_page);
639 static inline int _allocate_block(struct reiserfs_transaction_handle *th,
642 b_blocknr_t * allocated_block_nr,
643 struct treepath *path, int flags)
645 BUG_ON(!th->t_trans_id);
647 #ifdef REISERFS_PREALLOCATE
648 if (!(flags & GET_BLOCK_NO_IMUX)) {
649 return reiserfs_new_unf_blocknrs2(th, inode, allocated_block_nr,
653 return reiserfs_new_unf_blocknrs(th, inode, allocated_block_nr, path,
657 int reiserfs_get_block(struct inode *inode, sector_t block,
658 struct buffer_head *bh_result, int create)
660 int repeat, retval = 0;
661 /* b_blocknr_t is (unsigned) 32 bit int*/
662 b_blocknr_t allocated_block_nr = 0;
663 INITIALIZE_PATH(path);
666 struct buffer_head *bh, *unbh = NULL;
667 struct item_head *ih, tmp_ih;
671 struct reiserfs_transaction_handle *th = NULL;
673 * space reserved in transaction batch:
674 * . 3 balancings in direct->indirect conversion
675 * . 1 block involved into reiserfs_update_sd()
676 * XXX in practically impossible worst case direct2indirect()
677 * can incur (much) more than 3 balancings.
678 * quota update for user, group
681 JOURNAL_PER_BALANCE_CNT * 3 + 1 +
682 2 * REISERFS_QUOTA_TRANS_BLOCKS(inode->i_sb);
686 (((loff_t) block) << inode->i_sb->s_blocksize_bits) + 1;
688 reiserfs_write_lock(inode->i_sb);
689 version = get_inode_item_key_version(inode);
691 if (!file_capable(inode, block)) {
692 reiserfs_write_unlock(inode->i_sb);
697 * if !create, we aren't changing the FS, so we don't need to
698 * log anything, so we don't need to start a transaction
700 if (!(create & GET_BLOCK_CREATE)) {
702 /* find number of block-th logical block of the file */
703 ret = _get_block_create_0(inode, block, bh_result,
704 create | GET_BLOCK_READ_DIRECT);
705 reiserfs_write_unlock(inode->i_sb);
710 * if we're already in a transaction, make sure to close
711 * any new transactions we start in this func
713 if ((create & GET_BLOCK_NO_DANGLE) ||
714 reiserfs_transaction_running(inode->i_sb))
718 * If file is of such a size, that it might have a tail and
719 * tails are enabled we should mark it as possibly needing
720 * tail packing on close
722 if ((have_large_tails(inode->i_sb)
723 && inode->i_size < i_block_size(inode) * 4)
724 || (have_small_tails(inode->i_sb)
725 && inode->i_size < i_block_size(inode)))
726 REISERFS_I(inode)->i_flags |= i_pack_on_close_mask;
728 /* set the key of the first byte in the 'block'-th block of file */
729 make_cpu_key(&key, inode, new_offset, TYPE_ANY, 3 /*key length */ );
730 if ((new_offset + inode->i_sb->s_blocksize - 1) > inode->i_size) {
732 th = reiserfs_persistent_transaction(inode->i_sb, jbegin_count);
737 reiserfs_update_inode_transaction(inode);
741 retval = search_for_position_by_key(inode->i_sb, &key, &path);
742 if (retval == IO_ERROR) {
747 bh = get_last_bh(&path);
748 ih = tp_item_head(&path);
749 item = tp_item_body(&path);
750 pos_in_item = path.pos_in_item;
752 fs_gen = get_generation(inode->i_sb);
753 copy_item_head(&tmp_ih, ih);
755 if (allocation_needed
756 (retval, allocated_block_nr, ih, item, pos_in_item)) {
757 /* we have to allocate block for the unformatted node */
764 _allocate_block(th, block, inode, &allocated_block_nr,
768 * restart the transaction to give the journal a chance to free
769 * some blocks. releases the path, so we have to go back to
770 * research if we succeed on the second try
772 if (repeat == NO_DISK_SPACE || repeat == QUOTA_EXCEEDED) {
773 SB_JOURNAL(inode->i_sb)->j_next_async_flush = 1;
774 retval = restart_transaction(th, inode, &path);
778 _allocate_block(th, block, inode,
779 &allocated_block_nr, NULL, create);
781 if (repeat != NO_DISK_SPACE && repeat != QUOTA_EXCEEDED) {
784 if (repeat == QUOTA_EXCEEDED)
791 if (fs_changed(fs_gen, inode->i_sb)
792 && item_moved(&tmp_ih, &path)) {
797 if (indirect_item_found(retval, ih)) {
798 b_blocknr_t unfm_ptr;
800 * 'block'-th block is in the file already (there is
801 * corresponding cell in some indirect item). But it may be
802 * zero unformatted node pointer (hole)
804 unfm_ptr = get_block_num(item, pos_in_item);
806 /* use allocated block to plug the hole */
807 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);
808 if (fs_changed(fs_gen, inode->i_sb)
809 && item_moved(&tmp_ih, &path)) {
810 reiserfs_restore_prepared_buffer(inode->i_sb,
814 set_buffer_new(bh_result);
815 if (buffer_dirty(bh_result)
816 && reiserfs_data_ordered(inode->i_sb))
817 reiserfs_add_ordered_list(inode, bh_result);
818 put_block_num(item, pos_in_item, allocated_block_nr);
819 unfm_ptr = allocated_block_nr;
820 journal_mark_dirty(th, bh);
821 reiserfs_update_sd(th, inode);
823 set_block_dev_mapped(bh_result, unfm_ptr, inode);
827 retval = reiserfs_end_persistent_transaction(th);
829 reiserfs_write_unlock(inode->i_sb);
832 * the item was found, so new blocks were not added to the file
833 * there is no need to make sure the inode is updated with this
845 * desired position is not found or is in the direct item. We have
846 * to append file with holes up to 'block'-th block converting
847 * direct items to indirect one if necessary
851 if (is_statdata_le_ih(ih)) {
853 struct cpu_key tmp_key;
855 /* indirect item has to be inserted */
856 make_le_item_head(&tmp_ih, &key, version, 1,
857 TYPE_INDIRECT, UNFM_P_SIZE,
858 0 /* free_space */ );
861 * we are going to add 'block'-th block to the file.
862 * Use allocated block for that
864 if (cpu_key_k_offset(&key) == 1) {
865 unp = cpu_to_le32(allocated_block_nr);
866 set_block_dev_mapped(bh_result,
867 allocated_block_nr, inode);
868 set_buffer_new(bh_result);
871 tmp_key = key; /* ;) */
872 set_cpu_key_k_offset(&tmp_key, 1);
873 PATH_LAST_POSITION(&path)++;
876 reiserfs_insert_item(th, &path, &tmp_key, &tmp_ih,
877 inode, (char *)&unp);
879 reiserfs_free_block(th, inode,
880 allocated_block_nr, 1);
882 * retval == -ENOSPC, -EDQUOT or -EIO
887 } else if (is_direct_le_ih(ih)) {
888 /* direct item has to be converted */
892 ((le_ih_k_offset(ih) -
893 1) & ~(inode->i_sb->s_blocksize - 1)) + 1;
896 * direct item we just found fits into block we have
897 * to map. Convert it into unformatted node: use
898 * bh_result for the conversion
900 if (tail_offset == cpu_key_k_offset(&key)) {
901 set_block_dev_mapped(bh_result,
902 allocated_block_nr, inode);
907 * we have to pad file tail stored in direct
908 * item(s) up to block size and convert it
909 * to unformatted node. FIXME: this should
910 * also get into page cache
915 * ugly, but we can only end the transaction if
918 BUG_ON(!th->t_refcount);
919 if (th->t_refcount == 1) {
921 reiserfs_end_persistent_transaction
929 convert_tail_for_hole(inode, bh_result,
932 if (retval != -ENOSPC)
933 reiserfs_error(inode->i_sb,
935 "convert tail failed "
936 "inode %lu, error %d",
939 if (allocated_block_nr) {
941 * the bitmap, the super,
942 * and the stat data == 3
945 th = reiserfs_persistent_transaction(inode->i_sb, 3);
947 reiserfs_free_block(th,
957 direct2indirect(th, inode, &path, unbh,
960 reiserfs_unmap_buffer(unbh);
961 reiserfs_free_block(th, inode,
962 allocated_block_nr, 1);
966 * it is important the set_buffer_uptodate is done
967 * after the direct2indirect. The buffer might
968 * contain valid data newer than the data on disk
969 * (read by readpage, changed, and then sent here by
970 * writepage). direct2indirect needs to know if unbh
971 * was already up to date, so it can decide if the
972 * data in unbh needs to be replaced with data from
975 set_buffer_uptodate(unbh);
978 * unbh->b_page == NULL in case of DIRECT_IO request,
979 * this means buffer will disappear shortly, so it
980 * should not be added to
984 * we've converted the tail, so we must
985 * flush unbh before the transaction commits
987 reiserfs_add_tail_list(inode, unbh);
990 * mark it dirty now to prevent commit_write
991 * from adding this buffer to the inode's
995 * AKPM: changed __mark_buffer_dirty to
996 * mark_buffer_dirty(). It's still atomic,
997 * but it sets the page dirty too, which makes
998 * it eligible for writeback at any time by the
999 * VM (which was also the case with
1000 * __mark_buffer_dirty())
1002 mark_buffer_dirty(unbh);
1006 * append indirect item with holes if needed, when
1007 * appending pointer to 'block'-th block use block,
1008 * which is already allocated
1010 struct cpu_key tmp_key;
1012 * We use this in case we need to allocate
1013 * only one block which is a fastpath
1015 unp_t unf_single = 0;
1017 __u64 max_to_insert =
1018 MAX_ITEM_LEN(inode->i_sb->s_blocksize) /
1020 __u64 blocks_needed;
1022 RFALSE(pos_in_item != ih_item_len(ih) / UNFM_P_SIZE,
1023 "vs-804: invalid position for append");
1025 * indirect item has to be appended,
1026 * set up key of that position
1027 * (key type is unimportant)
1029 make_cpu_key(&tmp_key, inode,
1030 le_key_k_offset(version,
1033 inode->i_sb->s_blocksize),
1036 RFALSE(cpu_key_k_offset(&tmp_key) > cpu_key_k_offset(&key),
1037 "green-805: invalid offset");
1040 ((cpu_key_k_offset(&key) -
1041 cpu_key_k_offset(&tmp_key)) >> inode->i_sb->
1044 if (blocks_needed == 1) {
1047 un = kcalloc(min(blocks_needed, max_to_insert),
1048 UNFM_P_SIZE, GFP_NOFS);
1055 if (blocks_needed <= max_to_insert) {
1057 * we are going to add target block to
1058 * the file. Use allocated block for that
1060 un[blocks_needed - 1] =
1061 cpu_to_le32(allocated_block_nr);
1062 set_block_dev_mapped(bh_result,
1063 allocated_block_nr, inode);
1064 set_buffer_new(bh_result);
1067 /* paste hole to the indirect item */
1069 * If kmalloc failed, max_to_insert becomes
1070 * zero and it means we only have space for
1074 max_to_insert ? max_to_insert : 1;
1077 reiserfs_paste_into_item(th, &path, &tmp_key, inode,
1082 if (blocks_needed != 1)
1086 reiserfs_free_block(th, inode,
1087 allocated_block_nr, 1);
1092 * We need to mark new file size in case
1093 * this function will be interrupted/aborted
1094 * later on. And we may do this only for
1098 inode->i_sb->s_blocksize * blocks_needed;
1106 * this loop could log more blocks than we had originally
1107 * asked for. So, we have to allow the transaction to end
1108 * if it is too big or too full. Update the inode so things
1109 * are consistent if we crash before the function returns
1110 * release the path so that anybody waiting on the path before
1111 * ending their transaction will be able to continue.
1113 if (journal_transaction_should_end(th, th->t_blocks_allocated)) {
1114 retval = restart_transaction(th, inode, &path);
1119 * inserting indirect pointers for a hole can take a
1120 * long time. reschedule if needed and also release the write
1123 reiserfs_cond_resched(inode->i_sb);
1125 retval = search_for_position_by_key(inode->i_sb, &key, &path);
1126 if (retval == IO_ERROR) {
1130 if (retval == POSITION_FOUND) {
1131 reiserfs_warning(inode->i_sb, "vs-825",
1132 "%K should not be found", &key);
1134 if (allocated_block_nr)
1135 reiserfs_free_block(th, inode,
1136 allocated_block_nr, 1);
1140 bh = get_last_bh(&path);
1141 ih = tp_item_head(&path);
1142 item = tp_item_body(&path);
1143 pos_in_item = path.pos_in_item;
1149 if (th && (!dangle || (retval && !th->t_trans_id))) {
1152 reiserfs_update_sd(th, inode);
1153 err = reiserfs_end_persistent_transaction(th);
1158 reiserfs_write_unlock(inode->i_sb);
1159 reiserfs_check_path(&path);
1164 reiserfs_readpages(struct file *file, struct address_space *mapping,
1165 struct list_head *pages, unsigned nr_pages)
1167 return mpage_readpages(mapping, pages, nr_pages, reiserfs_get_block);
1171 * Compute real number of used bytes by file
1172 * Following three functions can go away when we'll have enough space in
1175 static int real_space_diff(struct inode *inode, int sd_size)
1178 loff_t blocksize = inode->i_sb->s_blocksize;
1180 if (S_ISLNK(inode->i_mode) || S_ISDIR(inode->i_mode))
1184 * End of file is also in full block with indirect reference, so round
1185 * up to the next block.
1187 * there is just no way to know if the tail is actually packed
1188 * on the file, so we have to assume it isn't. When we pack the
1189 * tail, we add 4 bytes to pretend there really is an unformatted
1194 (blocksize - 1)) >> inode->i_sb->s_blocksize_bits) * UNFM_P_SIZE +
1199 static inline loff_t to_real_used_space(struct inode *inode, ulong blocks,
1202 if (S_ISLNK(inode->i_mode) || S_ISDIR(inode->i_mode)) {
1203 return inode->i_size +
1204 (loff_t) (real_space_diff(inode, sd_size));
1206 return ((loff_t) real_space_diff(inode, sd_size)) +
1207 (((loff_t) blocks) << 9);
1210 /* Compute number of blocks used by file in ReiserFS counting */
1211 static inline ulong to_fake_used_blocks(struct inode *inode, int sd_size)
1213 loff_t bytes = inode_get_bytes(inode);
1214 loff_t real_space = real_space_diff(inode, sd_size);
1216 /* keeps fsck and non-quota versions of reiserfs happy */
1217 if (S_ISLNK(inode->i_mode) || S_ISDIR(inode->i_mode)) {
1218 bytes += (loff_t) 511;
1222 * files from before the quota patch might i_blocks such that
1223 * bytes < real_space. Deal with that here to prevent it from
1226 if (bytes < real_space)
1228 return (bytes - real_space) >> 9;
1232 * BAD: new directories have stat data of new type and all other items
1233 * of old type. Version stored in the inode says about body items, so
1234 * in update_stat_data we can not rely on inode, but have to check
1235 * item version directly
1238 /* called by read_locked_inode */
1239 static void init_inode(struct inode *inode, struct treepath *path)
1241 struct buffer_head *bh;
1242 struct item_head *ih;
1245 bh = PATH_PLAST_BUFFER(path);
1246 ih = tp_item_head(path);
1248 copy_key(INODE_PKEY(inode), &ih->ih_key);
1250 INIT_LIST_HEAD(&REISERFS_I(inode)->i_prealloc_list);
1251 REISERFS_I(inode)->i_flags = 0;
1252 REISERFS_I(inode)->i_prealloc_block = 0;
1253 REISERFS_I(inode)->i_prealloc_count = 0;
1254 REISERFS_I(inode)->i_trans_id = 0;
1255 REISERFS_I(inode)->i_jl = NULL;
1256 reiserfs_init_xattr_rwsem(inode);
1258 if (stat_data_v1(ih)) {
1259 struct stat_data_v1 *sd =
1260 (struct stat_data_v1 *)ih_item_body(bh, ih);
1261 unsigned long blocks;
1263 set_inode_item_key_version(inode, KEY_FORMAT_3_5);
1264 set_inode_sd_version(inode, STAT_DATA_V1);
1265 inode->i_mode = sd_v1_mode(sd);
1266 set_nlink(inode, sd_v1_nlink(sd));
1267 i_uid_write(inode, sd_v1_uid(sd));
1268 i_gid_write(inode, sd_v1_gid(sd));
1269 inode->i_size = sd_v1_size(sd);
1270 inode->i_atime.tv_sec = sd_v1_atime(sd);
1271 inode->i_mtime.tv_sec = sd_v1_mtime(sd);
1272 inode->i_ctime.tv_sec = sd_v1_ctime(sd);
1273 inode->i_atime.tv_nsec = 0;
1274 inode->i_ctime.tv_nsec = 0;
1275 inode->i_mtime.tv_nsec = 0;
1277 inode->i_blocks = sd_v1_blocks(sd);
1278 inode->i_generation = le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1279 blocks = (inode->i_size + 511) >> 9;
1280 blocks = _ROUND_UP(blocks, inode->i_sb->s_blocksize >> 9);
1283 * there was a bug in <=3.5.23 when i_blocks could take
1284 * negative values. Starting from 3.5.17 this value could
1285 * even be stored in stat data. For such files we set
1286 * i_blocks based on file size. Just 2 notes: this can be
1287 * wrong for sparse files. On-disk value will be only
1288 * updated if file's inode will ever change
1290 if (inode->i_blocks > blocks) {
1291 inode->i_blocks = blocks;
1294 rdev = sd_v1_rdev(sd);
1295 REISERFS_I(inode)->i_first_direct_byte =
1296 sd_v1_first_direct_byte(sd);
1299 * an early bug in the quota code can give us an odd
1300 * number for the block count. This is incorrect, fix it here.
1302 if (inode->i_blocks & 1) {
1305 inode_set_bytes(inode,
1306 to_real_used_space(inode, inode->i_blocks,
1309 * nopack is initially zero for v1 objects. For v2 objects,
1310 * nopack is initialised from sd_attrs
1312 REISERFS_I(inode)->i_flags &= ~i_nopack_mask;
1315 * new stat data found, but object may have old items
1316 * (directories and symlinks)
1318 struct stat_data *sd = (struct stat_data *)ih_item_body(bh, ih);
1320 inode->i_mode = sd_v2_mode(sd);
1321 set_nlink(inode, sd_v2_nlink(sd));
1322 i_uid_write(inode, sd_v2_uid(sd));
1323 inode->i_size = sd_v2_size(sd);
1324 i_gid_write(inode, sd_v2_gid(sd));
1325 inode->i_mtime.tv_sec = sd_v2_mtime(sd);
1326 inode->i_atime.tv_sec = sd_v2_atime(sd);
1327 inode->i_ctime.tv_sec = sd_v2_ctime(sd);
1328 inode->i_ctime.tv_nsec = 0;
1329 inode->i_mtime.tv_nsec = 0;
1330 inode->i_atime.tv_nsec = 0;
1331 inode->i_blocks = sd_v2_blocks(sd);
1332 rdev = sd_v2_rdev(sd);
1333 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
1334 inode->i_generation =
1335 le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1337 inode->i_generation = sd_v2_generation(sd);
1339 if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode))
1340 set_inode_item_key_version(inode, KEY_FORMAT_3_5);
1342 set_inode_item_key_version(inode, KEY_FORMAT_3_6);
1343 REISERFS_I(inode)->i_first_direct_byte = 0;
1344 set_inode_sd_version(inode, STAT_DATA_V2);
1345 inode_set_bytes(inode,
1346 to_real_used_space(inode, inode->i_blocks,
1349 * read persistent inode attributes from sd and initialise
1350 * generic inode flags from them
1352 REISERFS_I(inode)->i_attrs = sd_v2_attrs(sd);
1353 sd_attrs_to_i_attrs(sd_v2_attrs(sd), inode);
1357 if (S_ISREG(inode->i_mode)) {
1358 inode->i_op = &reiserfs_file_inode_operations;
1359 inode->i_fop = &reiserfs_file_operations;
1360 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
1361 } else if (S_ISDIR(inode->i_mode)) {
1362 inode->i_op = &reiserfs_dir_inode_operations;
1363 inode->i_fop = &reiserfs_dir_operations;
1364 } else if (S_ISLNK(inode->i_mode)) {
1365 inode->i_op = &reiserfs_symlink_inode_operations;
1366 inode_nohighmem(inode);
1367 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
1369 inode->i_blocks = 0;
1370 inode->i_op = &reiserfs_special_inode_operations;
1371 init_special_inode(inode, inode->i_mode, new_decode_dev(rdev));
1375 /* update new stat data with inode fields */
1376 static void inode2sd(void *sd, struct inode *inode, loff_t size)
1378 struct stat_data *sd_v2 = (struct stat_data *)sd;
1380 set_sd_v2_mode(sd_v2, inode->i_mode);
1381 set_sd_v2_nlink(sd_v2, inode->i_nlink);
1382 set_sd_v2_uid(sd_v2, i_uid_read(inode));
1383 set_sd_v2_size(sd_v2, size);
1384 set_sd_v2_gid(sd_v2, i_gid_read(inode));
1385 set_sd_v2_mtime(sd_v2, inode->i_mtime.tv_sec);
1386 set_sd_v2_atime(sd_v2, inode->i_atime.tv_sec);
1387 set_sd_v2_ctime(sd_v2, inode->i_ctime.tv_sec);
1388 set_sd_v2_blocks(sd_v2, to_fake_used_blocks(inode, SD_V2_SIZE));
1389 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
1390 set_sd_v2_rdev(sd_v2, new_encode_dev(inode->i_rdev));
1392 set_sd_v2_generation(sd_v2, inode->i_generation);
1393 set_sd_v2_attrs(sd_v2, REISERFS_I(inode)->i_attrs);
1396 /* used to copy inode's fields to old stat data */
1397 static void inode2sd_v1(void *sd, struct inode *inode, loff_t size)
1399 struct stat_data_v1 *sd_v1 = (struct stat_data_v1 *)sd;
1401 set_sd_v1_mode(sd_v1, inode->i_mode);
1402 set_sd_v1_uid(sd_v1, i_uid_read(inode));
1403 set_sd_v1_gid(sd_v1, i_gid_read(inode));
1404 set_sd_v1_nlink(sd_v1, inode->i_nlink);
1405 set_sd_v1_size(sd_v1, size);
1406 set_sd_v1_atime(sd_v1, inode->i_atime.tv_sec);
1407 set_sd_v1_ctime(sd_v1, inode->i_ctime.tv_sec);
1408 set_sd_v1_mtime(sd_v1, inode->i_mtime.tv_sec);
1410 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
1411 set_sd_v1_rdev(sd_v1, new_encode_dev(inode->i_rdev));
1413 set_sd_v1_blocks(sd_v1, to_fake_used_blocks(inode, SD_V1_SIZE));
1415 /* Sigh. i_first_direct_byte is back */
1416 set_sd_v1_first_direct_byte(sd_v1,
1417 REISERFS_I(inode)->i_first_direct_byte);
1421 * NOTE, you must prepare the buffer head before sending it here,
1422 * and then log it after the call
1424 static void update_stat_data(struct treepath *path, struct inode *inode,
1427 struct buffer_head *bh;
1428 struct item_head *ih;
1430 bh = PATH_PLAST_BUFFER(path);
1431 ih = tp_item_head(path);
1433 if (!is_statdata_le_ih(ih))
1434 reiserfs_panic(inode->i_sb, "vs-13065", "key %k, found item %h",
1435 INODE_PKEY(inode), ih);
1437 /* path points to old stat data */
1438 if (stat_data_v1(ih)) {
1439 inode2sd_v1(ih_item_body(bh, ih), inode, size);
1441 inode2sd(ih_item_body(bh, ih), inode, size);
1447 void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
1448 struct inode *inode, loff_t size)
1451 INITIALIZE_PATH(path);
1452 struct buffer_head *bh;
1454 struct item_head *ih, tmp_ih;
1457 BUG_ON(!th->t_trans_id);
1459 /* key type is unimportant */
1460 make_cpu_key(&key, inode, SD_OFFSET, TYPE_STAT_DATA, 3);
1464 /* look for the object's stat data */
1465 retval = search_item(inode->i_sb, &key, &path);
1466 if (retval == IO_ERROR) {
1467 reiserfs_error(inode->i_sb, "vs-13050",
1468 "i/o failure occurred trying to "
1469 "update %K stat data", &key);
1472 if (retval == ITEM_NOT_FOUND) {
1473 pos = PATH_LAST_POSITION(&path);
1475 if (inode->i_nlink == 0) {
1476 /*reiserfs_warning (inode->i_sb, "vs-13050: reiserfs_update_sd: i_nlink == 0, stat data not found"); */
1479 reiserfs_warning(inode->i_sb, "vs-13060",
1480 "stat data of object %k (nlink == %d) "
1481 "not found (pos %d)",
1482 INODE_PKEY(inode), inode->i_nlink,
1484 reiserfs_check_path(&path);
1489 * sigh, prepare_for_journal might schedule. When it
1490 * schedules the FS might change. We have to detect that,
1491 * and loop back to the search if the stat data item has moved
1493 bh = get_last_bh(&path);
1494 ih = tp_item_head(&path);
1495 copy_item_head(&tmp_ih, ih);
1496 fs_gen = get_generation(inode->i_sb);
1497 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);
1499 /* Stat_data item has been moved after scheduling. */
1500 if (fs_changed(fs_gen, inode->i_sb)
1501 && item_moved(&tmp_ih, &path)) {
1502 reiserfs_restore_prepared_buffer(inode->i_sb, bh);
1507 update_stat_data(&path, inode, size);
1508 journal_mark_dirty(th, bh);
1514 * reiserfs_read_locked_inode is called to read the inode off disk, and it
1515 * does a make_bad_inode when things go wrong. But, we need to make sure
1516 * and clear the key in the private portion of the inode, otherwise a
1517 * corresponding iput might try to delete whatever object the inode last
1520 static void reiserfs_make_bad_inode(struct inode *inode)
1522 memset(INODE_PKEY(inode), 0, KEY_SIZE);
1523 make_bad_inode(inode);
1527 * initially this function was derived from minix or ext2's analog and
1528 * evolved as the prototype did
1530 int reiserfs_init_locked_inode(struct inode *inode, void *p)
1532 struct reiserfs_iget_args *args = (struct reiserfs_iget_args *)p;
1533 inode->i_ino = args->objectid;
1534 INODE_PKEY(inode)->k_dir_id = cpu_to_le32(args->dirid);
1539 * looks for stat data in the tree, and fills up the fields of in-core
1540 * inode stat data fields
1542 void reiserfs_read_locked_inode(struct inode *inode,
1543 struct reiserfs_iget_args *args)
1545 INITIALIZE_PATH(path_to_sd);
1547 unsigned long dirino;
1550 dirino = args->dirid;
1553 * set version 1, version 2 could be used too, because stat data
1554 * key is the same in both versions
1556 _make_cpu_key(&key, KEY_FORMAT_3_5, dirino, inode->i_ino, 0, 0, 3);
1558 /* look for the object's stat data */
1559 retval = search_item(inode->i_sb, &key, &path_to_sd);
1560 if (retval == IO_ERROR) {
1561 reiserfs_error(inode->i_sb, "vs-13070",
1562 "i/o failure occurred trying to find "
1563 "stat data of %K", &key);
1564 reiserfs_make_bad_inode(inode);
1568 /* a stale NFS handle can trigger this without it being an error */
1569 if (retval != ITEM_FOUND) {
1570 pathrelse(&path_to_sd);
1571 reiserfs_make_bad_inode(inode);
1576 init_inode(inode, &path_to_sd);
1579 * It is possible that knfsd is trying to access inode of a file
1580 * that is being removed from the disk by some other thread. As we
1581 * update sd on unlink all that is required is to check for nlink
1582 * here. This bug was first found by Sizif when debugging
1583 * SquidNG/Butterfly, forgotten, and found again after Philippe
1584 * Gramoulle <philippe.gramoulle@mmania.com> reproduced it.
1586 * More logical fix would require changes in fs/inode.c:iput() to
1587 * remove inode from hash-table _after_ fs cleaned disk stuff up and
1588 * in iget() to return NULL if I_FREEING inode is found in
1593 * Currently there is one place where it's ok to meet inode with
1594 * nlink==0: processing of open-unlinked and half-truncated files
1595 * during mount (fs/reiserfs/super.c:finish_unfinished()).
1597 if ((inode->i_nlink == 0) &&
1598 !REISERFS_SB(inode->i_sb)->s_is_unlinked_ok) {
1599 reiserfs_warning(inode->i_sb, "vs-13075",
1600 "dead inode read from disk %K. "
1601 "This is likely to be race with knfsd. Ignore",
1603 reiserfs_make_bad_inode(inode);
1606 /* init inode should be relsing */
1607 reiserfs_check_path(&path_to_sd);
1610 * Stat data v1 doesn't support ACLs.
1612 if (get_inode_sd_version(inode) == STAT_DATA_V1)
1613 cache_no_acl(inode);
1617 * reiserfs_find_actor() - "find actor" reiserfs supplies to iget5_locked().
1619 * @inode: inode from hash table to check
1620 * @opaque: "cookie" passed to iget5_locked(). This is &reiserfs_iget_args.
1622 * This function is called by iget5_locked() to distinguish reiserfs inodes
1623 * having the same inode numbers. Such inodes can only exist due to some
1624 * error condition. One of them should be bad. Inodes with identical
1625 * inode numbers (objectids) are distinguished by parent directory ids.
1628 int reiserfs_find_actor(struct inode *inode, void *opaque)
1630 struct reiserfs_iget_args *args;
1633 /* args is already in CPU order */
1634 return (inode->i_ino == args->objectid) &&
1635 (le32_to_cpu(INODE_PKEY(inode)->k_dir_id) == args->dirid);
1638 struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key)
1640 struct inode *inode;
1641 struct reiserfs_iget_args args;
1644 args.objectid = key->on_disk_key.k_objectid;
1645 args.dirid = key->on_disk_key.k_dir_id;
1646 depth = reiserfs_write_unlock_nested(s);
1647 inode = iget5_locked(s, key->on_disk_key.k_objectid,
1648 reiserfs_find_actor, reiserfs_init_locked_inode,
1650 reiserfs_write_lock_nested(s, depth);
1652 return ERR_PTR(-ENOMEM);
1654 if (inode->i_state & I_NEW) {
1655 reiserfs_read_locked_inode(inode, &args);
1656 unlock_new_inode(inode);
1659 if (comp_short_keys(INODE_PKEY(inode), key) || is_bad_inode(inode)) {
1660 /* either due to i/o error or a stale NFS handle */
1667 static struct dentry *reiserfs_get_dentry(struct super_block *sb,
1668 u32 objectid, u32 dir_id, u32 generation)
1672 struct inode *inode;
1674 key.on_disk_key.k_objectid = objectid;
1675 key.on_disk_key.k_dir_id = dir_id;
1676 reiserfs_write_lock(sb);
1677 inode = reiserfs_iget(sb, &key);
1678 if (inode && !IS_ERR(inode) && generation != 0 &&
1679 generation != inode->i_generation) {
1683 reiserfs_write_unlock(sb);
1685 return d_obtain_alias(inode);
1688 struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
1689 int fh_len, int fh_type)
1692 * fhtype happens to reflect the number of u32s encoded.
1693 * due to a bug in earlier code, fhtype might indicate there
1694 * are more u32s then actually fitted.
1695 * so if fhtype seems to be more than len, reduce fhtype.
1697 * 2 - objectid + dir_id - legacy support
1698 * 3 - objectid + dir_id + generation
1699 * 4 - objectid + dir_id + objectid and dirid of parent - legacy
1700 * 5 - objectid + dir_id + generation + objectid and dirid of parent
1701 * 6 - as above plus generation of directory
1702 * 6 does not fit in NFSv2 handles
1704 if (fh_type > fh_len) {
1705 if (fh_type != 6 || fh_len != 5)
1706 reiserfs_warning(sb, "reiserfs-13077",
1707 "nfsd/reiserfs, fhtype=%d, len=%d - odd",
1714 return reiserfs_get_dentry(sb, fid->raw[0], fid->raw[1],
1715 (fh_type == 3 || fh_type >= 5) ? fid->raw[2] : 0);
1718 struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
1719 int fh_len, int fh_type)
1721 if (fh_type > fh_len)
1726 return reiserfs_get_dentry(sb,
1727 (fh_type >= 5) ? fid->raw[3] : fid->raw[2],
1728 (fh_type >= 5) ? fid->raw[4] : fid->raw[3],
1729 (fh_type == 6) ? fid->raw[5] : 0);
1732 int reiserfs_encode_fh(struct inode *inode, __u32 * data, int *lenp,
1733 struct inode *parent)
1737 if (parent && (maxlen < 5)) {
1739 return FILEID_INVALID;
1740 } else if (maxlen < 3) {
1742 return FILEID_INVALID;
1745 data[0] = inode->i_ino;
1746 data[1] = le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1747 data[2] = inode->i_generation;
1750 data[3] = parent->i_ino;
1751 data[4] = le32_to_cpu(INODE_PKEY(parent)->k_dir_id);
1754 data[5] = parent->i_generation;
1762 * looks for stat data, then copies fields to it, marks the buffer
1763 * containing stat data as dirty
1766 * reiserfs inodes are never really dirty, since the dirty inode call
1767 * always logs them. This call allows the VFS inode marking routines
1768 * to properly mark inodes for datasync and such, but only actually
1769 * does something when called for a synchronous update.
1771 int reiserfs_write_inode(struct inode *inode, struct writeback_control *wbc)
1773 struct reiserfs_transaction_handle th;
1774 int jbegin_count = 1;
1776 if (sb_rdonly(inode->i_sb))
1779 * memory pressure can sometimes initiate write_inode calls with
1781 * these cases are just when the system needs ram, not when the
1782 * inode needs to reach disk for safety, and they can safely be
1783 * ignored because the altered inode has already been logged.
1785 if (wbc->sync_mode == WB_SYNC_ALL && !(current->flags & PF_MEMALLOC)) {
1786 reiserfs_write_lock(inode->i_sb);
1787 if (!journal_begin(&th, inode->i_sb, jbegin_count)) {
1788 reiserfs_update_sd(&th, inode);
1789 journal_end_sync(&th);
1791 reiserfs_write_unlock(inode->i_sb);
1797 * stat data of new object is inserted already, this inserts the item
1798 * containing "." and ".." entries
1800 static int reiserfs_new_directory(struct reiserfs_transaction_handle *th,
1801 struct inode *inode,
1802 struct item_head *ih, struct treepath *path,
1805 struct super_block *sb = th->t_super;
1806 char empty_dir[EMPTY_DIR_SIZE];
1807 char *body = empty_dir;
1811 BUG_ON(!th->t_trans_id);
1813 _make_cpu_key(&key, KEY_FORMAT_3_5, le32_to_cpu(ih->ih_key.k_dir_id),
1814 le32_to_cpu(ih->ih_key.k_objectid), DOT_OFFSET,
1815 TYPE_DIRENTRY, 3 /*key length */ );
1818 * compose item head for new item. Directories consist of items of
1819 * old type (ITEM_VERSION_1). Do not set key (second arg is 0), it
1820 * is done by reiserfs_new_inode
1822 if (old_format_only(sb)) {
1823 make_le_item_head(ih, NULL, KEY_FORMAT_3_5, DOT_OFFSET,
1824 TYPE_DIRENTRY, EMPTY_DIR_SIZE_V1, 2);
1826 make_empty_dir_item_v1(body, ih->ih_key.k_dir_id,
1827 ih->ih_key.k_objectid,
1828 INODE_PKEY(dir)->k_dir_id,
1829 INODE_PKEY(dir)->k_objectid);
1831 make_le_item_head(ih, NULL, KEY_FORMAT_3_5, DOT_OFFSET,
1832 TYPE_DIRENTRY, EMPTY_DIR_SIZE, 2);
1834 make_empty_dir_item(body, ih->ih_key.k_dir_id,
1835 ih->ih_key.k_objectid,
1836 INODE_PKEY(dir)->k_dir_id,
1837 INODE_PKEY(dir)->k_objectid);
1840 /* look for place in the tree for new item */
1841 retval = search_item(sb, &key, path);
1842 if (retval == IO_ERROR) {
1843 reiserfs_error(sb, "vs-13080",
1844 "i/o failure occurred creating new directory");
1847 if (retval == ITEM_FOUND) {
1849 reiserfs_warning(sb, "vs-13070",
1850 "object with this key exists (%k)",
1855 /* insert item, that is empty directory item */
1856 return reiserfs_insert_item(th, path, &key, ih, inode, body);
1860 * stat data of object has been inserted, this inserts the item
1861 * containing the body of symlink
1863 static int reiserfs_new_symlink(struct reiserfs_transaction_handle *th,
1864 struct inode *inode,
1865 struct item_head *ih,
1866 struct treepath *path, const char *symname,
1869 struct super_block *sb = th->t_super;
1873 BUG_ON(!th->t_trans_id);
1875 _make_cpu_key(&key, KEY_FORMAT_3_5,
1876 le32_to_cpu(ih->ih_key.k_dir_id),
1877 le32_to_cpu(ih->ih_key.k_objectid),
1878 1, TYPE_DIRECT, 3 /*key length */ );
1880 make_le_item_head(ih, NULL, KEY_FORMAT_3_5, 1, TYPE_DIRECT, item_len,
1881 0 /*free_space */ );
1883 /* look for place in the tree for new item */
1884 retval = search_item(sb, &key, path);
1885 if (retval == IO_ERROR) {
1886 reiserfs_error(sb, "vs-13080",
1887 "i/o failure occurred creating new symlink");
1890 if (retval == ITEM_FOUND) {
1892 reiserfs_warning(sb, "vs-13080",
1893 "object with this key exists (%k)",
1898 /* insert item, that is body of symlink */
1899 return reiserfs_insert_item(th, path, &key, ih, inode, symname);
1903 * inserts the stat data into the tree, and then calls
1904 * reiserfs_new_directory (to insert ".", ".." item if new object is
1905 * directory) or reiserfs_new_symlink (to insert symlink body if new
1906 * object is symlink) or nothing (if new object is regular file)
1908 * NOTE! uid and gid must already be set in the inode. If we return
1909 * non-zero due to an error, we have to drop the quota previously allocated
1910 * for the fresh inode. This can only be done outside a transaction, so
1911 * if we return non-zero, we also end the transaction.
1913 * @th: active transaction handle
1914 * @dir: parent directory for new inode
1915 * @mode: mode of new inode
1916 * @symname: symlink contents if inode is symlink
1917 * @isize: 0 for regular file, EMPTY_DIR_SIZE for dirs, strlen(symname) for
1919 * @inode: inode to be filled
1920 * @security: optional security context to associate with this inode
1922 int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
1923 struct inode *dir, umode_t mode, const char *symname,
1924 /* 0 for regular, EMTRY_DIR_SIZE for dirs,
1925 strlen (symname) for symlinks) */
1926 loff_t i_size, struct dentry *dentry,
1927 struct inode *inode,
1928 struct reiserfs_security_handle *security)
1930 struct super_block *sb = dir->i_sb;
1931 struct reiserfs_iget_args args;
1932 INITIALIZE_PATH(path_to_key);
1934 struct item_head ih;
1935 struct stat_data sd;
1940 BUG_ON(!th->t_trans_id);
1942 depth = reiserfs_write_unlock_nested(sb);
1943 err = dquot_alloc_inode(inode);
1944 reiserfs_write_lock_nested(sb, depth);
1947 if (!dir->i_nlink) {
1952 /* item head of new item */
1953 ih.ih_key.k_dir_id = reiserfs_choose_packing(dir);
1954 ih.ih_key.k_objectid = cpu_to_le32(reiserfs_get_unused_objectid(th));
1955 if (!ih.ih_key.k_objectid) {
1959 args.objectid = inode->i_ino = le32_to_cpu(ih.ih_key.k_objectid);
1960 if (old_format_only(sb))
1961 make_le_item_head(&ih, NULL, KEY_FORMAT_3_5, SD_OFFSET,
1962 TYPE_STAT_DATA, SD_V1_SIZE, MAX_US_INT);
1964 make_le_item_head(&ih, NULL, KEY_FORMAT_3_6, SD_OFFSET,
1965 TYPE_STAT_DATA, SD_SIZE, MAX_US_INT);
1966 memcpy(INODE_PKEY(inode), &ih.ih_key, KEY_SIZE);
1967 args.dirid = le32_to_cpu(ih.ih_key.k_dir_id);
1969 depth = reiserfs_write_unlock_nested(inode->i_sb);
1970 err = insert_inode_locked4(inode, args.objectid,
1971 reiserfs_find_actor, &args);
1972 reiserfs_write_lock_nested(inode->i_sb, depth);
1978 if (old_format_only(sb))
1980 * not a perfect generation count, as object ids can be reused,
1981 * but this is as good as reiserfs can do right now.
1982 * note that the private part of inode isn't filled in yet,
1983 * we have to use the directory.
1985 inode->i_generation = le32_to_cpu(INODE_PKEY(dir)->k_objectid);
1987 #if defined( USE_INODE_GENERATION_COUNTER )
1988 inode->i_generation =
1989 le32_to_cpu(REISERFS_SB(sb)->s_rs->s_inode_generation);
1991 inode->i_generation = ++event;
1994 /* fill stat data */
1995 set_nlink(inode, (S_ISDIR(mode) ? 2 : 1));
1997 /* uid and gid must already be set by the caller for quota init */
1999 inode->i_mtime = inode->i_atime = inode->i_ctime = current_time(inode);
2000 inode->i_size = i_size;
2001 inode->i_blocks = 0;
2003 REISERFS_I(inode)->i_first_direct_byte = S_ISLNK(mode) ? 1 :
2004 U32_MAX /*NO_BYTES_IN_DIRECT_ITEM */ ;
2006 INIT_LIST_HEAD(&REISERFS_I(inode)->i_prealloc_list);
2007 REISERFS_I(inode)->i_flags = 0;
2008 REISERFS_I(inode)->i_prealloc_block = 0;
2009 REISERFS_I(inode)->i_prealloc_count = 0;
2010 REISERFS_I(inode)->i_trans_id = 0;
2011 REISERFS_I(inode)->i_jl = NULL;
2012 REISERFS_I(inode)->i_attrs =
2013 REISERFS_I(dir)->i_attrs & REISERFS_INHERIT_MASK;
2014 sd_attrs_to_i_attrs(REISERFS_I(inode)->i_attrs, inode);
2015 reiserfs_init_xattr_rwsem(inode);
2017 /* key to search for correct place for new stat data */
2018 _make_cpu_key(&key, KEY_FORMAT_3_6, le32_to_cpu(ih.ih_key.k_dir_id),
2019 le32_to_cpu(ih.ih_key.k_objectid), SD_OFFSET,
2020 TYPE_STAT_DATA, 3 /*key length */ );
2022 /* find proper place for inserting of stat data */
2023 retval = search_item(sb, &key, &path_to_key);
2024 if (retval == IO_ERROR) {
2028 if (retval == ITEM_FOUND) {
2029 pathrelse(&path_to_key);
2033 if (old_format_only(sb)) {
2034 /* i_uid or i_gid is too big to be stored in stat data v3.5 */
2035 if (i_uid_read(inode) & ~0xffff || i_gid_read(inode) & ~0xffff) {
2036 pathrelse(&path_to_key);
2040 inode2sd_v1(&sd, inode, inode->i_size);
2042 inode2sd(&sd, inode, inode->i_size);
2045 * store in in-core inode the key of stat data and version all
2046 * object items will have (directory items will have old offset
2047 * format, other new objects will consist of new items)
2049 if (old_format_only(sb) || S_ISDIR(mode) || S_ISLNK(mode))
2050 set_inode_item_key_version(inode, KEY_FORMAT_3_5);
2052 set_inode_item_key_version(inode, KEY_FORMAT_3_6);
2053 if (old_format_only(sb))
2054 set_inode_sd_version(inode, STAT_DATA_V1);
2056 set_inode_sd_version(inode, STAT_DATA_V2);
2058 /* insert the stat data into the tree */
2059 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
2060 if (REISERFS_I(dir)->new_packing_locality)
2061 th->displace_new_blocks = 1;
2064 reiserfs_insert_item(th, &path_to_key, &key, &ih, inode,
2068 reiserfs_check_path(&path_to_key);
2071 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
2072 if (!th->displace_new_blocks)
2073 REISERFS_I(dir)->new_packing_locality = 0;
2075 if (S_ISDIR(mode)) {
2076 /* insert item with "." and ".." */
2078 reiserfs_new_directory(th, inode, &ih, &path_to_key, dir);
2081 if (S_ISLNK(mode)) {
2082 /* insert body of symlink */
2083 if (!old_format_only(sb))
2084 i_size = ROUND_UP(i_size);
2086 reiserfs_new_symlink(th, inode, &ih, &path_to_key, symname,
2091 reiserfs_check_path(&path_to_key);
2093 goto out_inserted_sd;
2097 * Mark it private if we're creating the privroot
2098 * or something under it.
2100 if (IS_PRIVATE(dir) || dentry == REISERFS_SB(sb)->priv_root) {
2101 inode->i_flags |= S_PRIVATE;
2102 inode->i_opflags &= ~IOP_XATTR;
2105 if (reiserfs_posixacl(inode->i_sb)) {
2106 reiserfs_write_unlock(inode->i_sb);
2107 retval = reiserfs_inherit_default_acl(th, dir, dentry, inode);
2108 reiserfs_write_lock(inode->i_sb);
2111 reiserfs_check_path(&path_to_key);
2113 goto out_inserted_sd;
2115 } else if (inode->i_sb->s_flags & SB_POSIXACL) {
2116 reiserfs_warning(inode->i_sb, "jdm-13090",
2117 "ACLs aren't enabled in the fs, "
2118 "but vfs thinks they are!");
2121 if (security->name) {
2122 reiserfs_write_unlock(inode->i_sb);
2123 retval = reiserfs_security_write(th, inode, security);
2124 reiserfs_write_lock(inode->i_sb);
2127 reiserfs_check_path(&path_to_key);
2128 retval = journal_end(th);
2131 goto out_inserted_sd;
2135 reiserfs_update_sd(th, inode);
2136 reiserfs_check_path(&path_to_key);
2141 /* Invalidate the object, nothing was inserted yet */
2142 INODE_PKEY(inode)->k_objectid = 0;
2144 /* Quota change must be inside a transaction for journaling */
2145 depth = reiserfs_write_unlock_nested(inode->i_sb);
2146 dquot_free_inode(inode);
2147 reiserfs_write_lock_nested(inode->i_sb, depth);
2152 * Drop can be outside and it needs more credits so it's better
2153 * to have it outside
2155 depth = reiserfs_write_unlock_nested(inode->i_sb);
2157 reiserfs_write_lock_nested(inode->i_sb, depth);
2158 inode->i_flags |= S_NOQUOTA;
2159 make_bad_inode(inode);
2163 th->t_trans_id = 0; /* so the caller can't use this handle later */
2164 if (inode->i_state & I_NEW)
2165 unlock_new_inode(inode);
2171 * finds the tail page in the page cache,
2172 * reads the last block in.
2174 * On success, page_result is set to a locked, pinned page, and bh_result
2175 * is set to an up to date buffer for the last block in the file. returns 0.
2177 * tail conversion is not done, so bh_result might not be valid for writing
2178 * check buffer_mapped(bh_result) and bh_result->b_blocknr != 0 before
2179 * trying to write the block.
2181 * on failure, nonzero is returned, page_result and bh_result are untouched.
2183 static int grab_tail_page(struct inode *inode,
2184 struct page **page_result,
2185 struct buffer_head **bh_result)
2189 * we want the page with the last byte in the file,
2190 * not the page that will hold the next byte for appending
2192 unsigned long index = (inode->i_size - 1) >> PAGE_SHIFT;
2193 unsigned long pos = 0;
2194 unsigned long start = 0;
2195 unsigned long blocksize = inode->i_sb->s_blocksize;
2196 unsigned long offset = (inode->i_size) & (PAGE_SIZE - 1);
2197 struct buffer_head *bh;
2198 struct buffer_head *head;
2203 * we know that we are only called with inode->i_size > 0.
2204 * we also know that a file tail can never be as big as a block
2205 * If i_size % blocksize == 0, our file is currently block aligned
2206 * and it won't need converting or zeroing after a truncate.
2208 if ((offset & (blocksize - 1)) == 0) {
2211 page = grab_cache_page(inode->i_mapping, index);
2216 /* start within the page of the last block in the file */
2217 start = (offset / blocksize) * blocksize;
2219 error = __block_write_begin(page, start, offset - start,
2220 reiserfs_get_block_create_0);
2224 head = page_buffers(page);
2230 bh = bh->b_this_page;
2232 } while (bh != head);
2234 if (!buffer_uptodate(bh)) {
2236 * note, this should never happen, prepare_write should be
2237 * taking care of this for us. If the buffer isn't up to
2238 * date, I've screwed up the code to find the buffer, or the
2239 * code to call prepare_write
2241 reiserfs_error(inode->i_sb, "clm-6000",
2242 "error reading block %lu", bh->b_blocknr);
2247 *page_result = page;
2259 * vfs version of truncate file. Must NOT be called with
2260 * a transaction already started.
2262 * some code taken from block_truncate_page
2264 int reiserfs_truncate_file(struct inode *inode, int update_timestamps)
2266 struct reiserfs_transaction_handle th;
2267 /* we want the offset for the first byte after the end of the file */
2268 unsigned long offset = inode->i_size & (PAGE_SIZE - 1);
2269 unsigned blocksize = inode->i_sb->s_blocksize;
2271 struct page *page = NULL;
2273 struct buffer_head *bh = NULL;
2276 reiserfs_write_lock(inode->i_sb);
2278 if (inode->i_size > 0) {
2279 error = grab_tail_page(inode, &page, &bh);
2282 * -ENOENT means we truncated past the end of the
2283 * file, and get_block_create_0 could not find a
2284 * block to read in, which is ok.
2286 if (error != -ENOENT)
2287 reiserfs_error(inode->i_sb, "clm-6001",
2288 "grab_tail_page failed %d",
2296 * so, if page != NULL, we have a buffer head for the offset at
2297 * the end of the file. if the bh is mapped, and bh->b_blocknr != 0,
2298 * then we have an unformatted node. Otherwise, we have a direct item,
2299 * and no zeroing is required on disk. We zero after the truncate,
2300 * because the truncate might pack the item anyway
2301 * (it will unmap bh if it packs).
2303 * it is enough to reserve space in transaction for 2 balancings:
2304 * one for "save" link adding and another for the first
2305 * cut_from_item. 1 is for update_sd
2307 error = journal_begin(&th, inode->i_sb,
2308 JOURNAL_PER_BALANCE_CNT * 2 + 1);
2311 reiserfs_update_inode_transaction(inode);
2312 if (update_timestamps)
2314 * we are doing real truncate: if the system crashes
2315 * before the last transaction of truncating gets committed
2316 * - on reboot the file either appears truncated properly
2317 * or not truncated at all
2319 add_save_link(&th, inode, 1);
2320 err2 = reiserfs_do_truncate(&th, inode, page, update_timestamps);
2321 error = journal_end(&th);
2325 /* check reiserfs_do_truncate after ending the transaction */
2331 if (update_timestamps) {
2332 error = remove_save_link(inode, 1 /* truncate */);
2338 length = offset & (blocksize - 1);
2339 /* if we are not on a block boundary */
2341 length = blocksize - length;
2342 zero_user(page, offset, length);
2343 if (buffer_mapped(bh) && bh->b_blocknr != 0) {
2344 mark_buffer_dirty(bh);
2351 reiserfs_write_unlock(inode->i_sb);
2360 reiserfs_write_unlock(inode->i_sb);
2365 static int map_block_for_writepage(struct inode *inode,
2366 struct buffer_head *bh_result,
2367 unsigned long block)
2369 struct reiserfs_transaction_handle th;
2371 struct item_head tmp_ih;
2372 struct item_head *ih;
2373 struct buffer_head *bh;
2376 INITIALIZE_PATH(path);
2378 int jbegin_count = JOURNAL_PER_BALANCE_CNT;
2379 loff_t byte_offset = ((loff_t)block << inode->i_sb->s_blocksize_bits)+1;
2381 int use_get_block = 0;
2382 int bytes_copied = 0;
2384 int trans_running = 0;
2387 * catch places below that try to log something without
2392 if (!buffer_uptodate(bh_result)) {
2396 kmap(bh_result->b_page);
2398 reiserfs_write_lock(inode->i_sb);
2399 make_cpu_key(&key, inode, byte_offset, TYPE_ANY, 3);
2402 retval = search_for_position_by_key(inode->i_sb, &key, &path);
2403 if (retval != POSITION_FOUND) {
2408 bh = get_last_bh(&path);
2409 ih = tp_item_head(&path);
2410 item = tp_item_body(&path);
2411 pos_in_item = path.pos_in_item;
2413 /* we've found an unformatted node */
2414 if (indirect_item_found(retval, ih)) {
2415 if (bytes_copied > 0) {
2416 reiserfs_warning(inode->i_sb, "clm-6002",
2417 "bytes_copied %d", bytes_copied);
2419 if (!get_block_num(item, pos_in_item)) {
2420 /* crap, we are writing to a hole */
2424 set_block_dev_mapped(bh_result,
2425 get_block_num(item, pos_in_item), inode);
2426 } else if (is_direct_le_ih(ih)) {
2428 p = page_address(bh_result->b_page);
2429 p += (byte_offset - 1) & (PAGE_SIZE - 1);
2430 copy_size = ih_item_len(ih) - pos_in_item;
2432 fs_gen = get_generation(inode->i_sb);
2433 copy_item_head(&tmp_ih, ih);
2435 if (!trans_running) {
2436 /* vs-3050 is gone, no need to drop the path */
2437 retval = journal_begin(&th, inode->i_sb, jbegin_count);
2440 reiserfs_update_inode_transaction(inode);
2442 if (fs_changed(fs_gen, inode->i_sb)
2443 && item_moved(&tmp_ih, &path)) {
2444 reiserfs_restore_prepared_buffer(inode->i_sb,
2450 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);
2452 if (fs_changed(fs_gen, inode->i_sb)
2453 && item_moved(&tmp_ih, &path)) {
2454 reiserfs_restore_prepared_buffer(inode->i_sb, bh);
2458 memcpy(ih_item_body(bh, ih) + pos_in_item, p + bytes_copied,
2461 journal_mark_dirty(&th, bh);
2462 bytes_copied += copy_size;
2463 set_block_dev_mapped(bh_result, 0, inode);
2465 /* are there still bytes left? */
2466 if (bytes_copied < bh_result->b_size &&
2467 (byte_offset + bytes_copied) < inode->i_size) {
2468 set_cpu_key_k_offset(&key,
2469 cpu_key_k_offset(&key) +
2474 reiserfs_warning(inode->i_sb, "clm-6003",
2475 "bad item inode %lu", inode->i_ino);
2483 if (trans_running) {
2484 int err = journal_end(&th);
2489 reiserfs_write_unlock(inode->i_sb);
2491 /* this is where we fill in holes in the file. */
2492 if (use_get_block) {
2493 retval = reiserfs_get_block(inode, block, bh_result,
2494 GET_BLOCK_CREATE | GET_BLOCK_NO_IMUX
2495 | GET_BLOCK_NO_DANGLE);
2497 if (!buffer_mapped(bh_result)
2498 || bh_result->b_blocknr == 0) {
2499 /* get_block failed to find a mapped unformatted node. */
2505 kunmap(bh_result->b_page);
2507 if (!retval && buffer_mapped(bh_result) && bh_result->b_blocknr == 0) {
2509 * we've copied data from the page into the direct item, so the
2510 * buffer in the page is now clean, mark it to reflect that.
2512 lock_buffer(bh_result);
2513 clear_buffer_dirty(bh_result);
2514 unlock_buffer(bh_result);
2520 * mason@suse.com: updated in 2.5.54 to follow the same general io
2521 * start/recovery path as __block_write_full_page, along with special
2522 * code to handle reiserfs tails.
2524 static int reiserfs_write_full_page(struct page *page,
2525 struct writeback_control *wbc)
2527 struct inode *inode = page->mapping->host;
2528 unsigned long end_index = inode->i_size >> PAGE_SHIFT;
2530 unsigned long block;
2531 sector_t last_block;
2532 struct buffer_head *head, *bh;
2535 int checked = PageChecked(page);
2536 struct reiserfs_transaction_handle th;
2537 struct super_block *s = inode->i_sb;
2538 int bh_per_page = PAGE_SIZE / s->s_blocksize;
2541 /* no logging allowed when nonblocking or from PF_MEMALLOC */
2542 if (checked && (current->flags & PF_MEMALLOC)) {
2543 redirty_page_for_writepage(wbc, page);
2549 * The page dirty bit is cleared before writepage is called, which
2550 * means we have to tell create_empty_buffers to make dirty buffers
2551 * The page really should be up to date at this point, so tossing
2552 * in the BH_Uptodate is just a sanity check.
2554 if (!page_has_buffers(page)) {
2555 create_empty_buffers(page, s->s_blocksize,
2556 (1 << BH_Dirty) | (1 << BH_Uptodate));
2558 head = page_buffers(page);
2561 * last page in the file, zero out any contents past the
2562 * last byte in the file
2564 if (page->index >= end_index) {
2565 unsigned last_offset;
2567 last_offset = inode->i_size & (PAGE_SIZE - 1);
2568 /* no file contents in this page */
2569 if (page->index >= end_index + 1 || !last_offset) {
2573 zero_user_segment(page, last_offset, PAGE_SIZE);
2576 block = page->index << (PAGE_SHIFT - s->s_blocksize_bits);
2577 last_block = (i_size_read(inode) - 1) >> inode->i_blkbits;
2578 /* first map all the buffers, logging any direct items we find */
2580 if (block > last_block) {
2582 * This can happen when the block size is less than
2583 * the page size. The corresponding bytes in the page
2584 * were zero filled above
2586 clear_buffer_dirty(bh);
2587 set_buffer_uptodate(bh);
2588 } else if ((checked || buffer_dirty(bh)) &&
2589 (!buffer_mapped(bh) || (buffer_mapped(bh)
2593 * not mapped yet, or it points to a direct item, search
2594 * the btree for the mapping info, and log any direct
2597 if ((error = map_block_for_writepage(inode, bh, block))) {
2601 bh = bh->b_this_page;
2603 } while (bh != head);
2606 * we start the transaction after map_block_for_writepage,
2607 * because it can create holes in the file (an unbounded operation).
2608 * starting it here, we can make a reliable estimate for how many
2609 * blocks we're going to log
2612 ClearPageChecked(page);
2613 reiserfs_write_lock(s);
2614 error = journal_begin(&th, s, bh_per_page + 1);
2616 reiserfs_write_unlock(s);
2619 reiserfs_update_inode_transaction(inode);
2621 /* now go through and lock any dirty buffers on the page */
2624 if (!buffer_mapped(bh))
2626 if (buffer_mapped(bh) && bh->b_blocknr == 0)
2630 reiserfs_prepare_for_journal(s, bh, 1);
2631 journal_mark_dirty(&th, bh);
2635 * from this point on, we know the buffer is mapped to a
2636 * real block and not a direct item
2638 if (wbc->sync_mode != WB_SYNC_NONE) {
2641 if (!trylock_buffer(bh)) {
2642 redirty_page_for_writepage(wbc, page);
2646 if (test_clear_buffer_dirty(bh)) {
2647 mark_buffer_async_write(bh);
2651 } while ((bh = bh->b_this_page) != head);
2654 error = journal_end(&th);
2655 reiserfs_write_unlock(s);
2659 BUG_ON(PageWriteback(page));
2660 set_page_writeback(page);
2664 * since any buffer might be the only dirty buffer on the page,
2665 * the first submit_bh can bring the page out of writeback.
2666 * be careful with the buffers.
2669 struct buffer_head *next = bh->b_this_page;
2670 if (buffer_async_write(bh)) {
2671 submit_bh(REQ_OP_WRITE, 0, bh);
2676 } while (bh != head);
2682 * if this page only had a direct item, it is very possible for
2683 * no io to be required without there being an error. Or,
2684 * someone else could have locked them and sent them down the
2685 * pipe without locking the page
2689 if (!buffer_uptodate(bh)) {
2693 bh = bh->b_this_page;
2694 } while (bh != head);
2696 SetPageUptodate(page);
2697 end_page_writeback(page);
2703 * catches various errors, we need to make sure any valid dirty blocks
2704 * get to the media. The page is currently locked and not marked for
2707 ClearPageUptodate(page);
2711 if (buffer_mapped(bh) && buffer_dirty(bh) && bh->b_blocknr) {
2713 mark_buffer_async_write(bh);
2716 * clear any dirty bits that might have come from
2717 * getting attached to a dirty page
2719 clear_buffer_dirty(bh);
2721 bh = bh->b_this_page;
2722 } while (bh != head);
2724 BUG_ON(PageWriteback(page));
2725 set_page_writeback(page);
2728 struct buffer_head *next = bh->b_this_page;
2729 if (buffer_async_write(bh)) {
2730 clear_buffer_dirty(bh);
2731 submit_bh(REQ_OP_WRITE, 0, bh);
2736 } while (bh != head);
2740 static int reiserfs_readpage(struct file *f, struct page *page)
2742 return block_read_full_page(page, reiserfs_get_block);
2745 static int reiserfs_writepage(struct page *page, struct writeback_control *wbc)
2747 struct inode *inode = page->mapping->host;
2748 reiserfs_wait_on_write_block(inode->i_sb);
2749 return reiserfs_write_full_page(page, wbc);
2752 static void reiserfs_truncate_failed_write(struct inode *inode)
2754 truncate_inode_pages(inode->i_mapping, inode->i_size);
2755 reiserfs_truncate_file(inode, 0);
2758 static int reiserfs_write_begin(struct file *file,
2759 struct address_space *mapping,
2760 loff_t pos, unsigned len, unsigned flags,
2761 struct page **pagep, void **fsdata)
2763 struct inode *inode;
2769 inode = mapping->host;
2771 if (flags & AOP_FLAG_CONT_EXPAND &&
2772 (pos & (inode->i_sb->s_blocksize - 1)) == 0) {
2774 *fsdata = (void *)(unsigned long)flags;
2777 index = pos >> PAGE_SHIFT;
2778 page = grab_cache_page_write_begin(mapping, index, flags);
2783 reiserfs_wait_on_write_block(inode->i_sb);
2784 fix_tail_page_for_writing(page);
2785 if (reiserfs_transaction_running(inode->i_sb)) {
2786 struct reiserfs_transaction_handle *th;
2787 th = (struct reiserfs_transaction_handle *)current->
2789 BUG_ON(!th->t_refcount);
2790 BUG_ON(!th->t_trans_id);
2791 old_ref = th->t_refcount;
2794 ret = __block_write_begin(page, pos, len, reiserfs_get_block);
2795 if (ret && reiserfs_transaction_running(inode->i_sb)) {
2796 struct reiserfs_transaction_handle *th = current->journal_info;
2798 * this gets a little ugly. If reiserfs_get_block returned an
2799 * error and left a transacstion running, we've got to close
2800 * it, and we've got to free handle if it was a persistent
2803 * But, if we had nested into an existing transaction, we need
2804 * to just drop the ref count on the handle.
2806 * If old_ref == 0, the transaction is from reiserfs_get_block,
2807 * and it was a persistent trans. Otherwise, it was nested
2810 if (th->t_refcount > old_ref) {
2815 reiserfs_write_lock(inode->i_sb);
2816 err = reiserfs_end_persistent_transaction(th);
2817 reiserfs_write_unlock(inode->i_sb);
2826 /* Truncate allocated blocks */
2827 reiserfs_truncate_failed_write(inode);
2832 int __reiserfs_write_begin(struct page *page, unsigned from, unsigned len)
2834 struct inode *inode = page->mapping->host;
2839 depth = reiserfs_write_unlock_nested(inode->i_sb);
2840 reiserfs_wait_on_write_block(inode->i_sb);
2841 reiserfs_write_lock_nested(inode->i_sb, depth);
2843 fix_tail_page_for_writing(page);
2844 if (reiserfs_transaction_running(inode->i_sb)) {
2845 struct reiserfs_transaction_handle *th;
2846 th = (struct reiserfs_transaction_handle *)current->
2848 BUG_ON(!th->t_refcount);
2849 BUG_ON(!th->t_trans_id);
2850 old_ref = th->t_refcount;
2854 ret = __block_write_begin(page, from, len, reiserfs_get_block);
2855 if (ret && reiserfs_transaction_running(inode->i_sb)) {
2856 struct reiserfs_transaction_handle *th = current->journal_info;
2858 * this gets a little ugly. If reiserfs_get_block returned an
2859 * error and left a transacstion running, we've got to close
2860 * it, and we've got to free handle if it was a persistent
2863 * But, if we had nested into an existing transaction, we need
2864 * to just drop the ref count on the handle.
2866 * If old_ref == 0, the transaction is from reiserfs_get_block,
2867 * and it was a persistent trans. Otherwise, it was nested
2870 if (th->t_refcount > old_ref) {
2875 reiserfs_write_lock(inode->i_sb);
2876 err = reiserfs_end_persistent_transaction(th);
2877 reiserfs_write_unlock(inode->i_sb);
2887 static sector_t reiserfs_aop_bmap(struct address_space *as, sector_t block)
2889 return generic_block_bmap(as, block, reiserfs_bmap);
2892 static int reiserfs_write_end(struct file *file, struct address_space *mapping,
2893 loff_t pos, unsigned len, unsigned copied,
2894 struct page *page, void *fsdata)
2896 struct inode *inode = page->mapping->host;
2899 struct reiserfs_transaction_handle *th;
2901 bool locked = false;
2903 if ((unsigned long)fsdata & AOP_FLAG_CONT_EXPAND)
2906 reiserfs_wait_on_write_block(inode->i_sb);
2907 if (reiserfs_transaction_running(inode->i_sb))
2908 th = current->journal_info;
2912 start = pos & (PAGE_SIZE - 1);
2913 if (unlikely(copied < len)) {
2914 if (!PageUptodate(page))
2917 page_zero_new_buffers(page, start + copied, start + len);
2919 flush_dcache_page(page);
2921 reiserfs_commit_page(inode, page, start, start + copied);
2924 * generic_commit_write does this for us, but does not update the
2925 * transaction tracking stuff when the size changes. So, we have
2926 * to do the i_size updates here.
2928 if (pos + copied > inode->i_size) {
2929 struct reiserfs_transaction_handle myth;
2930 reiserfs_write_lock(inode->i_sb);
2933 * If the file have grown beyond the border where it
2934 * can have a tail, unmark it as needing a tail
2937 if ((have_large_tails(inode->i_sb)
2938 && inode->i_size > i_block_size(inode) * 4)
2939 || (have_small_tails(inode->i_sb)
2940 && inode->i_size > i_block_size(inode)))
2941 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
2943 ret = journal_begin(&myth, inode->i_sb, 1);
2947 reiserfs_update_inode_transaction(inode);
2948 inode->i_size = pos + copied;
2950 * this will just nest into our transaction. It's important
2951 * to use mark_inode_dirty so the inode gets pushed around on
2952 * the dirty lists, and so that O_SYNC works as expected
2954 mark_inode_dirty(inode);
2955 reiserfs_update_sd(&myth, inode);
2957 ret = journal_end(&myth);
2963 reiserfs_write_lock(inode->i_sb);
2967 mark_inode_dirty(inode);
2968 ret = reiserfs_end_persistent_transaction(th);
2975 reiserfs_write_unlock(inode->i_sb);
2979 if (pos + len > inode->i_size)
2980 reiserfs_truncate_failed_write(inode);
2982 return ret == 0 ? copied : ret;
2985 reiserfs_write_unlock(inode->i_sb);
2989 reiserfs_update_sd(th, inode);
2990 ret = reiserfs_end_persistent_transaction(th);
2995 int reiserfs_commit_write(struct file *f, struct page *page,
2996 unsigned from, unsigned to)
2998 struct inode *inode = page->mapping->host;
2999 loff_t pos = ((loff_t) page->index << PAGE_SHIFT) + to;
3002 struct reiserfs_transaction_handle *th = NULL;
3005 depth = reiserfs_write_unlock_nested(inode->i_sb);
3006 reiserfs_wait_on_write_block(inode->i_sb);
3007 reiserfs_write_lock_nested(inode->i_sb, depth);
3009 if (reiserfs_transaction_running(inode->i_sb)) {
3010 th = current->journal_info;
3012 reiserfs_commit_page(inode, page, from, to);
3015 * generic_commit_write does this for us, but does not update the
3016 * transaction tracking stuff when the size changes. So, we have
3017 * to do the i_size updates here.
3019 if (pos > inode->i_size) {
3020 struct reiserfs_transaction_handle myth;
3022 * If the file have grown beyond the border where it
3023 * can have a tail, unmark it as needing a tail
3026 if ((have_large_tails(inode->i_sb)
3027 && inode->i_size > i_block_size(inode) * 4)
3028 || (have_small_tails(inode->i_sb)
3029 && inode->i_size > i_block_size(inode)))
3030 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
3032 ret = journal_begin(&myth, inode->i_sb, 1);
3036 reiserfs_update_inode_transaction(inode);
3037 inode->i_size = pos;
3039 * this will just nest into our transaction. It's important
3040 * to use mark_inode_dirty so the inode gets pushed around
3041 * on the dirty lists, and so that O_SYNC works as expected
3043 mark_inode_dirty(inode);
3044 reiserfs_update_sd(&myth, inode);
3046 ret = journal_end(&myth);
3052 mark_inode_dirty(inode);
3053 ret = reiserfs_end_persistent_transaction(th);
3064 reiserfs_update_sd(th, inode);
3065 ret = reiserfs_end_persistent_transaction(th);
3071 void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode)
3073 if (reiserfs_attrs(inode->i_sb)) {
3074 if (sd_attrs & REISERFS_SYNC_FL)
3075 inode->i_flags |= S_SYNC;
3077 inode->i_flags &= ~S_SYNC;
3078 if (sd_attrs & REISERFS_IMMUTABLE_FL)
3079 inode->i_flags |= S_IMMUTABLE;
3081 inode->i_flags &= ~S_IMMUTABLE;
3082 if (sd_attrs & REISERFS_APPEND_FL)
3083 inode->i_flags |= S_APPEND;
3085 inode->i_flags &= ~S_APPEND;
3086 if (sd_attrs & REISERFS_NOATIME_FL)
3087 inode->i_flags |= S_NOATIME;
3089 inode->i_flags &= ~S_NOATIME;
3090 if (sd_attrs & REISERFS_NOTAIL_FL)
3091 REISERFS_I(inode)->i_flags |= i_nopack_mask;
3093 REISERFS_I(inode)->i_flags &= ~i_nopack_mask;
3098 * decide if this buffer needs to stay around for data logging or ordered
3101 static int invalidatepage_can_drop(struct inode *inode, struct buffer_head *bh)
3104 struct reiserfs_journal *j = SB_JOURNAL(inode->i_sb);
3107 spin_lock(&j->j_dirty_buffers_lock);
3108 if (!buffer_mapped(bh)) {
3112 * the page is locked, and the only places that log a data buffer
3113 * also lock the page.
3115 if (reiserfs_file_data_log(inode)) {
3117 * very conservative, leave the buffer pinned if
3118 * anyone might need it.
3120 if (buffer_journaled(bh) || buffer_journal_dirty(bh)) {
3123 } else if (buffer_dirty(bh)) {
3124 struct reiserfs_journal_list *jl;
3125 struct reiserfs_jh *jh = bh->b_private;
3129 * reiserfs_setattr updates i_size in the on disk
3130 * stat data before allowing vmtruncate to be called.
3132 * If buffer was put onto the ordered list for this
3133 * transaction, we know for sure either this transaction
3134 * or an older one already has updated i_size on disk,
3135 * and this ordered data won't be referenced in the file
3138 * if the buffer was put onto the ordered list for an older
3139 * transaction, we need to leave it around
3141 if (jh && (jl = jh->jl)
3142 && jl != SB_JOURNAL(inode->i_sb)->j_current_jl)
3146 if (ret && bh->b_private) {
3147 reiserfs_free_jh(bh);
3149 spin_unlock(&j->j_dirty_buffers_lock);
3154 /* clm -- taken from fs/buffer.c:block_invalidate_page */
3155 static void reiserfs_invalidatepage(struct page *page, unsigned int offset,
3156 unsigned int length)
3158 struct buffer_head *head, *bh, *next;
3159 struct inode *inode = page->mapping->host;
3160 unsigned int curr_off = 0;
3161 unsigned int stop = offset + length;
3162 int partial_page = (offset || length < PAGE_SIZE);
3165 BUG_ON(!PageLocked(page));
3168 ClearPageChecked(page);
3170 if (!page_has_buffers(page))
3173 head = page_buffers(page);
3176 unsigned int next_off = curr_off + bh->b_size;
3177 next = bh->b_this_page;
3179 if (next_off > stop)
3183 * is this block fully invalidated?
3185 if (offset <= curr_off) {
3186 if (invalidatepage_can_drop(inode, bh))
3187 reiserfs_unmap_buffer(bh);
3191 curr_off = next_off;
3193 } while (bh != head);
3196 * We release buffers only if the entire page is being invalidated.
3197 * The get_block cached value has been unconditionally invalidated,
3198 * so real IO is not possible anymore.
3200 if (!partial_page && ret) {
3201 ret = try_to_release_page(page, 0);
3202 /* maybe should BUG_ON(!ret); - neilb */
3208 static int reiserfs_set_page_dirty(struct page *page)
3210 struct inode *inode = page->mapping->host;
3211 if (reiserfs_file_data_log(inode)) {
3212 SetPageChecked(page);
3213 return __set_page_dirty_nobuffers(page);
3215 return __set_page_dirty_buffers(page);
3219 * Returns 1 if the page's buffers were dropped. The page is locked.
3221 * Takes j_dirty_buffers_lock to protect the b_assoc_buffers list_heads
3222 * in the buffers at page_buffers(page).
3224 * even in -o notail mode, we can't be sure an old mount without -o notail
3225 * didn't create files with tails.
3227 static int reiserfs_releasepage(struct page *page, gfp_t unused_gfp_flags)
3229 struct inode *inode = page->mapping->host;
3230 struct reiserfs_journal *j = SB_JOURNAL(inode->i_sb);
3231 struct buffer_head *head;
3232 struct buffer_head *bh;
3235 WARN_ON(PageChecked(page));
3236 spin_lock(&j->j_dirty_buffers_lock);
3237 head = page_buffers(page);
3240 if (bh->b_private) {
3241 if (!buffer_dirty(bh) && !buffer_locked(bh)) {
3242 reiserfs_free_jh(bh);
3248 bh = bh->b_this_page;
3249 } while (bh != head);
3251 ret = try_to_free_buffers(page);
3252 spin_unlock(&j->j_dirty_buffers_lock);
3257 * We thank Mingming Cao for helping us understand in great detail what
3258 * to do in this section of the code.
3260 static ssize_t reiserfs_direct_IO(struct kiocb *iocb, struct iov_iter *iter)
3262 struct file *file = iocb->ki_filp;
3263 struct inode *inode = file->f_mapping->host;
3264 size_t count = iov_iter_count(iter);
3267 ret = blockdev_direct_IO(iocb, inode, iter,
3268 reiserfs_get_blocks_direct_io);
3271 * In case of error extending write may have instantiated a few
3272 * blocks outside i_size. Trim these off again.
3274 if (unlikely(iov_iter_rw(iter) == WRITE && ret < 0)) {
3275 loff_t isize = i_size_read(inode);
3276 loff_t end = iocb->ki_pos + count;
3278 if ((end > isize) && inode_newsize_ok(inode, isize) == 0) {
3279 truncate_setsize(inode, isize);
3280 reiserfs_vfs_truncate_file(inode);
3287 int reiserfs_setattr(struct dentry *dentry, struct iattr *attr)
3289 struct inode *inode = d_inode(dentry);
3290 unsigned int ia_valid;
3293 error = setattr_prepare(dentry, attr);
3297 /* must be turned off for recursive notify_change calls */
3298 ia_valid = attr->ia_valid &= ~(ATTR_KILL_SUID|ATTR_KILL_SGID);
3300 if (is_quota_modification(inode, attr)) {
3301 error = dquot_initialize(inode);
3305 reiserfs_write_lock(inode->i_sb);
3306 if (attr->ia_valid & ATTR_SIZE) {
3308 * version 2 items will be caught by the s_maxbytes check
3309 * done for us in vmtruncate
3311 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5 &&
3312 attr->ia_size > MAX_NON_LFS) {
3313 reiserfs_write_unlock(inode->i_sb);
3318 inode_dio_wait(inode);
3320 /* fill in hole pointers in the expanding truncate case. */
3321 if (attr->ia_size > inode->i_size) {
3322 error = generic_cont_expand_simple(inode, attr->ia_size);
3323 if (REISERFS_I(inode)->i_prealloc_count > 0) {
3325 struct reiserfs_transaction_handle th;
3326 /* we're changing at most 2 bitmaps, inode + super */
3327 err = journal_begin(&th, inode->i_sb, 4);
3329 reiserfs_discard_prealloc(&th, inode);
3330 err = journal_end(&th);
3336 reiserfs_write_unlock(inode->i_sb);
3340 * file size is changed, ctime and mtime are
3343 attr->ia_valid |= (ATTR_MTIME | ATTR_CTIME);
3346 reiserfs_write_unlock(inode->i_sb);
3348 if ((((attr->ia_valid & ATTR_UID) && (from_kuid(&init_user_ns, attr->ia_uid) & ~0xffff)) ||
3349 ((attr->ia_valid & ATTR_GID) && (from_kgid(&init_user_ns, attr->ia_gid) & ~0xffff))) &&
3350 (get_inode_sd_version(inode) == STAT_DATA_V1)) {
3351 /* stat data of format v3.5 has 16 bit uid and gid */
3356 if ((ia_valid & ATTR_UID && !uid_eq(attr->ia_uid, inode->i_uid)) ||
3357 (ia_valid & ATTR_GID && !gid_eq(attr->ia_gid, inode->i_gid))) {
3358 struct reiserfs_transaction_handle th;
3361 (REISERFS_QUOTA_INIT_BLOCKS(inode->i_sb) +
3362 REISERFS_QUOTA_DEL_BLOCKS(inode->i_sb)) +
3365 error = reiserfs_chown_xattrs(inode, attr);
3371 * (user+group)*(old+new) structure - we count quota
3372 * info and , inode write (sb, inode)
3374 reiserfs_write_lock(inode->i_sb);
3375 error = journal_begin(&th, inode->i_sb, jbegin_count);
3376 reiserfs_write_unlock(inode->i_sb);
3379 error = dquot_transfer(inode, attr);
3380 reiserfs_write_lock(inode->i_sb);
3383 reiserfs_write_unlock(inode->i_sb);
3388 * Update corresponding info in inode so that everything
3389 * is in one transaction
3391 if (attr->ia_valid & ATTR_UID)
3392 inode->i_uid = attr->ia_uid;
3393 if (attr->ia_valid & ATTR_GID)
3394 inode->i_gid = attr->ia_gid;
3395 mark_inode_dirty(inode);
3396 error = journal_end(&th);
3397 reiserfs_write_unlock(inode->i_sb);
3402 if ((attr->ia_valid & ATTR_SIZE) &&
3403 attr->ia_size != i_size_read(inode)) {
3404 error = inode_newsize_ok(inode, attr->ia_size);
3407 * Could race against reiserfs_file_release
3408 * if called from NFS, so take tailpack mutex.
3410 mutex_lock(&REISERFS_I(inode)->tailpack);
3411 truncate_setsize(inode, attr->ia_size);
3412 reiserfs_truncate_file(inode, 1);
3413 mutex_unlock(&REISERFS_I(inode)->tailpack);
3418 setattr_copy(inode, attr);
3419 mark_inode_dirty(inode);
3422 if (!error && reiserfs_posixacl(inode->i_sb)) {
3423 if (attr->ia_valid & ATTR_MODE)
3424 error = reiserfs_acl_chmod(inode);
3431 const struct address_space_operations reiserfs_address_space_operations = {
3432 .writepage = reiserfs_writepage,
3433 .readpage = reiserfs_readpage,
3434 .readpages = reiserfs_readpages,
3435 .releasepage = reiserfs_releasepage,
3436 .invalidatepage = reiserfs_invalidatepage,
3437 .write_begin = reiserfs_write_begin,
3438 .write_end = reiserfs_write_end,
3439 .bmap = reiserfs_aop_bmap,
3440 .direct_IO = reiserfs_direct_IO,
3441 .set_page_dirty = reiserfs_set_page_dirty,