2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
5 #include <linux/time.h>
7 #include <linux/reiserfs_fs.h>
8 #include <linux/reiserfs_acl.h>
9 #include <linux/reiserfs_xattr.h>
10 #include <linux/exportfs.h>
11 #include <linux/smp_lock.h>
12 #include <linux/pagemap.h>
13 #include <linux/highmem.h>
14 #include <asm/uaccess.h>
15 #include <asm/unaligned.h>
16 #include <linux/buffer_head.h>
17 #include <linux/mpage.h>
18 #include <linux/writeback.h>
19 #include <linux/quotaops.h>
20 #include <linux/swap.h>
22 int reiserfs_commit_write(struct file *f, struct page *page,
23 unsigned from, unsigned to);
24 int reiserfs_prepare_write(struct file *f, struct page *page,
25 unsigned from, unsigned to);
27 void reiserfs_delete_inode(struct inode *inode)
29 /* We need blocks for transaction + (user+group) quota update (possibly delete) */
31 JOURNAL_PER_BALANCE_CNT * 2 +
32 2 * REISERFS_QUOTA_INIT_BLOCKS(inode->i_sb);
33 struct reiserfs_transaction_handle th;
36 truncate_inode_pages(&inode->i_data, 0);
38 reiserfs_write_lock(inode->i_sb);
40 /* The = 0 happens when we abort creating a new inode for some reason like lack of space.. */
41 if (!(inode->i_state & I_NEW) && INODE_PKEY(inode)->k_objectid != 0) { /* also handles bad_inode case */
42 reiserfs_delete_xattrs(inode);
44 if (journal_begin(&th, inode->i_sb, jbegin_count))
46 reiserfs_update_inode_transaction(inode);
48 reiserfs_discard_prealloc(&th, inode);
50 err = reiserfs_delete_object(&th, inode);
52 /* Do quota update inside a transaction for journaled quotas. We must do that
53 * after delete_object so that quota updates go into the same transaction as
54 * stat data deletion */
56 DQUOT_FREE_INODE(inode);
58 if (journal_end(&th, inode->i_sb, jbegin_count))
61 /* check return value from reiserfs_delete_object after
62 * ending the transaction
67 /* all items of file are deleted, so we can remove "save" link */
68 remove_save_link(inode, 0 /* not truncate */ ); /* we can't do anything
69 * about an error here */
71 /* no object items are in the tree */
75 clear_inode(inode); /* note this must go after the journal_end to prevent deadlock */
77 reiserfs_write_unlock(inode->i_sb);
80 static void _make_cpu_key(struct cpu_key *key, int version, __u32 dirid,
81 __u32 objectid, loff_t offset, int type, int length)
83 key->version = version;
85 key->on_disk_key.k_dir_id = dirid;
86 key->on_disk_key.k_objectid = objectid;
87 set_cpu_key_k_offset(key, offset);
88 set_cpu_key_k_type(key, type);
89 key->key_length = length;
92 /* take base of inode_key (it comes from inode always) (dirid, objectid) and version from an inode, set
93 offset and type of key */
94 void make_cpu_key(struct cpu_key *key, struct inode *inode, loff_t offset,
97 _make_cpu_key(key, get_inode_item_key_version(inode),
98 le32_to_cpu(INODE_PKEY(inode)->k_dir_id),
99 le32_to_cpu(INODE_PKEY(inode)->k_objectid), offset, type,
104 // when key is 0, do not set version and short key
106 inline void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
108 loff_t offset, int type, int length,
109 int entry_count /*or ih_free_space */ )
112 ih->ih_key.k_dir_id = cpu_to_le32(key->on_disk_key.k_dir_id);
113 ih->ih_key.k_objectid =
114 cpu_to_le32(key->on_disk_key.k_objectid);
116 put_ih_version(ih, version);
117 set_le_ih_k_offset(ih, offset);
118 set_le_ih_k_type(ih, type);
119 put_ih_item_len(ih, length);
120 /* set_ih_free_space (ih, 0); */
121 // for directory items it is entry count, for directs and stat
122 // datas - 0xffff, for indirects - 0
123 put_ih_entry_count(ih, entry_count);
127 // FIXME: we might cache recently accessed indirect item
129 // Ugh. Not too eager for that....
130 // I cut the code until such time as I see a convincing argument (benchmark).
131 // I don't want a bloated inode struct..., and I don't like code complexity....
133 /* cutting the code is fine, since it really isn't in use yet and is easy
134 ** to add back in. But, Vladimir has a really good idea here. Think
135 ** about what happens for reading a file. For each page,
136 ** The VFS layer calls reiserfs_readpage, who searches the tree to find
137 ** an indirect item. This indirect item has X number of pointers, where
138 ** X is a big number if we've done the block allocation right. But,
139 ** we only use one or two of these pointers during each call to readpage,
140 ** needlessly researching again later on.
142 ** The size of the cache could be dynamic based on the size of the file.
144 ** I'd also like to see us cache the location the stat data item, since
145 ** we are needlessly researching for that frequently.
150 /* If this page has a file tail in it, and
151 ** it was read in by get_block_create_0, the page data is valid,
152 ** but tail is still sitting in a direct item, and we can't write to
153 ** it. So, look through this page, and check all the mapped buffers
154 ** to make sure they have valid block numbers. Any that don't need
155 ** to be unmapped, so that block_prepare_write will correctly call
156 ** reiserfs_get_block to convert the tail into an unformatted node
158 static inline void fix_tail_page_for_writing(struct page *page)
160 struct buffer_head *head, *next, *bh;
162 if (page && page_has_buffers(page)) {
163 head = page_buffers(page);
166 next = bh->b_this_page;
167 if (buffer_mapped(bh) && bh->b_blocknr == 0) {
168 reiserfs_unmap_buffer(bh);
171 } while (bh != head);
175 /* reiserfs_get_block does not need to allocate a block only if it has been
176 done already or non-hole position has been found in the indirect item */
177 static inline int allocation_needed(int retval, b_blocknr_t allocated,
178 struct item_head *ih,
179 __le32 * item, int pos_in_item)
183 if (retval == POSITION_FOUND && is_indirect_le_ih(ih) &&
184 get_block_num(item, pos_in_item))
189 static inline int indirect_item_found(int retval, struct item_head *ih)
191 return (retval == POSITION_FOUND) && is_indirect_le_ih(ih);
194 static inline void set_block_dev_mapped(struct buffer_head *bh,
195 b_blocknr_t block, struct inode *inode)
197 map_bh(bh, inode->i_sb, block);
201 // files which were created in the earlier version can not be longer,
204 static int file_capable(struct inode *inode, sector_t block)
206 if (get_inode_item_key_version(inode) != KEY_FORMAT_3_5 || // it is new file.
207 block < (1 << (31 - inode->i_sb->s_blocksize_bits))) // old file, but 'block' is inside of 2gb
213 static int restart_transaction(struct reiserfs_transaction_handle *th,
214 struct inode *inode, struct treepath *path)
216 struct super_block *s = th->t_super;
217 int len = th->t_blocks_allocated;
220 BUG_ON(!th->t_trans_id);
221 BUG_ON(!th->t_refcount);
225 /* we cannot restart while nested */
226 if (th->t_refcount > 1) {
229 reiserfs_update_sd(th, inode);
230 err = journal_end(th, s, len);
232 err = journal_begin(th, s, JOURNAL_PER_BALANCE_CNT * 6);
234 reiserfs_update_inode_transaction(inode);
239 // it is called by get_block when create == 0. Returns block number
240 // for 'block'-th logical block of file. When it hits direct item it
241 // returns 0 (being called from bmap) or read direct item into piece
242 // of page (bh_result)
244 // Please improve the english/clarity in the comment above, as it is
245 // hard to understand.
247 static int _get_block_create_0(struct inode *inode, sector_t block,
248 struct buffer_head *bh_result, int args)
250 INITIALIZE_PATH(path);
252 struct buffer_head *bh;
253 struct item_head *ih, tmp_ih;
261 unsigned long offset;
263 // prepare the key to look for the 'block'-th block of file
264 make_cpu_key(&key, inode,
265 (loff_t) block * inode->i_sb->s_blocksize + 1, TYPE_ANY,
269 result = search_for_position_by_key(inode->i_sb, &key, &path);
270 if (result != POSITION_FOUND) {
273 kunmap(bh_result->b_page);
274 if (result == IO_ERROR)
276 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
277 // That there is some MMAPED data associated with it that is yet to be written to disk.
278 if ((args & GET_BLOCK_NO_HOLE)
279 && !PageUptodate(bh_result->b_page)) {
285 bh = get_last_bh(&path);
287 if (is_indirect_le_ih(ih)) {
288 __le32 *ind_item = (__le32 *) B_I_PITEM(bh, ih);
290 /* FIXME: here we could cache indirect item or part of it in
291 the inode to avoid search_by_key in case of subsequent
293 blocknr = get_block_num(ind_item, path.pos_in_item);
296 map_bh(bh_result, inode->i_sb, blocknr);
297 if (path.pos_in_item ==
298 ((ih_item_len(ih) / UNFM_P_SIZE) - 1)) {
299 set_buffer_boundary(bh_result);
302 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
303 // That there is some MMAPED data associated with it that is yet to be written to disk.
304 if ((args & GET_BLOCK_NO_HOLE)
305 && !PageUptodate(bh_result->b_page)) {
311 kunmap(bh_result->b_page);
314 // requested data are in direct item(s)
315 if (!(args & GET_BLOCK_READ_DIRECT)) {
316 // we are called by bmap. FIXME: we can not map block of file
317 // when it is stored in direct item(s)
320 kunmap(bh_result->b_page);
324 /* if we've got a direct item, and the buffer or page was uptodate,
325 ** we don't want to pull data off disk again. skip to the
326 ** end, where we map the buffer and return
328 if (buffer_uptodate(bh_result)) {
332 ** grab_tail_page can trigger calls to reiserfs_get_block on up to date
333 ** pages without any buffers. If the page is up to date, we don't want
334 ** read old data off disk. Set the up to date bit on the buffer instead
335 ** and jump to the end
337 if (!bh_result->b_page || PageUptodate(bh_result->b_page)) {
338 set_buffer_uptodate(bh_result);
341 // read file tail into part of page
342 offset = (cpu_key_k_offset(&key) - 1) & (PAGE_CACHE_SIZE - 1);
343 fs_gen = get_generation(inode->i_sb);
344 copy_item_head(&tmp_ih, ih);
346 /* we only want to kmap if we are reading the tail into the page.
347 ** this is not the common case, so we don't kmap until we are
348 ** sure we need to. But, this means the item might move if
352 p = (char *)kmap(bh_result->b_page);
353 if (fs_changed(fs_gen, inode->i_sb)
354 && item_moved(&tmp_ih, &path)) {
359 memset(p, 0, inode->i_sb->s_blocksize);
361 if (!is_direct_le_ih(ih)) {
364 /* make sure we don't read more bytes than actually exist in
365 ** the file. This can happen in odd cases where i_size isn't
366 ** correct, and when direct item padding results in a few
367 ** extra bytes at the end of the direct item
369 if ((le_ih_k_offset(ih) + path.pos_in_item) > inode->i_size)
371 if ((le_ih_k_offset(ih) - 1 + ih_item_len(ih)) > inode->i_size) {
373 inode->i_size - (le_ih_k_offset(ih) - 1) -
377 chars = ih_item_len(ih) - path.pos_in_item;
379 memcpy(p, B_I_PITEM(bh, ih) + path.pos_in_item, chars);
386 if (PATH_LAST_POSITION(&path) != (B_NR_ITEMS(bh) - 1))
387 // we done, if read direct item is not the last item of
388 // node FIXME: we could try to check right delimiting key
389 // to see whether direct item continues in the right
390 // neighbor or rely on i_size
393 // update key to look for the next piece
394 set_cpu_key_k_offset(&key, cpu_key_k_offset(&key) + chars);
395 result = search_for_position_by_key(inode->i_sb, &key, &path);
396 if (result != POSITION_FOUND)
397 // i/o error most likely
399 bh = get_last_bh(&path);
403 flush_dcache_page(bh_result->b_page);
404 kunmap(bh_result->b_page);
409 if (result == IO_ERROR)
412 /* this buffer has valid data, but isn't valid for io. mapping it to
413 * block #0 tells the rest of reiserfs it just has a tail in it
415 map_bh(bh_result, inode->i_sb, 0);
416 set_buffer_uptodate(bh_result);
420 // this is called to create file map. So, _get_block_create_0 will not
422 static int reiserfs_bmap(struct inode *inode, sector_t block,
423 struct buffer_head *bh_result, int create)
425 if (!file_capable(inode, block))
428 reiserfs_write_lock(inode->i_sb);
429 /* do not read the direct item */
430 _get_block_create_0(inode, block, bh_result, 0);
431 reiserfs_write_unlock(inode->i_sb);
435 /* special version of get_block that is only used by grab_tail_page right
436 ** now. It is sent to block_prepare_write, and when you try to get a
437 ** block past the end of the file (or a block from a hole) it returns
438 ** -ENOENT instead of a valid buffer. block_prepare_write expects to
439 ** be able to do i/o on the buffers returned, unless an error value
442 ** So, this allows block_prepare_write to be used for reading a single block
443 ** in a page. Where it does not produce a valid page for holes, or past the
444 ** end of the file. This turns out to be exactly what we need for reading
445 ** tails for conversion.
447 ** The point of the wrapper is forcing a certain value for create, even
448 ** though the VFS layer is calling this function with create==1. If you
449 ** don't want to send create == GET_BLOCK_NO_HOLE to reiserfs_get_block,
450 ** don't use this function.
452 static int reiserfs_get_block_create_0(struct inode *inode, sector_t block,
453 struct buffer_head *bh_result,
456 return reiserfs_get_block(inode, block, bh_result, GET_BLOCK_NO_HOLE);
459 /* This is special helper for reiserfs_get_block in case we are executing
460 direct_IO request. */
461 static int reiserfs_get_blocks_direct_io(struct inode *inode,
463 struct buffer_head *bh_result,
468 bh_result->b_page = NULL;
470 /* We set the b_size before reiserfs_get_block call since it is
471 referenced in convert_tail_for_hole() that may be called from
472 reiserfs_get_block() */
473 bh_result->b_size = (1 << inode->i_blkbits);
475 ret = reiserfs_get_block(inode, iblock, bh_result,
476 create | GET_BLOCK_NO_DANGLE);
480 /* don't allow direct io onto tail pages */
481 if (buffer_mapped(bh_result) && bh_result->b_blocknr == 0) {
482 /* make sure future calls to the direct io funcs for this offset
483 ** in the file fail by unmapping the buffer
485 clear_buffer_mapped(bh_result);
488 /* Possible unpacked tail. Flush the data before pages have
490 if (REISERFS_I(inode)->i_flags & i_pack_on_close_mask) {
493 err = reiserfs_commit_for_inode(inode);
494 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
504 ** helper function for when reiserfs_get_block is called for a hole
505 ** but the file tail is still in a direct item
506 ** bh_result is the buffer head for the hole
507 ** tail_offset is the offset of the start of the tail in the file
509 ** This calls prepare_write, which will start a new transaction
510 ** you should not be in a transaction, or have any paths held when you
513 static int convert_tail_for_hole(struct inode *inode,
514 struct buffer_head *bh_result,
518 unsigned long tail_end;
519 unsigned long tail_start;
520 struct page *tail_page;
521 struct page *hole_page = bh_result->b_page;
524 if ((tail_offset & (bh_result->b_size - 1)) != 1)
527 /* always try to read until the end of the block */
528 tail_start = tail_offset & (PAGE_CACHE_SIZE - 1);
529 tail_end = (tail_start | (bh_result->b_size - 1)) + 1;
531 index = tail_offset >> PAGE_CACHE_SHIFT;
532 /* hole_page can be zero in case of direct_io, we are sure
533 that we cannot get here if we write with O_DIRECT into
535 if (!hole_page || index != hole_page->index) {
536 tail_page = grab_cache_page(inode->i_mapping, index);
542 tail_page = hole_page;
545 /* we don't have to make sure the conversion did not happen while
546 ** we were locking the page because anyone that could convert
547 ** must first take i_mutex.
549 ** We must fix the tail page for writing because it might have buffers
550 ** that are mapped, but have a block number of 0. This indicates tail
551 ** data that has been read directly into the page, and block_prepare_write
552 ** won't trigger a get_block in this case.
554 fix_tail_page_for_writing(tail_page);
555 retval = reiserfs_prepare_write(NULL, tail_page, tail_start, tail_end);
559 /* tail conversion might change the data in the page */
560 flush_dcache_page(tail_page);
562 retval = reiserfs_commit_write(NULL, tail_page, tail_start, tail_end);
565 if (tail_page != hole_page) {
566 unlock_page(tail_page);
567 page_cache_release(tail_page);
573 static inline int _allocate_block(struct reiserfs_transaction_handle *th,
576 b_blocknr_t * allocated_block_nr,
577 struct treepath *path, int flags)
579 BUG_ON(!th->t_trans_id);
581 #ifdef REISERFS_PREALLOCATE
582 if (!(flags & GET_BLOCK_NO_IMUX)) {
583 return reiserfs_new_unf_blocknrs2(th, inode, allocated_block_nr,
587 return reiserfs_new_unf_blocknrs(th, inode, allocated_block_nr, path,
591 int reiserfs_get_block(struct inode *inode, sector_t block,
592 struct buffer_head *bh_result, int create)
594 int repeat, retval = 0;
595 b_blocknr_t allocated_block_nr = 0; // b_blocknr_t is (unsigned) 32 bit int
596 INITIALIZE_PATH(path);
599 struct buffer_head *bh, *unbh = NULL;
600 struct item_head *ih, tmp_ih;
604 struct reiserfs_transaction_handle *th = NULL;
605 /* space reserved in transaction batch:
606 . 3 balancings in direct->indirect conversion
607 . 1 block involved into reiserfs_update_sd()
608 XXX in practically impossible worst case direct2indirect()
609 can incur (much) more than 3 balancings.
610 quota update for user, group */
612 JOURNAL_PER_BALANCE_CNT * 3 + 1 +
613 2 * REISERFS_QUOTA_TRANS_BLOCKS(inode->i_sb);
617 (((loff_t) block) << inode->i_sb->s_blocksize_bits) + 1;
620 reiserfs_write_lock(inode->i_sb);
621 version = get_inode_item_key_version(inode);
623 if (!file_capable(inode, block)) {
624 reiserfs_write_unlock(inode->i_sb);
628 /* if !create, we aren't changing the FS, so we don't need to
629 ** log anything, so we don't need to start a transaction
631 if (!(create & GET_BLOCK_CREATE)) {
633 /* find number of block-th logical block of the file */
634 ret = _get_block_create_0(inode, block, bh_result,
635 create | GET_BLOCK_READ_DIRECT);
636 reiserfs_write_unlock(inode->i_sb);
640 * if we're already in a transaction, make sure to close
641 * any new transactions we start in this func
643 if ((create & GET_BLOCK_NO_DANGLE) ||
644 reiserfs_transaction_running(inode->i_sb))
647 /* If file is of such a size, that it might have a tail and tails are enabled
648 ** we should mark it as possibly needing tail packing on close
650 if ((have_large_tails(inode->i_sb)
651 && inode->i_size < i_block_size(inode) * 4)
652 || (have_small_tails(inode->i_sb)
653 && inode->i_size < i_block_size(inode)))
654 REISERFS_I(inode)->i_flags |= i_pack_on_close_mask;
656 /* set the key of the first byte in the 'block'-th block of file */
657 make_cpu_key(&key, inode, new_offset, TYPE_ANY, 3 /*key length */ );
658 if ((new_offset + inode->i_sb->s_blocksize - 1) > inode->i_size) {
660 th = reiserfs_persistent_transaction(inode->i_sb, jbegin_count);
665 reiserfs_update_inode_transaction(inode);
669 retval = search_for_position_by_key(inode->i_sb, &key, &path);
670 if (retval == IO_ERROR) {
675 bh = get_last_bh(&path);
677 item = get_item(&path);
678 pos_in_item = path.pos_in_item;
680 fs_gen = get_generation(inode->i_sb);
681 copy_item_head(&tmp_ih, ih);
683 if (allocation_needed
684 (retval, allocated_block_nr, ih, item, pos_in_item)) {
685 /* we have to allocate block for the unformatted node */
692 _allocate_block(th, block, inode, &allocated_block_nr,
695 if (repeat == NO_DISK_SPACE || repeat == QUOTA_EXCEEDED) {
696 /* restart the transaction to give the journal a chance to free
697 ** some blocks. releases the path, so we have to go back to
698 ** research if we succeed on the second try
700 SB_JOURNAL(inode->i_sb)->j_next_async_flush = 1;
701 retval = restart_transaction(th, inode, &path);
705 _allocate_block(th, block, inode,
706 &allocated_block_nr, NULL, create);
708 if (repeat != NO_DISK_SPACE && repeat != QUOTA_EXCEEDED) {
711 if (repeat == QUOTA_EXCEEDED)
718 if (fs_changed(fs_gen, inode->i_sb)
719 && item_moved(&tmp_ih, &path)) {
724 if (indirect_item_found(retval, ih)) {
725 b_blocknr_t unfm_ptr;
726 /* 'block'-th block is in the file already (there is
727 corresponding cell in some indirect item). But it may be
728 zero unformatted node pointer (hole) */
729 unfm_ptr = get_block_num(item, pos_in_item);
731 /* use allocated block to plug the hole */
732 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);
733 if (fs_changed(fs_gen, inode->i_sb)
734 && item_moved(&tmp_ih, &path)) {
735 reiserfs_restore_prepared_buffer(inode->i_sb,
739 set_buffer_new(bh_result);
740 if (buffer_dirty(bh_result)
741 && reiserfs_data_ordered(inode->i_sb))
742 reiserfs_add_ordered_list(inode, bh_result);
743 put_block_num(item, pos_in_item, allocated_block_nr);
744 unfm_ptr = allocated_block_nr;
745 journal_mark_dirty(th, inode->i_sb, bh);
746 reiserfs_update_sd(th, inode);
748 set_block_dev_mapped(bh_result, unfm_ptr, inode);
752 retval = reiserfs_end_persistent_transaction(th);
754 reiserfs_write_unlock(inode->i_sb);
756 /* the item was found, so new blocks were not added to the file
757 ** there is no need to make sure the inode is updated with this
768 /* desired position is not found or is in the direct item. We have
769 to append file with holes up to 'block'-th block converting
770 direct items to indirect one if necessary */
773 if (is_statdata_le_ih(ih)) {
775 struct cpu_key tmp_key;
777 /* indirect item has to be inserted */
778 make_le_item_head(&tmp_ih, &key, version, 1,
779 TYPE_INDIRECT, UNFM_P_SIZE,
780 0 /* free_space */ );
782 if (cpu_key_k_offset(&key) == 1) {
783 /* we are going to add 'block'-th block to the file. Use
784 allocated block for that */
785 unp = cpu_to_le32(allocated_block_nr);
786 set_block_dev_mapped(bh_result,
787 allocated_block_nr, inode);
788 set_buffer_new(bh_result);
792 set_cpu_key_k_offset(&tmp_key, 1);
793 PATH_LAST_POSITION(&path)++;
796 reiserfs_insert_item(th, &path, &tmp_key, &tmp_ih,
797 inode, (char *)&unp);
799 reiserfs_free_block(th, inode,
800 allocated_block_nr, 1);
801 goto failure; // retval == -ENOSPC, -EDQUOT or -EIO or -EEXIST
803 //mark_tail_converted (inode);
804 } else if (is_direct_le_ih(ih)) {
805 /* direct item has to be converted */
809 ((le_ih_k_offset(ih) -
810 1) & ~(inode->i_sb->s_blocksize - 1)) + 1;
811 if (tail_offset == cpu_key_k_offset(&key)) {
812 /* direct item we just found fits into block we have
813 to map. Convert it into unformatted node: use
814 bh_result for the conversion */
815 set_block_dev_mapped(bh_result,
816 allocated_block_nr, inode);
820 /* we have to padd file tail stored in direct item(s)
821 up to block size and convert it to unformatted
822 node. FIXME: this should also get into page cache */
826 * ugly, but we can only end the transaction if
829 BUG_ON(!th->t_refcount);
830 if (th->t_refcount == 1) {
832 reiserfs_end_persistent_transaction
840 convert_tail_for_hole(inode, bh_result,
843 if (retval != -ENOSPC)
844 reiserfs_warning(inode->i_sb,
845 "clm-6004: convert tail failed inode %lu, error %d",
848 if (allocated_block_nr) {
849 /* the bitmap, the super, and the stat data == 3 */
851 th = reiserfs_persistent_transaction(inode->i_sb, 3);
853 reiserfs_free_block(th,
863 direct2indirect(th, inode, &path, unbh,
866 reiserfs_unmap_buffer(unbh);
867 reiserfs_free_block(th, inode,
868 allocated_block_nr, 1);
871 /* it is important the set_buffer_uptodate is done after
872 ** the direct2indirect. The buffer might contain valid
873 ** data newer than the data on disk (read by readpage, changed,
874 ** and then sent here by writepage). direct2indirect needs
875 ** to know if unbh was already up to date, so it can decide
876 ** if the data in unbh needs to be replaced with data from
879 set_buffer_uptodate(unbh);
881 /* unbh->b_page == NULL in case of DIRECT_IO request, this means
882 buffer will disappear shortly, so it should not be added to
885 /* we've converted the tail, so we must
886 ** flush unbh before the transaction commits
888 reiserfs_add_tail_list(inode, unbh);
890 /* mark it dirty now to prevent commit_write from adding
891 ** this buffer to the inode's dirty buffer list
894 * AKPM: changed __mark_buffer_dirty to mark_buffer_dirty().
895 * It's still atomic, but it sets the page dirty too,
896 * which makes it eligible for writeback at any time by the
897 * VM (which was also the case with __mark_buffer_dirty())
899 mark_buffer_dirty(unbh);
902 /* append indirect item with holes if needed, when appending
903 pointer to 'block'-th block use block, which is already
905 struct cpu_key tmp_key;
906 unp_t unf_single = 0; // We use this in case we need to allocate only
907 // one block which is a fastpath
909 __u64 max_to_insert =
910 MAX_ITEM_LEN(inode->i_sb->s_blocksize) /
914 RFALSE(pos_in_item != ih_item_len(ih) / UNFM_P_SIZE,
915 "vs-804: invalid position for append");
916 /* indirect item has to be appended, set up key of that position */
917 make_cpu_key(&tmp_key, inode,
918 le_key_k_offset(version,
921 inode->i_sb->s_blocksize),
922 //pos_in_item * inode->i_sb->s_blocksize,
923 TYPE_INDIRECT, 3); // key type is unimportant
925 RFALSE(cpu_key_k_offset(&tmp_key) > cpu_key_k_offset(&key),
926 "green-805: invalid offset");
929 ((cpu_key_k_offset(&key) -
930 cpu_key_k_offset(&tmp_key)) >> inode->i_sb->
933 if (blocks_needed == 1) {
936 un = kzalloc(min(blocks_needed, max_to_insert) * UNFM_P_SIZE, GFP_ATOMIC); // We need to avoid scheduling.
943 if (blocks_needed <= max_to_insert) {
944 /* we are going to add target block to the file. Use allocated
946 un[blocks_needed - 1] =
947 cpu_to_le32(allocated_block_nr);
948 set_block_dev_mapped(bh_result,
949 allocated_block_nr, inode);
950 set_buffer_new(bh_result);
953 /* paste hole to the indirect item */
954 /* If kmalloc failed, max_to_insert becomes zero and it means we
955 only have space for one block */
957 max_to_insert ? max_to_insert : 1;
960 reiserfs_paste_into_item(th, &path, &tmp_key, inode,
965 if (blocks_needed != 1)
969 reiserfs_free_block(th, inode,
970 allocated_block_nr, 1);
974 /* We need to mark new file size in case this function will be
975 interrupted/aborted later on. And we may do this only for
978 inode->i_sb->s_blocksize * blocks_needed;
985 /* this loop could log more blocks than we had originally asked
986 ** for. So, we have to allow the transaction to end if it is
987 ** too big or too full. Update the inode so things are
988 ** consistent if we crash before the function returns
990 ** release the path so that anybody waiting on the path before
991 ** ending their transaction will be able to continue.
993 if (journal_transaction_should_end(th, th->t_blocks_allocated)) {
994 retval = restart_transaction(th, inode, &path);
998 /* inserting indirect pointers for a hole can take a
999 ** long time. reschedule if needed
1003 retval = search_for_position_by_key(inode->i_sb, &key, &path);
1004 if (retval == IO_ERROR) {
1008 if (retval == POSITION_FOUND) {
1009 reiserfs_warning(inode->i_sb,
1010 "vs-825: reiserfs_get_block: "
1011 "%K should not be found", &key);
1013 if (allocated_block_nr)
1014 reiserfs_free_block(th, inode,
1015 allocated_block_nr, 1);
1019 bh = get_last_bh(&path);
1021 item = get_item(&path);
1022 pos_in_item = path.pos_in_item;
1028 if (th && (!dangle || (retval && !th->t_trans_id))) {
1031 reiserfs_update_sd(th, inode);
1032 err = reiserfs_end_persistent_transaction(th);
1037 reiserfs_write_unlock(inode->i_sb);
1038 reiserfs_check_path(&path);
1043 reiserfs_readpages(struct file *file, struct address_space *mapping,
1044 struct list_head *pages, unsigned nr_pages)
1046 return mpage_readpages(mapping, pages, nr_pages, reiserfs_get_block);
1049 /* Compute real number of used bytes by file
1050 * Following three functions can go away when we'll have enough space in stat item
1052 static int real_space_diff(struct inode *inode, int sd_size)
1055 loff_t blocksize = inode->i_sb->s_blocksize;
1057 if (S_ISLNK(inode->i_mode) || S_ISDIR(inode->i_mode))
1060 /* End of file is also in full block with indirect reference, so round
1061 ** up to the next block.
1063 ** there is just no way to know if the tail is actually packed
1064 ** on the file, so we have to assume it isn't. When we pack the
1065 ** tail, we add 4 bytes to pretend there really is an unformatted
1070 (blocksize - 1)) >> inode->i_sb->s_blocksize_bits) * UNFM_P_SIZE +
1075 static inline loff_t to_real_used_space(struct inode *inode, ulong blocks,
1078 if (S_ISLNK(inode->i_mode) || S_ISDIR(inode->i_mode)) {
1079 return inode->i_size +
1080 (loff_t) (real_space_diff(inode, sd_size));
1082 return ((loff_t) real_space_diff(inode, sd_size)) +
1083 (((loff_t) blocks) << 9);
1086 /* Compute number of blocks used by file in ReiserFS counting */
1087 static inline ulong to_fake_used_blocks(struct inode *inode, int sd_size)
1089 loff_t bytes = inode_get_bytes(inode);
1090 loff_t real_space = real_space_diff(inode, sd_size);
1092 /* keeps fsck and non-quota versions of reiserfs happy */
1093 if (S_ISLNK(inode->i_mode) || S_ISDIR(inode->i_mode)) {
1094 bytes += (loff_t) 511;
1097 /* files from before the quota patch might i_blocks such that
1098 ** bytes < real_space. Deal with that here to prevent it from
1101 if (bytes < real_space)
1103 return (bytes - real_space) >> 9;
1107 // BAD: new directories have stat data of new type and all other items
1108 // of old type. Version stored in the inode says about body items, so
1109 // in update_stat_data we can not rely on inode, but have to check
1110 // item version directly
1113 // called by read_locked_inode
1114 static void init_inode(struct inode *inode, struct treepath *path)
1116 struct buffer_head *bh;
1117 struct item_head *ih;
1119 //int version = ITEM_VERSION_1;
1121 bh = PATH_PLAST_BUFFER(path);
1122 ih = PATH_PITEM_HEAD(path);
1124 copy_key(INODE_PKEY(inode), &(ih->ih_key));
1126 INIT_LIST_HEAD(&(REISERFS_I(inode)->i_prealloc_list));
1127 REISERFS_I(inode)->i_flags = 0;
1128 REISERFS_I(inode)->i_prealloc_block = 0;
1129 REISERFS_I(inode)->i_prealloc_count = 0;
1130 REISERFS_I(inode)->i_trans_id = 0;
1131 REISERFS_I(inode)->i_jl = NULL;
1132 mutex_init(&(REISERFS_I(inode)->i_mmap));
1133 reiserfs_init_acl_access(inode);
1134 reiserfs_init_acl_default(inode);
1135 reiserfs_init_xattr_rwsem(inode);
1137 if (stat_data_v1(ih)) {
1138 struct stat_data_v1 *sd =
1139 (struct stat_data_v1 *)B_I_PITEM(bh, ih);
1140 unsigned long blocks;
1142 set_inode_item_key_version(inode, KEY_FORMAT_3_5);
1143 set_inode_sd_version(inode, STAT_DATA_V1);
1144 inode->i_mode = sd_v1_mode(sd);
1145 inode->i_nlink = sd_v1_nlink(sd);
1146 inode->i_uid = sd_v1_uid(sd);
1147 inode->i_gid = sd_v1_gid(sd);
1148 inode->i_size = sd_v1_size(sd);
1149 inode->i_atime.tv_sec = sd_v1_atime(sd);
1150 inode->i_mtime.tv_sec = sd_v1_mtime(sd);
1151 inode->i_ctime.tv_sec = sd_v1_ctime(sd);
1152 inode->i_atime.tv_nsec = 0;
1153 inode->i_ctime.tv_nsec = 0;
1154 inode->i_mtime.tv_nsec = 0;
1156 inode->i_blocks = sd_v1_blocks(sd);
1157 inode->i_generation = le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1158 blocks = (inode->i_size + 511) >> 9;
1159 blocks = _ROUND_UP(blocks, inode->i_sb->s_blocksize >> 9);
1160 if (inode->i_blocks > blocks) {
1161 // there was a bug in <=3.5.23 when i_blocks could take negative
1162 // values. Starting from 3.5.17 this value could even be stored in
1163 // stat data. For such files we set i_blocks based on file
1164 // size. Just 2 notes: this can be wrong for sparce files. On-disk value will be
1165 // only updated if file's inode will ever change
1166 inode->i_blocks = blocks;
1169 rdev = sd_v1_rdev(sd);
1170 REISERFS_I(inode)->i_first_direct_byte =
1171 sd_v1_first_direct_byte(sd);
1172 /* an early bug in the quota code can give us an odd number for the
1173 ** block count. This is incorrect, fix it here.
1175 if (inode->i_blocks & 1) {
1178 inode_set_bytes(inode,
1179 to_real_used_space(inode, inode->i_blocks,
1181 /* nopack is initially zero for v1 objects. For v2 objects,
1182 nopack is initialised from sd_attrs */
1183 REISERFS_I(inode)->i_flags &= ~i_nopack_mask;
1185 // new stat data found, but object may have old items
1186 // (directories and symlinks)
1187 struct stat_data *sd = (struct stat_data *)B_I_PITEM(bh, ih);
1189 inode->i_mode = sd_v2_mode(sd);
1190 inode->i_nlink = sd_v2_nlink(sd);
1191 inode->i_uid = sd_v2_uid(sd);
1192 inode->i_size = sd_v2_size(sd);
1193 inode->i_gid = sd_v2_gid(sd);
1194 inode->i_mtime.tv_sec = sd_v2_mtime(sd);
1195 inode->i_atime.tv_sec = sd_v2_atime(sd);
1196 inode->i_ctime.tv_sec = sd_v2_ctime(sd);
1197 inode->i_ctime.tv_nsec = 0;
1198 inode->i_mtime.tv_nsec = 0;
1199 inode->i_atime.tv_nsec = 0;
1200 inode->i_blocks = sd_v2_blocks(sd);
1201 rdev = sd_v2_rdev(sd);
1202 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
1203 inode->i_generation =
1204 le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1206 inode->i_generation = sd_v2_generation(sd);
1208 if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode))
1209 set_inode_item_key_version(inode, KEY_FORMAT_3_5);
1211 set_inode_item_key_version(inode, KEY_FORMAT_3_6);
1212 REISERFS_I(inode)->i_first_direct_byte = 0;
1213 set_inode_sd_version(inode, STAT_DATA_V2);
1214 inode_set_bytes(inode,
1215 to_real_used_space(inode, inode->i_blocks,
1217 /* read persistent inode attributes from sd and initalise
1218 generic inode flags from them */
1219 REISERFS_I(inode)->i_attrs = sd_v2_attrs(sd);
1220 sd_attrs_to_i_attrs(sd_v2_attrs(sd), inode);
1224 if (S_ISREG(inode->i_mode)) {
1225 inode->i_op = &reiserfs_file_inode_operations;
1226 inode->i_fop = &reiserfs_file_operations;
1227 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
1228 } else if (S_ISDIR(inode->i_mode)) {
1229 inode->i_op = &reiserfs_dir_inode_operations;
1230 inode->i_fop = &reiserfs_dir_operations;
1231 } else if (S_ISLNK(inode->i_mode)) {
1232 inode->i_op = &reiserfs_symlink_inode_operations;
1233 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
1235 inode->i_blocks = 0;
1236 inode->i_op = &reiserfs_special_inode_operations;
1237 init_special_inode(inode, inode->i_mode, new_decode_dev(rdev));
1241 // update new stat data with inode fields
1242 static void inode2sd(void *sd, struct inode *inode, loff_t size)
1244 struct stat_data *sd_v2 = (struct stat_data *)sd;
1247 set_sd_v2_mode(sd_v2, inode->i_mode);
1248 set_sd_v2_nlink(sd_v2, inode->i_nlink);
1249 set_sd_v2_uid(sd_v2, inode->i_uid);
1250 set_sd_v2_size(sd_v2, size);
1251 set_sd_v2_gid(sd_v2, inode->i_gid);
1252 set_sd_v2_mtime(sd_v2, inode->i_mtime.tv_sec);
1253 set_sd_v2_atime(sd_v2, inode->i_atime.tv_sec);
1254 set_sd_v2_ctime(sd_v2, inode->i_ctime.tv_sec);
1255 set_sd_v2_blocks(sd_v2, to_fake_used_blocks(inode, SD_V2_SIZE));
1256 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
1257 set_sd_v2_rdev(sd_v2, new_encode_dev(inode->i_rdev));
1259 set_sd_v2_generation(sd_v2, inode->i_generation);
1260 flags = REISERFS_I(inode)->i_attrs;
1261 i_attrs_to_sd_attrs(inode, &flags);
1262 set_sd_v2_attrs(sd_v2, flags);
1265 // used to copy inode's fields to old stat data
1266 static void inode2sd_v1(void *sd, struct inode *inode, loff_t size)
1268 struct stat_data_v1 *sd_v1 = (struct stat_data_v1 *)sd;
1270 set_sd_v1_mode(sd_v1, inode->i_mode);
1271 set_sd_v1_uid(sd_v1, inode->i_uid);
1272 set_sd_v1_gid(sd_v1, inode->i_gid);
1273 set_sd_v1_nlink(sd_v1, inode->i_nlink);
1274 set_sd_v1_size(sd_v1, size);
1275 set_sd_v1_atime(sd_v1, inode->i_atime.tv_sec);
1276 set_sd_v1_ctime(sd_v1, inode->i_ctime.tv_sec);
1277 set_sd_v1_mtime(sd_v1, inode->i_mtime.tv_sec);
1279 if (S_ISCHR(inode->i_mode) || S_ISBLK(inode->i_mode))
1280 set_sd_v1_rdev(sd_v1, new_encode_dev(inode->i_rdev));
1282 set_sd_v1_blocks(sd_v1, to_fake_used_blocks(inode, SD_V1_SIZE));
1284 // Sigh. i_first_direct_byte is back
1285 set_sd_v1_first_direct_byte(sd_v1,
1286 REISERFS_I(inode)->i_first_direct_byte);
1289 /* NOTE, you must prepare the buffer head before sending it here,
1290 ** and then log it after the call
1292 static void update_stat_data(struct treepath *path, struct inode *inode,
1295 struct buffer_head *bh;
1296 struct item_head *ih;
1298 bh = PATH_PLAST_BUFFER(path);
1299 ih = PATH_PITEM_HEAD(path);
1301 if (!is_statdata_le_ih(ih))
1302 reiserfs_panic(inode->i_sb,
1303 "vs-13065: update_stat_data: key %k, found item %h",
1304 INODE_PKEY(inode), ih);
1306 if (stat_data_v1(ih)) {
1307 // path points to old stat data
1308 inode2sd_v1(B_I_PITEM(bh, ih), inode, size);
1310 inode2sd(B_I_PITEM(bh, ih), inode, size);
1316 void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
1317 struct inode *inode, loff_t size)
1320 INITIALIZE_PATH(path);
1321 struct buffer_head *bh;
1323 struct item_head *ih, tmp_ih;
1326 BUG_ON(!th->t_trans_id);
1328 make_cpu_key(&key, inode, SD_OFFSET, TYPE_STAT_DATA, 3); //key type is unimportant
1332 /* look for the object's stat data */
1333 retval = search_item(inode->i_sb, &key, &path);
1334 if (retval == IO_ERROR) {
1335 reiserfs_warning(inode->i_sb,
1336 "vs-13050: reiserfs_update_sd: "
1337 "i/o failure occurred trying to update %K stat data",
1341 if (retval == ITEM_NOT_FOUND) {
1342 pos = PATH_LAST_POSITION(&path);
1344 if (inode->i_nlink == 0) {
1345 /*reiserfs_warning (inode->i_sb, "vs-13050: reiserfs_update_sd: i_nlink == 0, stat data not found"); */
1348 reiserfs_warning(inode->i_sb,
1349 "vs-13060: reiserfs_update_sd: "
1350 "stat data of object %k (nlink == %d) not found (pos %d)",
1351 INODE_PKEY(inode), inode->i_nlink,
1353 reiserfs_check_path(&path);
1357 /* sigh, prepare_for_journal might schedule. When it schedules the
1358 ** FS might change. We have to detect that, and loop back to the
1359 ** search if the stat data item has moved
1361 bh = get_last_bh(&path);
1363 copy_item_head(&tmp_ih, ih);
1364 fs_gen = get_generation(inode->i_sb);
1365 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);
1366 if (fs_changed(fs_gen, inode->i_sb)
1367 && item_moved(&tmp_ih, &path)) {
1368 reiserfs_restore_prepared_buffer(inode->i_sb, bh);
1369 continue; /* Stat_data item has been moved after scheduling. */
1373 update_stat_data(&path, inode, size);
1374 journal_mark_dirty(th, th->t_super, bh);
1379 /* reiserfs_read_locked_inode is called to read the inode off disk, and it
1380 ** does a make_bad_inode when things go wrong. But, we need to make sure
1381 ** and clear the key in the private portion of the inode, otherwise a
1382 ** corresponding iput might try to delete whatever object the inode last
1385 static void reiserfs_make_bad_inode(struct inode *inode)
1387 memset(INODE_PKEY(inode), 0, KEY_SIZE);
1388 make_bad_inode(inode);
1392 // initially this function was derived from minix or ext2's analog and
1393 // evolved as the prototype did
1396 int reiserfs_init_locked_inode(struct inode *inode, void *p)
1398 struct reiserfs_iget_args *args = (struct reiserfs_iget_args *)p;
1399 inode->i_ino = args->objectid;
1400 INODE_PKEY(inode)->k_dir_id = cpu_to_le32(args->dirid);
1404 /* looks for stat data in the tree, and fills up the fields of in-core
1405 inode stat data fields */
1406 void reiserfs_read_locked_inode(struct inode *inode,
1407 struct reiserfs_iget_args *args)
1409 INITIALIZE_PATH(path_to_sd);
1411 unsigned long dirino;
1414 dirino = args->dirid;
1416 /* set version 1, version 2 could be used too, because stat data
1417 key is the same in both versions */
1418 key.version = KEY_FORMAT_3_5;
1419 key.on_disk_key.k_dir_id = dirino;
1420 key.on_disk_key.k_objectid = inode->i_ino;
1421 key.on_disk_key.k_offset = 0;
1422 key.on_disk_key.k_type = 0;
1424 /* look for the object's stat data */
1425 retval = search_item(inode->i_sb, &key, &path_to_sd);
1426 if (retval == IO_ERROR) {
1427 reiserfs_warning(inode->i_sb,
1428 "vs-13070: reiserfs_read_locked_inode: "
1429 "i/o failure occurred trying to find stat data of %K",
1431 reiserfs_make_bad_inode(inode);
1434 if (retval != ITEM_FOUND) {
1435 /* a stale NFS handle can trigger this without it being an error */
1436 pathrelse(&path_to_sd);
1437 reiserfs_make_bad_inode(inode);
1442 init_inode(inode, &path_to_sd);
1444 /* It is possible that knfsd is trying to access inode of a file
1445 that is being removed from the disk by some other thread. As we
1446 update sd on unlink all that is required is to check for nlink
1447 here. This bug was first found by Sizif when debugging
1448 SquidNG/Butterfly, forgotten, and found again after Philippe
1449 Gramoulle <philippe.gramoulle@mmania.com> reproduced it.
1451 More logical fix would require changes in fs/inode.c:iput() to
1452 remove inode from hash-table _after_ fs cleaned disk stuff up and
1453 in iget() to return NULL if I_FREEING inode is found in
1455 /* Currently there is one place where it's ok to meet inode with
1456 nlink==0: processing of open-unlinked and half-truncated files
1457 during mount (fs/reiserfs/super.c:finish_unfinished()). */
1458 if ((inode->i_nlink == 0) &&
1459 !REISERFS_SB(inode->i_sb)->s_is_unlinked_ok) {
1460 reiserfs_warning(inode->i_sb,
1461 "vs-13075: reiserfs_read_locked_inode: "
1462 "dead inode read from disk %K. "
1463 "This is likely to be race with knfsd. Ignore",
1465 reiserfs_make_bad_inode(inode);
1468 reiserfs_check_path(&path_to_sd); /* init inode should be relsing */
1473 * reiserfs_find_actor() - "find actor" reiserfs supplies to iget5_locked().
1475 * @inode: inode from hash table to check
1476 * @opaque: "cookie" passed to iget5_locked(). This is &reiserfs_iget_args.
1478 * This function is called by iget5_locked() to distinguish reiserfs inodes
1479 * having the same inode numbers. Such inodes can only exist due to some
1480 * error condition. One of them should be bad. Inodes with identical
1481 * inode numbers (objectids) are distinguished by parent directory ids.
1484 int reiserfs_find_actor(struct inode *inode, void *opaque)
1486 struct reiserfs_iget_args *args;
1489 /* args is already in CPU order */
1490 return (inode->i_ino == args->objectid) &&
1491 (le32_to_cpu(INODE_PKEY(inode)->k_dir_id) == args->dirid);
1494 struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key)
1496 struct inode *inode;
1497 struct reiserfs_iget_args args;
1499 args.objectid = key->on_disk_key.k_objectid;
1500 args.dirid = key->on_disk_key.k_dir_id;
1501 inode = iget5_locked(s, key->on_disk_key.k_objectid,
1502 reiserfs_find_actor, reiserfs_init_locked_inode,
1505 return ERR_PTR(-ENOMEM);
1507 if (inode->i_state & I_NEW) {
1508 reiserfs_read_locked_inode(inode, &args);
1509 unlock_new_inode(inode);
1512 if (comp_short_keys(INODE_PKEY(inode), key) || is_bad_inode(inode)) {
1513 /* either due to i/o error or a stale NFS handle */
1520 static struct dentry *reiserfs_get_dentry(struct super_block *sb,
1521 u32 objectid, u32 dir_id, u32 generation)
1525 struct inode *inode;
1527 key.on_disk_key.k_objectid = objectid;
1528 key.on_disk_key.k_dir_id = dir_id;
1529 reiserfs_write_lock(sb);
1530 inode = reiserfs_iget(sb, &key);
1531 if (inode && !IS_ERR(inode) && generation != 0 &&
1532 generation != inode->i_generation) {
1536 reiserfs_write_unlock(sb);
1538 return d_obtain_alias(inode);
1541 struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
1542 int fh_len, int fh_type)
1544 /* fhtype happens to reflect the number of u32s encoded.
1545 * due to a bug in earlier code, fhtype might indicate there
1546 * are more u32s then actually fitted.
1547 * so if fhtype seems to be more than len, reduce fhtype.
1549 * 2 - objectid + dir_id - legacy support
1550 * 3 - objectid + dir_id + generation
1551 * 4 - objectid + dir_id + objectid and dirid of parent - legacy
1552 * 5 - objectid + dir_id + generation + objectid and dirid of parent
1553 * 6 - as above plus generation of directory
1554 * 6 does not fit in NFSv2 handles
1556 if (fh_type > fh_len) {
1557 if (fh_type != 6 || fh_len != 5)
1558 reiserfs_warning(sb,
1559 "nfsd/reiserfs, fhtype=%d, len=%d - odd",
1564 return reiserfs_get_dentry(sb, fid->raw[0], fid->raw[1],
1565 (fh_type == 3 || fh_type >= 5) ? fid->raw[2] : 0);
1568 struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
1569 int fh_len, int fh_type)
1574 return reiserfs_get_dentry(sb,
1575 (fh_type >= 5) ? fid->raw[3] : fid->raw[2],
1576 (fh_type >= 5) ? fid->raw[4] : fid->raw[3],
1577 (fh_type == 6) ? fid->raw[5] : 0);
1580 int reiserfs_encode_fh(struct dentry *dentry, __u32 * data, int *lenp,
1583 struct inode *inode = dentry->d_inode;
1589 data[0] = inode->i_ino;
1590 data[1] = le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1591 data[2] = inode->i_generation;
1593 /* no room for directory info? return what we've stored so far */
1594 if (maxlen < 5 || !need_parent)
1597 spin_lock(&dentry->d_lock);
1598 inode = dentry->d_parent->d_inode;
1599 data[3] = inode->i_ino;
1600 data[4] = le32_to_cpu(INODE_PKEY(inode)->k_dir_id);
1603 data[5] = inode->i_generation;
1606 spin_unlock(&dentry->d_lock);
1610 /* looks for stat data, then copies fields to it, marks the buffer
1611 containing stat data as dirty */
1612 /* reiserfs inodes are never really dirty, since the dirty inode call
1613 ** always logs them. This call allows the VFS inode marking routines
1614 ** to properly mark inodes for datasync and such, but only actually
1615 ** does something when called for a synchronous update.
1617 int reiserfs_write_inode(struct inode *inode, int do_sync)
1619 struct reiserfs_transaction_handle th;
1620 int jbegin_count = 1;
1622 if (inode->i_sb->s_flags & MS_RDONLY)
1624 /* memory pressure can sometimes initiate write_inode calls with sync == 1,
1625 ** these cases are just when the system needs ram, not when the
1626 ** inode needs to reach disk for safety, and they can safely be
1627 ** ignored because the altered inode has already been logged.
1629 if (do_sync && !(current->flags & PF_MEMALLOC)) {
1630 reiserfs_write_lock(inode->i_sb);
1631 if (!journal_begin(&th, inode->i_sb, jbegin_count)) {
1632 reiserfs_update_sd(&th, inode);
1633 journal_end_sync(&th, inode->i_sb, jbegin_count);
1635 reiserfs_write_unlock(inode->i_sb);
1640 /* stat data of new object is inserted already, this inserts the item
1641 containing "." and ".." entries */
1642 static int reiserfs_new_directory(struct reiserfs_transaction_handle *th,
1643 struct inode *inode,
1644 struct item_head *ih, struct treepath *path,
1647 struct super_block *sb = th->t_super;
1648 char empty_dir[EMPTY_DIR_SIZE];
1649 char *body = empty_dir;
1653 BUG_ON(!th->t_trans_id);
1655 _make_cpu_key(&key, KEY_FORMAT_3_5, le32_to_cpu(ih->ih_key.k_dir_id),
1656 le32_to_cpu(ih->ih_key.k_objectid), DOT_OFFSET,
1657 TYPE_DIRENTRY, 3 /*key length */ );
1659 /* compose item head for new item. Directories consist of items of
1660 old type (ITEM_VERSION_1). Do not set key (second arg is 0), it
1661 is done by reiserfs_new_inode */
1662 if (old_format_only(sb)) {
1663 make_le_item_head(ih, NULL, KEY_FORMAT_3_5, DOT_OFFSET,
1664 TYPE_DIRENTRY, EMPTY_DIR_SIZE_V1, 2);
1666 make_empty_dir_item_v1(body, ih->ih_key.k_dir_id,
1667 ih->ih_key.k_objectid,
1668 INODE_PKEY(dir)->k_dir_id,
1669 INODE_PKEY(dir)->k_objectid);
1671 make_le_item_head(ih, NULL, KEY_FORMAT_3_5, DOT_OFFSET,
1672 TYPE_DIRENTRY, EMPTY_DIR_SIZE, 2);
1674 make_empty_dir_item(body, ih->ih_key.k_dir_id,
1675 ih->ih_key.k_objectid,
1676 INODE_PKEY(dir)->k_dir_id,
1677 INODE_PKEY(dir)->k_objectid);
1680 /* look for place in the tree for new item */
1681 retval = search_item(sb, &key, path);
1682 if (retval == IO_ERROR) {
1683 reiserfs_warning(sb, "vs-13080: reiserfs_new_directory: "
1684 "i/o failure occurred creating new directory");
1687 if (retval == ITEM_FOUND) {
1689 reiserfs_warning(sb, "vs-13070: reiserfs_new_directory: "
1690 "object with this key exists (%k)",
1695 /* insert item, that is empty directory item */
1696 return reiserfs_insert_item(th, path, &key, ih, inode, body);
1699 /* stat data of object has been inserted, this inserts the item
1700 containing the body of symlink */
1701 static int reiserfs_new_symlink(struct reiserfs_transaction_handle *th, struct inode *inode, /* Inode of symlink */
1702 struct item_head *ih,
1703 struct treepath *path, const char *symname,
1706 struct super_block *sb = th->t_super;
1710 BUG_ON(!th->t_trans_id);
1712 _make_cpu_key(&key, KEY_FORMAT_3_5,
1713 le32_to_cpu(ih->ih_key.k_dir_id),
1714 le32_to_cpu(ih->ih_key.k_objectid),
1715 1, TYPE_DIRECT, 3 /*key length */ );
1717 make_le_item_head(ih, NULL, KEY_FORMAT_3_5, 1, TYPE_DIRECT, item_len,
1718 0 /*free_space */ );
1720 /* look for place in the tree for new item */
1721 retval = search_item(sb, &key, path);
1722 if (retval == IO_ERROR) {
1723 reiserfs_warning(sb, "vs-13080: reiserfs_new_symlinik: "
1724 "i/o failure occurred creating new symlink");
1727 if (retval == ITEM_FOUND) {
1729 reiserfs_warning(sb, "vs-13080: reiserfs_new_symlink: "
1730 "object with this key exists (%k)",
1735 /* insert item, that is body of symlink */
1736 return reiserfs_insert_item(th, path, &key, ih, inode, symname);
1739 /* inserts the stat data into the tree, and then calls
1740 reiserfs_new_directory (to insert ".", ".." item if new object is
1741 directory) or reiserfs_new_symlink (to insert symlink body if new
1742 object is symlink) or nothing (if new object is regular file)
1744 NOTE! uid and gid must already be set in the inode. If we return
1745 non-zero due to an error, we have to drop the quota previously allocated
1746 for the fresh inode. This can only be done outside a transaction, so
1747 if we return non-zero, we also end the transaction. */
1748 int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
1749 struct inode *dir, int mode, const char *symname,
1750 /* 0 for regular, EMTRY_DIR_SIZE for dirs,
1751 strlen (symname) for symlinks) */
1752 loff_t i_size, struct dentry *dentry,
1753 struct inode *inode)
1755 struct super_block *sb;
1756 struct reiserfs_iget_args args;
1757 INITIALIZE_PATH(path_to_key);
1759 struct item_head ih;
1760 struct stat_data sd;
1764 BUG_ON(!th->t_trans_id);
1766 if (DQUOT_ALLOC_INODE(inode)) {
1770 if (!dir->i_nlink) {
1777 /* item head of new item */
1778 ih.ih_key.k_dir_id = reiserfs_choose_packing(dir);
1779 ih.ih_key.k_objectid = cpu_to_le32(reiserfs_get_unused_objectid(th));
1780 if (!ih.ih_key.k_objectid) {
1784 args.objectid = inode->i_ino = le32_to_cpu(ih.ih_key.k_objectid);
1785 memcpy(INODE_PKEY(inode), &(ih.ih_key), KEY_SIZE);
1786 args.dirid = le32_to_cpu(ih.ih_key.k_dir_id);
1787 if (insert_inode_locked4(inode, args.objectid,
1788 reiserfs_find_actor, &args) < 0) {
1792 if (old_format_only(sb))
1793 /* not a perfect generation count, as object ids can be reused, but
1794 ** this is as good as reiserfs can do right now.
1795 ** note that the private part of inode isn't filled in yet, we have
1796 ** to use the directory.
1798 inode->i_generation = le32_to_cpu(INODE_PKEY(dir)->k_objectid);
1800 #if defined( USE_INODE_GENERATION_COUNTER )
1801 inode->i_generation =
1802 le32_to_cpu(REISERFS_SB(sb)->s_rs->s_inode_generation);
1804 inode->i_generation = ++event;
1807 /* fill stat data */
1808 inode->i_nlink = (S_ISDIR(mode) ? 2 : 1);
1810 /* uid and gid must already be set by the caller for quota init */
1812 /* symlink cannot be immutable or append only, right? */
1813 if (S_ISLNK(inode->i_mode))
1814 inode->i_flags &= ~(S_IMMUTABLE | S_APPEND);
1816 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
1817 inode->i_size = i_size;
1818 inode->i_blocks = 0;
1820 REISERFS_I(inode)->i_first_direct_byte = S_ISLNK(mode) ? 1 :
1821 U32_MAX /*NO_BYTES_IN_DIRECT_ITEM */ ;
1823 INIT_LIST_HEAD(&(REISERFS_I(inode)->i_prealloc_list));
1824 REISERFS_I(inode)->i_flags = 0;
1825 REISERFS_I(inode)->i_prealloc_block = 0;
1826 REISERFS_I(inode)->i_prealloc_count = 0;
1827 REISERFS_I(inode)->i_trans_id = 0;
1828 REISERFS_I(inode)->i_jl = NULL;
1829 REISERFS_I(inode)->i_attrs =
1830 REISERFS_I(dir)->i_attrs & REISERFS_INHERIT_MASK;
1831 sd_attrs_to_i_attrs(REISERFS_I(inode)->i_attrs, inode);
1832 mutex_init(&(REISERFS_I(inode)->i_mmap));
1833 reiserfs_init_acl_access(inode);
1834 reiserfs_init_acl_default(inode);
1835 reiserfs_init_xattr_rwsem(inode);
1837 if (old_format_only(sb))
1838 make_le_item_head(&ih, NULL, KEY_FORMAT_3_5, SD_OFFSET,
1839 TYPE_STAT_DATA, SD_V1_SIZE, MAX_US_INT);
1841 make_le_item_head(&ih, NULL, KEY_FORMAT_3_6, SD_OFFSET,
1842 TYPE_STAT_DATA, SD_SIZE, MAX_US_INT);
1844 /* key to search for correct place for new stat data */
1845 _make_cpu_key(&key, KEY_FORMAT_3_6, le32_to_cpu(ih.ih_key.k_dir_id),
1846 le32_to_cpu(ih.ih_key.k_objectid), SD_OFFSET,
1847 TYPE_STAT_DATA, 3 /*key length */ );
1849 /* find proper place for inserting of stat data */
1850 retval = search_item(sb, &key, &path_to_key);
1851 if (retval == IO_ERROR) {
1855 if (retval == ITEM_FOUND) {
1856 pathrelse(&path_to_key);
1860 if (old_format_only(sb)) {
1861 if (inode->i_uid & ~0xffff || inode->i_gid & ~0xffff) {
1862 pathrelse(&path_to_key);
1863 /* i_uid or i_gid is too big to be stored in stat data v3.5 */
1867 inode2sd_v1(&sd, inode, inode->i_size);
1869 inode2sd(&sd, inode, inode->i_size);
1871 // store in in-core inode the key of stat data and version all
1872 // object items will have (directory items will have old offset
1873 // format, other new objects will consist of new items)
1874 if (old_format_only(sb) || S_ISDIR(mode) || S_ISLNK(mode))
1875 set_inode_item_key_version(inode, KEY_FORMAT_3_5);
1877 set_inode_item_key_version(inode, KEY_FORMAT_3_6);
1878 if (old_format_only(sb))
1879 set_inode_sd_version(inode, STAT_DATA_V1);
1881 set_inode_sd_version(inode, STAT_DATA_V2);
1883 /* insert the stat data into the tree */
1884 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1885 if (REISERFS_I(dir)->new_packing_locality)
1886 th->displace_new_blocks = 1;
1889 reiserfs_insert_item(th, &path_to_key, &key, &ih, inode,
1893 reiserfs_check_path(&path_to_key);
1896 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1897 if (!th->displace_new_blocks)
1898 REISERFS_I(dir)->new_packing_locality = 0;
1900 if (S_ISDIR(mode)) {
1901 /* insert item with "." and ".." */
1903 reiserfs_new_directory(th, inode, &ih, &path_to_key, dir);
1906 if (S_ISLNK(mode)) {
1907 /* insert body of symlink */
1908 if (!old_format_only(sb))
1909 i_size = ROUND_UP(i_size);
1911 reiserfs_new_symlink(th, inode, &ih, &path_to_key, symname,
1916 reiserfs_check_path(&path_to_key);
1917 journal_end(th, th->t_super, th->t_blocks_allocated);
1918 goto out_inserted_sd;
1921 /* XXX CHECK THIS */
1922 if (reiserfs_posixacl(inode->i_sb)) {
1923 retval = reiserfs_inherit_default_acl(dir, dentry, inode);
1926 reiserfs_check_path(&path_to_key);
1927 journal_end(th, th->t_super, th->t_blocks_allocated);
1928 goto out_inserted_sd;
1930 } else if (inode->i_sb->s_flags & MS_POSIXACL) {
1931 reiserfs_warning(inode->i_sb, "ACLs aren't enabled in the fs, "
1932 "but vfs thinks they are!");
1933 } else if (is_reiserfs_priv_object(dir)) {
1934 reiserfs_mark_inode_private(inode);
1937 reiserfs_update_sd(th, inode);
1938 reiserfs_check_path(&path_to_key);
1942 /* it looks like you can easily compress these two goto targets into
1943 * one. Keeping it like this doesn't actually hurt anything, and they
1944 * are place holders for what the quota code actually needs.
1947 /* Invalidate the object, nothing was inserted yet */
1948 INODE_PKEY(inode)->k_objectid = 0;
1950 /* Quota change must be inside a transaction for journaling */
1951 DQUOT_FREE_INODE(inode);
1954 journal_end(th, th->t_super, th->t_blocks_allocated);
1955 /* Drop can be outside and it needs more credits so it's better to have it outside */
1957 inode->i_flags |= S_NOQUOTA;
1958 make_bad_inode(inode);
1962 th->t_trans_id = 0; /* so the caller can't use this handle later */
1963 unlock_new_inode(inode); /* OK to do even if we hadn't locked it */
1965 /* If we were inheriting an ACL, we need to release the lock so that
1966 * iput doesn't deadlock in reiserfs_delete_xattrs. The locking
1967 * code really needs to be reworked, but this will take care of it
1968 * for now. -jeffm */
1969 #ifdef CONFIG_REISERFS_FS_POSIX_ACL
1970 if (REISERFS_I(dir)->i_acl_default && !IS_ERR(REISERFS_I(dir)->i_acl_default)) {
1971 reiserfs_write_unlock_xattrs(dir->i_sb);
1973 reiserfs_write_lock_xattrs(dir->i_sb);
1981 ** finds the tail page in the page cache,
1982 ** reads the last block in.
1984 ** On success, page_result is set to a locked, pinned page, and bh_result
1985 ** is set to an up to date buffer for the last block in the file. returns 0.
1987 ** tail conversion is not done, so bh_result might not be valid for writing
1988 ** check buffer_mapped(bh_result) and bh_result->b_blocknr != 0 before
1989 ** trying to write the block.
1991 ** on failure, nonzero is returned, page_result and bh_result are untouched.
1993 static int grab_tail_page(struct inode *p_s_inode,
1994 struct page **page_result,
1995 struct buffer_head **bh_result)
1998 /* we want the page with the last byte in the file,
1999 ** not the page that will hold the next byte for appending
2001 unsigned long index = (p_s_inode->i_size - 1) >> PAGE_CACHE_SHIFT;
2002 unsigned long pos = 0;
2003 unsigned long start = 0;
2004 unsigned long blocksize = p_s_inode->i_sb->s_blocksize;
2005 unsigned long offset = (p_s_inode->i_size) & (PAGE_CACHE_SIZE - 1);
2006 struct buffer_head *bh;
2007 struct buffer_head *head;
2011 /* we know that we are only called with inode->i_size > 0.
2012 ** we also know that a file tail can never be as big as a block
2013 ** If i_size % blocksize == 0, our file is currently block aligned
2014 ** and it won't need converting or zeroing after a truncate.
2016 if ((offset & (blocksize - 1)) == 0) {
2019 page = grab_cache_page(p_s_inode->i_mapping, index);
2024 /* start within the page of the last block in the file */
2025 start = (offset / blocksize) * blocksize;
2027 error = block_prepare_write(page, start, offset,
2028 reiserfs_get_block_create_0);
2032 head = page_buffers(page);
2038 bh = bh->b_this_page;
2040 } while (bh != head);
2042 if (!buffer_uptodate(bh)) {
2043 /* note, this should never happen, prepare_write should
2044 ** be taking care of this for us. If the buffer isn't up to date,
2045 ** I've screwed up the code to find the buffer, or the code to
2046 ** call prepare_write
2048 reiserfs_warning(p_s_inode->i_sb,
2049 "clm-6000: error reading block %lu on dev %s",
2051 reiserfs_bdevname(p_s_inode->i_sb));
2056 *page_result = page;
2063 page_cache_release(page);
2068 ** vfs version of truncate file. Must NOT be called with
2069 ** a transaction already started.
2071 ** some code taken from block_truncate_page
2073 int reiserfs_truncate_file(struct inode *p_s_inode, int update_timestamps)
2075 struct reiserfs_transaction_handle th;
2076 /* we want the offset for the first byte after the end of the file */
2077 unsigned long offset = p_s_inode->i_size & (PAGE_CACHE_SIZE - 1);
2078 unsigned blocksize = p_s_inode->i_sb->s_blocksize;
2080 struct page *page = NULL;
2082 struct buffer_head *bh = NULL;
2085 reiserfs_write_lock(p_s_inode->i_sb);
2087 if (p_s_inode->i_size > 0) {
2088 if ((error = grab_tail_page(p_s_inode, &page, &bh))) {
2089 // -ENOENT means we truncated past the end of the file,
2090 // and get_block_create_0 could not find a block to read in,
2092 if (error != -ENOENT)
2093 reiserfs_warning(p_s_inode->i_sb,
2094 "clm-6001: grab_tail_page failed %d",
2101 /* so, if page != NULL, we have a buffer head for the offset at
2102 ** the end of the file. if the bh is mapped, and bh->b_blocknr != 0,
2103 ** then we have an unformatted node. Otherwise, we have a direct item,
2104 ** and no zeroing is required on disk. We zero after the truncate,
2105 ** because the truncate might pack the item anyway
2106 ** (it will unmap bh if it packs).
2108 /* it is enough to reserve space in transaction for 2 balancings:
2109 one for "save" link adding and another for the first
2110 cut_from_item. 1 is for update_sd */
2111 error = journal_begin(&th, p_s_inode->i_sb,
2112 JOURNAL_PER_BALANCE_CNT * 2 + 1);
2115 reiserfs_update_inode_transaction(p_s_inode);
2116 if (update_timestamps)
2117 /* we are doing real truncate: if the system crashes before the last
2118 transaction of truncating gets committed - on reboot the file
2119 either appears truncated properly or not truncated at all */
2120 add_save_link(&th, p_s_inode, 1);
2121 err2 = reiserfs_do_truncate(&th, p_s_inode, page, update_timestamps);
2123 journal_end(&th, p_s_inode->i_sb, JOURNAL_PER_BALANCE_CNT * 2 + 1);
2127 /* check reiserfs_do_truncate after ending the transaction */
2133 if (update_timestamps) {
2134 error = remove_save_link(p_s_inode, 1 /* truncate */ );
2140 length = offset & (blocksize - 1);
2141 /* if we are not on a block boundary */
2143 length = blocksize - length;
2144 zero_user(page, offset, length);
2145 if (buffer_mapped(bh) && bh->b_blocknr != 0) {
2146 mark_buffer_dirty(bh);
2150 page_cache_release(page);
2153 reiserfs_write_unlock(p_s_inode->i_sb);
2158 page_cache_release(page);
2160 reiserfs_write_unlock(p_s_inode->i_sb);
2164 static int map_block_for_writepage(struct inode *inode,
2165 struct buffer_head *bh_result,
2166 unsigned long block)
2168 struct reiserfs_transaction_handle th;
2170 struct item_head tmp_ih;
2171 struct item_head *ih;
2172 struct buffer_head *bh;
2175 INITIALIZE_PATH(path);
2177 int jbegin_count = JOURNAL_PER_BALANCE_CNT;
2178 loff_t byte_offset = ((loff_t)block << inode->i_sb->s_blocksize_bits)+1;
2180 int use_get_block = 0;
2181 int bytes_copied = 0;
2183 int trans_running = 0;
2185 /* catch places below that try to log something without starting a trans */
2188 if (!buffer_uptodate(bh_result)) {
2192 kmap(bh_result->b_page);
2194 reiserfs_write_lock(inode->i_sb);
2195 make_cpu_key(&key, inode, byte_offset, TYPE_ANY, 3);
2198 retval = search_for_position_by_key(inode->i_sb, &key, &path);
2199 if (retval != POSITION_FOUND) {
2204 bh = get_last_bh(&path);
2206 item = get_item(&path);
2207 pos_in_item = path.pos_in_item;
2209 /* we've found an unformatted node */
2210 if (indirect_item_found(retval, ih)) {
2211 if (bytes_copied > 0) {
2212 reiserfs_warning(inode->i_sb,
2213 "clm-6002: bytes_copied %d",
2216 if (!get_block_num(item, pos_in_item)) {
2217 /* crap, we are writing to a hole */
2221 set_block_dev_mapped(bh_result,
2222 get_block_num(item, pos_in_item), inode);
2223 } else if (is_direct_le_ih(ih)) {
2225 p = page_address(bh_result->b_page);
2226 p += (byte_offset - 1) & (PAGE_CACHE_SIZE - 1);
2227 copy_size = ih_item_len(ih) - pos_in_item;
2229 fs_gen = get_generation(inode->i_sb);
2230 copy_item_head(&tmp_ih, ih);
2232 if (!trans_running) {
2233 /* vs-3050 is gone, no need to drop the path */
2234 retval = journal_begin(&th, inode->i_sb, jbegin_count);
2237 reiserfs_update_inode_transaction(inode);
2239 if (fs_changed(fs_gen, inode->i_sb)
2240 && item_moved(&tmp_ih, &path)) {
2241 reiserfs_restore_prepared_buffer(inode->i_sb,
2247 reiserfs_prepare_for_journal(inode->i_sb, bh, 1);
2249 if (fs_changed(fs_gen, inode->i_sb)
2250 && item_moved(&tmp_ih, &path)) {
2251 reiserfs_restore_prepared_buffer(inode->i_sb, bh);
2255 memcpy(B_I_PITEM(bh, ih) + pos_in_item, p + bytes_copied,
2258 journal_mark_dirty(&th, inode->i_sb, bh);
2259 bytes_copied += copy_size;
2260 set_block_dev_mapped(bh_result, 0, inode);
2262 /* are there still bytes left? */
2263 if (bytes_copied < bh_result->b_size &&
2264 (byte_offset + bytes_copied) < inode->i_size) {
2265 set_cpu_key_k_offset(&key,
2266 cpu_key_k_offset(&key) +
2271 reiserfs_warning(inode->i_sb,
2272 "clm-6003: bad item inode %lu, device %s",
2273 inode->i_ino, reiserfs_bdevname(inode->i_sb));
2281 if (trans_running) {
2282 int err = journal_end(&th, inode->i_sb, jbegin_count);
2287 reiserfs_write_unlock(inode->i_sb);
2289 /* this is where we fill in holes in the file. */
2290 if (use_get_block) {
2291 retval = reiserfs_get_block(inode, block, bh_result,
2292 GET_BLOCK_CREATE | GET_BLOCK_NO_IMUX
2293 | GET_BLOCK_NO_DANGLE);
2295 if (!buffer_mapped(bh_result)
2296 || bh_result->b_blocknr == 0) {
2297 /* get_block failed to find a mapped unformatted node. */
2303 kunmap(bh_result->b_page);
2305 if (!retval && buffer_mapped(bh_result) && bh_result->b_blocknr == 0) {
2306 /* we've copied data from the page into the direct item, so the
2307 * buffer in the page is now clean, mark it to reflect that.
2309 lock_buffer(bh_result);
2310 clear_buffer_dirty(bh_result);
2311 unlock_buffer(bh_result);
2317 * mason@suse.com: updated in 2.5.54 to follow the same general io
2318 * start/recovery path as __block_write_full_page, along with special
2319 * code to handle reiserfs tails.
2321 static int reiserfs_write_full_page(struct page *page,
2322 struct writeback_control *wbc)
2324 struct inode *inode = page->mapping->host;
2325 unsigned long end_index = inode->i_size >> PAGE_CACHE_SHIFT;
2327 unsigned long block;
2328 sector_t last_block;
2329 struct buffer_head *head, *bh;
2332 int checked = PageChecked(page);
2333 struct reiserfs_transaction_handle th;
2334 struct super_block *s = inode->i_sb;
2335 int bh_per_page = PAGE_CACHE_SIZE / s->s_blocksize;
2338 /* no logging allowed when nonblocking or from PF_MEMALLOC */
2339 if (checked && (current->flags & PF_MEMALLOC)) {
2340 redirty_page_for_writepage(wbc, page);
2345 /* The page dirty bit is cleared before writepage is called, which
2346 * means we have to tell create_empty_buffers to make dirty buffers
2347 * The page really should be up to date at this point, so tossing
2348 * in the BH_Uptodate is just a sanity check.
2350 if (!page_has_buffers(page)) {
2351 create_empty_buffers(page, s->s_blocksize,
2352 (1 << BH_Dirty) | (1 << BH_Uptodate));
2354 head = page_buffers(page);
2356 /* last page in the file, zero out any contents past the
2357 ** last byte in the file
2359 if (page->index >= end_index) {
2360 unsigned last_offset;
2362 last_offset = inode->i_size & (PAGE_CACHE_SIZE - 1);
2363 /* no file contents in this page */
2364 if (page->index >= end_index + 1 || !last_offset) {
2368 zero_user_segment(page, last_offset, PAGE_CACHE_SIZE);
2371 block = page->index << (PAGE_CACHE_SHIFT - s->s_blocksize_bits);
2372 last_block = (i_size_read(inode) - 1) >> inode->i_blkbits;
2373 /* first map all the buffers, logging any direct items we find */
2375 if (block > last_block) {
2377 * This can happen when the block size is less than
2378 * the page size. The corresponding bytes in the page
2379 * were zero filled above
2381 clear_buffer_dirty(bh);
2382 set_buffer_uptodate(bh);
2383 } else if ((checked || buffer_dirty(bh)) &&
2384 (!buffer_mapped(bh) || (buffer_mapped(bh)
2387 /* not mapped yet, or it points to a direct item, search
2388 * the btree for the mapping info, and log any direct
2391 if ((error = map_block_for_writepage(inode, bh, block))) {
2395 bh = bh->b_this_page;
2397 } while (bh != head);
2400 * we start the transaction after map_block_for_writepage,
2401 * because it can create holes in the file (an unbounded operation).
2402 * starting it here, we can make a reliable estimate for how many
2403 * blocks we're going to log
2406 ClearPageChecked(page);
2407 reiserfs_write_lock(s);
2408 error = journal_begin(&th, s, bh_per_page + 1);
2410 reiserfs_write_unlock(s);
2413 reiserfs_update_inode_transaction(inode);
2415 /* now go through and lock any dirty buffers on the page */
2418 if (!buffer_mapped(bh))
2420 if (buffer_mapped(bh) && bh->b_blocknr == 0)
2424 reiserfs_prepare_for_journal(s, bh, 1);
2425 journal_mark_dirty(&th, s, bh);
2428 /* from this point on, we know the buffer is mapped to a
2429 * real block and not a direct item
2431 if (wbc->sync_mode != WB_SYNC_NONE || !wbc->nonblocking) {
2434 if (!trylock_buffer(bh)) {
2435 redirty_page_for_writepage(wbc, page);
2439 if (test_clear_buffer_dirty(bh)) {
2440 mark_buffer_async_write(bh);
2444 } while ((bh = bh->b_this_page) != head);
2447 error = journal_end(&th, s, bh_per_page + 1);
2448 reiserfs_write_unlock(s);
2452 BUG_ON(PageWriteback(page));
2453 set_page_writeback(page);
2457 * since any buffer might be the only dirty buffer on the page,
2458 * the first submit_bh can bring the page out of writeback.
2459 * be careful with the buffers.
2462 struct buffer_head *next = bh->b_this_page;
2463 if (buffer_async_write(bh)) {
2464 submit_bh(WRITE, bh);
2469 } while (bh != head);
2475 * if this page only had a direct item, it is very possible for
2476 * no io to be required without there being an error. Or,
2477 * someone else could have locked them and sent them down the
2478 * pipe without locking the page
2482 if (!buffer_uptodate(bh)) {
2486 bh = bh->b_this_page;
2487 } while (bh != head);
2489 SetPageUptodate(page);
2490 end_page_writeback(page);
2495 /* catches various errors, we need to make sure any valid dirty blocks
2496 * get to the media. The page is currently locked and not marked for
2499 ClearPageUptodate(page);
2503 if (buffer_mapped(bh) && buffer_dirty(bh) && bh->b_blocknr) {
2505 mark_buffer_async_write(bh);
2508 * clear any dirty bits that might have come from getting
2509 * attached to a dirty page
2511 clear_buffer_dirty(bh);
2513 bh = bh->b_this_page;
2514 } while (bh != head);
2516 BUG_ON(PageWriteback(page));
2517 set_page_writeback(page);
2520 struct buffer_head *next = bh->b_this_page;
2521 if (buffer_async_write(bh)) {
2522 clear_buffer_dirty(bh);
2523 submit_bh(WRITE, bh);
2528 } while (bh != head);
2532 static int reiserfs_readpage(struct file *f, struct page *page)
2534 return block_read_full_page(page, reiserfs_get_block);
2537 static int reiserfs_writepage(struct page *page, struct writeback_control *wbc)
2539 struct inode *inode = page->mapping->host;
2540 reiserfs_wait_on_write_block(inode->i_sb);
2541 return reiserfs_write_full_page(page, wbc);
2544 static int reiserfs_write_begin(struct file *file,
2545 struct address_space *mapping,
2546 loff_t pos, unsigned len, unsigned flags,
2547 struct page **pagep, void **fsdata)
2549 struct inode *inode;
2555 inode = mapping->host;
2557 if (flags & AOP_FLAG_CONT_EXPAND &&
2558 (pos & (inode->i_sb->s_blocksize - 1)) == 0) {
2560 *fsdata = (void *)(unsigned long)flags;
2563 index = pos >> PAGE_CACHE_SHIFT;
2564 page = grab_cache_page_write_begin(mapping, index, flags);
2569 reiserfs_wait_on_write_block(inode->i_sb);
2570 fix_tail_page_for_writing(page);
2571 if (reiserfs_transaction_running(inode->i_sb)) {
2572 struct reiserfs_transaction_handle *th;
2573 th = (struct reiserfs_transaction_handle *)current->
2575 BUG_ON(!th->t_refcount);
2576 BUG_ON(!th->t_trans_id);
2577 old_ref = th->t_refcount;
2580 ret = block_write_begin(file, mapping, pos, len, flags, pagep, fsdata,
2581 reiserfs_get_block);
2582 if (ret && reiserfs_transaction_running(inode->i_sb)) {
2583 struct reiserfs_transaction_handle *th = current->journal_info;
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.
2588 * But, if we had nested into an existing transaction, we need
2589 * to just drop the ref count on the handle.
2591 * If old_ref == 0, the transaction is from reiserfs_get_block,
2592 * and it was a persistent trans. Otherwise, it was nested above.
2594 if (th->t_refcount > old_ref) {
2599 reiserfs_write_lock(inode->i_sb);
2600 err = reiserfs_end_persistent_transaction(th);
2601 reiserfs_write_unlock(inode->i_sb);
2609 page_cache_release(page);
2614 int reiserfs_prepare_write(struct file *f, struct page *page,
2615 unsigned from, unsigned to)
2617 struct inode *inode = page->mapping->host;
2621 reiserfs_wait_on_write_block(inode->i_sb);
2622 fix_tail_page_for_writing(page);
2623 if (reiserfs_transaction_running(inode->i_sb)) {
2624 struct reiserfs_transaction_handle *th;
2625 th = (struct reiserfs_transaction_handle *)current->
2627 BUG_ON(!th->t_refcount);
2628 BUG_ON(!th->t_trans_id);
2629 old_ref = th->t_refcount;
2633 ret = block_prepare_write(page, from, to, reiserfs_get_block);
2634 if (ret && reiserfs_transaction_running(inode->i_sb)) {
2635 struct reiserfs_transaction_handle *th = current->journal_info;
2636 /* this gets a little ugly. If reiserfs_get_block returned an
2637 * error and left a transacstion running, we've got to close it,
2638 * and we've got to free handle if it was a persistent transaction.
2640 * But, if we had nested into an existing transaction, we need
2641 * to just drop the ref count on the handle.
2643 * If old_ref == 0, the transaction is from reiserfs_get_block,
2644 * and it was a persistent trans. Otherwise, it was nested above.
2646 if (th->t_refcount > old_ref) {
2651 reiserfs_write_lock(inode->i_sb);
2652 err = reiserfs_end_persistent_transaction(th);
2653 reiserfs_write_unlock(inode->i_sb);
2663 static sector_t reiserfs_aop_bmap(struct address_space *as, sector_t block)
2665 return generic_block_bmap(as, block, reiserfs_bmap);
2668 static int reiserfs_write_end(struct file *file, struct address_space *mapping,
2669 loff_t pos, unsigned len, unsigned copied,
2670 struct page *page, void *fsdata)
2672 struct inode *inode = page->mapping->host;
2675 struct reiserfs_transaction_handle *th;
2678 if ((unsigned long)fsdata & AOP_FLAG_CONT_EXPAND)
2681 reiserfs_wait_on_write_block(inode->i_sb);
2682 if (reiserfs_transaction_running(inode->i_sb))
2683 th = current->journal_info;
2687 start = pos & (PAGE_CACHE_SIZE - 1);
2688 if (unlikely(copied < len)) {
2689 if (!PageUptodate(page))
2692 page_zero_new_buffers(page, start + copied, start + len);
2694 flush_dcache_page(page);
2696 reiserfs_commit_page(inode, page, start, start + copied);
2698 /* generic_commit_write does this for us, but does not update the
2699 ** transaction tracking stuff when the size changes. So, we have
2700 ** to do the i_size updates here.
2703 if (pos > inode->i_size) {
2704 struct reiserfs_transaction_handle myth;
2705 reiserfs_write_lock(inode->i_sb);
2706 /* If the file have grown beyond the border where it
2707 can have a tail, unmark it as needing a tail
2709 if ((have_large_tails(inode->i_sb)
2710 && inode->i_size > i_block_size(inode) * 4)
2711 || (have_small_tails(inode->i_sb)
2712 && inode->i_size > i_block_size(inode)))
2713 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
2715 ret = journal_begin(&myth, inode->i_sb, 1);
2717 reiserfs_write_unlock(inode->i_sb);
2720 reiserfs_update_inode_transaction(inode);
2721 inode->i_size = pos;
2723 * this will just nest into our transaction. It's important
2724 * to use mark_inode_dirty so the inode gets pushed around on the
2725 * dirty lists, and so that O_SYNC works as expected
2727 mark_inode_dirty(inode);
2728 reiserfs_update_sd(&myth, inode);
2730 ret = journal_end(&myth, inode->i_sb, 1);
2731 reiserfs_write_unlock(inode->i_sb);
2736 reiserfs_write_lock(inode->i_sb);
2738 mark_inode_dirty(inode);
2739 ret = reiserfs_end_persistent_transaction(th);
2740 reiserfs_write_unlock(inode->i_sb);
2747 page_cache_release(page);
2748 return ret == 0 ? copied : ret;
2752 reiserfs_write_lock(inode->i_sb);
2754 reiserfs_update_sd(th, inode);
2755 ret = reiserfs_end_persistent_transaction(th);
2756 reiserfs_write_unlock(inode->i_sb);
2762 int reiserfs_commit_write(struct file *f, struct page *page,
2763 unsigned from, unsigned to)
2765 struct inode *inode = page->mapping->host;
2766 loff_t pos = ((loff_t) page->index << PAGE_CACHE_SHIFT) + to;
2769 struct reiserfs_transaction_handle *th = NULL;
2771 reiserfs_wait_on_write_block(inode->i_sb);
2772 if (reiserfs_transaction_running(inode->i_sb)) {
2773 th = current->journal_info;
2775 reiserfs_commit_page(inode, page, from, to);
2777 /* generic_commit_write does this for us, but does not update the
2778 ** transaction tracking stuff when the size changes. So, we have
2779 ** to do the i_size updates here.
2781 if (pos > inode->i_size) {
2782 struct reiserfs_transaction_handle myth;
2783 reiserfs_write_lock(inode->i_sb);
2784 /* If the file have grown beyond the border where it
2785 can have a tail, unmark it as needing a tail
2787 if ((have_large_tails(inode->i_sb)
2788 && inode->i_size > i_block_size(inode) * 4)
2789 || (have_small_tails(inode->i_sb)
2790 && inode->i_size > i_block_size(inode)))
2791 REISERFS_I(inode)->i_flags &= ~i_pack_on_close_mask;
2793 ret = journal_begin(&myth, inode->i_sb, 1);
2795 reiserfs_write_unlock(inode->i_sb);
2798 reiserfs_update_inode_transaction(inode);
2799 inode->i_size = pos;
2801 * this will just nest into our transaction. It's important
2802 * to use mark_inode_dirty so the inode gets pushed around on the
2803 * dirty lists, and so that O_SYNC works as expected
2805 mark_inode_dirty(inode);
2806 reiserfs_update_sd(&myth, inode);
2808 ret = journal_end(&myth, inode->i_sb, 1);
2809 reiserfs_write_unlock(inode->i_sb);
2814 reiserfs_write_lock(inode->i_sb);
2816 mark_inode_dirty(inode);
2817 ret = reiserfs_end_persistent_transaction(th);
2818 reiserfs_write_unlock(inode->i_sb);
2828 reiserfs_write_lock(inode->i_sb);
2830 reiserfs_update_sd(th, inode);
2831 ret = reiserfs_end_persistent_transaction(th);
2832 reiserfs_write_unlock(inode->i_sb);
2838 void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode)
2840 if (reiserfs_attrs(inode->i_sb)) {
2841 if (sd_attrs & REISERFS_SYNC_FL)
2842 inode->i_flags |= S_SYNC;
2844 inode->i_flags &= ~S_SYNC;
2845 if (sd_attrs & REISERFS_IMMUTABLE_FL)
2846 inode->i_flags |= S_IMMUTABLE;
2848 inode->i_flags &= ~S_IMMUTABLE;
2849 if (sd_attrs & REISERFS_APPEND_FL)
2850 inode->i_flags |= S_APPEND;
2852 inode->i_flags &= ~S_APPEND;
2853 if (sd_attrs & REISERFS_NOATIME_FL)
2854 inode->i_flags |= S_NOATIME;
2856 inode->i_flags &= ~S_NOATIME;
2857 if (sd_attrs & REISERFS_NOTAIL_FL)
2858 REISERFS_I(inode)->i_flags |= i_nopack_mask;
2860 REISERFS_I(inode)->i_flags &= ~i_nopack_mask;
2864 void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs)
2866 if (reiserfs_attrs(inode->i_sb)) {
2867 if (inode->i_flags & S_IMMUTABLE)
2868 *sd_attrs |= REISERFS_IMMUTABLE_FL;
2870 *sd_attrs &= ~REISERFS_IMMUTABLE_FL;
2871 if (inode->i_flags & S_SYNC)
2872 *sd_attrs |= REISERFS_SYNC_FL;
2874 *sd_attrs &= ~REISERFS_SYNC_FL;
2875 if (inode->i_flags & S_NOATIME)
2876 *sd_attrs |= REISERFS_NOATIME_FL;
2878 *sd_attrs &= ~REISERFS_NOATIME_FL;
2879 if (REISERFS_I(inode)->i_flags & i_nopack_mask)
2880 *sd_attrs |= REISERFS_NOTAIL_FL;
2882 *sd_attrs &= ~REISERFS_NOTAIL_FL;
2886 /* decide if this buffer needs to stay around for data logging or ordered
2889 static int invalidatepage_can_drop(struct inode *inode, struct buffer_head *bh)
2892 struct reiserfs_journal *j = SB_JOURNAL(inode->i_sb);
2895 spin_lock(&j->j_dirty_buffers_lock);
2896 if (!buffer_mapped(bh)) {
2899 /* the page is locked, and the only places that log a data buffer
2900 * also lock the page.
2902 if (reiserfs_file_data_log(inode)) {
2904 * very conservative, leave the buffer pinned if
2905 * anyone might need it.
2907 if (buffer_journaled(bh) || buffer_journal_dirty(bh)) {
2910 } else if (buffer_dirty(bh)) {
2911 struct reiserfs_journal_list *jl;
2912 struct reiserfs_jh *jh = bh->b_private;
2914 /* why is this safe?
2915 * reiserfs_setattr updates i_size in the on disk
2916 * stat data before allowing vmtruncate to be called.
2918 * If buffer was put onto the ordered list for this
2919 * transaction, we know for sure either this transaction
2920 * or an older one already has updated i_size on disk,
2921 * and this ordered data won't be referenced in the file
2924 * if the buffer was put onto the ordered list for an older
2925 * transaction, we need to leave it around
2927 if (jh && (jl = jh->jl)
2928 && jl != SB_JOURNAL(inode->i_sb)->j_current_jl)
2932 if (ret && bh->b_private) {
2933 reiserfs_free_jh(bh);
2935 spin_unlock(&j->j_dirty_buffers_lock);
2940 /* clm -- taken from fs/buffer.c:block_invalidate_page */
2941 static void reiserfs_invalidatepage(struct page *page, unsigned long offset)
2943 struct buffer_head *head, *bh, *next;
2944 struct inode *inode = page->mapping->host;
2945 unsigned int curr_off = 0;
2948 BUG_ON(!PageLocked(page));
2951 ClearPageChecked(page);
2953 if (!page_has_buffers(page))
2956 head = page_buffers(page);
2959 unsigned int next_off = curr_off + bh->b_size;
2960 next = bh->b_this_page;
2963 * is this block fully invalidated?
2965 if (offset <= curr_off) {
2966 if (invalidatepage_can_drop(inode, bh))
2967 reiserfs_unmap_buffer(bh);
2971 curr_off = next_off;
2973 } while (bh != head);
2976 * We release buffers only if the entire page is being invalidated.
2977 * The get_block cached value has been unconditionally invalidated,
2978 * so real IO is not possible anymore.
2980 if (!offset && ret) {
2981 ret = try_to_release_page(page, 0);
2982 /* maybe should BUG_ON(!ret); - neilb */
2988 static int reiserfs_set_page_dirty(struct page *page)
2990 struct inode *inode = page->mapping->host;
2991 if (reiserfs_file_data_log(inode)) {
2992 SetPageChecked(page);
2993 return __set_page_dirty_nobuffers(page);
2995 return __set_page_dirty_buffers(page);
2999 * Returns 1 if the page's buffers were dropped. The page is locked.
3001 * Takes j_dirty_buffers_lock to protect the b_assoc_buffers list_heads
3002 * in the buffers at page_buffers(page).
3004 * even in -o notail mode, we can't be sure an old mount without -o notail
3005 * didn't create files with tails.
3007 static int reiserfs_releasepage(struct page *page, gfp_t unused_gfp_flags)
3009 struct inode *inode = page->mapping->host;
3010 struct reiserfs_journal *j = SB_JOURNAL(inode->i_sb);
3011 struct buffer_head *head;
3012 struct buffer_head *bh;
3015 WARN_ON(PageChecked(page));
3016 spin_lock(&j->j_dirty_buffers_lock);
3017 head = page_buffers(page);
3020 if (bh->b_private) {
3021 if (!buffer_dirty(bh) && !buffer_locked(bh)) {
3022 reiserfs_free_jh(bh);
3028 bh = bh->b_this_page;
3029 } while (bh != head);
3031 ret = try_to_free_buffers(page);
3032 spin_unlock(&j->j_dirty_buffers_lock);
3036 /* We thank Mingming Cao for helping us understand in great detail what
3037 to do in this section of the code. */
3038 static ssize_t reiserfs_direct_IO(int rw, struct kiocb *iocb,
3039 const struct iovec *iov, loff_t offset,
3040 unsigned long nr_segs)
3042 struct file *file = iocb->ki_filp;
3043 struct inode *inode = file->f_mapping->host;
3045 return blockdev_direct_IO(rw, iocb, inode, inode->i_sb->s_bdev, iov,
3047 reiserfs_get_blocks_direct_io, NULL);
3050 int reiserfs_setattr(struct dentry *dentry, struct iattr *attr)
3052 struct inode *inode = dentry->d_inode;
3054 unsigned int ia_valid;
3056 /* must be turned off for recursive notify_change calls */
3057 ia_valid = attr->ia_valid &= ~(ATTR_KILL_SUID|ATTR_KILL_SGID);
3059 reiserfs_write_lock(inode->i_sb);
3060 if (attr->ia_valid & ATTR_SIZE) {
3061 /* version 2 items will be caught by the s_maxbytes check
3062 ** done for us in vmtruncate
3064 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5 &&
3065 attr->ia_size > MAX_NON_LFS) {
3069 /* fill in hole pointers in the expanding truncate case. */
3070 if (attr->ia_size > inode->i_size) {
3071 error = generic_cont_expand_simple(inode, attr->ia_size);
3072 if (REISERFS_I(inode)->i_prealloc_count > 0) {
3074 struct reiserfs_transaction_handle th;
3075 /* we're changing at most 2 bitmaps, inode + super */
3076 err = journal_begin(&th, inode->i_sb, 4);
3078 reiserfs_discard_prealloc(&th, inode);
3079 err = journal_end(&th, inode->i_sb, 4);
3087 * file size is changed, ctime and mtime are
3090 attr->ia_valid |= (ATTR_MTIME | ATTR_CTIME);
3094 if ((((attr->ia_valid & ATTR_UID) && (attr->ia_uid & ~0xffff)) ||
3095 ((attr->ia_valid & ATTR_GID) && (attr->ia_gid & ~0xffff))) &&
3096 (get_inode_sd_version(inode) == STAT_DATA_V1)) {
3097 /* stat data of format v3.5 has 16 bit uid and gid */
3102 error = inode_change_ok(inode, attr);
3104 if ((ia_valid & ATTR_UID && attr->ia_uid != inode->i_uid) ||
3105 (ia_valid & ATTR_GID && attr->ia_gid != inode->i_gid)) {
3106 error = reiserfs_chown_xattrs(inode, attr);
3109 struct reiserfs_transaction_handle th;
3112 (REISERFS_QUOTA_INIT_BLOCKS(inode->i_sb) +
3113 REISERFS_QUOTA_DEL_BLOCKS(inode->i_sb)) +
3116 /* (user+group)*(old+new) structure - we count quota info and , inode write (sb, inode) */
3118 journal_begin(&th, inode->i_sb,
3123 DQUOT_TRANSFER(inode, attr) ? -EDQUOT : 0;
3125 journal_end(&th, inode->i_sb,
3129 /* Update corresponding info in inode so that everything is in
3130 * one transaction */
3131 if (attr->ia_valid & ATTR_UID)
3132 inode->i_uid = attr->ia_uid;
3133 if (attr->ia_valid & ATTR_GID)
3134 inode->i_gid = attr->ia_gid;
3135 mark_inode_dirty(inode);
3137 journal_end(&th, inode->i_sb, jbegin_count);
3141 error = inode_setattr(inode, attr);
3144 if (!error && reiserfs_posixacl(inode->i_sb)) {
3145 if (attr->ia_valid & ATTR_MODE)
3146 error = reiserfs_acl_chmod(inode);
3150 reiserfs_write_unlock(inode->i_sb);
3154 const struct address_space_operations reiserfs_address_space_operations = {
3155 .writepage = reiserfs_writepage,
3156 .readpage = reiserfs_readpage,
3157 .readpages = reiserfs_readpages,
3158 .releasepage = reiserfs_releasepage,
3159 .invalidatepage = reiserfs_invalidatepage,
3160 .sync_page = block_sync_page,
3161 .write_begin = reiserfs_write_begin,
3162 .write_end = reiserfs_write_end,
3163 .bmap = reiserfs_aop_bmap,
3164 .direct_IO = reiserfs_direct_IO,
3165 .set_page_dirty = reiserfs_set_page_dirty,