2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
5 #include <linux/config.h>
6 #include <linux/time.h>
8 #include <linux/reiserfs_fs.h>
9 #include <linux/reiserfs_acl.h>
10 #include <linux/reiserfs_xattr.h>
11 #include <linux/smp_lock.h>
12 #include <linux/pagemap.h>
13 #include <linux/highmem.h>
14 #include <asm/uaccess.h>
15 #include <asm/unaligned.h>
16 #include <linux/buffer_head.h>
17 #include <linux/mpage.h>
18 #include <linux/writeback.h>
19 #include <linux/quotaops.h>
21 extern int reiserfs_default_io_size
; /* default io size devuned in super.c */
23 static int reiserfs_commit_write(struct file
*f
, struct page
*page
,
24 unsigned from
, unsigned to
);
25 static int reiserfs_prepare_write(struct file
*f
, struct page
*page
,
26 unsigned from
, unsigned to
);
28 void reiserfs_delete_inode(struct inode
*inode
)
30 /* We need blocks for transaction + (user+group) quota update (possibly delete) */
32 JOURNAL_PER_BALANCE_CNT
* 2 +
33 2 * REISERFS_QUOTA_INIT_BLOCKS(inode
->i_sb
);
34 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 */
44 reiserfs_delete_xattrs(inode
);
46 if (journal_begin(&th
, inode
->i_sb
, jbegin_count
)) {
50 reiserfs_update_inode_transaction(inode
);
52 if (reiserfs_delete_object(&th
, inode
)) {
57 /* Do quota update inside a transaction for journaled quotas. We must do that
58 * after delete_object so that quota updates go into the same transaction as
59 * stat data deletion */
60 DQUOT_FREE_INODE(inode
);
62 if (journal_end(&th
, inode
->i_sb
, jbegin_count
)) {
69 /* all items of file are deleted, so we can remove "save" link */
70 remove_save_link(inode
, 0 /* not truncate */ ); /* we can't do anything
71 * about an error here */
73 /* no object items are in the tree */
77 clear_inode(inode
); /* note this must go after the journal_end to prevent deadlock */
79 reiserfs_write_unlock(inode
->i_sb
);
82 static void _make_cpu_key(struct cpu_key
*key
, int version
, __u32 dirid
,
83 __u32 objectid
, loff_t offset
, int type
, int length
)
85 key
->version
= version
;
87 key
->on_disk_key
.k_dir_id
= dirid
;
88 key
->on_disk_key
.k_objectid
= objectid
;
89 set_cpu_key_k_offset(key
, offset
);
90 set_cpu_key_k_type(key
, type
);
91 key
->key_length
= length
;
94 /* take base of inode_key (it comes from inode always) (dirid, objectid) and version from an inode, set
95 offset and type of key */
96 void make_cpu_key(struct cpu_key
*key
, struct inode
*inode
, loff_t offset
,
99 _make_cpu_key(key
, get_inode_item_key_version(inode
),
100 le32_to_cpu(INODE_PKEY(inode
)->k_dir_id
),
101 le32_to_cpu(INODE_PKEY(inode
)->k_objectid
), offset
, type
,
106 // when key is 0, do not set version and short key
108 inline void make_le_item_head(struct item_head
*ih
, const struct cpu_key
*key
,
110 loff_t offset
, int type
, int length
,
111 int entry_count
/*or ih_free_space */ )
114 ih
->ih_key
.k_dir_id
= cpu_to_le32(key
->on_disk_key
.k_dir_id
);
115 ih
->ih_key
.k_objectid
=
116 cpu_to_le32(key
->on_disk_key
.k_objectid
);
118 put_ih_version(ih
, version
);
119 set_le_ih_k_offset(ih
, offset
);
120 set_le_ih_k_type(ih
, type
);
121 put_ih_item_len(ih
, length
);
122 /* set_ih_free_space (ih, 0); */
123 // for directory items it is entry count, for directs and stat
124 // datas - 0xffff, for indirects - 0
125 put_ih_entry_count(ih
, entry_count
);
129 // FIXME: we might cache recently accessed indirect item
131 // Ugh. Not too eager for that....
132 // I cut the code until such time as I see a convincing argument (benchmark).
133 // I don't want a bloated inode struct..., and I don't like code complexity....
135 /* cutting the code is fine, since it really isn't in use yet and is easy
136 ** to add back in. But, Vladimir has a really good idea here. Think
137 ** about what happens for reading a file. For each page,
138 ** The VFS layer calls reiserfs_readpage, who searches the tree to find
139 ** an indirect item. This indirect item has X number of pointers, where
140 ** X is a big number if we've done the block allocation right. But,
141 ** we only use one or two of these pointers during each call to readpage,
142 ** needlessly researching again later on.
144 ** The size of the cache could be dynamic based on the size of the file.
146 ** I'd also like to see us cache the location the stat data item, since
147 ** we are needlessly researching for that frequently.
152 /* If this page has a file tail in it, and
153 ** it was read in by get_block_create_0, the page data is valid,
154 ** but tail is still sitting in a direct item, and we can't write to
155 ** it. So, look through this page, and check all the mapped buffers
156 ** to make sure they have valid block numbers. Any that don't need
157 ** to be unmapped, so that block_prepare_write will correctly call
158 ** reiserfs_get_block to convert the tail into an unformatted node
160 static inline void fix_tail_page_for_writing(struct page
*page
)
162 struct buffer_head
*head
, *next
, *bh
;
164 if (page
&& page_has_buffers(page
)) {
165 head
= page_buffers(page
);
168 next
= bh
->b_this_page
;
169 if (buffer_mapped(bh
) && bh
->b_blocknr
== 0) {
170 reiserfs_unmap_buffer(bh
);
173 } while (bh
!= head
);
177 /* reiserfs_get_block does not need to allocate a block only if it has been
178 done already or non-hole position has been found in the indirect item */
179 static inline int allocation_needed(int retval
, b_blocknr_t allocated
,
180 struct item_head
*ih
,
181 __le32
* item
, int pos_in_item
)
185 if (retval
== POSITION_FOUND
&& is_indirect_le_ih(ih
) &&
186 get_block_num(item
, pos_in_item
))
191 static inline int indirect_item_found(int retval
, struct item_head
*ih
)
193 return (retval
== POSITION_FOUND
) && is_indirect_le_ih(ih
);
196 static inline void set_block_dev_mapped(struct buffer_head
*bh
,
197 b_blocknr_t block
, struct inode
*inode
)
199 map_bh(bh
, inode
->i_sb
, block
);
203 // files which were created in the earlier version can not be longer,
206 static int file_capable(struct inode
*inode
, long block
)
208 if (get_inode_item_key_version(inode
) != KEY_FORMAT_3_5
|| // it is new file.
209 block
< (1 << (31 - inode
->i_sb
->s_blocksize_bits
))) // old file, but 'block' is inside of 2gb
215 /*static*/ int restart_transaction(struct reiserfs_transaction_handle
*th
,
216 struct inode
*inode
, struct path
*path
)
218 struct super_block
*s
= th
->t_super
;
219 int len
= th
->t_blocks_allocated
;
222 BUG_ON(!th
->t_trans_id
);
223 BUG_ON(!th
->t_refcount
);
225 /* we cannot restart while nested */
226 if (th
->t_refcount
> 1) {
230 reiserfs_update_sd(th
, inode
);
231 err
= journal_end(th
, s
, len
);
233 err
= journal_begin(th
, s
, JOURNAL_PER_BALANCE_CNT
* 6);
235 reiserfs_update_inode_transaction(inode
);
240 // it is called by get_block when create == 0. Returns block number
241 // for 'block'-th logical block of file. When it hits direct item it
242 // returns 0 (being called from bmap) or read direct item into piece
243 // of page (bh_result)
245 // Please improve the english/clarity in the comment above, as it is
246 // hard to understand.
248 static int _get_block_create_0(struct inode
*inode
, long block
,
249 struct buffer_head
*bh_result
, int args
)
251 INITIALIZE_PATH(path
);
253 struct buffer_head
*bh
;
254 struct item_head
*ih
, tmp_ih
;
262 unsigned long offset
;
264 // prepare the key to look for the 'block'-th block of file
265 make_cpu_key(&key
, inode
,
266 (loff_t
) block
* inode
->i_sb
->s_blocksize
+ 1, TYPE_ANY
,
270 result
= search_for_position_by_key(inode
->i_sb
, &key
, &path
);
271 if (result
!= POSITION_FOUND
) {
274 kunmap(bh_result
->b_page
);
275 if (result
== IO_ERROR
)
277 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
278 // That there is some MMAPED data associated with it that is yet to be written to disk.
279 if ((args
& GET_BLOCK_NO_HOLE
)
280 && !PageUptodate(bh_result
->b_page
)) {
286 bh
= get_last_bh(&path
);
288 if (is_indirect_le_ih(ih
)) {
289 __le32
*ind_item
= (__le32
*) B_I_PITEM(bh
, ih
);
291 /* FIXME: here we could cache indirect item or part of it in
292 the inode to avoid search_by_key in case of subsequent
294 blocknr
= get_block_num(ind_item
, path
.pos_in_item
);
297 map_bh(bh_result
, inode
->i_sb
, blocknr
);
298 if (path
.pos_in_item
==
299 ((ih_item_len(ih
) / UNFM_P_SIZE
) - 1)) {
300 set_buffer_boundary(bh_result
);
303 // We do not return -ENOENT if there is a hole but page is uptodate, because it means
304 // That there is some MMAPED data associated with it that is yet to be written to disk.
305 if ((args
& GET_BLOCK_NO_HOLE
)
306 && !PageUptodate(bh_result
->b_page
)) {
312 kunmap(bh_result
->b_page
);
315 // requested data are in direct item(s)
316 if (!(args
& GET_BLOCK_READ_DIRECT
)) {
317 // we are called by bmap. FIXME: we can not map block of file
318 // when it is stored in direct item(s)
321 kunmap(bh_result
->b_page
);
325 /* if we've got a direct item, and the buffer or page was uptodate,
326 ** we don't want to pull data off disk again. skip to the
327 ** end, where we map the buffer and return
329 if (buffer_uptodate(bh_result
)) {
333 ** grab_tail_page can trigger calls to reiserfs_get_block on up to date
334 ** pages without any buffers. If the page is up to date, we don't want
335 ** read old data off disk. Set the up to date bit on the buffer instead
336 ** and jump to the end
338 if (!bh_result
->b_page
|| PageUptodate(bh_result
->b_page
)) {
339 set_buffer_uptodate(bh_result
);
342 // read file tail into part of page
343 offset
= (cpu_key_k_offset(&key
) - 1) & (PAGE_CACHE_SIZE
- 1);
344 fs_gen
= get_generation(inode
->i_sb
);
345 copy_item_head(&tmp_ih
, ih
);
347 /* we only want to kmap if we are reading the tail into the page.
348 ** this is not the common case, so we don't kmap until we are
349 ** sure we need to. But, this means the item might move if
353 p
= (char *)kmap(bh_result
->b_page
);
354 if (fs_changed(fs_gen
, inode
->i_sb
)
355 && item_moved(&tmp_ih
, &path
)) {
360 memset(p
, 0, inode
->i_sb
->s_blocksize
);
362 if (!is_direct_le_ih(ih
)) {
365 /* make sure we don't read more bytes than actually exist in
366 ** the file. This can happen in odd cases where i_size isn't
367 ** correct, and when direct item padding results in a few
368 ** extra bytes at the end of the direct item
370 if ((le_ih_k_offset(ih
) + path
.pos_in_item
) > inode
->i_size
)
372 if ((le_ih_k_offset(ih
) - 1 + ih_item_len(ih
)) > inode
->i_size
) {
374 inode
->i_size
- (le_ih_k_offset(ih
) - 1) -
378 chars
= ih_item_len(ih
) - path
.pos_in_item
;
380 memcpy(p
, B_I_PITEM(bh
, ih
) + path
.pos_in_item
, chars
);
387 if (PATH_LAST_POSITION(&path
) != (B_NR_ITEMS(bh
) - 1))
388 // we done, if read direct item is not the last item of
389 // node FIXME: we could try to check right delimiting key
390 // to see whether direct item continues in the right
391 // neighbor or rely on i_size
394 // update key to look for the next piece
395 set_cpu_key_k_offset(&key
, cpu_key_k_offset(&key
) + chars
);
396 result
= search_for_position_by_key(inode
->i_sb
, &key
, &path
);
397 if (result
!= POSITION_FOUND
)
398 // i/o error most likely
400 bh
= get_last_bh(&path
);
404 flush_dcache_page(bh_result
->b_page
);
405 kunmap(bh_result
->b_page
);
410 if (result
== IO_ERROR
)
413 /* this buffer has valid data, but isn't valid for io. mapping it to
414 * block #0 tells the rest of reiserfs it just has a tail in it
416 map_bh(bh_result
, inode
->i_sb
, 0);
417 set_buffer_uptodate(bh_result
);
421 // this is called to create file map. So, _get_block_create_0 will not
423 static int reiserfs_bmap(struct inode
*inode
, sector_t block
,
424 struct buffer_head
*bh_result
, int create
)
426 if (!file_capable(inode
, block
))
429 reiserfs_write_lock(inode
->i_sb
);
430 /* do not read the direct item */
431 _get_block_create_0(inode
, block
, bh_result
, 0);
432 reiserfs_write_unlock(inode
->i_sb
);
436 /* special version of get_block that is only used by grab_tail_page right
437 ** now. It is sent to block_prepare_write, and when you try to get a
438 ** block past the end of the file (or a block from a hole) it returns
439 ** -ENOENT instead of a valid buffer. block_prepare_write expects to
440 ** be able to do i/o on the buffers returned, unless an error value
443 ** So, this allows block_prepare_write to be used for reading a single block
444 ** in a page. Where it does not produce a valid page for holes, or past the
445 ** end of the file. This turns out to be exactly what we need for reading
446 ** tails for conversion.
448 ** The point of the wrapper is forcing a certain value for create, even
449 ** though the VFS layer is calling this function with create==1. If you
450 ** don't want to send create == GET_BLOCK_NO_HOLE to reiserfs_get_block,
451 ** don't use this function.
453 static int reiserfs_get_block_create_0(struct inode
*inode
, sector_t block
,
454 struct buffer_head
*bh_result
,
457 return reiserfs_get_block(inode
, block
, bh_result
, GET_BLOCK_NO_HOLE
);
460 /* This is special helper for reiserfs_get_block in case we are executing
461 direct_IO request. */
462 static int reiserfs_get_blocks_direct_io(struct inode
*inode
,
464 unsigned long max_blocks
,
465 struct buffer_head
*bh_result
,
470 bh_result
->b_page
= NULL
;
472 /* We set the b_size before reiserfs_get_block call since it is
473 referenced in convert_tail_for_hole() that may be called from
474 reiserfs_get_block() */
475 bh_result
->b_size
= (1 << inode
->i_blkbits
);
477 ret
= reiserfs_get_block(inode
, iblock
, bh_result
,
478 create
| GET_BLOCK_NO_DANGLE
);
482 /* don't allow direct io onto tail pages */
483 if (buffer_mapped(bh_result
) && bh_result
->b_blocknr
== 0) {
484 /* make sure future calls to the direct io funcs for this offset
485 ** in the file fail by unmapping the buffer
487 clear_buffer_mapped(bh_result
);
490 /* Possible unpacked tail. Flush the data before pages have
492 if (REISERFS_I(inode
)->i_flags
& i_pack_on_close_mask
) {
495 err
= reiserfs_commit_for_inode(inode
);
496 REISERFS_I(inode
)->i_flags
&= ~i_pack_on_close_mask
;
506 ** helper function for when reiserfs_get_block is called for a hole
507 ** but the file tail is still in a direct item
508 ** bh_result is the buffer head for the hole
509 ** tail_offset is the offset of the start of the tail in the file
511 ** This calls prepare_write, which will start a new transaction
512 ** you should not be in a transaction, or have any paths held when you
515 static int convert_tail_for_hole(struct inode
*inode
,
516 struct buffer_head
*bh_result
,
520 unsigned long tail_end
;
521 unsigned long tail_start
;
522 struct page
*tail_page
;
523 struct page
*hole_page
= bh_result
->b_page
;
526 if ((tail_offset
& (bh_result
->b_size
- 1)) != 1)
529 /* always try to read until the end of the block */
530 tail_start
= tail_offset
& (PAGE_CACHE_SIZE
- 1);
531 tail_end
= (tail_start
| (bh_result
->b_size
- 1)) + 1;
533 index
= tail_offset
>> PAGE_CACHE_SHIFT
;
534 /* hole_page can be zero in case of direct_io, we are sure
535 that we cannot get here if we write with O_DIRECT into
537 if (!hole_page
|| index
!= hole_page
->index
) {
538 tail_page
= grab_cache_page(inode
->i_mapping
, index
);
544 tail_page
= hole_page
;
547 /* we don't have to make sure the conversion did not happen while
548 ** we were locking the page because anyone that could convert
549 ** must first take i_sem.
551 ** We must fix the tail page for writing because it might have buffers
552 ** that are mapped, but have a block number of 0. This indicates tail
553 ** data that has been read directly into the page, and block_prepare_write
554 ** won't trigger a get_block in this case.
556 fix_tail_page_for_writing(tail_page
);
557 retval
= reiserfs_prepare_write(NULL
, tail_page
, tail_start
, tail_end
);
561 /* tail conversion might change the data in the page */
562 flush_dcache_page(tail_page
);
564 retval
= reiserfs_commit_write(NULL
, tail_page
, tail_start
, tail_end
);
567 if (tail_page
!= hole_page
) {
568 unlock_page(tail_page
);
569 page_cache_release(tail_page
);
575 static inline int _allocate_block(struct reiserfs_transaction_handle
*th
,
578 b_blocknr_t
* allocated_block_nr
,
579 struct path
*path
, int flags
)
581 BUG_ON(!th
->t_trans_id
);
583 #ifdef REISERFS_PREALLOCATE
584 if (!(flags
& GET_BLOCK_NO_ISEM
)) {
585 return reiserfs_new_unf_blocknrs2(th
, inode
, allocated_block_nr
,
589 return reiserfs_new_unf_blocknrs(th
, inode
, allocated_block_nr
, path
,
593 int reiserfs_get_block(struct inode
*inode
, sector_t block
,
594 struct buffer_head
*bh_result
, int create
)
596 int repeat
, retval
= 0;
597 b_blocknr_t allocated_block_nr
= 0; // b_blocknr_t is (unsigned) 32 bit int
598 INITIALIZE_PATH(path
);
601 struct buffer_head
*bh
, *unbh
= NULL
;
602 struct item_head
*ih
, tmp_ih
;
606 struct reiserfs_transaction_handle
*th
= NULL
;
607 /* space reserved in transaction batch:
608 . 3 balancings in direct->indirect conversion
609 . 1 block involved into reiserfs_update_sd()
610 XXX in practically impossible worst case direct2indirect()
611 can incur (much) more than 3 balancings.
612 quota update for user, group */
614 JOURNAL_PER_BALANCE_CNT
* 3 + 1 +
615 2 * REISERFS_QUOTA_TRANS_BLOCKS(inode
->i_sb
);
619 (((loff_t
) block
) << inode
->i_sb
->s_blocksize_bits
) + 1;
622 reiserfs_write_lock(inode
->i_sb
);
623 version
= get_inode_item_key_version(inode
);
626 reiserfs_write_unlock(inode
->i_sb
);
630 if (!file_capable(inode
, block
)) {
631 reiserfs_write_unlock(inode
->i_sb
);
635 /* if !create, we aren't changing the FS, so we don't need to
636 ** log anything, so we don't need to start a transaction
638 if (!(create
& GET_BLOCK_CREATE
)) {
640 /* find number of block-th logical block of the file */
641 ret
= _get_block_create_0(inode
, block
, bh_result
,
642 create
| GET_BLOCK_READ_DIRECT
);
643 reiserfs_write_unlock(inode
->i_sb
);
647 * if we're already in a transaction, make sure to close
648 * any new transactions we start in this func
650 if ((create
& GET_BLOCK_NO_DANGLE
) ||
651 reiserfs_transaction_running(inode
->i_sb
))
654 /* If file is of such a size, that it might have a tail and tails are enabled
655 ** we should mark it as possibly needing tail packing on close
657 if ((have_large_tails(inode
->i_sb
)
658 && inode
->i_size
< i_block_size(inode
) * 4)
659 || (have_small_tails(inode
->i_sb
)
660 && inode
->i_size
< i_block_size(inode
)))
661 REISERFS_I(inode
)->i_flags
|= i_pack_on_close_mask
;
663 /* set the key of the first byte in the 'block'-th block of file */
664 make_cpu_key(&key
, inode
, new_offset
, TYPE_ANY
, 3 /*key length */ );
665 if ((new_offset
+ inode
->i_sb
->s_blocksize
- 1) > inode
->i_size
) {
667 th
= reiserfs_persistent_transaction(inode
->i_sb
, jbegin_count
);
672 reiserfs_update_inode_transaction(inode
);
676 retval
= search_for_position_by_key(inode
->i_sb
, &key
, &path
);
677 if (retval
== IO_ERROR
) {
682 bh
= get_last_bh(&path
);
684 item
= get_item(&path
);
685 pos_in_item
= path
.pos_in_item
;
687 fs_gen
= get_generation(inode
->i_sb
);
688 copy_item_head(&tmp_ih
, ih
);
690 if (allocation_needed
691 (retval
, allocated_block_nr
, ih
, item
, pos_in_item
)) {
692 /* we have to allocate block for the unformatted node */
699 _allocate_block(th
, block
, inode
, &allocated_block_nr
,
702 if (repeat
== NO_DISK_SPACE
|| repeat
== QUOTA_EXCEEDED
) {
703 /* restart the transaction to give the journal a chance to free
704 ** some blocks. releases the path, so we have to go back to
705 ** research if we succeed on the second try
707 SB_JOURNAL(inode
->i_sb
)->j_next_async_flush
= 1;
708 retval
= restart_transaction(th
, inode
, &path
);
712 _allocate_block(th
, block
, inode
,
713 &allocated_block_nr
, NULL
, create
);
715 if (repeat
!= NO_DISK_SPACE
&& repeat
!= QUOTA_EXCEEDED
) {
718 if (repeat
== QUOTA_EXCEEDED
)
725 if (fs_changed(fs_gen
, inode
->i_sb
)
726 && item_moved(&tmp_ih
, &path
)) {
731 if (indirect_item_found(retval
, ih
)) {
732 b_blocknr_t unfm_ptr
;
733 /* 'block'-th block is in the file already (there is
734 corresponding cell in some indirect item). But it may be
735 zero unformatted node pointer (hole) */
736 unfm_ptr
= get_block_num(item
, pos_in_item
);
738 /* use allocated block to plug the hole */
739 reiserfs_prepare_for_journal(inode
->i_sb
, bh
, 1);
740 if (fs_changed(fs_gen
, inode
->i_sb
)
741 && item_moved(&tmp_ih
, &path
)) {
742 reiserfs_restore_prepared_buffer(inode
->i_sb
,
746 set_buffer_new(bh_result
);
747 if (buffer_dirty(bh_result
)
748 && reiserfs_data_ordered(inode
->i_sb
))
749 reiserfs_add_ordered_list(inode
, bh_result
);
750 put_block_num(item
, pos_in_item
, allocated_block_nr
);
751 unfm_ptr
= allocated_block_nr
;
752 journal_mark_dirty(th
, inode
->i_sb
, bh
);
753 reiserfs_update_sd(th
, inode
);
755 set_block_dev_mapped(bh_result
, unfm_ptr
, inode
);
759 retval
= reiserfs_end_persistent_transaction(th
);
761 reiserfs_write_unlock(inode
->i_sb
);
763 /* the item was found, so new blocks were not added to the file
764 ** there is no need to make sure the inode is updated with this
775 /* desired position is not found or is in the direct item. We have
776 to append file with holes up to 'block'-th block converting
777 direct items to indirect one if necessary */
780 if (is_statdata_le_ih(ih
)) {
782 struct cpu_key tmp_key
;
784 /* indirect item has to be inserted */
785 make_le_item_head(&tmp_ih
, &key
, version
, 1,
786 TYPE_INDIRECT
, UNFM_P_SIZE
,
787 0 /* free_space */ );
789 if (cpu_key_k_offset(&key
) == 1) {
790 /* we are going to add 'block'-th block to the file. Use
791 allocated block for that */
792 unp
= cpu_to_le32(allocated_block_nr
);
793 set_block_dev_mapped(bh_result
,
794 allocated_block_nr
, inode
);
795 set_buffer_new(bh_result
);
799 set_cpu_key_k_offset(&tmp_key
, 1);
800 PATH_LAST_POSITION(&path
)++;
803 reiserfs_insert_item(th
, &path
, &tmp_key
, &tmp_ih
,
804 inode
, (char *)&unp
);
806 reiserfs_free_block(th
, inode
,
807 allocated_block_nr
, 1);
808 goto failure
; // retval == -ENOSPC, -EDQUOT or -EIO or -EEXIST
810 //mark_tail_converted (inode);
811 } else if (is_direct_le_ih(ih
)) {
812 /* direct item has to be converted */
816 ((le_ih_k_offset(ih
) -
817 1) & ~(inode
->i_sb
->s_blocksize
- 1)) + 1;
818 if (tail_offset
== cpu_key_k_offset(&key
)) {
819 /* direct item we just found fits into block we have
820 to map. Convert it into unformatted node: use
821 bh_result for the conversion */
822 set_block_dev_mapped(bh_result
,
823 allocated_block_nr
, inode
);
827 /* we have to padd file tail stored in direct item(s)
828 up to block size and convert it to unformatted
829 node. FIXME: this should also get into page cache */
833 * ugly, but we can only end the transaction if
836 BUG_ON(!th
->t_refcount
);
837 if (th
->t_refcount
== 1) {
839 reiserfs_end_persistent_transaction
847 convert_tail_for_hole(inode
, bh_result
,
850 if (retval
!= -ENOSPC
)
851 reiserfs_warning(inode
->i_sb
,
852 "clm-6004: convert tail failed inode %lu, error %d",
855 if (allocated_block_nr
) {
856 /* the bitmap, the super, and the stat data == 3 */
858 th
= reiserfs_persistent_transaction(inode
->i_sb
, 3);
860 reiserfs_free_block(th
,
870 direct2indirect(th
, inode
, &path
, unbh
,
873 reiserfs_unmap_buffer(unbh
);
874 reiserfs_free_block(th
, inode
,
875 allocated_block_nr
, 1);
878 /* it is important the set_buffer_uptodate is done after
879 ** the direct2indirect. The buffer might contain valid
880 ** data newer than the data on disk (read by readpage, changed,
881 ** and then sent here by writepage). direct2indirect needs
882 ** to know if unbh was already up to date, so it can decide
883 ** if the data in unbh needs to be replaced with data from
886 set_buffer_uptodate(unbh
);
888 /* unbh->b_page == NULL in case of DIRECT_IO request, this means
889 buffer will disappear shortly, so it should not be added to
892 /* we've converted the tail, so we must
893 ** flush unbh before the transaction commits
895 reiserfs_add_tail_list(inode
, unbh
);
897 /* mark it dirty now to prevent commit_write from adding
898 ** this buffer to the inode's dirty buffer list
901 * AKPM: changed __mark_buffer_dirty to mark_buffer_dirty().
902 * It's still atomic, but it sets the page dirty too,
903 * which makes it eligible for writeback at any time by the
904 * VM (which was also the case with __mark_buffer_dirty())
906 mark_buffer_dirty(unbh
);
909 /* append indirect item with holes if needed, when appending
910 pointer to 'block'-th block use block, which is already
912 struct cpu_key tmp_key
;
913 unp_t unf_single
= 0; // We use this in case we need to allocate only
914 // one block which is a fastpath
916 __u64 max_to_insert
=
917 MAX_ITEM_LEN(inode
->i_sb
->s_blocksize
) /
921 RFALSE(pos_in_item
!= ih_item_len(ih
) / UNFM_P_SIZE
,
922 "vs-804: invalid position for append");
923 /* indirect item has to be appended, set up key of that position */
924 make_cpu_key(&tmp_key
, inode
,
925 le_key_k_offset(version
,
928 inode
->i_sb
->s_blocksize
),
929 //pos_in_item * inode->i_sb->s_blocksize,
930 TYPE_INDIRECT
, 3); // key type is unimportant
934 ((cpu_key_k_offset(&key
) -
935 cpu_key_k_offset(&tmp_key
)) >> inode
->i_sb
->
937 RFALSE(blocks_needed
< 0, "green-805: invalid offset");
939 if (blocks_needed
== 1) {
942 un
= kmalloc(min(blocks_needed
, max_to_insert
) * UNFM_P_SIZE
, GFP_ATOMIC
); // We need to avoid scheduling.
949 UNFM_P_SIZE
* min(blocks_needed
,
952 if (blocks_needed
<= max_to_insert
) {
953 /* we are going to add target block to the file. Use allocated
955 un
[blocks_needed
- 1] =
956 cpu_to_le32(allocated_block_nr
);
957 set_block_dev_mapped(bh_result
,
958 allocated_block_nr
, inode
);
959 set_buffer_new(bh_result
);
962 /* paste hole to the indirect item */
963 /* If kmalloc failed, max_to_insert becomes zero and it means we
964 only have space for one block */
966 max_to_insert
? max_to_insert
: 1;
969 reiserfs_paste_into_item(th
, &path
, &tmp_key
, inode
,
974 if (blocks_needed
!= 1)
978 reiserfs_free_block(th
, inode
,
979 allocated_block_nr
, 1);
983 /* We need to mark new file size in case this function will be
984 interrupted/aborted later on. And we may do this only for
987 inode
->i_sb
->s_blocksize
* blocks_needed
;
994 /* this loop could log more blocks than we had originally asked
995 ** for. So, we have to allow the transaction to end if it is
996 ** too big or too full. Update the inode so things are
997 ** consistent if we crash before the function returns
999 ** release the path so that anybody waiting on the path before
1000 ** ending their transaction will be able to continue.
1002 if (journal_transaction_should_end(th
, th
->t_blocks_allocated
)) {
1003 retval
= restart_transaction(th
, inode
, &path
);
1007 /* inserting indirect pointers for a hole can take a
1008 ** long time. reschedule if needed
1012 retval
= search_for_position_by_key(inode
->i_sb
, &key
, &path
);
1013 if (retval
== IO_ERROR
) {
1017 if (retval
== POSITION_FOUND
) {
1018 reiserfs_warning(inode
->i_sb
,
1019 "vs-825: reiserfs_get_block: "
1020 "%K should not be found", &key
);
1022 if (allocated_block_nr
)
1023 reiserfs_free_block(th
, inode
,
1024 allocated_block_nr
, 1);
1028 bh
= get_last_bh(&path
);
1030 item
= get_item(&path
);
1031 pos_in_item
= path
.pos_in_item
;
1037 if (th
&& (!dangle
|| (retval
&& !th
->t_trans_id
))) {
1040 reiserfs_update_sd(th
, inode
);
1041 err
= reiserfs_end_persistent_transaction(th
);
1046 reiserfs_write_unlock(inode
->i_sb
);
1047 reiserfs_check_path(&path
);
1052 reiserfs_readpages(struct file
*file
, struct address_space
*mapping
,
1053 struct list_head
*pages
, unsigned nr_pages
)
1055 return mpage_readpages(mapping
, pages
, nr_pages
, reiserfs_get_block
);
1058 /* Compute real number of used bytes by file
1059 * Following three functions can go away when we'll have enough space in stat item
1061 static int real_space_diff(struct inode
*inode
, int sd_size
)
1064 loff_t blocksize
= inode
->i_sb
->s_blocksize
;
1066 if (S_ISLNK(inode
->i_mode
) || S_ISDIR(inode
->i_mode
))
1069 /* End of file is also in full block with indirect reference, so round
1070 ** up to the next block.
1072 ** there is just no way to know if the tail is actually packed
1073 ** on the file, so we have to assume it isn't. When we pack the
1074 ** tail, we add 4 bytes to pretend there really is an unformatted
1079 (blocksize
- 1)) >> inode
->i_sb
->s_blocksize_bits
) * UNFM_P_SIZE
+
1084 static inline loff_t
to_real_used_space(struct inode
*inode
, ulong blocks
,
1087 if (S_ISLNK(inode
->i_mode
) || S_ISDIR(inode
->i_mode
)) {
1088 return inode
->i_size
+
1089 (loff_t
) (real_space_diff(inode
, sd_size
));
1091 return ((loff_t
) real_space_diff(inode
, sd_size
)) +
1092 (((loff_t
) blocks
) << 9);
1095 /* Compute number of blocks used by file in ReiserFS counting */
1096 static inline ulong
to_fake_used_blocks(struct inode
*inode
, int sd_size
)
1098 loff_t bytes
= inode_get_bytes(inode
);
1099 loff_t real_space
= real_space_diff(inode
, sd_size
);
1101 /* keeps fsck and non-quota versions of reiserfs happy */
1102 if (S_ISLNK(inode
->i_mode
) || S_ISDIR(inode
->i_mode
)) {
1103 bytes
+= (loff_t
) 511;
1106 /* files from before the quota patch might i_blocks such that
1107 ** bytes < real_space. Deal with that here to prevent it from
1110 if (bytes
< real_space
)
1112 return (bytes
- real_space
) >> 9;
1116 // BAD: new directories have stat data of new type and all other items
1117 // of old type. Version stored in the inode says about body items, so
1118 // in update_stat_data we can not rely on inode, but have to check
1119 // item version directly
1122 // called by read_locked_inode
1123 static void init_inode(struct inode
*inode
, struct path
*path
)
1125 struct buffer_head
*bh
;
1126 struct item_head
*ih
;
1128 //int version = ITEM_VERSION_1;
1130 bh
= PATH_PLAST_BUFFER(path
);
1131 ih
= PATH_PITEM_HEAD(path
);
1133 copy_key(INODE_PKEY(inode
), &(ih
->ih_key
));
1134 inode
->i_blksize
= reiserfs_default_io_size
;
1136 INIT_LIST_HEAD(&(REISERFS_I(inode
)->i_prealloc_list
));
1137 REISERFS_I(inode
)->i_flags
= 0;
1138 REISERFS_I(inode
)->i_prealloc_block
= 0;
1139 REISERFS_I(inode
)->i_prealloc_count
= 0;
1140 REISERFS_I(inode
)->i_trans_id
= 0;
1141 REISERFS_I(inode
)->i_jl
= NULL
;
1142 REISERFS_I(inode
)->i_acl_access
= NULL
;
1143 REISERFS_I(inode
)->i_acl_default
= NULL
;
1144 init_rwsem(&REISERFS_I(inode
)->xattr_sem
);
1146 if (stat_data_v1(ih
)) {
1147 struct stat_data_v1
*sd
=
1148 (struct stat_data_v1
*)B_I_PITEM(bh
, ih
);
1149 unsigned long blocks
;
1151 set_inode_item_key_version(inode
, KEY_FORMAT_3_5
);
1152 set_inode_sd_version(inode
, STAT_DATA_V1
);
1153 inode
->i_mode
= sd_v1_mode(sd
);
1154 inode
->i_nlink
= sd_v1_nlink(sd
);
1155 inode
->i_uid
= sd_v1_uid(sd
);
1156 inode
->i_gid
= sd_v1_gid(sd
);
1157 inode
->i_size
= sd_v1_size(sd
);
1158 inode
->i_atime
.tv_sec
= sd_v1_atime(sd
);
1159 inode
->i_mtime
.tv_sec
= sd_v1_mtime(sd
);
1160 inode
->i_ctime
.tv_sec
= sd_v1_ctime(sd
);
1161 inode
->i_atime
.tv_nsec
= 0;
1162 inode
->i_ctime
.tv_nsec
= 0;
1163 inode
->i_mtime
.tv_nsec
= 0;
1165 inode
->i_blocks
= sd_v1_blocks(sd
);
1166 inode
->i_generation
= le32_to_cpu(INODE_PKEY(inode
)->k_dir_id
);
1167 blocks
= (inode
->i_size
+ 511) >> 9;
1168 blocks
= _ROUND_UP(blocks
, inode
->i_sb
->s_blocksize
>> 9);
1169 if (inode
->i_blocks
> blocks
) {
1170 // there was a bug in <=3.5.23 when i_blocks could take negative
1171 // values. Starting from 3.5.17 this value could even be stored in
1172 // stat data. For such files we set i_blocks based on file
1173 // size. Just 2 notes: this can be wrong for sparce files. On-disk value will be
1174 // only updated if file's inode will ever change
1175 inode
->i_blocks
= blocks
;
1178 rdev
= sd_v1_rdev(sd
);
1179 REISERFS_I(inode
)->i_first_direct_byte
=
1180 sd_v1_first_direct_byte(sd
);
1181 /* an early bug in the quota code can give us an odd number for the
1182 ** block count. This is incorrect, fix it here.
1184 if (inode
->i_blocks
& 1) {
1187 inode_set_bytes(inode
,
1188 to_real_used_space(inode
, inode
->i_blocks
,
1190 /* nopack is initially zero for v1 objects. For v2 objects,
1191 nopack is initialised from sd_attrs */
1192 REISERFS_I(inode
)->i_flags
&= ~i_nopack_mask
;
1194 // new stat data found, but object may have old items
1195 // (directories and symlinks)
1196 struct stat_data
*sd
= (struct stat_data
*)B_I_PITEM(bh
, ih
);
1198 inode
->i_mode
= sd_v2_mode(sd
);
1199 inode
->i_nlink
= sd_v2_nlink(sd
);
1200 inode
->i_uid
= sd_v2_uid(sd
);
1201 inode
->i_size
= sd_v2_size(sd
);
1202 inode
->i_gid
= sd_v2_gid(sd
);
1203 inode
->i_mtime
.tv_sec
= sd_v2_mtime(sd
);
1204 inode
->i_atime
.tv_sec
= sd_v2_atime(sd
);
1205 inode
->i_ctime
.tv_sec
= sd_v2_ctime(sd
);
1206 inode
->i_ctime
.tv_nsec
= 0;
1207 inode
->i_mtime
.tv_nsec
= 0;
1208 inode
->i_atime
.tv_nsec
= 0;
1209 inode
->i_blocks
= sd_v2_blocks(sd
);
1210 rdev
= sd_v2_rdev(sd
);
1211 if (S_ISCHR(inode
->i_mode
) || S_ISBLK(inode
->i_mode
))
1212 inode
->i_generation
=
1213 le32_to_cpu(INODE_PKEY(inode
)->k_dir_id
);
1215 inode
->i_generation
= sd_v2_generation(sd
);
1217 if (S_ISDIR(inode
->i_mode
) || S_ISLNK(inode
->i_mode
))
1218 set_inode_item_key_version(inode
, KEY_FORMAT_3_5
);
1220 set_inode_item_key_version(inode
, KEY_FORMAT_3_6
);
1221 REISERFS_I(inode
)->i_first_direct_byte
= 0;
1222 set_inode_sd_version(inode
, STAT_DATA_V2
);
1223 inode_set_bytes(inode
,
1224 to_real_used_space(inode
, inode
->i_blocks
,
1226 /* read persistent inode attributes from sd and initalise
1227 generic inode flags from them */
1228 REISERFS_I(inode
)->i_attrs
= sd_v2_attrs(sd
);
1229 sd_attrs_to_i_attrs(sd_v2_attrs(sd
), inode
);
1233 if (S_ISREG(inode
->i_mode
)) {
1234 inode
->i_op
= &reiserfs_file_inode_operations
;
1235 inode
->i_fop
= &reiserfs_file_operations
;
1236 inode
->i_mapping
->a_ops
= &reiserfs_address_space_operations
;
1237 } else if (S_ISDIR(inode
->i_mode
)) {
1238 inode
->i_op
= &reiserfs_dir_inode_operations
;
1239 inode
->i_fop
= &reiserfs_dir_operations
;
1240 } else if (S_ISLNK(inode
->i_mode
)) {
1241 inode
->i_op
= &reiserfs_symlink_inode_operations
;
1242 inode
->i_mapping
->a_ops
= &reiserfs_address_space_operations
;
1244 inode
->i_blocks
= 0;
1245 inode
->i_op
= &reiserfs_special_inode_operations
;
1246 init_special_inode(inode
, inode
->i_mode
, new_decode_dev(rdev
));
1250 // update new stat data with inode fields
1251 static void inode2sd(void *sd
, struct inode
*inode
, loff_t size
)
1253 struct stat_data
*sd_v2
= (struct stat_data
*)sd
;
1256 set_sd_v2_mode(sd_v2
, inode
->i_mode
);
1257 set_sd_v2_nlink(sd_v2
, inode
->i_nlink
);
1258 set_sd_v2_uid(sd_v2
, inode
->i_uid
);
1259 set_sd_v2_size(sd_v2
, size
);
1260 set_sd_v2_gid(sd_v2
, inode
->i_gid
);
1261 set_sd_v2_mtime(sd_v2
, inode
->i_mtime
.tv_sec
);
1262 set_sd_v2_atime(sd_v2
, inode
->i_atime
.tv_sec
);
1263 set_sd_v2_ctime(sd_v2
, inode
->i_ctime
.tv_sec
);
1264 set_sd_v2_blocks(sd_v2
, to_fake_used_blocks(inode
, SD_V2_SIZE
));
1265 if (S_ISCHR(inode
->i_mode
) || S_ISBLK(inode
->i_mode
))
1266 set_sd_v2_rdev(sd_v2
, new_encode_dev(inode
->i_rdev
));
1268 set_sd_v2_generation(sd_v2
, inode
->i_generation
);
1269 flags
= REISERFS_I(inode
)->i_attrs
;
1270 i_attrs_to_sd_attrs(inode
, &flags
);
1271 set_sd_v2_attrs(sd_v2
, flags
);
1274 // used to copy inode's fields to old stat data
1275 static void inode2sd_v1(void *sd
, struct inode
*inode
, loff_t size
)
1277 struct stat_data_v1
*sd_v1
= (struct stat_data_v1
*)sd
;
1279 set_sd_v1_mode(sd_v1
, inode
->i_mode
);
1280 set_sd_v1_uid(sd_v1
, inode
->i_uid
);
1281 set_sd_v1_gid(sd_v1
, inode
->i_gid
);
1282 set_sd_v1_nlink(sd_v1
, inode
->i_nlink
);
1283 set_sd_v1_size(sd_v1
, size
);
1284 set_sd_v1_atime(sd_v1
, inode
->i_atime
.tv_sec
);
1285 set_sd_v1_ctime(sd_v1
, inode
->i_ctime
.tv_sec
);
1286 set_sd_v1_mtime(sd_v1
, inode
->i_mtime
.tv_sec
);
1288 if (S_ISCHR(inode
->i_mode
) || S_ISBLK(inode
->i_mode
))
1289 set_sd_v1_rdev(sd_v1
, new_encode_dev(inode
->i_rdev
));
1291 set_sd_v1_blocks(sd_v1
, to_fake_used_blocks(inode
, SD_V1_SIZE
));
1293 // Sigh. i_first_direct_byte is back
1294 set_sd_v1_first_direct_byte(sd_v1
,
1295 REISERFS_I(inode
)->i_first_direct_byte
);
1298 /* NOTE, you must prepare the buffer head before sending it here,
1299 ** and then log it after the call
1301 static void update_stat_data(struct path
*path
, struct inode
*inode
,
1304 struct buffer_head
*bh
;
1305 struct item_head
*ih
;
1307 bh
= PATH_PLAST_BUFFER(path
);
1308 ih
= PATH_PITEM_HEAD(path
);
1310 if (!is_statdata_le_ih(ih
))
1311 reiserfs_panic(inode
->i_sb
,
1312 "vs-13065: update_stat_data: key %k, found item %h",
1313 INODE_PKEY(inode
), ih
);
1315 if (stat_data_v1(ih
)) {
1316 // path points to old stat data
1317 inode2sd_v1(B_I_PITEM(bh
, ih
), inode
, size
);
1319 inode2sd(B_I_PITEM(bh
, ih
), inode
, size
);
1325 void reiserfs_update_sd_size(struct reiserfs_transaction_handle
*th
,
1326 struct inode
*inode
, loff_t size
)
1329 INITIALIZE_PATH(path
);
1330 struct buffer_head
*bh
;
1332 struct item_head
*ih
, tmp_ih
;
1335 BUG_ON(!th
->t_trans_id
);
1337 make_cpu_key(&key
, inode
, SD_OFFSET
, TYPE_STAT_DATA
, 3); //key type is unimportant
1341 /* look for the object's stat data */
1342 retval
= search_item(inode
->i_sb
, &key
, &path
);
1343 if (retval
== IO_ERROR
) {
1344 reiserfs_warning(inode
->i_sb
,
1345 "vs-13050: reiserfs_update_sd: "
1346 "i/o failure occurred trying to update %K stat data",
1350 if (retval
== ITEM_NOT_FOUND
) {
1351 pos
= PATH_LAST_POSITION(&path
);
1353 if (inode
->i_nlink
== 0) {
1354 /*reiserfs_warning (inode->i_sb, "vs-13050: reiserfs_update_sd: i_nlink == 0, stat data not found"); */
1357 reiserfs_warning(inode
->i_sb
,
1358 "vs-13060: reiserfs_update_sd: "
1359 "stat data of object %k (nlink == %d) not found (pos %d)",
1360 INODE_PKEY(inode
), inode
->i_nlink
,
1362 reiserfs_check_path(&path
);
1366 /* sigh, prepare_for_journal might schedule. When it schedules the
1367 ** FS might change. We have to detect that, and loop back to the
1368 ** search if the stat data item has moved
1370 bh
= get_last_bh(&path
);
1372 copy_item_head(&tmp_ih
, ih
);
1373 fs_gen
= get_generation(inode
->i_sb
);
1374 reiserfs_prepare_for_journal(inode
->i_sb
, bh
, 1);
1375 if (fs_changed(fs_gen
, inode
->i_sb
)
1376 && item_moved(&tmp_ih
, &path
)) {
1377 reiserfs_restore_prepared_buffer(inode
->i_sb
, bh
);
1378 continue; /* Stat_data item has been moved after scheduling. */
1382 update_stat_data(&path
, inode
, size
);
1383 journal_mark_dirty(th
, th
->t_super
, bh
);
1388 /* reiserfs_read_locked_inode is called to read the inode off disk, and it
1389 ** does a make_bad_inode when things go wrong. But, we need to make sure
1390 ** and clear the key in the private portion of the inode, otherwise a
1391 ** corresponding iput might try to delete whatever object the inode last
1394 static void reiserfs_make_bad_inode(struct inode
*inode
)
1396 memset(INODE_PKEY(inode
), 0, KEY_SIZE
);
1397 make_bad_inode(inode
);
1401 // initially this function was derived from minix or ext2's analog and
1402 // evolved as the prototype did
1405 int reiserfs_init_locked_inode(struct inode
*inode
, void *p
)
1407 struct reiserfs_iget_args
*args
= (struct reiserfs_iget_args
*)p
;
1408 inode
->i_ino
= args
->objectid
;
1409 INODE_PKEY(inode
)->k_dir_id
= cpu_to_le32(args
->dirid
);
1413 /* looks for stat data in the tree, and fills up the fields of in-core
1414 inode stat data fields */
1415 void reiserfs_read_locked_inode(struct inode
*inode
,
1416 struct reiserfs_iget_args
*args
)
1418 INITIALIZE_PATH(path_to_sd
);
1420 unsigned long dirino
;
1423 dirino
= args
->dirid
;
1425 /* set version 1, version 2 could be used too, because stat data
1426 key is the same in both versions */
1427 key
.version
= KEY_FORMAT_3_5
;
1428 key
.on_disk_key
.k_dir_id
= dirino
;
1429 key
.on_disk_key
.k_objectid
= inode
->i_ino
;
1430 key
.on_disk_key
.k_offset
= 0;
1431 key
.on_disk_key
.k_type
= 0;
1433 /* look for the object's stat data */
1434 retval
= search_item(inode
->i_sb
, &key
, &path_to_sd
);
1435 if (retval
== IO_ERROR
) {
1436 reiserfs_warning(inode
->i_sb
,
1437 "vs-13070: reiserfs_read_locked_inode: "
1438 "i/o failure occurred trying to find stat data of %K",
1440 reiserfs_make_bad_inode(inode
);
1443 if (retval
!= ITEM_FOUND
) {
1444 /* a stale NFS handle can trigger this without it being an error */
1445 pathrelse(&path_to_sd
);
1446 reiserfs_make_bad_inode(inode
);
1451 init_inode(inode
, &path_to_sd
);
1453 /* It is possible that knfsd is trying to access inode of a file
1454 that is being removed from the disk by some other thread. As we
1455 update sd on unlink all that is required is to check for nlink
1456 here. This bug was first found by Sizif when debugging
1457 SquidNG/Butterfly, forgotten, and found again after Philippe
1458 Gramoulle <philippe.gramoulle@mmania.com> reproduced it.
1460 More logical fix would require changes in fs/inode.c:iput() to
1461 remove inode from hash-table _after_ fs cleaned disk stuff up and
1462 in iget() to return NULL if I_FREEING inode is found in
1464 /* Currently there is one place where it's ok to meet inode with
1465 nlink==0: processing of open-unlinked and half-truncated files
1466 during mount (fs/reiserfs/super.c:finish_unfinished()). */
1467 if ((inode
->i_nlink
== 0) &&
1468 !REISERFS_SB(inode
->i_sb
)->s_is_unlinked_ok
) {
1469 reiserfs_warning(inode
->i_sb
,
1470 "vs-13075: reiserfs_read_locked_inode: "
1471 "dead inode read from disk %K. "
1472 "This is likely to be race with knfsd. Ignore",
1474 reiserfs_make_bad_inode(inode
);
1477 reiserfs_check_path(&path_to_sd
); /* init inode should be relsing */
1482 * reiserfs_find_actor() - "find actor" reiserfs supplies to iget5_locked().
1484 * @inode: inode from hash table to check
1485 * @opaque: "cookie" passed to iget5_locked(). This is &reiserfs_iget_args.
1487 * This function is called by iget5_locked() to distinguish reiserfs inodes
1488 * having the same inode numbers. Such inodes can only exist due to some
1489 * error condition. One of them should be bad. Inodes with identical
1490 * inode numbers (objectids) are distinguished by parent directory ids.
1493 int reiserfs_find_actor(struct inode
*inode
, void *opaque
)
1495 struct reiserfs_iget_args
*args
;
1498 /* args is already in CPU order */
1499 return (inode
->i_ino
== args
->objectid
) &&
1500 (le32_to_cpu(INODE_PKEY(inode
)->k_dir_id
) == args
->dirid
);
1503 struct inode
*reiserfs_iget(struct super_block
*s
, const struct cpu_key
*key
)
1505 struct inode
*inode
;
1506 struct reiserfs_iget_args args
;
1508 args
.objectid
= key
->on_disk_key
.k_objectid
;
1509 args
.dirid
= key
->on_disk_key
.k_dir_id
;
1510 inode
= iget5_locked(s
, key
->on_disk_key
.k_objectid
,
1511 reiserfs_find_actor
, reiserfs_init_locked_inode
,
1514 return ERR_PTR(-ENOMEM
);
1516 if (inode
->i_state
& I_NEW
) {
1517 reiserfs_read_locked_inode(inode
, &args
);
1518 unlock_new_inode(inode
);
1521 if (comp_short_keys(INODE_PKEY(inode
), key
) || is_bad_inode(inode
)) {
1522 /* either due to i/o error or a stale NFS handle */
1529 struct dentry
*reiserfs_get_dentry(struct super_block
*sb
, void *vobjp
)
1531 __u32
*data
= vobjp
;
1533 struct dentry
*result
;
1534 struct inode
*inode
;
1536 key
.on_disk_key
.k_objectid
= data
[0];
1537 key
.on_disk_key
.k_dir_id
= data
[1];
1538 reiserfs_write_lock(sb
);
1539 inode
= reiserfs_iget(sb
, &key
);
1540 if (inode
&& !IS_ERR(inode
) && data
[2] != 0 &&
1541 data
[2] != inode
->i_generation
) {
1545 reiserfs_write_unlock(sb
);
1547 inode
= ERR_PTR(-ESTALE
);
1549 return ERR_PTR(PTR_ERR(inode
));
1550 result
= d_alloc_anon(inode
);
1553 return ERR_PTR(-ENOMEM
);
1558 struct dentry
*reiserfs_decode_fh(struct super_block
*sb
, __u32
* data
,
1559 int len
, int fhtype
,
1560 int (*acceptable
) (void *contect
,
1561 struct dentry
* de
),
1564 __u32 obj
[3], parent
[3];
1566 /* fhtype happens to reflect the number of u32s encoded.
1567 * due to a bug in earlier code, fhtype might indicate there
1568 * are more u32s then actually fitted.
1569 * so if fhtype seems to be more than len, reduce fhtype.
1571 * 2 - objectid + dir_id - legacy support
1572 * 3 - objectid + dir_id + generation
1573 * 4 - objectid + dir_id + objectid and dirid of parent - legacy
1574 * 5 - objectid + dir_id + generation + objectid and dirid of parent
1575 * 6 - as above plus generation of directory
1576 * 6 does not fit in NFSv2 handles
1579 if (fhtype
!= 6 || len
!= 5)
1580 reiserfs_warning(sb
,
1581 "nfsd/reiserfs, fhtype=%d, len=%d - odd",
1588 if (fhtype
== 3 || fhtype
>= 5)
1591 obj
[2] = 0; /* generation number */
1594 parent
[0] = data
[fhtype
>= 5 ? 3 : 2];
1595 parent
[1] = data
[fhtype
>= 5 ? 4 : 3];
1597 parent
[2] = data
[5];
1601 return sb
->s_export_op
->find_exported_dentry(sb
, obj
,
1602 fhtype
< 4 ? NULL
: parent
,
1603 acceptable
, context
);
1606 int reiserfs_encode_fh(struct dentry
*dentry
, __u32
* data
, int *lenp
,
1609 struct inode
*inode
= dentry
->d_inode
;
1615 data
[0] = inode
->i_ino
;
1616 data
[1] = le32_to_cpu(INODE_PKEY(inode
)->k_dir_id
);
1617 data
[2] = inode
->i_generation
;
1619 /* no room for directory info? return what we've stored so far */
1620 if (maxlen
< 5 || !need_parent
)
1623 spin_lock(&dentry
->d_lock
);
1624 inode
= dentry
->d_parent
->d_inode
;
1625 data
[3] = inode
->i_ino
;
1626 data
[4] = le32_to_cpu(INODE_PKEY(inode
)->k_dir_id
);
1629 data
[5] = inode
->i_generation
;
1632 spin_unlock(&dentry
->d_lock
);
1636 /* looks for stat data, then copies fields to it, marks the buffer
1637 containing stat data as dirty */
1638 /* reiserfs inodes are never really dirty, since the dirty inode call
1639 ** always logs them. This call allows the VFS inode marking routines
1640 ** to properly mark inodes for datasync and such, but only actually
1641 ** does something when called for a synchronous update.
1643 int reiserfs_write_inode(struct inode
*inode
, int do_sync
)
1645 struct reiserfs_transaction_handle th
;
1646 int jbegin_count
= 1;
1648 if (inode
->i_sb
->s_flags
& MS_RDONLY
)
1650 /* memory pressure can sometimes initiate write_inode calls with sync == 1,
1651 ** these cases are just when the system needs ram, not when the
1652 ** inode needs to reach disk for safety, and they can safely be
1653 ** ignored because the altered inode has already been logged.
1655 if (do_sync
&& !(current
->flags
& PF_MEMALLOC
)) {
1656 reiserfs_write_lock(inode
->i_sb
);
1657 if (!journal_begin(&th
, inode
->i_sb
, jbegin_count
)) {
1658 reiserfs_update_sd(&th
, inode
);
1659 journal_end_sync(&th
, inode
->i_sb
, jbegin_count
);
1661 reiserfs_write_unlock(inode
->i_sb
);
1666 /* stat data of new object is inserted already, this inserts the item
1667 containing "." and ".." entries */
1668 static int reiserfs_new_directory(struct reiserfs_transaction_handle
*th
,
1669 struct inode
*inode
,
1670 struct item_head
*ih
, struct path
*path
,
1673 struct super_block
*sb
= th
->t_super
;
1674 char empty_dir
[EMPTY_DIR_SIZE
];
1675 char *body
= empty_dir
;
1679 BUG_ON(!th
->t_trans_id
);
1681 _make_cpu_key(&key
, KEY_FORMAT_3_5
, le32_to_cpu(ih
->ih_key
.k_dir_id
),
1682 le32_to_cpu(ih
->ih_key
.k_objectid
), DOT_OFFSET
,
1683 TYPE_DIRENTRY
, 3 /*key length */ );
1685 /* compose item head for new item. Directories consist of items of
1686 old type (ITEM_VERSION_1). Do not set key (second arg is 0), it
1687 is done by reiserfs_new_inode */
1688 if (old_format_only(sb
)) {
1689 make_le_item_head(ih
, NULL
, KEY_FORMAT_3_5
, DOT_OFFSET
,
1690 TYPE_DIRENTRY
, EMPTY_DIR_SIZE_V1
, 2);
1692 make_empty_dir_item_v1(body
, ih
->ih_key
.k_dir_id
,
1693 ih
->ih_key
.k_objectid
,
1694 INODE_PKEY(dir
)->k_dir_id
,
1695 INODE_PKEY(dir
)->k_objectid
);
1697 make_le_item_head(ih
, NULL
, KEY_FORMAT_3_5
, DOT_OFFSET
,
1698 TYPE_DIRENTRY
, EMPTY_DIR_SIZE
, 2);
1700 make_empty_dir_item(body
, ih
->ih_key
.k_dir_id
,
1701 ih
->ih_key
.k_objectid
,
1702 INODE_PKEY(dir
)->k_dir_id
,
1703 INODE_PKEY(dir
)->k_objectid
);
1706 /* look for place in the tree for new item */
1707 retval
= search_item(sb
, &key
, path
);
1708 if (retval
== IO_ERROR
) {
1709 reiserfs_warning(sb
, "vs-13080: reiserfs_new_directory: "
1710 "i/o failure occurred creating new directory");
1713 if (retval
== ITEM_FOUND
) {
1715 reiserfs_warning(sb
, "vs-13070: reiserfs_new_directory: "
1716 "object with this key exists (%k)",
1721 /* insert item, that is empty directory item */
1722 return reiserfs_insert_item(th
, path
, &key
, ih
, inode
, body
);
1725 /* stat data of object has been inserted, this inserts the item
1726 containing the body of symlink */
1727 static int reiserfs_new_symlink(struct reiserfs_transaction_handle
*th
, struct inode
*inode
, /* Inode of symlink */
1728 struct item_head
*ih
,
1729 struct path
*path
, const char *symname
,
1732 struct super_block
*sb
= th
->t_super
;
1736 BUG_ON(!th
->t_trans_id
);
1738 _make_cpu_key(&key
, KEY_FORMAT_3_5
,
1739 le32_to_cpu(ih
->ih_key
.k_dir_id
),
1740 le32_to_cpu(ih
->ih_key
.k_objectid
),
1741 1, TYPE_DIRECT
, 3 /*key length */ );
1743 make_le_item_head(ih
, NULL
, KEY_FORMAT_3_5
, 1, TYPE_DIRECT
, item_len
,
1744 0 /*free_space */ );
1746 /* look for place in the tree for new item */
1747 retval
= search_item(sb
, &key
, path
);
1748 if (retval
== IO_ERROR
) {
1749 reiserfs_warning(sb
, "vs-13080: reiserfs_new_symlinik: "
1750 "i/o failure occurred creating new symlink");
1753 if (retval
== ITEM_FOUND
) {
1755 reiserfs_warning(sb
, "vs-13080: reiserfs_new_symlink: "
1756 "object with this key exists (%k)",
1761 /* insert item, that is body of symlink */
1762 return reiserfs_insert_item(th
, path
, &key
, ih
, inode
, symname
);
1765 /* inserts the stat data into the tree, and then calls
1766 reiserfs_new_directory (to insert ".", ".." item if new object is
1767 directory) or reiserfs_new_symlink (to insert symlink body if new
1768 object is symlink) or nothing (if new object is regular file)
1770 NOTE! uid and gid must already be set in the inode. If we return
1771 non-zero due to an error, we have to drop the quota previously allocated
1772 for the fresh inode. This can only be done outside a transaction, so
1773 if we return non-zero, we also end the transaction. */
1774 int reiserfs_new_inode(struct reiserfs_transaction_handle
*th
,
1775 struct inode
*dir
, int mode
, const char *symname
,
1776 /* 0 for regular, EMTRY_DIR_SIZE for dirs,
1777 strlen (symname) for symlinks) */
1778 loff_t i_size
, struct dentry
*dentry
,
1779 struct inode
*inode
)
1781 struct super_block
*sb
;
1782 INITIALIZE_PATH(path_to_key
);
1784 struct item_head ih
;
1785 struct stat_data sd
;
1789 BUG_ON(!th
->t_trans_id
);
1791 if (DQUOT_ALLOC_INODE(inode
)) {
1795 if (!dir
|| !dir
->i_nlink
) {
1802 /* item head of new item */
1803 ih
.ih_key
.k_dir_id
= reiserfs_choose_packing(dir
);
1804 ih
.ih_key
.k_objectid
= cpu_to_le32(reiserfs_get_unused_objectid(th
));
1805 if (!ih
.ih_key
.k_objectid
) {
1809 if (old_format_only(sb
))
1810 /* not a perfect generation count, as object ids can be reused, but
1811 ** this is as good as reiserfs can do right now.
1812 ** note that the private part of inode isn't filled in yet, we have
1813 ** to use the directory.
1815 inode
->i_generation
= le32_to_cpu(INODE_PKEY(dir
)->k_objectid
);
1817 #if defined( USE_INODE_GENERATION_COUNTER )
1818 inode
->i_generation
=
1819 le32_to_cpu(REISERFS_SB(sb
)->s_rs
->s_inode_generation
);
1821 inode
->i_generation
= ++event
;
1824 /* fill stat data */
1825 inode
->i_nlink
= (S_ISDIR(mode
) ? 2 : 1);
1827 /* uid and gid must already be set by the caller for quota init */
1829 /* symlink cannot be immutable or append only, right? */
1830 if (S_ISLNK(inode
->i_mode
))
1831 inode
->i_flags
&= ~(S_IMMUTABLE
| S_APPEND
);
1833 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME_SEC
;
1834 inode
->i_size
= i_size
;
1835 inode
->i_blocks
= 0;
1837 REISERFS_I(inode
)->i_first_direct_byte
= S_ISLNK(mode
) ? 1 :
1838 U32_MAX
/*NO_BYTES_IN_DIRECT_ITEM */ ;
1840 INIT_LIST_HEAD(&(REISERFS_I(inode
)->i_prealloc_list
));
1841 REISERFS_I(inode
)->i_flags
= 0;
1842 REISERFS_I(inode
)->i_prealloc_block
= 0;
1843 REISERFS_I(inode
)->i_prealloc_count
= 0;
1844 REISERFS_I(inode
)->i_trans_id
= 0;
1845 REISERFS_I(inode
)->i_jl
= NULL
;
1846 REISERFS_I(inode
)->i_attrs
=
1847 REISERFS_I(dir
)->i_attrs
& REISERFS_INHERIT_MASK
;
1848 sd_attrs_to_i_attrs(REISERFS_I(inode
)->i_attrs
, inode
);
1849 REISERFS_I(inode
)->i_acl_access
= NULL
;
1850 REISERFS_I(inode
)->i_acl_default
= NULL
;
1851 init_rwsem(&REISERFS_I(inode
)->xattr_sem
);
1853 if (old_format_only(sb
))
1854 make_le_item_head(&ih
, NULL
, KEY_FORMAT_3_5
, SD_OFFSET
,
1855 TYPE_STAT_DATA
, SD_V1_SIZE
, MAX_US_INT
);
1857 make_le_item_head(&ih
, NULL
, KEY_FORMAT_3_6
, SD_OFFSET
,
1858 TYPE_STAT_DATA
, SD_SIZE
, MAX_US_INT
);
1860 /* key to search for correct place for new stat data */
1861 _make_cpu_key(&key
, KEY_FORMAT_3_6
, le32_to_cpu(ih
.ih_key
.k_dir_id
),
1862 le32_to_cpu(ih
.ih_key
.k_objectid
), SD_OFFSET
,
1863 TYPE_STAT_DATA
, 3 /*key length */ );
1865 /* find proper place for inserting of stat data */
1866 retval
= search_item(sb
, &key
, &path_to_key
);
1867 if (retval
== IO_ERROR
) {
1871 if (retval
== ITEM_FOUND
) {
1872 pathrelse(&path_to_key
);
1876 if (old_format_only(sb
)) {
1877 if (inode
->i_uid
& ~0xffff || inode
->i_gid
& ~0xffff) {
1878 pathrelse(&path_to_key
);
1879 /* i_uid or i_gid is too big to be stored in stat data v3.5 */
1883 inode2sd_v1(&sd
, inode
, inode
->i_size
);
1885 inode2sd(&sd
, inode
, inode
->i_size
);
1887 // these do not go to on-disk stat data
1888 inode
->i_ino
= le32_to_cpu(ih
.ih_key
.k_objectid
);
1889 inode
->i_blksize
= reiserfs_default_io_size
;
1891 // store in in-core inode the key of stat data and version all
1892 // object items will have (directory items will have old offset
1893 // format, other new objects will consist of new items)
1894 memcpy(INODE_PKEY(inode
), &(ih
.ih_key
), KEY_SIZE
);
1895 if (old_format_only(sb
) || S_ISDIR(mode
) || S_ISLNK(mode
))
1896 set_inode_item_key_version(inode
, KEY_FORMAT_3_5
);
1898 set_inode_item_key_version(inode
, KEY_FORMAT_3_6
);
1899 if (old_format_only(sb
))
1900 set_inode_sd_version(inode
, STAT_DATA_V1
);
1902 set_inode_sd_version(inode
, STAT_DATA_V2
);
1904 /* insert the stat data into the tree */
1905 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1906 if (REISERFS_I(dir
)->new_packing_locality
)
1907 th
->displace_new_blocks
= 1;
1910 reiserfs_insert_item(th
, &path_to_key
, &key
, &ih
, inode
,
1914 reiserfs_check_path(&path_to_key
);
1917 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1918 if (!th
->displace_new_blocks
)
1919 REISERFS_I(dir
)->new_packing_locality
= 0;
1921 if (S_ISDIR(mode
)) {
1922 /* insert item with "." and ".." */
1924 reiserfs_new_directory(th
, inode
, &ih
, &path_to_key
, dir
);
1927 if (S_ISLNK(mode
)) {
1928 /* insert body of symlink */
1929 if (!old_format_only(sb
))
1930 i_size
= ROUND_UP(i_size
);
1932 reiserfs_new_symlink(th
, inode
, &ih
, &path_to_key
, symname
,
1937 reiserfs_check_path(&path_to_key
);
1938 journal_end(th
, th
->t_super
, th
->t_blocks_allocated
);
1939 goto out_inserted_sd
;
1942 /* XXX CHECK THIS */
1943 if (reiserfs_posixacl(inode
->i_sb
)) {
1944 retval
= reiserfs_inherit_default_acl(dir
, dentry
, inode
);
1947 reiserfs_check_path(&path_to_key
);
1948 journal_end(th
, th
->t_super
, th
->t_blocks_allocated
);
1949 goto out_inserted_sd
;
1951 } else if (inode
->i_sb
->s_flags
& MS_POSIXACL
) {
1952 reiserfs_warning(inode
->i_sb
, "ACLs aren't enabled in the fs, "
1953 "but vfs thinks they are!");
1954 } else if (is_reiserfs_priv_object(dir
)) {
1955 reiserfs_mark_inode_private(inode
);
1958 insert_inode_hash(inode
);
1959 reiserfs_update_sd(th
, inode
);
1960 reiserfs_check_path(&path_to_key
);
1964 /* it looks like you can easily compress these two goto targets into
1965 * one. Keeping it like this doesn't actually hurt anything, and they
1966 * are place holders for what the quota code actually needs.
1969 /* Invalidate the object, nothing was inserted yet */
1970 INODE_PKEY(inode
)->k_objectid
= 0;
1972 /* Quota change must be inside a transaction for journaling */
1973 DQUOT_FREE_INODE(inode
);
1976 journal_end(th
, th
->t_super
, th
->t_blocks_allocated
);
1977 /* Drop can be outside and it needs more credits so it's better to have it outside */
1979 inode
->i_flags
|= S_NOQUOTA
;
1980 make_bad_inode(inode
);
1984 th
->t_trans_id
= 0; /* so the caller can't use this handle later */
1986 /* If we were inheriting an ACL, we need to release the lock so that
1987 * iput doesn't deadlock in reiserfs_delete_xattrs. The locking
1988 * code really needs to be reworked, but this will take care of it
1989 * for now. -jeffm */
1990 if (REISERFS_I(dir
)->i_acl_default
&& !IS_ERR(REISERFS_I(dir
)->i_acl_default
)) {
1991 reiserfs_write_unlock_xattrs(dir
->i_sb
);
1993 reiserfs_write_lock_xattrs(dir
->i_sb
);
2000 ** finds the tail page in the page cache,
2001 ** reads the last block in.
2003 ** On success, page_result is set to a locked, pinned page, and bh_result
2004 ** is set to an up to date buffer for the last block in the file. returns 0.
2006 ** tail conversion is not done, so bh_result might not be valid for writing
2007 ** check buffer_mapped(bh_result) and bh_result->b_blocknr != 0 before
2008 ** trying to write the block.
2010 ** on failure, nonzero is returned, page_result and bh_result are untouched.
2012 static int grab_tail_page(struct inode
*p_s_inode
,
2013 struct page
**page_result
,
2014 struct buffer_head
**bh_result
)
2017 /* we want the page with the last byte in the file,
2018 ** not the page that will hold the next byte for appending
2020 unsigned long index
= (p_s_inode
->i_size
- 1) >> PAGE_CACHE_SHIFT
;
2021 unsigned long pos
= 0;
2022 unsigned long start
= 0;
2023 unsigned long blocksize
= p_s_inode
->i_sb
->s_blocksize
;
2024 unsigned long offset
= (p_s_inode
->i_size
) & (PAGE_CACHE_SIZE
- 1);
2025 struct buffer_head
*bh
;
2026 struct buffer_head
*head
;
2030 /* we know that we are only called with inode->i_size > 0.
2031 ** we also know that a file tail can never be as big as a block
2032 ** If i_size % blocksize == 0, our file is currently block aligned
2033 ** and it won't need converting or zeroing after a truncate.
2035 if ((offset
& (blocksize
- 1)) == 0) {
2038 page
= grab_cache_page(p_s_inode
->i_mapping
, index
);
2043 /* start within the page of the last block in the file */
2044 start
= (offset
/ blocksize
) * blocksize
;
2046 error
= block_prepare_write(page
, start
, offset
,
2047 reiserfs_get_block_create_0
);
2051 head
= page_buffers(page
);
2057 bh
= bh
->b_this_page
;
2059 } while (bh
!= head
);
2061 if (!buffer_uptodate(bh
)) {
2062 /* note, this should never happen, prepare_write should
2063 ** be taking care of this for us. If the buffer isn't up to date,
2064 ** I've screwed up the code to find the buffer, or the code to
2065 ** call prepare_write
2067 reiserfs_warning(p_s_inode
->i_sb
,
2068 "clm-6000: error reading block %lu on dev %s",
2070 reiserfs_bdevname(p_s_inode
->i_sb
));
2075 *page_result
= page
;
2082 page_cache_release(page
);
2087 ** vfs version of truncate file. Must NOT be called with
2088 ** a transaction already started.
2090 ** some code taken from block_truncate_page
2092 int reiserfs_truncate_file(struct inode
*p_s_inode
, int update_timestamps
)
2094 struct reiserfs_transaction_handle th
;
2095 /* we want the offset for the first byte after the end of the file */
2096 unsigned long offset
= p_s_inode
->i_size
& (PAGE_CACHE_SIZE
- 1);
2097 unsigned blocksize
= p_s_inode
->i_sb
->s_blocksize
;
2099 struct page
*page
= NULL
;
2101 struct buffer_head
*bh
= NULL
;
2103 reiserfs_write_lock(p_s_inode
->i_sb
);
2105 if (p_s_inode
->i_size
> 0) {
2106 if ((error
= grab_tail_page(p_s_inode
, &page
, &bh
))) {
2107 // -ENOENT means we truncated past the end of the file,
2108 // and get_block_create_0 could not find a block to read in,
2110 if (error
!= -ENOENT
)
2111 reiserfs_warning(p_s_inode
->i_sb
,
2112 "clm-6001: grab_tail_page failed %d",
2119 /* so, if page != NULL, we have a buffer head for the offset at
2120 ** the end of the file. if the bh is mapped, and bh->b_blocknr != 0,
2121 ** then we have an unformatted node. Otherwise, we have a direct item,
2122 ** and no zeroing is required on disk. We zero after the truncate,
2123 ** because the truncate might pack the item anyway
2124 ** (it will unmap bh if it packs).
2126 /* it is enough to reserve space in transaction for 2 balancings:
2127 one for "save" link adding and another for the first
2128 cut_from_item. 1 is for update_sd */
2129 error
= journal_begin(&th
, p_s_inode
->i_sb
,
2130 JOURNAL_PER_BALANCE_CNT
* 2 + 1);
2133 reiserfs_update_inode_transaction(p_s_inode
);
2134 if (update_timestamps
)
2135 /* we are doing real truncate: if the system crashes before the last
2136 transaction of truncating gets committed - on reboot the file
2137 either appears truncated properly or not truncated at all */
2138 add_save_link(&th
, p_s_inode
, 1);
2139 error
= reiserfs_do_truncate(&th
, p_s_inode
, page
, update_timestamps
);
2143 journal_end(&th
, p_s_inode
->i_sb
, JOURNAL_PER_BALANCE_CNT
* 2 + 1);
2147 if (update_timestamps
) {
2148 error
= remove_save_link(p_s_inode
, 1 /* truncate */ );
2154 length
= offset
& (blocksize
- 1);
2155 /* if we are not on a block boundary */
2159 length
= blocksize
- length
;
2160 kaddr
= kmap_atomic(page
, KM_USER0
);
2161 memset(kaddr
+ offset
, 0, length
);
2162 flush_dcache_page(page
);
2163 kunmap_atomic(kaddr
, KM_USER0
);
2164 if (buffer_mapped(bh
) && bh
->b_blocknr
!= 0) {
2165 mark_buffer_dirty(bh
);
2169 page_cache_release(page
);
2172 reiserfs_write_unlock(p_s_inode
->i_sb
);
2177 page_cache_release(page
);
2179 reiserfs_write_unlock(p_s_inode
->i_sb
);
2183 static int map_block_for_writepage(struct inode
*inode
,
2184 struct buffer_head
*bh_result
,
2185 unsigned long block
)
2187 struct reiserfs_transaction_handle th
;
2189 struct item_head tmp_ih
;
2190 struct item_head
*ih
;
2191 struct buffer_head
*bh
;
2194 INITIALIZE_PATH(path
);
2196 int jbegin_count
= JOURNAL_PER_BALANCE_CNT
;
2197 loff_t byte_offset
= (block
<< inode
->i_sb
->s_blocksize_bits
) + 1;
2199 int use_get_block
= 0;
2200 int bytes_copied
= 0;
2202 int trans_running
= 0;
2204 /* catch places below that try to log something without starting a trans */
2207 if (!buffer_uptodate(bh_result
)) {
2211 kmap(bh_result
->b_page
);
2213 reiserfs_write_lock(inode
->i_sb
);
2214 make_cpu_key(&key
, inode
, byte_offset
, TYPE_ANY
, 3);
2217 retval
= search_for_position_by_key(inode
->i_sb
, &key
, &path
);
2218 if (retval
!= POSITION_FOUND
) {
2223 bh
= get_last_bh(&path
);
2225 item
= get_item(&path
);
2226 pos_in_item
= path
.pos_in_item
;
2228 /* we've found an unformatted node */
2229 if (indirect_item_found(retval
, ih
)) {
2230 if (bytes_copied
> 0) {
2231 reiserfs_warning(inode
->i_sb
,
2232 "clm-6002: bytes_copied %d",
2235 if (!get_block_num(item
, pos_in_item
)) {
2236 /* crap, we are writing to a hole */
2240 set_block_dev_mapped(bh_result
,
2241 get_block_num(item
, pos_in_item
), inode
);
2242 } else if (is_direct_le_ih(ih
)) {
2244 p
= page_address(bh_result
->b_page
);
2245 p
+= (byte_offset
- 1) & (PAGE_CACHE_SIZE
- 1);
2246 copy_size
= ih_item_len(ih
) - pos_in_item
;
2248 fs_gen
= get_generation(inode
->i_sb
);
2249 copy_item_head(&tmp_ih
, ih
);
2251 if (!trans_running
) {
2252 /* vs-3050 is gone, no need to drop the path */
2253 retval
= journal_begin(&th
, inode
->i_sb
, jbegin_count
);
2256 reiserfs_update_inode_transaction(inode
);
2258 if (fs_changed(fs_gen
, inode
->i_sb
)
2259 && item_moved(&tmp_ih
, &path
)) {
2260 reiserfs_restore_prepared_buffer(inode
->i_sb
,
2266 reiserfs_prepare_for_journal(inode
->i_sb
, bh
, 1);
2268 if (fs_changed(fs_gen
, inode
->i_sb
)
2269 && item_moved(&tmp_ih
, &path
)) {
2270 reiserfs_restore_prepared_buffer(inode
->i_sb
, bh
);
2274 memcpy(B_I_PITEM(bh
, ih
) + pos_in_item
, p
+ bytes_copied
,
2277 journal_mark_dirty(&th
, inode
->i_sb
, bh
);
2278 bytes_copied
+= copy_size
;
2279 set_block_dev_mapped(bh_result
, 0, inode
);
2281 /* are there still bytes left? */
2282 if (bytes_copied
< bh_result
->b_size
&&
2283 (byte_offset
+ bytes_copied
) < inode
->i_size
) {
2284 set_cpu_key_k_offset(&key
,
2285 cpu_key_k_offset(&key
) +
2290 reiserfs_warning(inode
->i_sb
,
2291 "clm-6003: bad item inode %lu, device %s",
2292 inode
->i_ino
, reiserfs_bdevname(inode
->i_sb
));
2300 if (trans_running
) {
2301 int err
= journal_end(&th
, inode
->i_sb
, jbegin_count
);
2306 reiserfs_write_unlock(inode
->i_sb
);
2308 /* this is where we fill in holes in the file. */
2309 if (use_get_block
) {
2310 retval
= reiserfs_get_block(inode
, block
, bh_result
,
2311 GET_BLOCK_CREATE
| GET_BLOCK_NO_ISEM
2312 | GET_BLOCK_NO_DANGLE
);
2314 if (!buffer_mapped(bh_result
)
2315 || bh_result
->b_blocknr
== 0) {
2316 /* get_block failed to find a mapped unformatted node. */
2322 kunmap(bh_result
->b_page
);
2324 if (!retval
&& buffer_mapped(bh_result
) && bh_result
->b_blocknr
== 0) {
2325 /* we've copied data from the page into the direct item, so the
2326 * buffer in the page is now clean, mark it to reflect that.
2328 lock_buffer(bh_result
);
2329 clear_buffer_dirty(bh_result
);
2330 unlock_buffer(bh_result
);
2336 * mason@suse.com: updated in 2.5.54 to follow the same general io
2337 * start/recovery path as __block_write_full_page, along with special
2338 * code to handle reiserfs tails.
2340 static int reiserfs_write_full_page(struct page
*page
,
2341 struct writeback_control
*wbc
)
2343 struct inode
*inode
= page
->mapping
->host
;
2344 unsigned long end_index
= inode
->i_size
>> PAGE_CACHE_SHIFT
;
2346 unsigned long block
;
2347 struct buffer_head
*head
, *bh
;
2350 int checked
= PageChecked(page
);
2351 struct reiserfs_transaction_handle th
;
2352 struct super_block
*s
= inode
->i_sb
;
2353 int bh_per_page
= PAGE_CACHE_SIZE
/ s
->s_blocksize
;
2356 /* The page dirty bit is cleared before writepage is called, which
2357 * means we have to tell create_empty_buffers to make dirty buffers
2358 * The page really should be up to date at this point, so tossing
2359 * in the BH_Uptodate is just a sanity check.
2361 if (!page_has_buffers(page
)) {
2362 create_empty_buffers(page
, s
->s_blocksize
,
2363 (1 << BH_Dirty
) | (1 << BH_Uptodate
));
2365 head
= page_buffers(page
);
2367 /* last page in the file, zero out any contents past the
2368 ** last byte in the file
2370 if (page
->index
>= end_index
) {
2372 unsigned last_offset
;
2374 last_offset
= inode
->i_size
& (PAGE_CACHE_SIZE
- 1);
2375 /* no file contents in this page */
2376 if (page
->index
>= end_index
+ 1 || !last_offset
) {
2380 kaddr
= kmap_atomic(page
, KM_USER0
);
2381 memset(kaddr
+ last_offset
, 0, PAGE_CACHE_SIZE
- last_offset
);
2382 flush_dcache_page(page
);
2383 kunmap_atomic(kaddr
, KM_USER0
);
2386 block
= page
->index
<< (PAGE_CACHE_SHIFT
- s
->s_blocksize_bits
);
2387 /* first map all the buffers, logging any direct items we find */
2389 if ((checked
|| buffer_dirty(bh
)) && (!buffer_mapped(bh
) ||
2393 /* not mapped yet, or it points to a direct item, search
2394 * the btree for the mapping info, and log any direct
2397 if ((error
= map_block_for_writepage(inode
, bh
, block
))) {
2401 bh
= bh
->b_this_page
;
2403 } while (bh
!= head
);
2406 * we start the transaction after map_block_for_writepage,
2407 * because it can create holes in the file (an unbounded operation).
2408 * starting it here, we can make a reliable estimate for how many
2409 * blocks we're going to log
2412 ClearPageChecked(page
);
2413 reiserfs_write_lock(s
);
2414 error
= journal_begin(&th
, s
, bh_per_page
+ 1);
2416 reiserfs_write_unlock(s
);
2419 reiserfs_update_inode_transaction(inode
);
2421 /* now go through and lock any dirty buffers on the page */
2424 if (!buffer_mapped(bh
))
2426 if (buffer_mapped(bh
) && bh
->b_blocknr
== 0)
2430 reiserfs_prepare_for_journal(s
, bh
, 1);
2431 journal_mark_dirty(&th
, s
, bh
);
2434 /* from this point on, we know the buffer is mapped to a
2435 * real block and not a direct item
2437 if (wbc
->sync_mode
!= WB_SYNC_NONE
|| !wbc
->nonblocking
) {
2440 if (test_set_buffer_locked(bh
)) {
2441 redirty_page_for_writepage(wbc
, page
);
2445 if (test_clear_buffer_dirty(bh
)) {
2446 mark_buffer_async_write(bh
);
2450 } while ((bh
= bh
->b_this_page
) != head
);
2453 error
= journal_end(&th
, s
, bh_per_page
+ 1);
2454 reiserfs_write_unlock(s
);
2458 BUG_ON(PageWriteback(page
));
2459 set_page_writeback(page
);
2463 * since any buffer might be the only dirty buffer on the page,
2464 * the first submit_bh can bring the page out of writeback.
2465 * be careful with the buffers.
2468 struct buffer_head
*next
= bh
->b_this_page
;
2469 if (buffer_async_write(bh
)) {
2470 submit_bh(WRITE
, bh
);
2475 } while (bh
!= head
);
2481 * if this page only had a direct item, it is very possible for
2482 * no io to be required without there being an error. Or,
2483 * someone else could have locked them and sent them down the
2484 * pipe without locking the page
2488 if (!buffer_uptodate(bh
)) {
2492 bh
= bh
->b_this_page
;
2493 } while (bh
!= head
);
2495 SetPageUptodate(page
);
2496 end_page_writeback(page
);
2501 /* catches various errors, we need to make sure any valid dirty blocks
2502 * get to the media. The page is currently locked and not marked for
2505 ClearPageUptodate(page
);
2509 if (buffer_mapped(bh
) && buffer_dirty(bh
) && bh
->b_blocknr
) {
2511 mark_buffer_async_write(bh
);
2514 * clear any dirty bits that might have come from getting
2515 * attached to a dirty page
2517 clear_buffer_dirty(bh
);
2519 bh
= bh
->b_this_page
;
2520 } while (bh
!= head
);
2522 BUG_ON(PageWriteback(page
));
2523 set_page_writeback(page
);
2526 struct buffer_head
*next
= bh
->b_this_page
;
2527 if (buffer_async_write(bh
)) {
2528 clear_buffer_dirty(bh
);
2529 submit_bh(WRITE
, bh
);
2534 } while (bh
!= head
);
2538 static int reiserfs_readpage(struct file
*f
, struct page
*page
)
2540 return block_read_full_page(page
, reiserfs_get_block
);
2543 static int reiserfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
2545 struct inode
*inode
= page
->mapping
->host
;
2546 reiserfs_wait_on_write_block(inode
->i_sb
);
2547 return reiserfs_write_full_page(page
, wbc
);
2550 static int reiserfs_prepare_write(struct file
*f
, struct page
*page
,
2551 unsigned from
, unsigned to
)
2553 struct inode
*inode
= page
->mapping
->host
;
2557 reiserfs_wait_on_write_block(inode
->i_sb
);
2558 fix_tail_page_for_writing(page
);
2559 if (reiserfs_transaction_running(inode
->i_sb
)) {
2560 struct reiserfs_transaction_handle
*th
;
2561 th
= (struct reiserfs_transaction_handle
*)current
->
2563 BUG_ON(!th
->t_refcount
);
2564 BUG_ON(!th
->t_trans_id
);
2565 old_ref
= th
->t_refcount
;
2569 ret
= block_prepare_write(page
, from
, to
, reiserfs_get_block
);
2570 if (ret
&& reiserfs_transaction_running(inode
->i_sb
)) {
2571 struct reiserfs_transaction_handle
*th
= current
->journal_info
;
2572 /* this gets a little ugly. If reiserfs_get_block returned an
2573 * error and left a transacstion running, we've got to close it,
2574 * and we've got to free handle if it was a persistent transaction.
2576 * But, if we had nested into an existing transaction, we need
2577 * to just drop the ref count on the handle.
2579 * If old_ref == 0, the transaction is from reiserfs_get_block,
2580 * and it was a persistent trans. Otherwise, it was nested above.
2582 if (th
->t_refcount
> old_ref
) {
2587 reiserfs_write_lock(inode
->i_sb
);
2588 err
= reiserfs_end_persistent_transaction(th
);
2589 reiserfs_write_unlock(inode
->i_sb
);
2599 static sector_t
reiserfs_aop_bmap(struct address_space
*as
, sector_t block
)
2601 return generic_block_bmap(as
, block
, reiserfs_bmap
);
2604 static int reiserfs_commit_write(struct file
*f
, struct page
*page
,
2605 unsigned from
, unsigned to
)
2607 struct inode
*inode
= page
->mapping
->host
;
2608 loff_t pos
= ((loff_t
) page
->index
<< PAGE_CACHE_SHIFT
) + to
;
2611 struct reiserfs_transaction_handle
*th
= NULL
;
2613 reiserfs_wait_on_write_block(inode
->i_sb
);
2614 if (reiserfs_transaction_running(inode
->i_sb
)) {
2615 th
= current
->journal_info
;
2617 reiserfs_commit_page(inode
, page
, from
, to
);
2619 /* generic_commit_write does this for us, but does not update the
2620 ** transaction tracking stuff when the size changes. So, we have
2621 ** to do the i_size updates here.
2623 if (pos
> inode
->i_size
) {
2624 struct reiserfs_transaction_handle myth
;
2625 reiserfs_write_lock(inode
->i_sb
);
2626 /* If the file have grown beyond the border where it
2627 can have a tail, unmark it as needing a tail
2629 if ((have_large_tails(inode
->i_sb
)
2630 && inode
->i_size
> i_block_size(inode
) * 4)
2631 || (have_small_tails(inode
->i_sb
)
2632 && inode
->i_size
> i_block_size(inode
)))
2633 REISERFS_I(inode
)->i_flags
&= ~i_pack_on_close_mask
;
2635 ret
= journal_begin(&myth
, inode
->i_sb
, 1);
2637 reiserfs_write_unlock(inode
->i_sb
);
2640 reiserfs_update_inode_transaction(inode
);
2641 inode
->i_size
= pos
;
2643 * this will just nest into our transaction. It's important
2644 * to use mark_inode_dirty so the inode gets pushed around on the
2645 * dirty lists, and so that O_SYNC works as expected
2647 mark_inode_dirty(inode
);
2648 reiserfs_update_sd(&myth
, inode
);
2650 ret
= journal_end(&myth
, inode
->i_sb
, 1);
2651 reiserfs_write_unlock(inode
->i_sb
);
2656 reiserfs_write_lock(inode
->i_sb
);
2658 mark_inode_dirty(inode
);
2659 ret
= reiserfs_end_persistent_transaction(th
);
2660 reiserfs_write_unlock(inode
->i_sb
);
2670 reiserfs_write_lock(inode
->i_sb
);
2672 reiserfs_update_sd(th
, inode
);
2673 ret
= reiserfs_end_persistent_transaction(th
);
2674 reiserfs_write_unlock(inode
->i_sb
);
2680 void sd_attrs_to_i_attrs(__u16 sd_attrs
, struct inode
*inode
)
2682 if (reiserfs_attrs(inode
->i_sb
)) {
2683 if (sd_attrs
& REISERFS_SYNC_FL
)
2684 inode
->i_flags
|= S_SYNC
;
2686 inode
->i_flags
&= ~S_SYNC
;
2687 if (sd_attrs
& REISERFS_IMMUTABLE_FL
)
2688 inode
->i_flags
|= S_IMMUTABLE
;
2690 inode
->i_flags
&= ~S_IMMUTABLE
;
2691 if (sd_attrs
& REISERFS_APPEND_FL
)
2692 inode
->i_flags
|= S_APPEND
;
2694 inode
->i_flags
&= ~S_APPEND
;
2695 if (sd_attrs
& REISERFS_NOATIME_FL
)
2696 inode
->i_flags
|= S_NOATIME
;
2698 inode
->i_flags
&= ~S_NOATIME
;
2699 if (sd_attrs
& REISERFS_NOTAIL_FL
)
2700 REISERFS_I(inode
)->i_flags
|= i_nopack_mask
;
2702 REISERFS_I(inode
)->i_flags
&= ~i_nopack_mask
;
2706 void i_attrs_to_sd_attrs(struct inode
*inode
, __u16
* sd_attrs
)
2708 if (reiserfs_attrs(inode
->i_sb
)) {
2709 if (inode
->i_flags
& S_IMMUTABLE
)
2710 *sd_attrs
|= REISERFS_IMMUTABLE_FL
;
2712 *sd_attrs
&= ~REISERFS_IMMUTABLE_FL
;
2713 if (inode
->i_flags
& S_SYNC
)
2714 *sd_attrs
|= REISERFS_SYNC_FL
;
2716 *sd_attrs
&= ~REISERFS_SYNC_FL
;
2717 if (inode
->i_flags
& S_NOATIME
)
2718 *sd_attrs
|= REISERFS_NOATIME_FL
;
2720 *sd_attrs
&= ~REISERFS_NOATIME_FL
;
2721 if (REISERFS_I(inode
)->i_flags
& i_nopack_mask
)
2722 *sd_attrs
|= REISERFS_NOTAIL_FL
;
2724 *sd_attrs
&= ~REISERFS_NOTAIL_FL
;
2728 /* decide if this buffer needs to stay around for data logging or ordered
2731 static int invalidatepage_can_drop(struct inode
*inode
, struct buffer_head
*bh
)
2734 struct reiserfs_journal
*j
= SB_JOURNAL(inode
->i_sb
);
2736 spin_lock(&j
->j_dirty_buffers_lock
);
2737 if (!buffer_mapped(bh
)) {
2740 /* the page is locked, and the only places that log a data buffer
2741 * also lock the page.
2743 if (reiserfs_file_data_log(inode
)) {
2745 * very conservative, leave the buffer pinned if
2746 * anyone might need it.
2748 if (buffer_journaled(bh
) || buffer_journal_dirty(bh
)) {
2751 } else if (buffer_dirty(bh
) || buffer_locked(bh
)) {
2752 struct reiserfs_journal_list
*jl
;
2753 struct reiserfs_jh
*jh
= bh
->b_private
;
2755 /* why is this safe?
2756 * reiserfs_setattr updates i_size in the on disk
2757 * stat data before allowing vmtruncate to be called.
2759 * If buffer was put onto the ordered list for this
2760 * transaction, we know for sure either this transaction
2761 * or an older one already has updated i_size on disk,
2762 * and this ordered data won't be referenced in the file
2765 * if the buffer was put onto the ordered list for an older
2766 * transaction, we need to leave it around
2768 if (jh
&& (jl
= jh
->jl
)
2769 && jl
!= SB_JOURNAL(inode
->i_sb
)->j_current_jl
)
2773 if (ret
&& bh
->b_private
) {
2774 reiserfs_free_jh(bh
);
2776 spin_unlock(&j
->j_dirty_buffers_lock
);
2780 /* clm -- taken from fs/buffer.c:block_invalidate_page */
2781 static int reiserfs_invalidatepage(struct page
*page
, unsigned long offset
)
2783 struct buffer_head
*head
, *bh
, *next
;
2784 struct inode
*inode
= page
->mapping
->host
;
2785 unsigned int curr_off
= 0;
2788 BUG_ON(!PageLocked(page
));
2791 ClearPageChecked(page
);
2793 if (!page_has_buffers(page
))
2796 head
= page_buffers(page
);
2799 unsigned int next_off
= curr_off
+ bh
->b_size
;
2800 next
= bh
->b_this_page
;
2803 * is this block fully invalidated?
2805 if (offset
<= curr_off
) {
2806 if (invalidatepage_can_drop(inode
, bh
))
2807 reiserfs_unmap_buffer(bh
);
2811 curr_off
= next_off
;
2813 } while (bh
!= head
);
2816 * We release buffers only if the entire page is being invalidated.
2817 * The get_block cached value has been unconditionally invalidated,
2818 * so real IO is not possible anymore.
2821 ret
= try_to_release_page(page
, 0);
2826 static int reiserfs_set_page_dirty(struct page
*page
)
2828 struct inode
*inode
= page
->mapping
->host
;
2829 if (reiserfs_file_data_log(inode
)) {
2830 SetPageChecked(page
);
2831 return __set_page_dirty_nobuffers(page
);
2833 return __set_page_dirty_buffers(page
);
2837 * Returns 1 if the page's buffers were dropped. The page is locked.
2839 * Takes j_dirty_buffers_lock to protect the b_assoc_buffers list_heads
2840 * in the buffers at page_buffers(page).
2842 * even in -o notail mode, we can't be sure an old mount without -o notail
2843 * didn't create files with tails.
2845 static int reiserfs_releasepage(struct page
*page
, gfp_t unused_gfp_flags
)
2847 struct inode
*inode
= page
->mapping
->host
;
2848 struct reiserfs_journal
*j
= SB_JOURNAL(inode
->i_sb
);
2849 struct buffer_head
*head
;
2850 struct buffer_head
*bh
;
2853 WARN_ON(PageChecked(page
));
2854 spin_lock(&j
->j_dirty_buffers_lock
);
2855 head
= page_buffers(page
);
2858 if (bh
->b_private
) {
2859 if (!buffer_dirty(bh
) && !buffer_locked(bh
)) {
2860 reiserfs_free_jh(bh
);
2866 bh
= bh
->b_this_page
;
2867 } while (bh
!= head
);
2869 ret
= try_to_free_buffers(page
);
2870 spin_unlock(&j
->j_dirty_buffers_lock
);
2874 /* We thank Mingming Cao for helping us understand in great detail what
2875 to do in this section of the code. */
2876 static ssize_t
reiserfs_direct_IO(int rw
, struct kiocb
*iocb
,
2877 const struct iovec
*iov
, loff_t offset
,
2878 unsigned long nr_segs
)
2880 struct file
*file
= iocb
->ki_filp
;
2881 struct inode
*inode
= file
->f_mapping
->host
;
2883 return blockdev_direct_IO(rw
, iocb
, inode
, inode
->i_sb
->s_bdev
, iov
,
2885 reiserfs_get_blocks_direct_io
, NULL
);
2888 int reiserfs_setattr(struct dentry
*dentry
, struct iattr
*attr
)
2890 struct inode
*inode
= dentry
->d_inode
;
2892 unsigned int ia_valid
= attr
->ia_valid
;
2893 reiserfs_write_lock(inode
->i_sb
);
2894 if (attr
->ia_valid
& ATTR_SIZE
) {
2895 /* version 2 items will be caught by the s_maxbytes check
2896 ** done for us in vmtruncate
2898 if (get_inode_item_key_version(inode
) == KEY_FORMAT_3_5
&&
2899 attr
->ia_size
> MAX_NON_LFS
) {
2903 /* fill in hole pointers in the expanding truncate case. */
2904 if (attr
->ia_size
> inode
->i_size
) {
2905 error
= generic_cont_expand(inode
, attr
->ia_size
);
2906 if (REISERFS_I(inode
)->i_prealloc_count
> 0) {
2908 struct reiserfs_transaction_handle th
;
2909 /* we're changing at most 2 bitmaps, inode + super */
2910 err
= journal_begin(&th
, inode
->i_sb
, 4);
2912 reiserfs_discard_prealloc(&th
, inode
);
2913 err
= journal_end(&th
, inode
->i_sb
, 4);
2923 if ((((attr
->ia_valid
& ATTR_UID
) && (attr
->ia_uid
& ~0xffff)) ||
2924 ((attr
->ia_valid
& ATTR_GID
) && (attr
->ia_gid
& ~0xffff))) &&
2925 (get_inode_sd_version(inode
) == STAT_DATA_V1
)) {
2926 /* stat data of format v3.5 has 16 bit uid and gid */
2931 error
= inode_change_ok(inode
, attr
);
2933 if ((ia_valid
& ATTR_UID
&& attr
->ia_uid
!= inode
->i_uid
) ||
2934 (ia_valid
& ATTR_GID
&& attr
->ia_gid
!= inode
->i_gid
)) {
2935 error
= reiserfs_chown_xattrs(inode
, attr
);
2938 struct reiserfs_transaction_handle th
;
2941 (REISERFS_QUOTA_INIT_BLOCKS(inode
->i_sb
) +
2942 REISERFS_QUOTA_DEL_BLOCKS(inode
->i_sb
)) +
2945 /* (user+group)*(old+new) structure - we count quota info and , inode write (sb, inode) */
2947 journal_begin(&th
, inode
->i_sb
,
2952 DQUOT_TRANSFER(inode
, attr
) ? -EDQUOT
: 0;
2954 journal_end(&th
, inode
->i_sb
,
2958 /* Update corresponding info in inode so that everything is in
2959 * one transaction */
2960 if (attr
->ia_valid
& ATTR_UID
)
2961 inode
->i_uid
= attr
->ia_uid
;
2962 if (attr
->ia_valid
& ATTR_GID
)
2963 inode
->i_gid
= attr
->ia_gid
;
2964 mark_inode_dirty(inode
);
2966 journal_end(&th
, inode
->i_sb
, jbegin_count
);
2970 error
= inode_setattr(inode
, attr
);
2973 if (!error
&& reiserfs_posixacl(inode
->i_sb
)) {
2974 if (attr
->ia_valid
& ATTR_MODE
)
2975 error
= reiserfs_acl_chmod(inode
);
2979 reiserfs_write_unlock(inode
->i_sb
);
2983 struct address_space_operations reiserfs_address_space_operations
= {
2984 .writepage
= reiserfs_writepage
,
2985 .readpage
= reiserfs_readpage
,
2986 .readpages
= reiserfs_readpages
,
2987 .releasepage
= reiserfs_releasepage
,
2988 .invalidatepage
= reiserfs_invalidatepage
,
2989 .sync_page
= block_sync_page
,
2990 .prepare_write
= reiserfs_prepare_write
,
2991 .commit_write
= reiserfs_commit_write
,
2992 .bmap
= reiserfs_aop_bmap
,
2993 .direct_IO
= reiserfs_direct_IO
,
2994 .set_page_dirty
= reiserfs_set_page_dirty
,