2 * Copyright (C) 2008 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/sched.h>
20 #include <linux/slab.h>
21 #include <linux/blkdev.h>
22 #include <linux/list_sort.h>
26 #include "print-tree.h"
29 #include "compression.h"
32 /* magic values for the inode_only field in btrfs_log_inode:
34 * LOG_INODE_ALL means to log everything
35 * LOG_INODE_EXISTS means to log just enough to recreate the inode
38 #define LOG_INODE_ALL 0
39 #define LOG_INODE_EXISTS 1
40 #define LOG_OTHER_INODE 2
43 * directory trouble cases
45 * 1) on rename or unlink, if the inode being unlinked isn't in the fsync
46 * log, we must force a full commit before doing an fsync of the directory
47 * where the unlink was done.
48 * ---> record transid of last unlink/rename per directory
52 * rename foo/some_dir foo2/some_dir
54 * fsync foo/some_dir/some_file
56 * The fsync above will unlink the original some_dir without recording
57 * it in its new location (foo2). After a crash, some_dir will be gone
58 * unless the fsync of some_file forces a full commit
60 * 2) we must log any new names for any file or dir that is in the fsync
61 * log. ---> check inode while renaming/linking.
63 * 2a) we must log any new names for any file or dir during rename
64 * when the directory they are being removed from was logged.
65 * ---> check inode and old parent dir during rename
67 * 2a is actually the more important variant. With the extra logging
68 * a crash might unlink the old name without recreating the new one
70 * 3) after a crash, we must go through any directories with a link count
71 * of zero and redo the rm -rf
78 * The directory f1 was fully removed from the FS, but fsync was never
79 * called on f1, only its parent dir. After a crash the rm -rf must
80 * be replayed. This must be able to recurse down the entire
81 * directory tree. The inode link count fixup code takes care of the
86 * stages for the tree walking. The first
87 * stage (0) is to only pin down the blocks we find
88 * the second stage (1) is to make sure that all the inodes
89 * we find in the log are created in the subvolume.
91 * The last stage is to deal with directories and links and extents
92 * and all the other fun semantics
94 #define LOG_WALK_PIN_ONLY 0
95 #define LOG_WALK_REPLAY_INODES 1
96 #define LOG_WALK_REPLAY_DIR_INDEX 2
97 #define LOG_WALK_REPLAY_ALL 3
99 static int btrfs_log_inode(struct btrfs_trans_handle
*trans
,
100 struct btrfs_root
*root
, struct btrfs_inode
*inode
,
104 struct btrfs_log_ctx
*ctx
);
105 static int link_to_fixup_dir(struct btrfs_trans_handle
*trans
,
106 struct btrfs_root
*root
,
107 struct btrfs_path
*path
, u64 objectid
);
108 static noinline
int replay_dir_deletes(struct btrfs_trans_handle
*trans
,
109 struct btrfs_root
*root
,
110 struct btrfs_root
*log
,
111 struct btrfs_path
*path
,
112 u64 dirid
, int del_all
);
115 * tree logging is a special write ahead log used to make sure that
116 * fsyncs and O_SYNCs can happen without doing full tree commits.
118 * Full tree commits are expensive because they require commonly
119 * modified blocks to be recowed, creating many dirty pages in the
120 * extent tree an 4x-6x higher write load than ext3.
122 * Instead of doing a tree commit on every fsync, we use the
123 * key ranges and transaction ids to find items for a given file or directory
124 * that have changed in this transaction. Those items are copied into
125 * a special tree (one per subvolume root), that tree is written to disk
126 * and then the fsync is considered complete.
128 * After a crash, items are copied out of the log-tree back into the
129 * subvolume tree. Any file data extents found are recorded in the extent
130 * allocation tree, and the log-tree freed.
132 * The log tree is read three times, once to pin down all the extents it is
133 * using in ram and once, once to create all the inodes logged in the tree
134 * and once to do all the other items.
138 * start a sub transaction and setup the log tree
139 * this increments the log tree writer count to make the people
140 * syncing the tree wait for us to finish
142 static int start_log_trans(struct btrfs_trans_handle
*trans
,
143 struct btrfs_root
*root
,
144 struct btrfs_log_ctx
*ctx
)
146 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
149 mutex_lock(&root
->log_mutex
);
151 if (root
->log_root
) {
152 if (btrfs_need_log_full_commit(fs_info
, trans
)) {
157 if (!root
->log_start_pid
) {
158 clear_bit(BTRFS_ROOT_MULTI_LOG_TASKS
, &root
->state
);
159 root
->log_start_pid
= current
->pid
;
160 } else if (root
->log_start_pid
!= current
->pid
) {
161 set_bit(BTRFS_ROOT_MULTI_LOG_TASKS
, &root
->state
);
164 mutex_lock(&fs_info
->tree_log_mutex
);
165 if (!fs_info
->log_root_tree
)
166 ret
= btrfs_init_log_root_tree(trans
, fs_info
);
167 mutex_unlock(&fs_info
->tree_log_mutex
);
171 ret
= btrfs_add_log_tree(trans
, root
);
175 clear_bit(BTRFS_ROOT_MULTI_LOG_TASKS
, &root
->state
);
176 root
->log_start_pid
= current
->pid
;
179 atomic_inc(&root
->log_batch
);
180 atomic_inc(&root
->log_writers
);
182 int index
= root
->log_transid
% 2;
183 list_add_tail(&ctx
->list
, &root
->log_ctxs
[index
]);
184 ctx
->log_transid
= root
->log_transid
;
188 mutex_unlock(&root
->log_mutex
);
193 * returns 0 if there was a log transaction running and we were able
194 * to join, or returns -ENOENT if there were not transactions
197 static int join_running_log_trans(struct btrfs_root
*root
)
205 mutex_lock(&root
->log_mutex
);
206 if (root
->log_root
) {
208 atomic_inc(&root
->log_writers
);
210 mutex_unlock(&root
->log_mutex
);
215 * This either makes the current running log transaction wait
216 * until you call btrfs_end_log_trans() or it makes any future
217 * log transactions wait until you call btrfs_end_log_trans()
219 int btrfs_pin_log_trans(struct btrfs_root
*root
)
223 mutex_lock(&root
->log_mutex
);
224 atomic_inc(&root
->log_writers
);
225 mutex_unlock(&root
->log_mutex
);
230 * indicate we're done making changes to the log tree
231 * and wake up anyone waiting to do a sync
233 void btrfs_end_log_trans(struct btrfs_root
*root
)
235 if (atomic_dec_and_test(&root
->log_writers
)) {
237 * Implicit memory barrier after atomic_dec_and_test
239 if (waitqueue_active(&root
->log_writer_wait
))
240 wake_up(&root
->log_writer_wait
);
246 * the walk control struct is used to pass state down the chain when
247 * processing the log tree. The stage field tells us which part
248 * of the log tree processing we are currently doing. The others
249 * are state fields used for that specific part
251 struct walk_control
{
252 /* should we free the extent on disk when done? This is used
253 * at transaction commit time while freeing a log tree
257 /* should we write out the extent buffer? This is used
258 * while flushing the log tree to disk during a sync
262 /* should we wait for the extent buffer io to finish? Also used
263 * while flushing the log tree to disk for a sync
267 /* pin only walk, we record which extents on disk belong to the
272 /* what stage of the replay code we're currently in */
275 /* the root we are currently replaying */
276 struct btrfs_root
*replay_dest
;
278 /* the trans handle for the current replay */
279 struct btrfs_trans_handle
*trans
;
281 /* the function that gets used to process blocks we find in the
282 * tree. Note the extent_buffer might not be up to date when it is
283 * passed in, and it must be checked or read if you need the data
286 int (*process_func
)(struct btrfs_root
*log
, struct extent_buffer
*eb
,
287 struct walk_control
*wc
, u64 gen
);
291 * process_func used to pin down extents, write them or wait on them
293 static int process_one_buffer(struct btrfs_root
*log
,
294 struct extent_buffer
*eb
,
295 struct walk_control
*wc
, u64 gen
)
297 struct btrfs_fs_info
*fs_info
= log
->fs_info
;
301 * If this fs is mixed then we need to be able to process the leaves to
302 * pin down any logged extents, so we have to read the block.
304 if (btrfs_fs_incompat(fs_info
, MIXED_GROUPS
)) {
305 ret
= btrfs_read_buffer(eb
, gen
);
311 ret
= btrfs_pin_extent_for_log_replay(fs_info
, eb
->start
,
314 if (!ret
&& btrfs_buffer_uptodate(eb
, gen
, 0)) {
315 if (wc
->pin
&& btrfs_header_level(eb
) == 0)
316 ret
= btrfs_exclude_logged_extents(fs_info
, eb
);
318 btrfs_write_tree_block(eb
);
320 btrfs_wait_tree_block_writeback(eb
);
326 * Item overwrite used by replay and tree logging. eb, slot and key all refer
327 * to the src data we are copying out.
329 * root is the tree we are copying into, and path is a scratch
330 * path for use in this function (it should be released on entry and
331 * will be released on exit).
333 * If the key is already in the destination tree the existing item is
334 * overwritten. If the existing item isn't big enough, it is extended.
335 * If it is too large, it is truncated.
337 * If the key isn't in the destination yet, a new item is inserted.
339 static noinline
int overwrite_item(struct btrfs_trans_handle
*trans
,
340 struct btrfs_root
*root
,
341 struct btrfs_path
*path
,
342 struct extent_buffer
*eb
, int slot
,
343 struct btrfs_key
*key
)
345 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
348 u64 saved_i_size
= 0;
349 int save_old_i_size
= 0;
350 unsigned long src_ptr
;
351 unsigned long dst_ptr
;
352 int overwrite_root
= 0;
353 bool inode_item
= key
->type
== BTRFS_INODE_ITEM_KEY
;
355 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
)
358 item_size
= btrfs_item_size_nr(eb
, slot
);
359 src_ptr
= btrfs_item_ptr_offset(eb
, slot
);
361 /* look for the key in the destination tree */
362 ret
= btrfs_search_slot(NULL
, root
, key
, path
, 0, 0);
369 u32 dst_size
= btrfs_item_size_nr(path
->nodes
[0],
371 if (dst_size
!= item_size
)
374 if (item_size
== 0) {
375 btrfs_release_path(path
);
378 dst_copy
= kmalloc(item_size
, GFP_NOFS
);
379 src_copy
= kmalloc(item_size
, GFP_NOFS
);
380 if (!dst_copy
|| !src_copy
) {
381 btrfs_release_path(path
);
387 read_extent_buffer(eb
, src_copy
, src_ptr
, item_size
);
389 dst_ptr
= btrfs_item_ptr_offset(path
->nodes
[0], path
->slots
[0]);
390 read_extent_buffer(path
->nodes
[0], dst_copy
, dst_ptr
,
392 ret
= memcmp(dst_copy
, src_copy
, item_size
);
397 * they have the same contents, just return, this saves
398 * us from cowing blocks in the destination tree and doing
399 * extra writes that may not have been done by a previous
403 btrfs_release_path(path
);
408 * We need to load the old nbytes into the inode so when we
409 * replay the extents we've logged we get the right nbytes.
412 struct btrfs_inode_item
*item
;
416 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
417 struct btrfs_inode_item
);
418 nbytes
= btrfs_inode_nbytes(path
->nodes
[0], item
);
419 item
= btrfs_item_ptr(eb
, slot
,
420 struct btrfs_inode_item
);
421 btrfs_set_inode_nbytes(eb
, item
, nbytes
);
424 * If this is a directory we need to reset the i_size to
425 * 0 so that we can set it up properly when replaying
426 * the rest of the items in this log.
428 mode
= btrfs_inode_mode(eb
, item
);
430 btrfs_set_inode_size(eb
, item
, 0);
432 } else if (inode_item
) {
433 struct btrfs_inode_item
*item
;
437 * New inode, set nbytes to 0 so that the nbytes comes out
438 * properly when we replay the extents.
440 item
= btrfs_item_ptr(eb
, slot
, struct btrfs_inode_item
);
441 btrfs_set_inode_nbytes(eb
, item
, 0);
444 * If this is a directory we need to reset the i_size to 0 so
445 * that we can set it up properly when replaying the rest of
446 * the items in this log.
448 mode
= btrfs_inode_mode(eb
, item
);
450 btrfs_set_inode_size(eb
, item
, 0);
453 btrfs_release_path(path
);
454 /* try to insert the key into the destination tree */
455 path
->skip_release_on_error
= 1;
456 ret
= btrfs_insert_empty_item(trans
, root
, path
,
458 path
->skip_release_on_error
= 0;
460 /* make sure any existing item is the correct size */
461 if (ret
== -EEXIST
|| ret
== -EOVERFLOW
) {
463 found_size
= btrfs_item_size_nr(path
->nodes
[0],
465 if (found_size
> item_size
)
466 btrfs_truncate_item(fs_info
, path
, item_size
, 1);
467 else if (found_size
< item_size
)
468 btrfs_extend_item(fs_info
, path
,
469 item_size
- found_size
);
473 dst_ptr
= btrfs_item_ptr_offset(path
->nodes
[0],
476 /* don't overwrite an existing inode if the generation number
477 * was logged as zero. This is done when the tree logging code
478 * is just logging an inode to make sure it exists after recovery.
480 * Also, don't overwrite i_size on directories during replay.
481 * log replay inserts and removes directory items based on the
482 * state of the tree found in the subvolume, and i_size is modified
485 if (key
->type
== BTRFS_INODE_ITEM_KEY
&& ret
== -EEXIST
) {
486 struct btrfs_inode_item
*src_item
;
487 struct btrfs_inode_item
*dst_item
;
489 src_item
= (struct btrfs_inode_item
*)src_ptr
;
490 dst_item
= (struct btrfs_inode_item
*)dst_ptr
;
492 if (btrfs_inode_generation(eb
, src_item
) == 0) {
493 struct extent_buffer
*dst_eb
= path
->nodes
[0];
494 const u64 ino_size
= btrfs_inode_size(eb
, src_item
);
497 * For regular files an ino_size == 0 is used only when
498 * logging that an inode exists, as part of a directory
499 * fsync, and the inode wasn't fsynced before. In this
500 * case don't set the size of the inode in the fs/subvol
501 * tree, otherwise we would be throwing valid data away.
503 if (S_ISREG(btrfs_inode_mode(eb
, src_item
)) &&
504 S_ISREG(btrfs_inode_mode(dst_eb
, dst_item
)) &&
506 struct btrfs_map_token token
;
508 btrfs_init_map_token(&token
);
509 btrfs_set_token_inode_size(dst_eb
, dst_item
,
515 if (overwrite_root
&&
516 S_ISDIR(btrfs_inode_mode(eb
, src_item
)) &&
517 S_ISDIR(btrfs_inode_mode(path
->nodes
[0], dst_item
))) {
519 saved_i_size
= btrfs_inode_size(path
->nodes
[0],
524 copy_extent_buffer(path
->nodes
[0], eb
, dst_ptr
,
527 if (save_old_i_size
) {
528 struct btrfs_inode_item
*dst_item
;
529 dst_item
= (struct btrfs_inode_item
*)dst_ptr
;
530 btrfs_set_inode_size(path
->nodes
[0], dst_item
, saved_i_size
);
533 /* make sure the generation is filled in */
534 if (key
->type
== BTRFS_INODE_ITEM_KEY
) {
535 struct btrfs_inode_item
*dst_item
;
536 dst_item
= (struct btrfs_inode_item
*)dst_ptr
;
537 if (btrfs_inode_generation(path
->nodes
[0], dst_item
) == 0) {
538 btrfs_set_inode_generation(path
->nodes
[0], dst_item
,
543 btrfs_mark_buffer_dirty(path
->nodes
[0]);
544 btrfs_release_path(path
);
549 * simple helper to read an inode off the disk from a given root
550 * This can only be called for subvolume roots and not for the log
552 static noinline
struct inode
*read_one_inode(struct btrfs_root
*root
,
555 struct btrfs_key key
;
558 key
.objectid
= objectid
;
559 key
.type
= BTRFS_INODE_ITEM_KEY
;
561 inode
= btrfs_iget(root
->fs_info
->sb
, &key
, root
, NULL
);
564 } else if (is_bad_inode(inode
)) {
571 /* replays a single extent in 'eb' at 'slot' with 'key' into the
572 * subvolume 'root'. path is released on entry and should be released
575 * extents in the log tree have not been allocated out of the extent
576 * tree yet. So, this completes the allocation, taking a reference
577 * as required if the extent already exists or creating a new extent
578 * if it isn't in the extent allocation tree yet.
580 * The extent is inserted into the file, dropping any existing extents
581 * from the file that overlap the new one.
583 static noinline
int replay_one_extent(struct btrfs_trans_handle
*trans
,
584 struct btrfs_root
*root
,
585 struct btrfs_path
*path
,
586 struct extent_buffer
*eb
, int slot
,
587 struct btrfs_key
*key
)
589 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
592 u64 start
= key
->offset
;
594 struct btrfs_file_extent_item
*item
;
595 struct inode
*inode
= NULL
;
599 item
= btrfs_item_ptr(eb
, slot
, struct btrfs_file_extent_item
);
600 found_type
= btrfs_file_extent_type(eb
, item
);
602 if (found_type
== BTRFS_FILE_EXTENT_REG
||
603 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
604 nbytes
= btrfs_file_extent_num_bytes(eb
, item
);
605 extent_end
= start
+ nbytes
;
608 * We don't add to the inodes nbytes if we are prealloc or a
611 if (btrfs_file_extent_disk_bytenr(eb
, item
) == 0)
613 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
614 size
= btrfs_file_extent_inline_len(eb
, slot
, item
);
615 nbytes
= btrfs_file_extent_ram_bytes(eb
, item
);
616 extent_end
= ALIGN(start
+ size
,
617 fs_info
->sectorsize
);
623 inode
= read_one_inode(root
, key
->objectid
);
630 * first check to see if we already have this extent in the
631 * file. This must be done before the btrfs_drop_extents run
632 * so we don't try to drop this extent.
634 ret
= btrfs_lookup_file_extent(trans
, root
, path
,
635 btrfs_ino(BTRFS_I(inode
)), start
, 0);
638 (found_type
== BTRFS_FILE_EXTENT_REG
||
639 found_type
== BTRFS_FILE_EXTENT_PREALLOC
)) {
640 struct btrfs_file_extent_item cmp1
;
641 struct btrfs_file_extent_item cmp2
;
642 struct btrfs_file_extent_item
*existing
;
643 struct extent_buffer
*leaf
;
645 leaf
= path
->nodes
[0];
646 existing
= btrfs_item_ptr(leaf
, path
->slots
[0],
647 struct btrfs_file_extent_item
);
649 read_extent_buffer(eb
, &cmp1
, (unsigned long)item
,
651 read_extent_buffer(leaf
, &cmp2
, (unsigned long)existing
,
655 * we already have a pointer to this exact extent,
656 * we don't have to do anything
658 if (memcmp(&cmp1
, &cmp2
, sizeof(cmp1
)) == 0) {
659 btrfs_release_path(path
);
663 btrfs_release_path(path
);
665 /* drop any overlapping extents */
666 ret
= btrfs_drop_extents(trans
, root
, inode
, start
, extent_end
, 1);
670 if (found_type
== BTRFS_FILE_EXTENT_REG
||
671 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
673 unsigned long dest_offset
;
674 struct btrfs_key ins
;
676 if (btrfs_file_extent_disk_bytenr(eb
, item
) == 0 &&
677 btrfs_fs_incompat(fs_info
, NO_HOLES
))
680 ret
= btrfs_insert_empty_item(trans
, root
, path
, key
,
684 dest_offset
= btrfs_item_ptr_offset(path
->nodes
[0],
686 copy_extent_buffer(path
->nodes
[0], eb
, dest_offset
,
687 (unsigned long)item
, sizeof(*item
));
689 ins
.objectid
= btrfs_file_extent_disk_bytenr(eb
, item
);
690 ins
.offset
= btrfs_file_extent_disk_num_bytes(eb
, item
);
691 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
692 offset
= key
->offset
- btrfs_file_extent_offset(eb
, item
);
695 * Manually record dirty extent, as here we did a shallow
696 * file extent item copy and skip normal backref update,
697 * but modifying extent tree all by ourselves.
698 * So need to manually record dirty extent for qgroup,
699 * as the owner of the file extent changed from log tree
700 * (doesn't affect qgroup) to fs/file tree(affects qgroup)
702 ret
= btrfs_qgroup_trace_extent(trans
, fs_info
,
703 btrfs_file_extent_disk_bytenr(eb
, item
),
704 btrfs_file_extent_disk_num_bytes(eb
, item
),
709 if (ins
.objectid
> 0) {
712 LIST_HEAD(ordered_sums
);
714 * is this extent already allocated in the extent
715 * allocation tree? If so, just add a reference
717 ret
= btrfs_lookup_data_extent(fs_info
, ins
.objectid
,
720 ret
= btrfs_inc_extent_ref(trans
, fs_info
,
721 ins
.objectid
, ins
.offset
,
722 0, root
->root_key
.objectid
,
723 key
->objectid
, offset
);
728 * insert the extent pointer in the extent
731 ret
= btrfs_alloc_logged_file_extent(trans
,
733 root
->root_key
.objectid
,
734 key
->objectid
, offset
, &ins
);
738 btrfs_release_path(path
);
740 if (btrfs_file_extent_compression(eb
, item
)) {
741 csum_start
= ins
.objectid
;
742 csum_end
= csum_start
+ ins
.offset
;
744 csum_start
= ins
.objectid
+
745 btrfs_file_extent_offset(eb
, item
);
746 csum_end
= csum_start
+
747 btrfs_file_extent_num_bytes(eb
, item
);
750 ret
= btrfs_lookup_csums_range(root
->log_root
,
751 csum_start
, csum_end
- 1,
756 * Now delete all existing cums in the csum root that
757 * cover our range. We do this because we can have an
758 * extent that is completely referenced by one file
759 * extent item and partially referenced by another
760 * file extent item (like after using the clone or
761 * extent_same ioctls). In this case if we end up doing
762 * the replay of the one that partially references the
763 * extent first, and we do not do the csum deletion
764 * below, we can get 2 csum items in the csum tree that
765 * overlap each other. For example, imagine our log has
766 * the two following file extent items:
768 * key (257 EXTENT_DATA 409600)
769 * extent data disk byte 12845056 nr 102400
770 * extent data offset 20480 nr 20480 ram 102400
772 * key (257 EXTENT_DATA 819200)
773 * extent data disk byte 12845056 nr 102400
774 * extent data offset 0 nr 102400 ram 102400
776 * Where the second one fully references the 100K extent
777 * that starts at disk byte 12845056, and the log tree
778 * has a single csum item that covers the entire range
781 * key (EXTENT_CSUM EXTENT_CSUM 12845056) itemsize 100
783 * After the first file extent item is replayed, the
784 * csum tree gets the following csum item:
786 * key (EXTENT_CSUM EXTENT_CSUM 12865536) itemsize 20
788 * Which covers the 20K sub-range starting at offset 20K
789 * of our extent. Now when we replay the second file
790 * extent item, if we do not delete existing csum items
791 * that cover any of its blocks, we end up getting two
792 * csum items in our csum tree that overlap each other:
794 * key (EXTENT_CSUM EXTENT_CSUM 12845056) itemsize 100
795 * key (EXTENT_CSUM EXTENT_CSUM 12865536) itemsize 20
797 * Which is a problem, because after this anyone trying
798 * to lookup up for the checksum of any block of our
799 * extent starting at an offset of 40K or higher, will
800 * end up looking at the second csum item only, which
801 * does not contain the checksum for any block starting
802 * at offset 40K or higher of our extent.
804 while (!list_empty(&ordered_sums
)) {
805 struct btrfs_ordered_sum
*sums
;
806 sums
= list_entry(ordered_sums
.next
,
807 struct btrfs_ordered_sum
,
810 ret
= btrfs_del_csums(trans
, fs_info
,
814 ret
= btrfs_csum_file_blocks(trans
,
815 fs_info
->csum_root
, sums
);
816 list_del(&sums
->list
);
822 btrfs_release_path(path
);
824 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
825 /* inline extents are easy, we just overwrite them */
826 ret
= overwrite_item(trans
, root
, path
, eb
, slot
, key
);
831 inode_add_bytes(inode
, nbytes
);
833 ret
= btrfs_update_inode(trans
, root
, inode
);
841 * when cleaning up conflicts between the directory names in the
842 * subvolume, directory names in the log and directory names in the
843 * inode back references, we may have to unlink inodes from directories.
845 * This is a helper function to do the unlink of a specific directory
848 static noinline
int drop_one_dir_item(struct btrfs_trans_handle
*trans
,
849 struct btrfs_root
*root
,
850 struct btrfs_path
*path
,
851 struct btrfs_inode
*dir
,
852 struct btrfs_dir_item
*di
)
854 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
858 struct extent_buffer
*leaf
;
859 struct btrfs_key location
;
862 leaf
= path
->nodes
[0];
864 btrfs_dir_item_key_to_cpu(leaf
, di
, &location
);
865 name_len
= btrfs_dir_name_len(leaf
, di
);
866 name
= kmalloc(name_len
, GFP_NOFS
);
870 read_extent_buffer(leaf
, name
, (unsigned long)(di
+ 1), name_len
);
871 btrfs_release_path(path
);
873 inode
= read_one_inode(root
, location
.objectid
);
879 ret
= link_to_fixup_dir(trans
, root
, path
, location
.objectid
);
883 ret
= btrfs_unlink_inode(trans
, root
, dir
, BTRFS_I(inode
), name
,
888 ret
= btrfs_run_delayed_items(trans
, fs_info
);
896 * helper function to see if a given name and sequence number found
897 * in an inode back reference are already in a directory and correctly
898 * point to this inode
900 static noinline
int inode_in_dir(struct btrfs_root
*root
,
901 struct btrfs_path
*path
,
902 u64 dirid
, u64 objectid
, u64 index
,
903 const char *name
, int name_len
)
905 struct btrfs_dir_item
*di
;
906 struct btrfs_key location
;
909 di
= btrfs_lookup_dir_index_item(NULL
, root
, path
, dirid
,
910 index
, name
, name_len
, 0);
911 if (di
&& !IS_ERR(di
)) {
912 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, &location
);
913 if (location
.objectid
!= objectid
)
917 btrfs_release_path(path
);
919 di
= btrfs_lookup_dir_item(NULL
, root
, path
, dirid
, name
, name_len
, 0);
920 if (di
&& !IS_ERR(di
)) {
921 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, &location
);
922 if (location
.objectid
!= objectid
)
928 btrfs_release_path(path
);
933 * helper function to check a log tree for a named back reference in
934 * an inode. This is used to decide if a back reference that is
935 * found in the subvolume conflicts with what we find in the log.
937 * inode backreferences may have multiple refs in a single item,
938 * during replay we process one reference at a time, and we don't
939 * want to delete valid links to a file from the subvolume if that
940 * link is also in the log.
942 static noinline
int backref_in_log(struct btrfs_root
*log
,
943 struct btrfs_key
*key
,
945 const char *name
, int namelen
)
947 struct btrfs_path
*path
;
948 struct btrfs_inode_ref
*ref
;
950 unsigned long ptr_end
;
951 unsigned long name_ptr
;
957 path
= btrfs_alloc_path();
961 ret
= btrfs_search_slot(NULL
, log
, key
, path
, 0, 0);
965 ptr
= btrfs_item_ptr_offset(path
->nodes
[0], path
->slots
[0]);
967 if (key
->type
== BTRFS_INODE_EXTREF_KEY
) {
968 if (btrfs_find_name_in_ext_backref(path
, ref_objectid
,
969 name
, namelen
, NULL
))
975 item_size
= btrfs_item_size_nr(path
->nodes
[0], path
->slots
[0]);
976 ptr_end
= ptr
+ item_size
;
977 while (ptr
< ptr_end
) {
978 ref
= (struct btrfs_inode_ref
*)ptr
;
979 found_name_len
= btrfs_inode_ref_name_len(path
->nodes
[0], ref
);
980 if (found_name_len
== namelen
) {
981 name_ptr
= (unsigned long)(ref
+ 1);
982 ret
= memcmp_extent_buffer(path
->nodes
[0], name
,
989 ptr
= (unsigned long)(ref
+ 1) + found_name_len
;
992 btrfs_free_path(path
);
996 static inline int __add_inode_ref(struct btrfs_trans_handle
*trans
,
997 struct btrfs_root
*root
,
998 struct btrfs_path
*path
,
999 struct btrfs_root
*log_root
,
1000 struct btrfs_inode
*dir
,
1001 struct btrfs_inode
*inode
,
1002 u64 inode_objectid
, u64 parent_objectid
,
1003 u64 ref_index
, char *name
, int namelen
,
1006 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
1009 int victim_name_len
;
1010 struct extent_buffer
*leaf
;
1011 struct btrfs_dir_item
*di
;
1012 struct btrfs_key search_key
;
1013 struct btrfs_inode_extref
*extref
;
1016 /* Search old style refs */
1017 search_key
.objectid
= inode_objectid
;
1018 search_key
.type
= BTRFS_INODE_REF_KEY
;
1019 search_key
.offset
= parent_objectid
;
1020 ret
= btrfs_search_slot(NULL
, root
, &search_key
, path
, 0, 0);
1022 struct btrfs_inode_ref
*victim_ref
;
1024 unsigned long ptr_end
;
1026 leaf
= path
->nodes
[0];
1028 /* are we trying to overwrite a back ref for the root directory
1029 * if so, just jump out, we're done
1031 if (search_key
.objectid
== search_key
.offset
)
1034 /* check all the names in this back reference to see
1035 * if they are in the log. if so, we allow them to stay
1036 * otherwise they must be unlinked as a conflict
1038 ptr
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
1039 ptr_end
= ptr
+ btrfs_item_size_nr(leaf
, path
->slots
[0]);
1040 while (ptr
< ptr_end
) {
1041 victim_ref
= (struct btrfs_inode_ref
*)ptr
;
1042 victim_name_len
= btrfs_inode_ref_name_len(leaf
,
1044 victim_name
= kmalloc(victim_name_len
, GFP_NOFS
);
1048 read_extent_buffer(leaf
, victim_name
,
1049 (unsigned long)(victim_ref
+ 1),
1052 if (!backref_in_log(log_root
, &search_key
,
1056 inc_nlink(&inode
->vfs_inode
);
1057 btrfs_release_path(path
);
1059 ret
= btrfs_unlink_inode(trans
, root
, dir
, inode
,
1060 victim_name
, victim_name_len
);
1064 ret
= btrfs_run_delayed_items(trans
, fs_info
);
1072 ptr
= (unsigned long)(victim_ref
+ 1) + victim_name_len
;
1076 * NOTE: we have searched root tree and checked the
1077 * corresponding ref, it does not need to check again.
1081 btrfs_release_path(path
);
1083 /* Same search but for extended refs */
1084 extref
= btrfs_lookup_inode_extref(NULL
, root
, path
, name
, namelen
,
1085 inode_objectid
, parent_objectid
, 0,
1087 if (!IS_ERR_OR_NULL(extref
)) {
1091 struct inode
*victim_parent
;
1093 leaf
= path
->nodes
[0];
1095 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1096 base
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
1098 while (cur_offset
< item_size
) {
1099 extref
= (struct btrfs_inode_extref
*)(base
+ cur_offset
);
1101 victim_name_len
= btrfs_inode_extref_name_len(leaf
, extref
);
1103 if (btrfs_inode_extref_parent(leaf
, extref
) != parent_objectid
)
1106 victim_name
= kmalloc(victim_name_len
, GFP_NOFS
);
1109 read_extent_buffer(leaf
, victim_name
, (unsigned long)&extref
->name
,
1112 search_key
.objectid
= inode_objectid
;
1113 search_key
.type
= BTRFS_INODE_EXTREF_KEY
;
1114 search_key
.offset
= btrfs_extref_hash(parent_objectid
,
1118 if (!backref_in_log(log_root
, &search_key
,
1119 parent_objectid
, victim_name
,
1122 victim_parent
= read_one_inode(root
,
1124 if (victim_parent
) {
1125 inc_nlink(&inode
->vfs_inode
);
1126 btrfs_release_path(path
);
1128 ret
= btrfs_unlink_inode(trans
, root
,
1129 BTRFS_I(victim_parent
),
1134 ret
= btrfs_run_delayed_items(
1138 iput(victim_parent
);
1149 cur_offset
+= victim_name_len
+ sizeof(*extref
);
1153 btrfs_release_path(path
);
1155 /* look for a conflicting sequence number */
1156 di
= btrfs_lookup_dir_index_item(trans
, root
, path
, btrfs_ino(dir
),
1157 ref_index
, name
, namelen
, 0);
1158 if (di
&& !IS_ERR(di
)) {
1159 ret
= drop_one_dir_item(trans
, root
, path
, dir
, di
);
1163 btrfs_release_path(path
);
1165 /* look for a conflicing name */
1166 di
= btrfs_lookup_dir_item(trans
, root
, path
, btrfs_ino(dir
),
1168 if (di
&& !IS_ERR(di
)) {
1169 ret
= drop_one_dir_item(trans
, root
, path
, dir
, di
);
1173 btrfs_release_path(path
);
1178 static int extref_get_fields(struct extent_buffer
*eb
, int slot
,
1179 unsigned long ref_ptr
, u32
*namelen
, char **name
,
1180 u64
*index
, u64
*parent_objectid
)
1182 struct btrfs_inode_extref
*extref
;
1184 extref
= (struct btrfs_inode_extref
*)ref_ptr
;
1186 *namelen
= btrfs_inode_extref_name_len(eb
, extref
);
1187 if (!btrfs_is_name_len_valid(eb
, slot
, (unsigned long)&extref
->name
,
1191 *name
= kmalloc(*namelen
, GFP_NOFS
);
1195 read_extent_buffer(eb
, *name
, (unsigned long)&extref
->name
,
1198 *index
= btrfs_inode_extref_index(eb
, extref
);
1199 if (parent_objectid
)
1200 *parent_objectid
= btrfs_inode_extref_parent(eb
, extref
);
1205 static int ref_get_fields(struct extent_buffer
*eb
, int slot
,
1206 unsigned long ref_ptr
, u32
*namelen
, char **name
,
1209 struct btrfs_inode_ref
*ref
;
1211 ref
= (struct btrfs_inode_ref
*)ref_ptr
;
1213 *namelen
= btrfs_inode_ref_name_len(eb
, ref
);
1214 if (!btrfs_is_name_len_valid(eb
, slot
, (unsigned long)(ref
+ 1),
1218 *name
= kmalloc(*namelen
, GFP_NOFS
);
1222 read_extent_buffer(eb
, *name
, (unsigned long)(ref
+ 1), *namelen
);
1224 *index
= btrfs_inode_ref_index(eb
, ref
);
1230 * replay one inode back reference item found in the log tree.
1231 * eb, slot and key refer to the buffer and key found in the log tree.
1232 * root is the destination we are replaying into, and path is for temp
1233 * use by this function. (it should be released on return).
1235 static noinline
int add_inode_ref(struct btrfs_trans_handle
*trans
,
1236 struct btrfs_root
*root
,
1237 struct btrfs_root
*log
,
1238 struct btrfs_path
*path
,
1239 struct extent_buffer
*eb
, int slot
,
1240 struct btrfs_key
*key
)
1242 struct inode
*dir
= NULL
;
1243 struct inode
*inode
= NULL
;
1244 unsigned long ref_ptr
;
1245 unsigned long ref_end
;
1249 int search_done
= 0;
1250 int log_ref_ver
= 0;
1251 u64 parent_objectid
;
1254 int ref_struct_size
;
1256 ref_ptr
= btrfs_item_ptr_offset(eb
, slot
);
1257 ref_end
= ref_ptr
+ btrfs_item_size_nr(eb
, slot
);
1259 if (key
->type
== BTRFS_INODE_EXTREF_KEY
) {
1260 struct btrfs_inode_extref
*r
;
1262 ref_struct_size
= sizeof(struct btrfs_inode_extref
);
1264 r
= (struct btrfs_inode_extref
*)ref_ptr
;
1265 parent_objectid
= btrfs_inode_extref_parent(eb
, r
);
1267 ref_struct_size
= sizeof(struct btrfs_inode_ref
);
1268 parent_objectid
= key
->offset
;
1270 inode_objectid
= key
->objectid
;
1273 * it is possible that we didn't log all the parent directories
1274 * for a given inode. If we don't find the dir, just don't
1275 * copy the back ref in. The link count fixup code will take
1278 dir
= read_one_inode(root
, parent_objectid
);
1284 inode
= read_one_inode(root
, inode_objectid
);
1290 while (ref_ptr
< ref_end
) {
1292 ret
= extref_get_fields(eb
, slot
, ref_ptr
, &namelen
,
1293 &name
, &ref_index
, &parent_objectid
);
1295 * parent object can change from one array
1299 dir
= read_one_inode(root
, parent_objectid
);
1305 ret
= ref_get_fields(eb
, slot
, ref_ptr
, &namelen
,
1311 /* if we already have a perfect match, we're done */
1312 if (!inode_in_dir(root
, path
, btrfs_ino(BTRFS_I(dir
)),
1313 btrfs_ino(BTRFS_I(inode
)), ref_index
,
1316 * look for a conflicting back reference in the
1317 * metadata. if we find one we have to unlink that name
1318 * of the file before we add our new link. Later on, we
1319 * overwrite any existing back reference, and we don't
1320 * want to create dangling pointers in the directory.
1324 ret
= __add_inode_ref(trans
, root
, path
, log
,
1329 ref_index
, name
, namelen
,
1338 /* insert our name */
1339 ret
= btrfs_add_link(trans
, BTRFS_I(dir
),
1341 name
, namelen
, 0, ref_index
);
1345 btrfs_update_inode(trans
, root
, inode
);
1348 ref_ptr
= (unsigned long)(ref_ptr
+ ref_struct_size
) + namelen
;
1357 /* finally write the back reference in the inode */
1358 ret
= overwrite_item(trans
, root
, path
, eb
, slot
, key
);
1360 btrfs_release_path(path
);
1367 static int insert_orphan_item(struct btrfs_trans_handle
*trans
,
1368 struct btrfs_root
*root
, u64 ino
)
1372 ret
= btrfs_insert_orphan_item(trans
, root
, ino
);
1379 static int count_inode_extrefs(struct btrfs_root
*root
,
1380 struct btrfs_inode
*inode
, struct btrfs_path
*path
)
1384 unsigned int nlink
= 0;
1387 u64 inode_objectid
= btrfs_ino(inode
);
1390 struct btrfs_inode_extref
*extref
;
1391 struct extent_buffer
*leaf
;
1394 ret
= btrfs_find_one_extref(root
, inode_objectid
, offset
, path
,
1399 leaf
= path
->nodes
[0];
1400 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1401 ptr
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
1404 while (cur_offset
< item_size
) {
1405 extref
= (struct btrfs_inode_extref
*) (ptr
+ cur_offset
);
1406 name_len
= btrfs_inode_extref_name_len(leaf
, extref
);
1410 cur_offset
+= name_len
+ sizeof(*extref
);
1414 btrfs_release_path(path
);
1416 btrfs_release_path(path
);
1418 if (ret
< 0 && ret
!= -ENOENT
)
1423 static int count_inode_refs(struct btrfs_root
*root
,
1424 struct btrfs_inode
*inode
, struct btrfs_path
*path
)
1427 struct btrfs_key key
;
1428 unsigned int nlink
= 0;
1430 unsigned long ptr_end
;
1432 u64 ino
= btrfs_ino(inode
);
1435 key
.type
= BTRFS_INODE_REF_KEY
;
1436 key
.offset
= (u64
)-1;
1439 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1443 if (path
->slots
[0] == 0)
1448 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
1450 if (key
.objectid
!= ino
||
1451 key
.type
!= BTRFS_INODE_REF_KEY
)
1453 ptr
= btrfs_item_ptr_offset(path
->nodes
[0], path
->slots
[0]);
1454 ptr_end
= ptr
+ btrfs_item_size_nr(path
->nodes
[0],
1456 while (ptr
< ptr_end
) {
1457 struct btrfs_inode_ref
*ref
;
1459 ref
= (struct btrfs_inode_ref
*)ptr
;
1460 name_len
= btrfs_inode_ref_name_len(path
->nodes
[0],
1462 ptr
= (unsigned long)(ref
+ 1) + name_len
;
1466 if (key
.offset
== 0)
1468 if (path
->slots
[0] > 0) {
1473 btrfs_release_path(path
);
1475 btrfs_release_path(path
);
1481 * There are a few corners where the link count of the file can't
1482 * be properly maintained during replay. So, instead of adding
1483 * lots of complexity to the log code, we just scan the backrefs
1484 * for any file that has been through replay.
1486 * The scan will update the link count on the inode to reflect the
1487 * number of back refs found. If it goes down to zero, the iput
1488 * will free the inode.
1490 static noinline
int fixup_inode_link_count(struct btrfs_trans_handle
*trans
,
1491 struct btrfs_root
*root
,
1492 struct inode
*inode
)
1494 struct btrfs_path
*path
;
1497 u64 ino
= btrfs_ino(BTRFS_I(inode
));
1499 path
= btrfs_alloc_path();
1503 ret
= count_inode_refs(root
, BTRFS_I(inode
), path
);
1509 ret
= count_inode_extrefs(root
, BTRFS_I(inode
), path
);
1517 if (nlink
!= inode
->i_nlink
) {
1518 set_nlink(inode
, nlink
);
1519 btrfs_update_inode(trans
, root
, inode
);
1521 BTRFS_I(inode
)->index_cnt
= (u64
)-1;
1523 if (inode
->i_nlink
== 0) {
1524 if (S_ISDIR(inode
->i_mode
)) {
1525 ret
= replay_dir_deletes(trans
, root
, NULL
, path
,
1530 ret
= insert_orphan_item(trans
, root
, ino
);
1534 btrfs_free_path(path
);
1538 static noinline
int fixup_inode_link_counts(struct btrfs_trans_handle
*trans
,
1539 struct btrfs_root
*root
,
1540 struct btrfs_path
*path
)
1543 struct btrfs_key key
;
1544 struct inode
*inode
;
1546 key
.objectid
= BTRFS_TREE_LOG_FIXUP_OBJECTID
;
1547 key
.type
= BTRFS_ORPHAN_ITEM_KEY
;
1548 key
.offset
= (u64
)-1;
1550 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1555 if (path
->slots
[0] == 0)
1560 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, path
->slots
[0]);
1561 if (key
.objectid
!= BTRFS_TREE_LOG_FIXUP_OBJECTID
||
1562 key
.type
!= BTRFS_ORPHAN_ITEM_KEY
)
1565 ret
= btrfs_del_item(trans
, root
, path
);
1569 btrfs_release_path(path
);
1570 inode
= read_one_inode(root
, key
.offset
);
1574 ret
= fixup_inode_link_count(trans
, root
, inode
);
1580 * fixup on a directory may create new entries,
1581 * make sure we always look for the highset possible
1584 key
.offset
= (u64
)-1;
1588 btrfs_release_path(path
);
1594 * record a given inode in the fixup dir so we can check its link
1595 * count when replay is done. The link count is incremented here
1596 * so the inode won't go away until we check it
1598 static noinline
int link_to_fixup_dir(struct btrfs_trans_handle
*trans
,
1599 struct btrfs_root
*root
,
1600 struct btrfs_path
*path
,
1603 struct btrfs_key key
;
1605 struct inode
*inode
;
1607 inode
= read_one_inode(root
, objectid
);
1611 key
.objectid
= BTRFS_TREE_LOG_FIXUP_OBJECTID
;
1612 key
.type
= BTRFS_ORPHAN_ITEM_KEY
;
1613 key
.offset
= objectid
;
1615 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
, 0);
1617 btrfs_release_path(path
);
1619 if (!inode
->i_nlink
)
1620 set_nlink(inode
, 1);
1623 ret
= btrfs_update_inode(trans
, root
, inode
);
1624 } else if (ret
== -EEXIST
) {
1627 BUG(); /* Logic Error */
1635 * when replaying the log for a directory, we only insert names
1636 * for inodes that actually exist. This means an fsync on a directory
1637 * does not implicitly fsync all the new files in it
1639 static noinline
int insert_one_name(struct btrfs_trans_handle
*trans
,
1640 struct btrfs_root
*root
,
1641 u64 dirid
, u64 index
,
1642 char *name
, int name_len
,
1643 struct btrfs_key
*location
)
1645 struct inode
*inode
;
1649 inode
= read_one_inode(root
, location
->objectid
);
1653 dir
= read_one_inode(root
, dirid
);
1659 ret
= btrfs_add_link(trans
, BTRFS_I(dir
), BTRFS_I(inode
), name
,
1660 name_len
, 1, index
);
1662 /* FIXME, put inode into FIXUP list */
1670 * Return true if an inode reference exists in the log for the given name,
1671 * inode and parent inode.
1673 static bool name_in_log_ref(struct btrfs_root
*log_root
,
1674 const char *name
, const int name_len
,
1675 const u64 dirid
, const u64 ino
)
1677 struct btrfs_key search_key
;
1679 search_key
.objectid
= ino
;
1680 search_key
.type
= BTRFS_INODE_REF_KEY
;
1681 search_key
.offset
= dirid
;
1682 if (backref_in_log(log_root
, &search_key
, dirid
, name
, name_len
))
1685 search_key
.type
= BTRFS_INODE_EXTREF_KEY
;
1686 search_key
.offset
= btrfs_extref_hash(dirid
, name
, name_len
);
1687 if (backref_in_log(log_root
, &search_key
, dirid
, name
, name_len
))
1694 * take a single entry in a log directory item and replay it into
1697 * if a conflicting item exists in the subdirectory already,
1698 * the inode it points to is unlinked and put into the link count
1701 * If a name from the log points to a file or directory that does
1702 * not exist in the FS, it is skipped. fsyncs on directories
1703 * do not force down inodes inside that directory, just changes to the
1704 * names or unlinks in a directory.
1706 * Returns < 0 on error, 0 if the name wasn't replayed (dentry points to a
1707 * non-existing inode) and 1 if the name was replayed.
1709 static noinline
int replay_one_name(struct btrfs_trans_handle
*trans
,
1710 struct btrfs_root
*root
,
1711 struct btrfs_path
*path
,
1712 struct extent_buffer
*eb
,
1713 struct btrfs_dir_item
*di
,
1714 struct btrfs_key
*key
)
1718 struct btrfs_dir_item
*dst_di
;
1719 struct btrfs_key found_key
;
1720 struct btrfs_key log_key
;
1725 bool update_size
= (key
->type
== BTRFS_DIR_INDEX_KEY
);
1726 bool name_added
= false;
1728 dir
= read_one_inode(root
, key
->objectid
);
1732 name_len
= btrfs_dir_name_len(eb
, di
);
1733 name
= kmalloc(name_len
, GFP_NOFS
);
1739 log_type
= btrfs_dir_type(eb
, di
);
1740 read_extent_buffer(eb
, name
, (unsigned long)(di
+ 1),
1743 btrfs_dir_item_key_to_cpu(eb
, di
, &log_key
);
1744 exists
= btrfs_lookup_inode(trans
, root
, path
, &log_key
, 0);
1749 btrfs_release_path(path
);
1751 if (key
->type
== BTRFS_DIR_ITEM_KEY
) {
1752 dst_di
= btrfs_lookup_dir_item(trans
, root
, path
, key
->objectid
,
1754 } else if (key
->type
== BTRFS_DIR_INDEX_KEY
) {
1755 dst_di
= btrfs_lookup_dir_index_item(trans
, root
, path
,
1764 if (IS_ERR_OR_NULL(dst_di
)) {
1765 /* we need a sequence number to insert, so we only
1766 * do inserts for the BTRFS_DIR_INDEX_KEY types
1768 if (key
->type
!= BTRFS_DIR_INDEX_KEY
)
1773 btrfs_dir_item_key_to_cpu(path
->nodes
[0], dst_di
, &found_key
);
1774 /* the existing item matches the logged item */
1775 if (found_key
.objectid
== log_key
.objectid
&&
1776 found_key
.type
== log_key
.type
&&
1777 found_key
.offset
== log_key
.offset
&&
1778 btrfs_dir_type(path
->nodes
[0], dst_di
) == log_type
) {
1779 update_size
= false;
1784 * don't drop the conflicting directory entry if the inode
1785 * for the new entry doesn't exist
1790 ret
= drop_one_dir_item(trans
, root
, path
, BTRFS_I(dir
), dst_di
);
1794 if (key
->type
== BTRFS_DIR_INDEX_KEY
)
1797 btrfs_release_path(path
);
1798 if (!ret
&& update_size
) {
1799 btrfs_i_size_write(BTRFS_I(dir
), dir
->i_size
+ name_len
* 2);
1800 ret
= btrfs_update_inode(trans
, root
, dir
);
1804 if (!ret
&& name_added
)
1809 if (name_in_log_ref(root
->log_root
, name
, name_len
,
1810 key
->objectid
, log_key
.objectid
)) {
1811 /* The dentry will be added later. */
1813 update_size
= false;
1816 btrfs_release_path(path
);
1817 ret
= insert_one_name(trans
, root
, key
->objectid
, key
->offset
,
1818 name
, name_len
, &log_key
);
1819 if (ret
&& ret
!= -ENOENT
&& ret
!= -EEXIST
)
1823 update_size
= false;
1829 * find all the names in a directory item and reconcile them into
1830 * the subvolume. Only BTRFS_DIR_ITEM_KEY types will have more than
1831 * one name in a directory item, but the same code gets used for
1832 * both directory index types
1834 static noinline
int replay_one_dir_item(struct btrfs_trans_handle
*trans
,
1835 struct btrfs_root
*root
,
1836 struct btrfs_path
*path
,
1837 struct extent_buffer
*eb
, int slot
,
1838 struct btrfs_key
*key
)
1840 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
1842 u32 item_size
= btrfs_item_size_nr(eb
, slot
);
1843 struct btrfs_dir_item
*di
;
1846 unsigned long ptr_end
;
1847 struct btrfs_path
*fixup_path
= NULL
;
1849 ptr
= btrfs_item_ptr_offset(eb
, slot
);
1850 ptr_end
= ptr
+ item_size
;
1851 while (ptr
< ptr_end
) {
1852 di
= (struct btrfs_dir_item
*)ptr
;
1853 if (verify_dir_item(fs_info
, eb
, slot
, di
))
1855 name_len
= btrfs_dir_name_len(eb
, di
);
1856 ret
= replay_one_name(trans
, root
, path
, eb
, di
, key
);
1859 ptr
= (unsigned long)(di
+ 1);
1863 * If this entry refers to a non-directory (directories can not
1864 * have a link count > 1) and it was added in the transaction
1865 * that was not committed, make sure we fixup the link count of
1866 * the inode it the entry points to. Otherwise something like
1867 * the following would result in a directory pointing to an
1868 * inode with a wrong link that does not account for this dir
1876 * ln testdir/bar testdir/bar_link
1877 * ln testdir/foo testdir/foo_link
1878 * xfs_io -c "fsync" testdir/bar
1882 * mount fs, log replay happens
1884 * File foo would remain with a link count of 1 when it has two
1885 * entries pointing to it in the directory testdir. This would
1886 * make it impossible to ever delete the parent directory has
1887 * it would result in stale dentries that can never be deleted.
1889 if (ret
== 1 && btrfs_dir_type(eb
, di
) != BTRFS_FT_DIR
) {
1890 struct btrfs_key di_key
;
1893 fixup_path
= btrfs_alloc_path();
1900 btrfs_dir_item_key_to_cpu(eb
, di
, &di_key
);
1901 ret
= link_to_fixup_dir(trans
, root
, fixup_path
,
1908 btrfs_free_path(fixup_path
);
1913 * directory replay has two parts. There are the standard directory
1914 * items in the log copied from the subvolume, and range items
1915 * created in the log while the subvolume was logged.
1917 * The range items tell us which parts of the key space the log
1918 * is authoritative for. During replay, if a key in the subvolume
1919 * directory is in a logged range item, but not actually in the log
1920 * that means it was deleted from the directory before the fsync
1921 * and should be removed.
1923 static noinline
int find_dir_range(struct btrfs_root
*root
,
1924 struct btrfs_path
*path
,
1925 u64 dirid
, int key_type
,
1926 u64
*start_ret
, u64
*end_ret
)
1928 struct btrfs_key key
;
1930 struct btrfs_dir_log_item
*item
;
1934 if (*start_ret
== (u64
)-1)
1937 key
.objectid
= dirid
;
1938 key
.type
= key_type
;
1939 key
.offset
= *start_ret
;
1941 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1945 if (path
->slots
[0] == 0)
1950 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, path
->slots
[0]);
1952 if (key
.type
!= key_type
|| key
.objectid
!= dirid
) {
1956 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
1957 struct btrfs_dir_log_item
);
1958 found_end
= btrfs_dir_log_end(path
->nodes
[0], item
);
1960 if (*start_ret
>= key
.offset
&& *start_ret
<= found_end
) {
1962 *start_ret
= key
.offset
;
1963 *end_ret
= found_end
;
1968 /* check the next slot in the tree to see if it is a valid item */
1969 nritems
= btrfs_header_nritems(path
->nodes
[0]);
1971 if (path
->slots
[0] >= nritems
) {
1972 ret
= btrfs_next_leaf(root
, path
);
1977 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, path
->slots
[0]);
1979 if (key
.type
!= key_type
|| key
.objectid
!= dirid
) {
1983 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
1984 struct btrfs_dir_log_item
);
1985 found_end
= btrfs_dir_log_end(path
->nodes
[0], item
);
1986 *start_ret
= key
.offset
;
1987 *end_ret
= found_end
;
1990 btrfs_release_path(path
);
1995 * this looks for a given directory item in the log. If the directory
1996 * item is not in the log, the item is removed and the inode it points
1999 static noinline
int check_item_in_log(struct btrfs_trans_handle
*trans
,
2000 struct btrfs_root
*root
,
2001 struct btrfs_root
*log
,
2002 struct btrfs_path
*path
,
2003 struct btrfs_path
*log_path
,
2005 struct btrfs_key
*dir_key
)
2007 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2009 struct extent_buffer
*eb
;
2012 struct btrfs_dir_item
*di
;
2013 struct btrfs_dir_item
*log_di
;
2016 unsigned long ptr_end
;
2018 struct inode
*inode
;
2019 struct btrfs_key location
;
2022 eb
= path
->nodes
[0];
2023 slot
= path
->slots
[0];
2024 item_size
= btrfs_item_size_nr(eb
, slot
);
2025 ptr
= btrfs_item_ptr_offset(eb
, slot
);
2026 ptr_end
= ptr
+ item_size
;
2027 while (ptr
< ptr_end
) {
2028 di
= (struct btrfs_dir_item
*)ptr
;
2029 if (verify_dir_item(fs_info
, eb
, slot
, di
)) {
2034 name_len
= btrfs_dir_name_len(eb
, di
);
2035 name
= kmalloc(name_len
, GFP_NOFS
);
2040 read_extent_buffer(eb
, name
, (unsigned long)(di
+ 1),
2043 if (log
&& dir_key
->type
== BTRFS_DIR_ITEM_KEY
) {
2044 log_di
= btrfs_lookup_dir_item(trans
, log
, log_path
,
2047 } else if (log
&& dir_key
->type
== BTRFS_DIR_INDEX_KEY
) {
2048 log_di
= btrfs_lookup_dir_index_item(trans
, log
,
2054 if (!log_di
|| (IS_ERR(log_di
) && PTR_ERR(log_di
) == -ENOENT
)) {
2055 btrfs_dir_item_key_to_cpu(eb
, di
, &location
);
2056 btrfs_release_path(path
);
2057 btrfs_release_path(log_path
);
2058 inode
= read_one_inode(root
, location
.objectid
);
2064 ret
= link_to_fixup_dir(trans
, root
,
2065 path
, location
.objectid
);
2073 ret
= btrfs_unlink_inode(trans
, root
, BTRFS_I(dir
),
2074 BTRFS_I(inode
), name
, name_len
);
2076 ret
= btrfs_run_delayed_items(trans
, fs_info
);
2082 /* there might still be more names under this key
2083 * check and repeat if required
2085 ret
= btrfs_search_slot(NULL
, root
, dir_key
, path
,
2091 } else if (IS_ERR(log_di
)) {
2093 return PTR_ERR(log_di
);
2095 btrfs_release_path(log_path
);
2098 ptr
= (unsigned long)(di
+ 1);
2103 btrfs_release_path(path
);
2104 btrfs_release_path(log_path
);
2108 static int replay_xattr_deletes(struct btrfs_trans_handle
*trans
,
2109 struct btrfs_root
*root
,
2110 struct btrfs_root
*log
,
2111 struct btrfs_path
*path
,
2114 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2115 struct btrfs_key search_key
;
2116 struct btrfs_path
*log_path
;
2121 log_path
= btrfs_alloc_path();
2125 search_key
.objectid
= ino
;
2126 search_key
.type
= BTRFS_XATTR_ITEM_KEY
;
2127 search_key
.offset
= 0;
2129 ret
= btrfs_search_slot(NULL
, root
, &search_key
, path
, 0, 0);
2133 nritems
= btrfs_header_nritems(path
->nodes
[0]);
2134 for (i
= path
->slots
[0]; i
< nritems
; i
++) {
2135 struct btrfs_key key
;
2136 struct btrfs_dir_item
*di
;
2137 struct btrfs_dir_item
*log_di
;
2141 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, i
);
2142 if (key
.objectid
!= ino
|| key
.type
!= BTRFS_XATTR_ITEM_KEY
) {
2147 di
= btrfs_item_ptr(path
->nodes
[0], i
, struct btrfs_dir_item
);
2148 total_size
= btrfs_item_size_nr(path
->nodes
[0], i
);
2150 while (cur
< total_size
) {
2151 u16 name_len
= btrfs_dir_name_len(path
->nodes
[0], di
);
2152 u16 data_len
= btrfs_dir_data_len(path
->nodes
[0], di
);
2153 u32 this_len
= sizeof(*di
) + name_len
+ data_len
;
2156 ret
= verify_dir_item(fs_info
, path
->nodes
[0],
2157 path
->slots
[0], di
);
2162 name
= kmalloc(name_len
, GFP_NOFS
);
2167 read_extent_buffer(path
->nodes
[0], name
,
2168 (unsigned long)(di
+ 1), name_len
);
2170 log_di
= btrfs_lookup_xattr(NULL
, log
, log_path
, ino
,
2172 btrfs_release_path(log_path
);
2174 /* Doesn't exist in log tree, so delete it. */
2175 btrfs_release_path(path
);
2176 di
= btrfs_lookup_xattr(trans
, root
, path
, ino
,
2177 name
, name_len
, -1);
2184 ret
= btrfs_delete_one_dir_name(trans
, root
,
2188 btrfs_release_path(path
);
2193 if (IS_ERR(log_di
)) {
2194 ret
= PTR_ERR(log_di
);
2198 di
= (struct btrfs_dir_item
*)((char *)di
+ this_len
);
2201 ret
= btrfs_next_leaf(root
, path
);
2207 btrfs_free_path(log_path
);
2208 btrfs_release_path(path
);
2214 * deletion replay happens before we copy any new directory items
2215 * out of the log or out of backreferences from inodes. It
2216 * scans the log to find ranges of keys that log is authoritative for,
2217 * and then scans the directory to find items in those ranges that are
2218 * not present in the log.
2220 * Anything we don't find in the log is unlinked and removed from the
2223 static noinline
int replay_dir_deletes(struct btrfs_trans_handle
*trans
,
2224 struct btrfs_root
*root
,
2225 struct btrfs_root
*log
,
2226 struct btrfs_path
*path
,
2227 u64 dirid
, int del_all
)
2231 int key_type
= BTRFS_DIR_LOG_ITEM_KEY
;
2233 struct btrfs_key dir_key
;
2234 struct btrfs_key found_key
;
2235 struct btrfs_path
*log_path
;
2238 dir_key
.objectid
= dirid
;
2239 dir_key
.type
= BTRFS_DIR_ITEM_KEY
;
2240 log_path
= btrfs_alloc_path();
2244 dir
= read_one_inode(root
, dirid
);
2245 /* it isn't an error if the inode isn't there, that can happen
2246 * because we replay the deletes before we copy in the inode item
2250 btrfs_free_path(log_path
);
2258 range_end
= (u64
)-1;
2260 ret
= find_dir_range(log
, path
, dirid
, key_type
,
2261 &range_start
, &range_end
);
2266 dir_key
.offset
= range_start
;
2269 ret
= btrfs_search_slot(NULL
, root
, &dir_key
, path
,
2274 nritems
= btrfs_header_nritems(path
->nodes
[0]);
2275 if (path
->slots
[0] >= nritems
) {
2276 ret
= btrfs_next_leaf(root
, path
);
2280 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
2282 if (found_key
.objectid
!= dirid
||
2283 found_key
.type
!= dir_key
.type
)
2286 if (found_key
.offset
> range_end
)
2289 ret
= check_item_in_log(trans
, root
, log
, path
,
2294 if (found_key
.offset
== (u64
)-1)
2296 dir_key
.offset
= found_key
.offset
+ 1;
2298 btrfs_release_path(path
);
2299 if (range_end
== (u64
)-1)
2301 range_start
= range_end
+ 1;
2306 if (key_type
== BTRFS_DIR_LOG_ITEM_KEY
) {
2307 key_type
= BTRFS_DIR_LOG_INDEX_KEY
;
2308 dir_key
.type
= BTRFS_DIR_INDEX_KEY
;
2309 btrfs_release_path(path
);
2313 btrfs_release_path(path
);
2314 btrfs_free_path(log_path
);
2320 * the process_func used to replay items from the log tree. This
2321 * gets called in two different stages. The first stage just looks
2322 * for inodes and makes sure they are all copied into the subvolume.
2324 * The second stage copies all the other item types from the log into
2325 * the subvolume. The two stage approach is slower, but gets rid of
2326 * lots of complexity around inodes referencing other inodes that exist
2327 * only in the log (references come from either directory items or inode
2330 static int replay_one_buffer(struct btrfs_root
*log
, struct extent_buffer
*eb
,
2331 struct walk_control
*wc
, u64 gen
)
2334 struct btrfs_path
*path
;
2335 struct btrfs_root
*root
= wc
->replay_dest
;
2336 struct btrfs_key key
;
2341 ret
= btrfs_read_buffer(eb
, gen
);
2345 level
= btrfs_header_level(eb
);
2350 path
= btrfs_alloc_path();
2354 nritems
= btrfs_header_nritems(eb
);
2355 for (i
= 0; i
< nritems
; i
++) {
2356 btrfs_item_key_to_cpu(eb
, &key
, i
);
2358 /* inode keys are done during the first stage */
2359 if (key
.type
== BTRFS_INODE_ITEM_KEY
&&
2360 wc
->stage
== LOG_WALK_REPLAY_INODES
) {
2361 struct btrfs_inode_item
*inode_item
;
2364 inode_item
= btrfs_item_ptr(eb
, i
,
2365 struct btrfs_inode_item
);
2366 ret
= replay_xattr_deletes(wc
->trans
, root
, log
,
2367 path
, key
.objectid
);
2370 mode
= btrfs_inode_mode(eb
, inode_item
);
2371 if (S_ISDIR(mode
)) {
2372 ret
= replay_dir_deletes(wc
->trans
,
2373 root
, log
, path
, key
.objectid
, 0);
2377 ret
= overwrite_item(wc
->trans
, root
, path
,
2382 /* for regular files, make sure corresponding
2383 * orphan item exist. extents past the new EOF
2384 * will be truncated later by orphan cleanup.
2386 if (S_ISREG(mode
)) {
2387 ret
= insert_orphan_item(wc
->trans
, root
,
2393 ret
= link_to_fixup_dir(wc
->trans
, root
,
2394 path
, key
.objectid
);
2399 if (key
.type
== BTRFS_DIR_INDEX_KEY
&&
2400 wc
->stage
== LOG_WALK_REPLAY_DIR_INDEX
) {
2401 ret
= replay_one_dir_item(wc
->trans
, root
, path
,
2407 if (wc
->stage
< LOG_WALK_REPLAY_ALL
)
2410 /* these keys are simply copied */
2411 if (key
.type
== BTRFS_XATTR_ITEM_KEY
) {
2412 ret
= overwrite_item(wc
->trans
, root
, path
,
2416 } else if (key
.type
== BTRFS_INODE_REF_KEY
||
2417 key
.type
== BTRFS_INODE_EXTREF_KEY
) {
2418 ret
= add_inode_ref(wc
->trans
, root
, log
, path
,
2420 if (ret
&& ret
!= -ENOENT
)
2423 } else if (key
.type
== BTRFS_EXTENT_DATA_KEY
) {
2424 ret
= replay_one_extent(wc
->trans
, root
, path
,
2428 } else if (key
.type
== BTRFS_DIR_ITEM_KEY
) {
2429 ret
= replay_one_dir_item(wc
->trans
, root
, path
,
2435 btrfs_free_path(path
);
2439 static noinline
int walk_down_log_tree(struct btrfs_trans_handle
*trans
,
2440 struct btrfs_root
*root
,
2441 struct btrfs_path
*path
, int *level
,
2442 struct walk_control
*wc
)
2444 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2448 struct extent_buffer
*next
;
2449 struct extent_buffer
*cur
;
2450 struct extent_buffer
*parent
;
2454 WARN_ON(*level
< 0);
2455 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2457 while (*level
> 0) {
2458 WARN_ON(*level
< 0);
2459 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2460 cur
= path
->nodes
[*level
];
2462 WARN_ON(btrfs_header_level(cur
) != *level
);
2464 if (path
->slots
[*level
] >=
2465 btrfs_header_nritems(cur
))
2468 bytenr
= btrfs_node_blockptr(cur
, path
->slots
[*level
]);
2469 ptr_gen
= btrfs_node_ptr_generation(cur
, path
->slots
[*level
]);
2470 blocksize
= fs_info
->nodesize
;
2472 parent
= path
->nodes
[*level
];
2473 root_owner
= btrfs_header_owner(parent
);
2475 next
= btrfs_find_create_tree_block(fs_info
, bytenr
);
2477 return PTR_ERR(next
);
2480 ret
= wc
->process_func(root
, next
, wc
, ptr_gen
);
2482 free_extent_buffer(next
);
2486 path
->slots
[*level
]++;
2488 ret
= btrfs_read_buffer(next
, ptr_gen
);
2490 free_extent_buffer(next
);
2495 btrfs_tree_lock(next
);
2496 btrfs_set_lock_blocking(next
);
2497 clean_tree_block(fs_info
, next
);
2498 btrfs_wait_tree_block_writeback(next
);
2499 btrfs_tree_unlock(next
);
2502 WARN_ON(root_owner
!=
2503 BTRFS_TREE_LOG_OBJECTID
);
2504 ret
= btrfs_free_and_pin_reserved_extent(
2508 free_extent_buffer(next
);
2512 free_extent_buffer(next
);
2515 ret
= btrfs_read_buffer(next
, ptr_gen
);
2517 free_extent_buffer(next
);
2521 WARN_ON(*level
<= 0);
2522 if (path
->nodes
[*level
-1])
2523 free_extent_buffer(path
->nodes
[*level
-1]);
2524 path
->nodes
[*level
-1] = next
;
2525 *level
= btrfs_header_level(next
);
2526 path
->slots
[*level
] = 0;
2529 WARN_ON(*level
< 0);
2530 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2532 path
->slots
[*level
] = btrfs_header_nritems(path
->nodes
[*level
]);
2538 static noinline
int walk_up_log_tree(struct btrfs_trans_handle
*trans
,
2539 struct btrfs_root
*root
,
2540 struct btrfs_path
*path
, int *level
,
2541 struct walk_control
*wc
)
2543 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2549 for (i
= *level
; i
< BTRFS_MAX_LEVEL
- 1 && path
->nodes
[i
]; i
++) {
2550 slot
= path
->slots
[i
];
2551 if (slot
+ 1 < btrfs_header_nritems(path
->nodes
[i
])) {
2554 WARN_ON(*level
== 0);
2557 struct extent_buffer
*parent
;
2558 if (path
->nodes
[*level
] == root
->node
)
2559 parent
= path
->nodes
[*level
];
2561 parent
= path
->nodes
[*level
+ 1];
2563 root_owner
= btrfs_header_owner(parent
);
2564 ret
= wc
->process_func(root
, path
->nodes
[*level
], wc
,
2565 btrfs_header_generation(path
->nodes
[*level
]));
2570 struct extent_buffer
*next
;
2572 next
= path
->nodes
[*level
];
2575 btrfs_tree_lock(next
);
2576 btrfs_set_lock_blocking(next
);
2577 clean_tree_block(fs_info
, next
);
2578 btrfs_wait_tree_block_writeback(next
);
2579 btrfs_tree_unlock(next
);
2582 WARN_ON(root_owner
!= BTRFS_TREE_LOG_OBJECTID
);
2583 ret
= btrfs_free_and_pin_reserved_extent(
2585 path
->nodes
[*level
]->start
,
2586 path
->nodes
[*level
]->len
);
2590 free_extent_buffer(path
->nodes
[*level
]);
2591 path
->nodes
[*level
] = NULL
;
2599 * drop the reference count on the tree rooted at 'snap'. This traverses
2600 * the tree freeing any blocks that have a ref count of zero after being
2603 static int walk_log_tree(struct btrfs_trans_handle
*trans
,
2604 struct btrfs_root
*log
, struct walk_control
*wc
)
2606 struct btrfs_fs_info
*fs_info
= log
->fs_info
;
2610 struct btrfs_path
*path
;
2613 path
= btrfs_alloc_path();
2617 level
= btrfs_header_level(log
->node
);
2619 path
->nodes
[level
] = log
->node
;
2620 extent_buffer_get(log
->node
);
2621 path
->slots
[level
] = 0;
2624 wret
= walk_down_log_tree(trans
, log
, path
, &level
, wc
);
2632 wret
= walk_up_log_tree(trans
, log
, path
, &level
, wc
);
2641 /* was the root node processed? if not, catch it here */
2642 if (path
->nodes
[orig_level
]) {
2643 ret
= wc
->process_func(log
, path
->nodes
[orig_level
], wc
,
2644 btrfs_header_generation(path
->nodes
[orig_level
]));
2648 struct extent_buffer
*next
;
2650 next
= path
->nodes
[orig_level
];
2653 btrfs_tree_lock(next
);
2654 btrfs_set_lock_blocking(next
);
2655 clean_tree_block(fs_info
, next
);
2656 btrfs_wait_tree_block_writeback(next
);
2657 btrfs_tree_unlock(next
);
2660 WARN_ON(log
->root_key
.objectid
!=
2661 BTRFS_TREE_LOG_OBJECTID
);
2662 ret
= btrfs_free_and_pin_reserved_extent(fs_info
,
2663 next
->start
, next
->len
);
2670 btrfs_free_path(path
);
2675 * helper function to update the item for a given subvolumes log root
2676 * in the tree of log roots
2678 static int update_log_root(struct btrfs_trans_handle
*trans
,
2679 struct btrfs_root
*log
)
2681 struct btrfs_fs_info
*fs_info
= log
->fs_info
;
2684 if (log
->log_transid
== 1) {
2685 /* insert root item on the first sync */
2686 ret
= btrfs_insert_root(trans
, fs_info
->log_root_tree
,
2687 &log
->root_key
, &log
->root_item
);
2689 ret
= btrfs_update_root(trans
, fs_info
->log_root_tree
,
2690 &log
->root_key
, &log
->root_item
);
2695 static void wait_log_commit(struct btrfs_root
*root
, int transid
)
2698 int index
= transid
% 2;
2701 * we only allow two pending log transactions at a time,
2702 * so we know that if ours is more than 2 older than the
2703 * current transaction, we're done
2706 prepare_to_wait(&root
->log_commit_wait
[index
],
2707 &wait
, TASK_UNINTERRUPTIBLE
);
2708 mutex_unlock(&root
->log_mutex
);
2710 if (root
->log_transid_committed
< transid
&&
2711 atomic_read(&root
->log_commit
[index
]))
2714 finish_wait(&root
->log_commit_wait
[index
], &wait
);
2715 mutex_lock(&root
->log_mutex
);
2716 } while (root
->log_transid_committed
< transid
&&
2717 atomic_read(&root
->log_commit
[index
]));
2720 static void wait_for_writer(struct btrfs_root
*root
)
2724 while (atomic_read(&root
->log_writers
)) {
2725 prepare_to_wait(&root
->log_writer_wait
,
2726 &wait
, TASK_UNINTERRUPTIBLE
);
2727 mutex_unlock(&root
->log_mutex
);
2728 if (atomic_read(&root
->log_writers
))
2730 finish_wait(&root
->log_writer_wait
, &wait
);
2731 mutex_lock(&root
->log_mutex
);
2735 static inline void btrfs_remove_log_ctx(struct btrfs_root
*root
,
2736 struct btrfs_log_ctx
*ctx
)
2741 mutex_lock(&root
->log_mutex
);
2742 list_del_init(&ctx
->list
);
2743 mutex_unlock(&root
->log_mutex
);
2747 * Invoked in log mutex context, or be sure there is no other task which
2748 * can access the list.
2750 static inline void btrfs_remove_all_log_ctxs(struct btrfs_root
*root
,
2751 int index
, int error
)
2753 struct btrfs_log_ctx
*ctx
;
2754 struct btrfs_log_ctx
*safe
;
2756 list_for_each_entry_safe(ctx
, safe
, &root
->log_ctxs
[index
], list
) {
2757 list_del_init(&ctx
->list
);
2758 ctx
->log_ret
= error
;
2761 INIT_LIST_HEAD(&root
->log_ctxs
[index
]);
2765 * btrfs_sync_log does sends a given tree log down to the disk and
2766 * updates the super blocks to record it. When this call is done,
2767 * you know that any inodes previously logged are safely on disk only
2770 * Any other return value means you need to call btrfs_commit_transaction.
2771 * Some of the edge cases for fsyncing directories that have had unlinks
2772 * or renames done in the past mean that sometimes the only safe
2773 * fsync is to commit the whole FS. When btrfs_sync_log returns -EAGAIN,
2774 * that has happened.
2776 int btrfs_sync_log(struct btrfs_trans_handle
*trans
,
2777 struct btrfs_root
*root
, struct btrfs_log_ctx
*ctx
)
2783 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2784 struct btrfs_root
*log
= root
->log_root
;
2785 struct btrfs_root
*log_root_tree
= fs_info
->log_root_tree
;
2786 int log_transid
= 0;
2787 struct btrfs_log_ctx root_log_ctx
;
2788 struct blk_plug plug
;
2790 mutex_lock(&root
->log_mutex
);
2791 log_transid
= ctx
->log_transid
;
2792 if (root
->log_transid_committed
>= log_transid
) {
2793 mutex_unlock(&root
->log_mutex
);
2794 return ctx
->log_ret
;
2797 index1
= log_transid
% 2;
2798 if (atomic_read(&root
->log_commit
[index1
])) {
2799 wait_log_commit(root
, log_transid
);
2800 mutex_unlock(&root
->log_mutex
);
2801 return ctx
->log_ret
;
2803 ASSERT(log_transid
== root
->log_transid
);
2804 atomic_set(&root
->log_commit
[index1
], 1);
2806 /* wait for previous tree log sync to complete */
2807 if (atomic_read(&root
->log_commit
[(index1
+ 1) % 2]))
2808 wait_log_commit(root
, log_transid
- 1);
2811 int batch
= atomic_read(&root
->log_batch
);
2812 /* when we're on an ssd, just kick the log commit out */
2813 if (!btrfs_test_opt(fs_info
, SSD
) &&
2814 test_bit(BTRFS_ROOT_MULTI_LOG_TASKS
, &root
->state
)) {
2815 mutex_unlock(&root
->log_mutex
);
2816 schedule_timeout_uninterruptible(1);
2817 mutex_lock(&root
->log_mutex
);
2819 wait_for_writer(root
);
2820 if (batch
== atomic_read(&root
->log_batch
))
2824 /* bail out if we need to do a full commit */
2825 if (btrfs_need_log_full_commit(fs_info
, trans
)) {
2827 btrfs_free_logged_extents(log
, log_transid
);
2828 mutex_unlock(&root
->log_mutex
);
2832 if (log_transid
% 2 == 0)
2833 mark
= EXTENT_DIRTY
;
2837 /* we start IO on all the marked extents here, but we don't actually
2838 * wait for them until later.
2840 blk_start_plug(&plug
);
2841 ret
= btrfs_write_marked_extents(fs_info
, &log
->dirty_log_pages
, mark
);
2843 blk_finish_plug(&plug
);
2844 btrfs_abort_transaction(trans
, ret
);
2845 btrfs_free_logged_extents(log
, log_transid
);
2846 btrfs_set_log_full_commit(fs_info
, trans
);
2847 mutex_unlock(&root
->log_mutex
);
2851 btrfs_set_root_node(&log
->root_item
, log
->node
);
2853 root
->log_transid
++;
2854 log
->log_transid
= root
->log_transid
;
2855 root
->log_start_pid
= 0;
2857 * IO has been started, blocks of the log tree have WRITTEN flag set
2858 * in their headers. new modifications of the log will be written to
2859 * new positions. so it's safe to allow log writers to go in.
2861 mutex_unlock(&root
->log_mutex
);
2863 btrfs_init_log_ctx(&root_log_ctx
, NULL
);
2865 mutex_lock(&log_root_tree
->log_mutex
);
2866 atomic_inc(&log_root_tree
->log_batch
);
2867 atomic_inc(&log_root_tree
->log_writers
);
2869 index2
= log_root_tree
->log_transid
% 2;
2870 list_add_tail(&root_log_ctx
.list
, &log_root_tree
->log_ctxs
[index2
]);
2871 root_log_ctx
.log_transid
= log_root_tree
->log_transid
;
2873 mutex_unlock(&log_root_tree
->log_mutex
);
2875 ret
= update_log_root(trans
, log
);
2877 mutex_lock(&log_root_tree
->log_mutex
);
2878 if (atomic_dec_and_test(&log_root_tree
->log_writers
)) {
2880 * Implicit memory barrier after atomic_dec_and_test
2882 if (waitqueue_active(&log_root_tree
->log_writer_wait
))
2883 wake_up(&log_root_tree
->log_writer_wait
);
2887 if (!list_empty(&root_log_ctx
.list
))
2888 list_del_init(&root_log_ctx
.list
);
2890 blk_finish_plug(&plug
);
2891 btrfs_set_log_full_commit(fs_info
, trans
);
2893 if (ret
!= -ENOSPC
) {
2894 btrfs_abort_transaction(trans
, ret
);
2895 mutex_unlock(&log_root_tree
->log_mutex
);
2898 btrfs_wait_tree_log_extents(log
, mark
);
2899 btrfs_free_logged_extents(log
, log_transid
);
2900 mutex_unlock(&log_root_tree
->log_mutex
);
2905 if (log_root_tree
->log_transid_committed
>= root_log_ctx
.log_transid
) {
2906 blk_finish_plug(&plug
);
2907 list_del_init(&root_log_ctx
.list
);
2908 mutex_unlock(&log_root_tree
->log_mutex
);
2909 ret
= root_log_ctx
.log_ret
;
2913 index2
= root_log_ctx
.log_transid
% 2;
2914 if (atomic_read(&log_root_tree
->log_commit
[index2
])) {
2915 blk_finish_plug(&plug
);
2916 ret
= btrfs_wait_tree_log_extents(log
, mark
);
2917 btrfs_wait_logged_extents(trans
, log
, log_transid
);
2918 wait_log_commit(log_root_tree
,
2919 root_log_ctx
.log_transid
);
2920 mutex_unlock(&log_root_tree
->log_mutex
);
2922 ret
= root_log_ctx
.log_ret
;
2925 ASSERT(root_log_ctx
.log_transid
== log_root_tree
->log_transid
);
2926 atomic_set(&log_root_tree
->log_commit
[index2
], 1);
2928 if (atomic_read(&log_root_tree
->log_commit
[(index2
+ 1) % 2])) {
2929 wait_log_commit(log_root_tree
,
2930 root_log_ctx
.log_transid
- 1);
2933 wait_for_writer(log_root_tree
);
2936 * now that we've moved on to the tree of log tree roots,
2937 * check the full commit flag again
2939 if (btrfs_need_log_full_commit(fs_info
, trans
)) {
2940 blk_finish_plug(&plug
);
2941 btrfs_wait_tree_log_extents(log
, mark
);
2942 btrfs_free_logged_extents(log
, log_transid
);
2943 mutex_unlock(&log_root_tree
->log_mutex
);
2945 goto out_wake_log_root
;
2948 ret
= btrfs_write_marked_extents(fs_info
,
2949 &log_root_tree
->dirty_log_pages
,
2950 EXTENT_DIRTY
| EXTENT_NEW
);
2951 blk_finish_plug(&plug
);
2953 btrfs_set_log_full_commit(fs_info
, trans
);
2954 btrfs_abort_transaction(trans
, ret
);
2955 btrfs_free_logged_extents(log
, log_transid
);
2956 mutex_unlock(&log_root_tree
->log_mutex
);
2957 goto out_wake_log_root
;
2959 ret
= btrfs_wait_tree_log_extents(log
, mark
);
2961 ret
= btrfs_wait_tree_log_extents(log_root_tree
,
2962 EXTENT_NEW
| EXTENT_DIRTY
);
2964 btrfs_set_log_full_commit(fs_info
, trans
);
2965 btrfs_free_logged_extents(log
, log_transid
);
2966 mutex_unlock(&log_root_tree
->log_mutex
);
2967 goto out_wake_log_root
;
2969 btrfs_wait_logged_extents(trans
, log
, log_transid
);
2971 btrfs_set_super_log_root(fs_info
->super_for_commit
,
2972 log_root_tree
->node
->start
);
2973 btrfs_set_super_log_root_level(fs_info
->super_for_commit
,
2974 btrfs_header_level(log_root_tree
->node
));
2976 log_root_tree
->log_transid
++;
2977 mutex_unlock(&log_root_tree
->log_mutex
);
2980 * nobody else is going to jump in and write the the ctree
2981 * super here because the log_commit atomic below is protecting
2982 * us. We must be called with a transaction handle pinning
2983 * the running transaction open, so a full commit can't hop
2984 * in and cause problems either.
2986 ret
= write_all_supers(fs_info
, 1);
2988 btrfs_set_log_full_commit(fs_info
, trans
);
2989 btrfs_abort_transaction(trans
, ret
);
2990 goto out_wake_log_root
;
2993 mutex_lock(&root
->log_mutex
);
2994 if (root
->last_log_commit
< log_transid
)
2995 root
->last_log_commit
= log_transid
;
2996 mutex_unlock(&root
->log_mutex
);
2999 mutex_lock(&log_root_tree
->log_mutex
);
3000 btrfs_remove_all_log_ctxs(log_root_tree
, index2
, ret
);
3002 log_root_tree
->log_transid_committed
++;
3003 atomic_set(&log_root_tree
->log_commit
[index2
], 0);
3004 mutex_unlock(&log_root_tree
->log_mutex
);
3007 * The barrier before waitqueue_active is implied by mutex_unlock
3009 if (waitqueue_active(&log_root_tree
->log_commit_wait
[index2
]))
3010 wake_up(&log_root_tree
->log_commit_wait
[index2
]);
3012 mutex_lock(&root
->log_mutex
);
3013 btrfs_remove_all_log_ctxs(root
, index1
, ret
);
3014 root
->log_transid_committed
++;
3015 atomic_set(&root
->log_commit
[index1
], 0);
3016 mutex_unlock(&root
->log_mutex
);
3019 * The barrier before waitqueue_active is implied by mutex_unlock
3021 if (waitqueue_active(&root
->log_commit_wait
[index1
]))
3022 wake_up(&root
->log_commit_wait
[index1
]);
3026 static void free_log_tree(struct btrfs_trans_handle
*trans
,
3027 struct btrfs_root
*log
)
3032 struct walk_control wc
= {
3034 .process_func
= process_one_buffer
3037 ret
= walk_log_tree(trans
, log
, &wc
);
3038 /* I don't think this can happen but just in case */
3040 btrfs_abort_transaction(trans
, ret
);
3043 ret
= find_first_extent_bit(&log
->dirty_log_pages
,
3044 0, &start
, &end
, EXTENT_DIRTY
| EXTENT_NEW
,
3049 clear_extent_bits(&log
->dirty_log_pages
, start
, end
,
3050 EXTENT_DIRTY
| EXTENT_NEW
);
3054 * We may have short-circuited the log tree with the full commit logic
3055 * and left ordered extents on our list, so clear these out to keep us
3056 * from leaking inodes and memory.
3058 btrfs_free_logged_extents(log
, 0);
3059 btrfs_free_logged_extents(log
, 1);
3061 free_extent_buffer(log
->node
);
3066 * free all the extents used by the tree log. This should be called
3067 * at commit time of the full transaction
3069 int btrfs_free_log(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
)
3071 if (root
->log_root
) {
3072 free_log_tree(trans
, root
->log_root
);
3073 root
->log_root
= NULL
;
3078 int btrfs_free_log_root_tree(struct btrfs_trans_handle
*trans
,
3079 struct btrfs_fs_info
*fs_info
)
3081 if (fs_info
->log_root_tree
) {
3082 free_log_tree(trans
, fs_info
->log_root_tree
);
3083 fs_info
->log_root_tree
= NULL
;
3089 * If both a file and directory are logged, and unlinks or renames are
3090 * mixed in, we have a few interesting corners:
3092 * create file X in dir Y
3093 * link file X to X.link in dir Y
3095 * unlink file X but leave X.link
3098 * After a crash we would expect only X.link to exist. But file X
3099 * didn't get fsync'd again so the log has back refs for X and X.link.
3101 * We solve this by removing directory entries and inode backrefs from the
3102 * log when a file that was logged in the current transaction is
3103 * unlinked. Any later fsync will include the updated log entries, and
3104 * we'll be able to reconstruct the proper directory items from backrefs.
3106 * This optimizations allows us to avoid relogging the entire inode
3107 * or the entire directory.
3109 int btrfs_del_dir_entries_in_log(struct btrfs_trans_handle
*trans
,
3110 struct btrfs_root
*root
,
3111 const char *name
, int name_len
,
3112 struct btrfs_inode
*dir
, u64 index
)
3114 struct btrfs_root
*log
;
3115 struct btrfs_dir_item
*di
;
3116 struct btrfs_path
*path
;
3120 u64 dir_ino
= btrfs_ino(dir
);
3122 if (dir
->logged_trans
< trans
->transid
)
3125 ret
= join_running_log_trans(root
);
3129 mutex_lock(&dir
->log_mutex
);
3131 log
= root
->log_root
;
3132 path
= btrfs_alloc_path();
3138 di
= btrfs_lookup_dir_item(trans
, log
, path
, dir_ino
,
3139 name
, name_len
, -1);
3145 ret
= btrfs_delete_one_dir_name(trans
, log
, path
, di
);
3146 bytes_del
+= name_len
;
3152 btrfs_release_path(path
);
3153 di
= btrfs_lookup_dir_index_item(trans
, log
, path
, dir_ino
,
3154 index
, name
, name_len
, -1);
3160 ret
= btrfs_delete_one_dir_name(trans
, log
, path
, di
);
3161 bytes_del
+= name_len
;
3168 /* update the directory size in the log to reflect the names
3172 struct btrfs_key key
;
3174 key
.objectid
= dir_ino
;
3176 key
.type
= BTRFS_INODE_ITEM_KEY
;
3177 btrfs_release_path(path
);
3179 ret
= btrfs_search_slot(trans
, log
, &key
, path
, 0, 1);
3185 struct btrfs_inode_item
*item
;
3188 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
3189 struct btrfs_inode_item
);
3190 i_size
= btrfs_inode_size(path
->nodes
[0], item
);
3191 if (i_size
> bytes_del
)
3192 i_size
-= bytes_del
;
3195 btrfs_set_inode_size(path
->nodes
[0], item
, i_size
);
3196 btrfs_mark_buffer_dirty(path
->nodes
[0]);
3199 btrfs_release_path(path
);
3202 btrfs_free_path(path
);
3204 mutex_unlock(&dir
->log_mutex
);
3205 if (ret
== -ENOSPC
) {
3206 btrfs_set_log_full_commit(root
->fs_info
, trans
);
3209 btrfs_abort_transaction(trans
, ret
);
3211 btrfs_end_log_trans(root
);
3216 /* see comments for btrfs_del_dir_entries_in_log */
3217 int btrfs_del_inode_ref_in_log(struct btrfs_trans_handle
*trans
,
3218 struct btrfs_root
*root
,
3219 const char *name
, int name_len
,
3220 struct btrfs_inode
*inode
, u64 dirid
)
3222 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3223 struct btrfs_root
*log
;
3227 if (inode
->logged_trans
< trans
->transid
)
3230 ret
= join_running_log_trans(root
);
3233 log
= root
->log_root
;
3234 mutex_lock(&inode
->log_mutex
);
3236 ret
= btrfs_del_inode_ref(trans
, log
, name
, name_len
, btrfs_ino(inode
),
3238 mutex_unlock(&inode
->log_mutex
);
3239 if (ret
== -ENOSPC
) {
3240 btrfs_set_log_full_commit(fs_info
, trans
);
3242 } else if (ret
< 0 && ret
!= -ENOENT
)
3243 btrfs_abort_transaction(trans
, ret
);
3244 btrfs_end_log_trans(root
);
3250 * creates a range item in the log for 'dirid'. first_offset and
3251 * last_offset tell us which parts of the key space the log should
3252 * be considered authoritative for.
3254 static noinline
int insert_dir_log_key(struct btrfs_trans_handle
*trans
,
3255 struct btrfs_root
*log
,
3256 struct btrfs_path
*path
,
3257 int key_type
, u64 dirid
,
3258 u64 first_offset
, u64 last_offset
)
3261 struct btrfs_key key
;
3262 struct btrfs_dir_log_item
*item
;
3264 key
.objectid
= dirid
;
3265 key
.offset
= first_offset
;
3266 if (key_type
== BTRFS_DIR_ITEM_KEY
)
3267 key
.type
= BTRFS_DIR_LOG_ITEM_KEY
;
3269 key
.type
= BTRFS_DIR_LOG_INDEX_KEY
;
3270 ret
= btrfs_insert_empty_item(trans
, log
, path
, &key
, sizeof(*item
));
3274 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
3275 struct btrfs_dir_log_item
);
3276 btrfs_set_dir_log_end(path
->nodes
[0], item
, last_offset
);
3277 btrfs_mark_buffer_dirty(path
->nodes
[0]);
3278 btrfs_release_path(path
);
3283 * log all the items included in the current transaction for a given
3284 * directory. This also creates the range items in the log tree required
3285 * to replay anything deleted before the fsync
3287 static noinline
int log_dir_items(struct btrfs_trans_handle
*trans
,
3288 struct btrfs_root
*root
, struct btrfs_inode
*inode
,
3289 struct btrfs_path
*path
,
3290 struct btrfs_path
*dst_path
, int key_type
,
3291 struct btrfs_log_ctx
*ctx
,
3292 u64 min_offset
, u64
*last_offset_ret
)
3294 struct btrfs_key min_key
;
3295 struct btrfs_root
*log
= root
->log_root
;
3296 struct extent_buffer
*src
;
3301 u64 first_offset
= min_offset
;
3302 u64 last_offset
= (u64
)-1;
3303 u64 ino
= btrfs_ino(inode
);
3305 log
= root
->log_root
;
3307 min_key
.objectid
= ino
;
3308 min_key
.type
= key_type
;
3309 min_key
.offset
= min_offset
;
3311 ret
= btrfs_search_forward(root
, &min_key
, path
, trans
->transid
);
3314 * we didn't find anything from this transaction, see if there
3315 * is anything at all
3317 if (ret
!= 0 || min_key
.objectid
!= ino
|| min_key
.type
!= key_type
) {
3318 min_key
.objectid
= ino
;
3319 min_key
.type
= key_type
;
3320 min_key
.offset
= (u64
)-1;
3321 btrfs_release_path(path
);
3322 ret
= btrfs_search_slot(NULL
, root
, &min_key
, path
, 0, 0);
3324 btrfs_release_path(path
);
3327 ret
= btrfs_previous_item(root
, path
, ino
, key_type
);
3329 /* if ret == 0 there are items for this type,
3330 * create a range to tell us the last key of this type.
3331 * otherwise, there are no items in this directory after
3332 * *min_offset, and we create a range to indicate that.
3335 struct btrfs_key tmp
;
3336 btrfs_item_key_to_cpu(path
->nodes
[0], &tmp
,
3338 if (key_type
== tmp
.type
)
3339 first_offset
= max(min_offset
, tmp
.offset
) + 1;
3344 /* go backward to find any previous key */
3345 ret
= btrfs_previous_item(root
, path
, ino
, key_type
);
3347 struct btrfs_key tmp
;
3348 btrfs_item_key_to_cpu(path
->nodes
[0], &tmp
, path
->slots
[0]);
3349 if (key_type
== tmp
.type
) {
3350 first_offset
= tmp
.offset
;
3351 ret
= overwrite_item(trans
, log
, dst_path
,
3352 path
->nodes
[0], path
->slots
[0],
3360 btrfs_release_path(path
);
3362 /* find the first key from this transaction again */
3363 ret
= btrfs_search_slot(NULL
, root
, &min_key
, path
, 0, 0);
3364 if (WARN_ON(ret
!= 0))
3368 * we have a block from this transaction, log every item in it
3369 * from our directory
3372 struct btrfs_key tmp
;
3373 src
= path
->nodes
[0];
3374 nritems
= btrfs_header_nritems(src
);
3375 for (i
= path
->slots
[0]; i
< nritems
; i
++) {
3376 struct btrfs_dir_item
*di
;
3378 btrfs_item_key_to_cpu(src
, &min_key
, i
);
3380 if (min_key
.objectid
!= ino
|| min_key
.type
!= key_type
)
3382 ret
= overwrite_item(trans
, log
, dst_path
, src
, i
,
3390 * We must make sure that when we log a directory entry,
3391 * the corresponding inode, after log replay, has a
3392 * matching link count. For example:
3398 * xfs_io -c "fsync" mydir
3400 * <mount fs and log replay>
3402 * Would result in a fsync log that when replayed, our
3403 * file inode would have a link count of 1, but we get
3404 * two directory entries pointing to the same inode.
3405 * After removing one of the names, it would not be
3406 * possible to remove the other name, which resulted
3407 * always in stale file handle errors, and would not
3408 * be possible to rmdir the parent directory, since
3409 * its i_size could never decrement to the value
3410 * BTRFS_EMPTY_DIR_SIZE, resulting in -ENOTEMPTY errors.
3412 di
= btrfs_item_ptr(src
, i
, struct btrfs_dir_item
);
3413 btrfs_dir_item_key_to_cpu(src
, di
, &tmp
);
3415 (btrfs_dir_transid(src
, di
) == trans
->transid
||
3416 btrfs_dir_type(src
, di
) == BTRFS_FT_DIR
) &&
3417 tmp
.type
!= BTRFS_ROOT_ITEM_KEY
)
3418 ctx
->log_new_dentries
= true;
3420 path
->slots
[0] = nritems
;
3423 * look ahead to the next item and see if it is also
3424 * from this directory and from this transaction
3426 ret
= btrfs_next_leaf(root
, path
);
3428 last_offset
= (u64
)-1;
3431 btrfs_item_key_to_cpu(path
->nodes
[0], &tmp
, path
->slots
[0]);
3432 if (tmp
.objectid
!= ino
|| tmp
.type
!= key_type
) {
3433 last_offset
= (u64
)-1;
3436 if (btrfs_header_generation(path
->nodes
[0]) != trans
->transid
) {
3437 ret
= overwrite_item(trans
, log
, dst_path
,
3438 path
->nodes
[0], path
->slots
[0],
3443 last_offset
= tmp
.offset
;
3448 btrfs_release_path(path
);
3449 btrfs_release_path(dst_path
);
3452 *last_offset_ret
= last_offset
;
3454 * insert the log range keys to indicate where the log
3457 ret
= insert_dir_log_key(trans
, log
, path
, key_type
,
3458 ino
, first_offset
, last_offset
);
3466 * logging directories is very similar to logging inodes, We find all the items
3467 * from the current transaction and write them to the log.
3469 * The recovery code scans the directory in the subvolume, and if it finds a
3470 * key in the range logged that is not present in the log tree, then it means
3471 * that dir entry was unlinked during the transaction.
3473 * In order for that scan to work, we must include one key smaller than
3474 * the smallest logged by this transaction and one key larger than the largest
3475 * key logged by this transaction.
3477 static noinline
int log_directory_changes(struct btrfs_trans_handle
*trans
,
3478 struct btrfs_root
*root
, struct btrfs_inode
*inode
,
3479 struct btrfs_path
*path
,
3480 struct btrfs_path
*dst_path
,
3481 struct btrfs_log_ctx
*ctx
)
3486 int key_type
= BTRFS_DIR_ITEM_KEY
;
3492 ret
= log_dir_items(trans
, root
, inode
, path
, dst_path
, key_type
,
3493 ctx
, min_key
, &max_key
);
3496 if (max_key
== (u64
)-1)
3498 min_key
= max_key
+ 1;
3501 if (key_type
== BTRFS_DIR_ITEM_KEY
) {
3502 key_type
= BTRFS_DIR_INDEX_KEY
;
3509 * a helper function to drop items from the log before we relog an
3510 * inode. max_key_type indicates the highest item type to remove.
3511 * This cannot be run for file data extents because it does not
3512 * free the extents they point to.
3514 static int drop_objectid_items(struct btrfs_trans_handle
*trans
,
3515 struct btrfs_root
*log
,
3516 struct btrfs_path
*path
,
3517 u64 objectid
, int max_key_type
)
3520 struct btrfs_key key
;
3521 struct btrfs_key found_key
;
3524 key
.objectid
= objectid
;
3525 key
.type
= max_key_type
;
3526 key
.offset
= (u64
)-1;
3529 ret
= btrfs_search_slot(trans
, log
, &key
, path
, -1, 1);
3530 BUG_ON(ret
== 0); /* Logic error */
3534 if (path
->slots
[0] == 0)
3538 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
3541 if (found_key
.objectid
!= objectid
)
3544 found_key
.offset
= 0;
3546 ret
= btrfs_bin_search(path
->nodes
[0], &found_key
, 0,
3549 ret
= btrfs_del_items(trans
, log
, path
, start_slot
,
3550 path
->slots
[0] - start_slot
+ 1);
3552 * If start slot isn't 0 then we don't need to re-search, we've
3553 * found the last guy with the objectid in this tree.
3555 if (ret
|| start_slot
!= 0)
3557 btrfs_release_path(path
);
3559 btrfs_release_path(path
);
3565 static void fill_inode_item(struct btrfs_trans_handle
*trans
,
3566 struct extent_buffer
*leaf
,
3567 struct btrfs_inode_item
*item
,
3568 struct inode
*inode
, int log_inode_only
,
3571 struct btrfs_map_token token
;
3573 btrfs_init_map_token(&token
);
3575 if (log_inode_only
) {
3576 /* set the generation to zero so the recover code
3577 * can tell the difference between an logging
3578 * just to say 'this inode exists' and a logging
3579 * to say 'update this inode with these values'
3581 btrfs_set_token_inode_generation(leaf
, item
, 0, &token
);
3582 btrfs_set_token_inode_size(leaf
, item
, logged_isize
, &token
);
3584 btrfs_set_token_inode_generation(leaf
, item
,
3585 BTRFS_I(inode
)->generation
,
3587 btrfs_set_token_inode_size(leaf
, item
, inode
->i_size
, &token
);
3590 btrfs_set_token_inode_uid(leaf
, item
, i_uid_read(inode
), &token
);
3591 btrfs_set_token_inode_gid(leaf
, item
, i_gid_read(inode
), &token
);
3592 btrfs_set_token_inode_mode(leaf
, item
, inode
->i_mode
, &token
);
3593 btrfs_set_token_inode_nlink(leaf
, item
, inode
->i_nlink
, &token
);
3595 btrfs_set_token_timespec_sec(leaf
, &item
->atime
,
3596 inode
->i_atime
.tv_sec
, &token
);
3597 btrfs_set_token_timespec_nsec(leaf
, &item
->atime
,
3598 inode
->i_atime
.tv_nsec
, &token
);
3600 btrfs_set_token_timespec_sec(leaf
, &item
->mtime
,
3601 inode
->i_mtime
.tv_sec
, &token
);
3602 btrfs_set_token_timespec_nsec(leaf
, &item
->mtime
,
3603 inode
->i_mtime
.tv_nsec
, &token
);
3605 btrfs_set_token_timespec_sec(leaf
, &item
->ctime
,
3606 inode
->i_ctime
.tv_sec
, &token
);
3607 btrfs_set_token_timespec_nsec(leaf
, &item
->ctime
,
3608 inode
->i_ctime
.tv_nsec
, &token
);
3610 btrfs_set_token_inode_nbytes(leaf
, item
, inode_get_bytes(inode
),
3613 btrfs_set_token_inode_sequence(leaf
, item
, inode
->i_version
, &token
);
3614 btrfs_set_token_inode_transid(leaf
, item
, trans
->transid
, &token
);
3615 btrfs_set_token_inode_rdev(leaf
, item
, inode
->i_rdev
, &token
);
3616 btrfs_set_token_inode_flags(leaf
, item
, BTRFS_I(inode
)->flags
, &token
);
3617 btrfs_set_token_inode_block_group(leaf
, item
, 0, &token
);
3620 static int log_inode_item(struct btrfs_trans_handle
*trans
,
3621 struct btrfs_root
*log
, struct btrfs_path
*path
,
3622 struct btrfs_inode
*inode
)
3624 struct btrfs_inode_item
*inode_item
;
3627 ret
= btrfs_insert_empty_item(trans
, log
, path
,
3628 &inode
->location
, sizeof(*inode_item
));
3629 if (ret
&& ret
!= -EEXIST
)
3631 inode_item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
3632 struct btrfs_inode_item
);
3633 fill_inode_item(trans
, path
->nodes
[0], inode_item
, &inode
->vfs_inode
,
3635 btrfs_release_path(path
);
3639 static noinline
int copy_items(struct btrfs_trans_handle
*trans
,
3640 struct btrfs_inode
*inode
,
3641 struct btrfs_path
*dst_path
,
3642 struct btrfs_path
*src_path
, u64
*last_extent
,
3643 int start_slot
, int nr
, int inode_only
,
3646 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
3647 unsigned long src_offset
;
3648 unsigned long dst_offset
;
3649 struct btrfs_root
*log
= inode
->root
->log_root
;
3650 struct btrfs_file_extent_item
*extent
;
3651 struct btrfs_inode_item
*inode_item
;
3652 struct extent_buffer
*src
= src_path
->nodes
[0];
3653 struct btrfs_key first_key
, last_key
, key
;
3655 struct btrfs_key
*ins_keys
;
3659 struct list_head ordered_sums
;
3660 int skip_csum
= inode
->flags
& BTRFS_INODE_NODATASUM
;
3661 bool has_extents
= false;
3662 bool need_find_last_extent
= true;
3665 INIT_LIST_HEAD(&ordered_sums
);
3667 ins_data
= kmalloc(nr
* sizeof(struct btrfs_key
) +
3668 nr
* sizeof(u32
), GFP_NOFS
);
3672 first_key
.objectid
= (u64
)-1;
3674 ins_sizes
= (u32
*)ins_data
;
3675 ins_keys
= (struct btrfs_key
*)(ins_data
+ nr
* sizeof(u32
));
3677 for (i
= 0; i
< nr
; i
++) {
3678 ins_sizes
[i
] = btrfs_item_size_nr(src
, i
+ start_slot
);
3679 btrfs_item_key_to_cpu(src
, ins_keys
+ i
, i
+ start_slot
);
3681 ret
= btrfs_insert_empty_items(trans
, log
, dst_path
,
3682 ins_keys
, ins_sizes
, nr
);
3688 for (i
= 0; i
< nr
; i
++, dst_path
->slots
[0]++) {
3689 dst_offset
= btrfs_item_ptr_offset(dst_path
->nodes
[0],
3690 dst_path
->slots
[0]);
3692 src_offset
= btrfs_item_ptr_offset(src
, start_slot
+ i
);
3694 if ((i
== (nr
- 1)))
3695 last_key
= ins_keys
[i
];
3697 if (ins_keys
[i
].type
== BTRFS_INODE_ITEM_KEY
) {
3698 inode_item
= btrfs_item_ptr(dst_path
->nodes
[0],
3700 struct btrfs_inode_item
);
3701 fill_inode_item(trans
, dst_path
->nodes
[0], inode_item
,
3703 inode_only
== LOG_INODE_EXISTS
,
3706 copy_extent_buffer(dst_path
->nodes
[0], src
, dst_offset
,
3707 src_offset
, ins_sizes
[i
]);
3711 * We set need_find_last_extent here in case we know we were
3712 * processing other items and then walk into the first extent in
3713 * the inode. If we don't hit an extent then nothing changes,
3714 * we'll do the last search the next time around.
3716 if (ins_keys
[i
].type
== BTRFS_EXTENT_DATA_KEY
) {
3718 if (first_key
.objectid
== (u64
)-1)
3719 first_key
= ins_keys
[i
];
3721 need_find_last_extent
= false;
3724 /* take a reference on file data extents so that truncates
3725 * or deletes of this inode don't have to relog the inode
3728 if (ins_keys
[i
].type
== BTRFS_EXTENT_DATA_KEY
&&
3731 extent
= btrfs_item_ptr(src
, start_slot
+ i
,
3732 struct btrfs_file_extent_item
);
3734 if (btrfs_file_extent_generation(src
, extent
) < trans
->transid
)
3737 found_type
= btrfs_file_extent_type(src
, extent
);
3738 if (found_type
== BTRFS_FILE_EXTENT_REG
) {
3740 ds
= btrfs_file_extent_disk_bytenr(src
,
3742 /* ds == 0 is a hole */
3746 dl
= btrfs_file_extent_disk_num_bytes(src
,
3748 cs
= btrfs_file_extent_offset(src
, extent
);
3749 cl
= btrfs_file_extent_num_bytes(src
,
3751 if (btrfs_file_extent_compression(src
,
3757 ret
= btrfs_lookup_csums_range(
3759 ds
+ cs
, ds
+ cs
+ cl
- 1,
3762 btrfs_release_path(dst_path
);
3770 btrfs_mark_buffer_dirty(dst_path
->nodes
[0]);
3771 btrfs_release_path(dst_path
);
3775 * we have to do this after the loop above to avoid changing the
3776 * log tree while trying to change the log tree.
3779 while (!list_empty(&ordered_sums
)) {
3780 struct btrfs_ordered_sum
*sums
= list_entry(ordered_sums
.next
,
3781 struct btrfs_ordered_sum
,
3784 ret
= btrfs_csum_file_blocks(trans
, log
, sums
);
3785 list_del(&sums
->list
);
3792 if (need_find_last_extent
&& *last_extent
== first_key
.offset
) {
3794 * We don't have any leafs between our current one and the one
3795 * we processed before that can have file extent items for our
3796 * inode (and have a generation number smaller than our current
3799 need_find_last_extent
= false;
3803 * Because we use btrfs_search_forward we could skip leaves that were
3804 * not modified and then assume *last_extent is valid when it really
3805 * isn't. So back up to the previous leaf and read the end of the last
3806 * extent before we go and fill in holes.
3808 if (need_find_last_extent
) {
3811 ret
= btrfs_prev_leaf(inode
->root
, src_path
);
3816 if (src_path
->slots
[0])
3817 src_path
->slots
[0]--;
3818 src
= src_path
->nodes
[0];
3819 btrfs_item_key_to_cpu(src
, &key
, src_path
->slots
[0]);
3820 if (key
.objectid
!= btrfs_ino(inode
) ||
3821 key
.type
!= BTRFS_EXTENT_DATA_KEY
)
3823 extent
= btrfs_item_ptr(src
, src_path
->slots
[0],
3824 struct btrfs_file_extent_item
);
3825 if (btrfs_file_extent_type(src
, extent
) ==
3826 BTRFS_FILE_EXTENT_INLINE
) {
3827 len
= btrfs_file_extent_inline_len(src
,
3830 *last_extent
= ALIGN(key
.offset
+ len
,
3831 fs_info
->sectorsize
);
3833 len
= btrfs_file_extent_num_bytes(src
, extent
);
3834 *last_extent
= key
.offset
+ len
;
3838 /* So we did prev_leaf, now we need to move to the next leaf, but a few
3839 * things could have happened
3841 * 1) A merge could have happened, so we could currently be on a leaf
3842 * that holds what we were copying in the first place.
3843 * 2) A split could have happened, and now not all of the items we want
3844 * are on the same leaf.
3846 * So we need to adjust how we search for holes, we need to drop the
3847 * path and re-search for the first extent key we found, and then walk
3848 * forward until we hit the last one we copied.
3850 if (need_find_last_extent
) {
3851 /* btrfs_prev_leaf could return 1 without releasing the path */
3852 btrfs_release_path(src_path
);
3853 ret
= btrfs_search_slot(NULL
, inode
->root
, &first_key
,
3858 src
= src_path
->nodes
[0];
3859 i
= src_path
->slots
[0];
3865 * Ok so here we need to go through and fill in any holes we may have
3866 * to make sure that holes are punched for those areas in case they had
3867 * extents previously.
3873 if (i
>= btrfs_header_nritems(src_path
->nodes
[0])) {
3874 ret
= btrfs_next_leaf(inode
->root
, src_path
);
3878 src
= src_path
->nodes
[0];
3882 btrfs_item_key_to_cpu(src
, &key
, i
);
3883 if (!btrfs_comp_cpu_keys(&key
, &last_key
))
3885 if (key
.objectid
!= btrfs_ino(inode
) ||
3886 key
.type
!= BTRFS_EXTENT_DATA_KEY
) {
3890 extent
= btrfs_item_ptr(src
, i
, struct btrfs_file_extent_item
);
3891 if (btrfs_file_extent_type(src
, extent
) ==
3892 BTRFS_FILE_EXTENT_INLINE
) {
3893 len
= btrfs_file_extent_inline_len(src
, i
, extent
);
3894 extent_end
= ALIGN(key
.offset
+ len
,
3895 fs_info
->sectorsize
);
3897 len
= btrfs_file_extent_num_bytes(src
, extent
);
3898 extent_end
= key
.offset
+ len
;
3902 if (*last_extent
== key
.offset
) {
3903 *last_extent
= extent_end
;
3906 offset
= *last_extent
;
3907 len
= key
.offset
- *last_extent
;
3908 ret
= btrfs_insert_file_extent(trans
, log
, btrfs_ino(inode
),
3909 offset
, 0, 0, len
, 0, len
, 0, 0, 0);
3912 *last_extent
= extent_end
;
3915 * Need to let the callers know we dropped the path so they should
3918 if (!ret
&& need_find_last_extent
)
3923 static int extent_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
3925 struct extent_map
*em1
, *em2
;
3927 em1
= list_entry(a
, struct extent_map
, list
);
3928 em2
= list_entry(b
, struct extent_map
, list
);
3930 if (em1
->start
< em2
->start
)
3932 else if (em1
->start
> em2
->start
)
3937 static int wait_ordered_extents(struct btrfs_trans_handle
*trans
,
3938 struct inode
*inode
,
3939 struct btrfs_root
*root
,
3940 const struct extent_map
*em
,
3941 const struct list_head
*logged_list
,
3942 bool *ordered_io_error
)
3944 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3945 struct btrfs_ordered_extent
*ordered
;
3946 struct btrfs_root
*log
= root
->log_root
;
3947 u64 mod_start
= em
->mod_start
;
3948 u64 mod_len
= em
->mod_len
;
3949 const bool skip_csum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
3952 LIST_HEAD(ordered_sums
);
3955 *ordered_io_error
= false;
3957 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
) ||
3958 em
->block_start
== EXTENT_MAP_HOLE
)
3962 * Wait far any ordered extent that covers our extent map. If it
3963 * finishes without an error, first check and see if our csums are on
3964 * our outstanding ordered extents.
3966 list_for_each_entry(ordered
, logged_list
, log_list
) {
3967 struct btrfs_ordered_sum
*sum
;
3972 if (ordered
->file_offset
+ ordered
->len
<= mod_start
||
3973 mod_start
+ mod_len
<= ordered
->file_offset
)
3976 if (!test_bit(BTRFS_ORDERED_IO_DONE
, &ordered
->flags
) &&
3977 !test_bit(BTRFS_ORDERED_IOERR
, &ordered
->flags
) &&
3978 !test_bit(BTRFS_ORDERED_DIRECT
, &ordered
->flags
)) {
3979 const u64 start
= ordered
->file_offset
;
3980 const u64 end
= ordered
->file_offset
+ ordered
->len
- 1;
3982 WARN_ON(ordered
->inode
!= inode
);
3983 filemap_fdatawrite_range(inode
->i_mapping
, start
, end
);
3986 wait_event(ordered
->wait
,
3987 (test_bit(BTRFS_ORDERED_IO_DONE
, &ordered
->flags
) ||
3988 test_bit(BTRFS_ORDERED_IOERR
, &ordered
->flags
)));
3990 if (test_bit(BTRFS_ORDERED_IOERR
, &ordered
->flags
)) {
3992 * Clear the AS_EIO/AS_ENOSPC flags from the inode's
3993 * i_mapping flags, so that the next fsync won't get
3994 * an outdated io error too.
3996 filemap_check_errors(inode
->i_mapping
);
3997 *ordered_io_error
= true;
4001 * We are going to copy all the csums on this ordered extent, so
4002 * go ahead and adjust mod_start and mod_len in case this
4003 * ordered extent has already been logged.
4005 if (ordered
->file_offset
> mod_start
) {
4006 if (ordered
->file_offset
+ ordered
->len
>=
4007 mod_start
+ mod_len
)
4008 mod_len
= ordered
->file_offset
- mod_start
;
4010 * If we have this case
4012 * |--------- logged extent ---------|
4013 * |----- ordered extent ----|
4015 * Just don't mess with mod_start and mod_len, we'll
4016 * just end up logging more csums than we need and it
4020 if (ordered
->file_offset
+ ordered
->len
<
4021 mod_start
+ mod_len
) {
4022 mod_len
= (mod_start
+ mod_len
) -
4023 (ordered
->file_offset
+ ordered
->len
);
4024 mod_start
= ordered
->file_offset
+
4035 * To keep us from looping for the above case of an ordered
4036 * extent that falls inside of the logged extent.
4038 if (test_and_set_bit(BTRFS_ORDERED_LOGGED_CSUM
,
4042 list_for_each_entry(sum
, &ordered
->list
, list
) {
4043 ret
= btrfs_csum_file_blocks(trans
, log
, sum
);
4049 if (*ordered_io_error
|| !mod_len
|| ret
|| skip_csum
)
4052 if (em
->compress_type
) {
4054 csum_len
= max(em
->block_len
, em
->orig_block_len
);
4056 csum_offset
= mod_start
- em
->start
;
4060 /* block start is already adjusted for the file extent offset. */
4061 ret
= btrfs_lookup_csums_range(fs_info
->csum_root
,
4062 em
->block_start
+ csum_offset
,
4063 em
->block_start
+ csum_offset
+
4064 csum_len
- 1, &ordered_sums
, 0);
4068 while (!list_empty(&ordered_sums
)) {
4069 struct btrfs_ordered_sum
*sums
= list_entry(ordered_sums
.next
,
4070 struct btrfs_ordered_sum
,
4073 ret
= btrfs_csum_file_blocks(trans
, log
, sums
);
4074 list_del(&sums
->list
);
4081 static int log_one_extent(struct btrfs_trans_handle
*trans
,
4082 struct btrfs_inode
*inode
, struct btrfs_root
*root
,
4083 const struct extent_map
*em
,
4084 struct btrfs_path
*path
,
4085 const struct list_head
*logged_list
,
4086 struct btrfs_log_ctx
*ctx
)
4088 struct btrfs_root
*log
= root
->log_root
;
4089 struct btrfs_file_extent_item
*fi
;
4090 struct extent_buffer
*leaf
;
4091 struct btrfs_map_token token
;
4092 struct btrfs_key key
;
4093 u64 extent_offset
= em
->start
- em
->orig_start
;
4096 int extent_inserted
= 0;
4097 bool ordered_io_err
= false;
4099 ret
= wait_ordered_extents(trans
, &inode
->vfs_inode
, root
, em
,
4100 logged_list
, &ordered_io_err
);
4104 if (ordered_io_err
) {
4109 btrfs_init_map_token(&token
);
4111 ret
= __btrfs_drop_extents(trans
, log
, &inode
->vfs_inode
, path
, em
->start
,
4112 em
->start
+ em
->len
, NULL
, 0, 1,
4113 sizeof(*fi
), &extent_inserted
);
4117 if (!extent_inserted
) {
4118 key
.objectid
= btrfs_ino(inode
);
4119 key
.type
= BTRFS_EXTENT_DATA_KEY
;
4120 key
.offset
= em
->start
;
4122 ret
= btrfs_insert_empty_item(trans
, log
, path
, &key
,
4127 leaf
= path
->nodes
[0];
4128 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
4129 struct btrfs_file_extent_item
);
4131 btrfs_set_token_file_extent_generation(leaf
, fi
, trans
->transid
,
4133 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
4134 btrfs_set_token_file_extent_type(leaf
, fi
,
4135 BTRFS_FILE_EXTENT_PREALLOC
,
4138 btrfs_set_token_file_extent_type(leaf
, fi
,
4139 BTRFS_FILE_EXTENT_REG
,
4142 block_len
= max(em
->block_len
, em
->orig_block_len
);
4143 if (em
->compress_type
!= BTRFS_COMPRESS_NONE
) {
4144 btrfs_set_token_file_extent_disk_bytenr(leaf
, fi
,
4147 btrfs_set_token_file_extent_disk_num_bytes(leaf
, fi
, block_len
,
4149 } else if (em
->block_start
< EXTENT_MAP_LAST_BYTE
) {
4150 btrfs_set_token_file_extent_disk_bytenr(leaf
, fi
,
4152 extent_offset
, &token
);
4153 btrfs_set_token_file_extent_disk_num_bytes(leaf
, fi
, block_len
,
4156 btrfs_set_token_file_extent_disk_bytenr(leaf
, fi
, 0, &token
);
4157 btrfs_set_token_file_extent_disk_num_bytes(leaf
, fi
, 0,
4161 btrfs_set_token_file_extent_offset(leaf
, fi
, extent_offset
, &token
);
4162 btrfs_set_token_file_extent_num_bytes(leaf
, fi
, em
->len
, &token
);
4163 btrfs_set_token_file_extent_ram_bytes(leaf
, fi
, em
->ram_bytes
, &token
);
4164 btrfs_set_token_file_extent_compression(leaf
, fi
, em
->compress_type
,
4166 btrfs_set_token_file_extent_encryption(leaf
, fi
, 0, &token
);
4167 btrfs_set_token_file_extent_other_encoding(leaf
, fi
, 0, &token
);
4168 btrfs_mark_buffer_dirty(leaf
);
4170 btrfs_release_path(path
);
4175 static int btrfs_log_changed_extents(struct btrfs_trans_handle
*trans
,
4176 struct btrfs_root
*root
,
4177 struct btrfs_inode
*inode
,
4178 struct btrfs_path
*path
,
4179 struct list_head
*logged_list
,
4180 struct btrfs_log_ctx
*ctx
,
4184 struct extent_map
*em
, *n
;
4185 struct list_head extents
;
4186 struct extent_map_tree
*tree
= &inode
->extent_tree
;
4191 INIT_LIST_HEAD(&extents
);
4193 down_write(&inode
->dio_sem
);
4194 write_lock(&tree
->lock
);
4195 test_gen
= root
->fs_info
->last_trans_committed
;
4197 list_for_each_entry_safe(em
, n
, &tree
->modified_extents
, list
) {
4198 list_del_init(&em
->list
);
4201 * Just an arbitrary number, this can be really CPU intensive
4202 * once we start getting a lot of extents, and really once we
4203 * have a bunch of extents we just want to commit since it will
4206 if (++num
> 32768) {
4207 list_del_init(&tree
->modified_extents
);
4212 if (em
->generation
<= test_gen
)
4214 /* Need a ref to keep it from getting evicted from cache */
4215 refcount_inc(&em
->refs
);
4216 set_bit(EXTENT_FLAG_LOGGING
, &em
->flags
);
4217 list_add_tail(&em
->list
, &extents
);
4221 list_sort(NULL
, &extents
, extent_cmp
);
4222 btrfs_get_logged_extents(inode
, logged_list
, start
, end
);
4224 * Some ordered extents started by fsync might have completed
4225 * before we could collect them into the list logged_list, which
4226 * means they're gone, not in our logged_list nor in the inode's
4227 * ordered tree. We want the application/user space to know an
4228 * error happened while attempting to persist file data so that
4229 * it can take proper action. If such error happened, we leave
4230 * without writing to the log tree and the fsync must report the
4231 * file data write error and not commit the current transaction.
4233 ret
= filemap_check_errors(inode
->vfs_inode
.i_mapping
);
4237 while (!list_empty(&extents
)) {
4238 em
= list_entry(extents
.next
, struct extent_map
, list
);
4240 list_del_init(&em
->list
);
4243 * If we had an error we just need to delete everybody from our
4247 clear_em_logging(tree
, em
);
4248 free_extent_map(em
);
4252 write_unlock(&tree
->lock
);
4254 ret
= log_one_extent(trans
, inode
, root
, em
, path
, logged_list
,
4256 write_lock(&tree
->lock
);
4257 clear_em_logging(tree
, em
);
4258 free_extent_map(em
);
4260 WARN_ON(!list_empty(&extents
));
4261 write_unlock(&tree
->lock
);
4262 up_write(&inode
->dio_sem
);
4264 btrfs_release_path(path
);
4268 static int logged_inode_size(struct btrfs_root
*log
, struct btrfs_inode
*inode
,
4269 struct btrfs_path
*path
, u64
*size_ret
)
4271 struct btrfs_key key
;
4274 key
.objectid
= btrfs_ino(inode
);
4275 key
.type
= BTRFS_INODE_ITEM_KEY
;
4278 ret
= btrfs_search_slot(NULL
, log
, &key
, path
, 0, 0);
4281 } else if (ret
> 0) {
4284 struct btrfs_inode_item
*item
;
4286 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
4287 struct btrfs_inode_item
);
4288 *size_ret
= btrfs_inode_size(path
->nodes
[0], item
);
4291 btrfs_release_path(path
);
4296 * At the moment we always log all xattrs. This is to figure out at log replay
4297 * time which xattrs must have their deletion replayed. If a xattr is missing
4298 * in the log tree and exists in the fs/subvol tree, we delete it. This is
4299 * because if a xattr is deleted, the inode is fsynced and a power failure
4300 * happens, causing the log to be replayed the next time the fs is mounted,
4301 * we want the xattr to not exist anymore (same behaviour as other filesystems
4302 * with a journal, ext3/4, xfs, f2fs, etc).
4304 static int btrfs_log_all_xattrs(struct btrfs_trans_handle
*trans
,
4305 struct btrfs_root
*root
,
4306 struct btrfs_inode
*inode
,
4307 struct btrfs_path
*path
,
4308 struct btrfs_path
*dst_path
)
4311 struct btrfs_key key
;
4312 const u64 ino
= btrfs_ino(inode
);
4317 key
.type
= BTRFS_XATTR_ITEM_KEY
;
4320 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
4325 int slot
= path
->slots
[0];
4326 struct extent_buffer
*leaf
= path
->nodes
[0];
4327 int nritems
= btrfs_header_nritems(leaf
);
4329 if (slot
>= nritems
) {
4331 u64 last_extent
= 0;
4333 ret
= copy_items(trans
, inode
, dst_path
, path
,
4334 &last_extent
, start_slot
,
4336 /* can't be 1, extent items aren't processed */
4342 ret
= btrfs_next_leaf(root
, path
);
4350 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
4351 if (key
.objectid
!= ino
|| key
.type
!= BTRFS_XATTR_ITEM_KEY
)
4361 u64 last_extent
= 0;
4363 ret
= copy_items(trans
, inode
, dst_path
, path
,
4364 &last_extent
, start_slot
,
4366 /* can't be 1, extent items aren't processed */
4376 * If the no holes feature is enabled we need to make sure any hole between the
4377 * last extent and the i_size of our inode is explicitly marked in the log. This
4378 * is to make sure that doing something like:
4380 * 1) create file with 128Kb of data
4381 * 2) truncate file to 64Kb
4382 * 3) truncate file to 256Kb
4384 * 5) <crash/power failure>
4385 * 6) mount fs and trigger log replay
4387 * Will give us a file with a size of 256Kb, the first 64Kb of data match what
4388 * the file had in its first 64Kb of data at step 1 and the last 192Kb of the
4389 * file correspond to a hole. The presence of explicit holes in a log tree is
4390 * what guarantees that log replay will remove/adjust file extent items in the
4393 * Here we do not need to care about holes between extents, that is already done
4394 * by copy_items(). We also only need to do this in the full sync path, where we
4395 * lookup for extents from the fs/subvol tree only. In the fast path case, we
4396 * lookup the list of modified extent maps and if any represents a hole, we
4397 * insert a corresponding extent representing a hole in the log tree.
4399 static int btrfs_log_trailing_hole(struct btrfs_trans_handle
*trans
,
4400 struct btrfs_root
*root
,
4401 struct btrfs_inode
*inode
,
4402 struct btrfs_path
*path
)
4404 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4406 struct btrfs_key key
;
4409 struct extent_buffer
*leaf
;
4410 struct btrfs_root
*log
= root
->log_root
;
4411 const u64 ino
= btrfs_ino(inode
);
4412 const u64 i_size
= i_size_read(&inode
->vfs_inode
);
4414 if (!btrfs_fs_incompat(fs_info
, NO_HOLES
))
4418 key
.type
= BTRFS_EXTENT_DATA_KEY
;
4419 key
.offset
= (u64
)-1;
4421 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
4426 ASSERT(path
->slots
[0] > 0);
4428 leaf
= path
->nodes
[0];
4429 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
4431 if (key
.objectid
!= ino
|| key
.type
!= BTRFS_EXTENT_DATA_KEY
) {
4432 /* inode does not have any extents */
4436 struct btrfs_file_extent_item
*extent
;
4440 * If there's an extent beyond i_size, an explicit hole was
4441 * already inserted by copy_items().
4443 if (key
.offset
>= i_size
)
4446 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
4447 struct btrfs_file_extent_item
);
4449 if (btrfs_file_extent_type(leaf
, extent
) ==
4450 BTRFS_FILE_EXTENT_INLINE
) {
4451 len
= btrfs_file_extent_inline_len(leaf
,
4454 ASSERT(len
== i_size
);
4458 len
= btrfs_file_extent_num_bytes(leaf
, extent
);
4459 /* Last extent goes beyond i_size, no need to log a hole. */
4460 if (key
.offset
+ len
> i_size
)
4462 hole_start
= key
.offset
+ len
;
4463 hole_size
= i_size
- hole_start
;
4465 btrfs_release_path(path
);
4467 /* Last extent ends at i_size. */
4471 hole_size
= ALIGN(hole_size
, fs_info
->sectorsize
);
4472 ret
= btrfs_insert_file_extent(trans
, log
, ino
, hole_start
, 0, 0,
4473 hole_size
, 0, hole_size
, 0, 0, 0);
4478 * When we are logging a new inode X, check if it doesn't have a reference that
4479 * matches the reference from some other inode Y created in a past transaction
4480 * and that was renamed in the current transaction. If we don't do this, then at
4481 * log replay time we can lose inode Y (and all its files if it's a directory):
4484 * echo "hello world" > /mnt/x/foobar
4487 * mkdir /mnt/x # or touch /mnt/x
4488 * xfs_io -c fsync /mnt/x
4490 * mount fs, trigger log replay
4492 * After the log replay procedure, we would lose the first directory and all its
4493 * files (file foobar).
4494 * For the case where inode Y is not a directory we simply end up losing it:
4496 * echo "123" > /mnt/foo
4498 * mv /mnt/foo /mnt/bar
4499 * echo "abc" > /mnt/foo
4500 * xfs_io -c fsync /mnt/foo
4503 * We also need this for cases where a snapshot entry is replaced by some other
4504 * entry (file or directory) otherwise we end up with an unreplayable log due to
4505 * attempts to delete the snapshot entry (entry of type BTRFS_ROOT_ITEM_KEY) as
4506 * if it were a regular entry:
4509 * btrfs subvolume snapshot /mnt /mnt/x/snap
4510 * btrfs subvolume delete /mnt/x/snap
4513 * fsync /mnt/x or fsync some new file inside it
4516 * The snapshot delete, rmdir of x, mkdir of a new x and the fsync all happen in
4517 * the same transaction.
4519 static int btrfs_check_ref_name_override(struct extent_buffer
*eb
,
4521 const struct btrfs_key
*key
,
4522 struct btrfs_inode
*inode
,
4526 struct btrfs_path
*search_path
;
4529 u32 item_size
= btrfs_item_size_nr(eb
, slot
);
4531 unsigned long ptr
= btrfs_item_ptr_offset(eb
, slot
);
4533 search_path
= btrfs_alloc_path();
4536 search_path
->search_commit_root
= 1;
4537 search_path
->skip_locking
= 1;
4539 while (cur_offset
< item_size
) {
4543 unsigned long name_ptr
;
4544 struct btrfs_dir_item
*di
;
4546 if (key
->type
== BTRFS_INODE_REF_KEY
) {
4547 struct btrfs_inode_ref
*iref
;
4549 iref
= (struct btrfs_inode_ref
*)(ptr
+ cur_offset
);
4550 parent
= key
->offset
;
4551 this_name_len
= btrfs_inode_ref_name_len(eb
, iref
);
4552 name_ptr
= (unsigned long)(iref
+ 1);
4553 this_len
= sizeof(*iref
) + this_name_len
;
4555 struct btrfs_inode_extref
*extref
;
4557 extref
= (struct btrfs_inode_extref
*)(ptr
+
4559 parent
= btrfs_inode_extref_parent(eb
, extref
);
4560 this_name_len
= btrfs_inode_extref_name_len(eb
, extref
);
4561 name_ptr
= (unsigned long)&extref
->name
;
4562 this_len
= sizeof(*extref
) + this_name_len
;
4565 ret
= btrfs_is_name_len_valid(eb
, slot
, name_ptr
,
4571 if (this_name_len
> name_len
) {
4574 new_name
= krealloc(name
, this_name_len
, GFP_NOFS
);
4579 name_len
= this_name_len
;
4583 read_extent_buffer(eb
, name
, name_ptr
, this_name_len
);
4584 di
= btrfs_lookup_dir_item(NULL
, inode
->root
, search_path
,
4585 parent
, name
, this_name_len
, 0);
4586 if (di
&& !IS_ERR(di
)) {
4587 struct btrfs_key di_key
;
4589 btrfs_dir_item_key_to_cpu(search_path
->nodes
[0],
4591 if (di_key
.type
== BTRFS_INODE_ITEM_KEY
) {
4593 *other_ino
= di_key
.objectid
;
4598 } else if (IS_ERR(di
)) {
4602 btrfs_release_path(search_path
);
4604 cur_offset
+= this_len
;
4608 btrfs_free_path(search_path
);
4613 /* log a single inode in the tree log.
4614 * At least one parent directory for this inode must exist in the tree
4615 * or be logged already.
4617 * Any items from this inode changed by the current transaction are copied
4618 * to the log tree. An extra reference is taken on any extents in this
4619 * file, allowing us to avoid a whole pile of corner cases around logging
4620 * blocks that have been removed from the tree.
4622 * See LOG_INODE_ALL and related defines for a description of what inode_only
4625 * This handles both files and directories.
4627 static int btrfs_log_inode(struct btrfs_trans_handle
*trans
,
4628 struct btrfs_root
*root
, struct btrfs_inode
*inode
,
4632 struct btrfs_log_ctx
*ctx
)
4634 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4635 struct btrfs_path
*path
;
4636 struct btrfs_path
*dst_path
;
4637 struct btrfs_key min_key
;
4638 struct btrfs_key max_key
;
4639 struct btrfs_root
*log
= root
->log_root
;
4640 struct extent_buffer
*src
= NULL
;
4641 LIST_HEAD(logged_list
);
4642 u64 last_extent
= 0;
4646 int ins_start_slot
= 0;
4648 bool fast_search
= false;
4649 u64 ino
= btrfs_ino(inode
);
4650 struct extent_map_tree
*em_tree
= &inode
->extent_tree
;
4651 u64 logged_isize
= 0;
4652 bool need_log_inode_item
= true;
4654 path
= btrfs_alloc_path();
4657 dst_path
= btrfs_alloc_path();
4659 btrfs_free_path(path
);
4663 min_key
.objectid
= ino
;
4664 min_key
.type
= BTRFS_INODE_ITEM_KEY
;
4667 max_key
.objectid
= ino
;
4670 /* today the code can only do partial logging of directories */
4671 if (S_ISDIR(inode
->vfs_inode
.i_mode
) ||
4672 (!test_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
4673 &inode
->runtime_flags
) &&
4674 inode_only
>= LOG_INODE_EXISTS
))
4675 max_key
.type
= BTRFS_XATTR_ITEM_KEY
;
4677 max_key
.type
= (u8
)-1;
4678 max_key
.offset
= (u64
)-1;
4681 * Only run delayed items if we are a dir or a new file.
4682 * Otherwise commit the delayed inode only, which is needed in
4683 * order for the log replay code to mark inodes for link count
4684 * fixup (create temporary BTRFS_TREE_LOG_FIXUP_OBJECTID items).
4686 if (S_ISDIR(inode
->vfs_inode
.i_mode
) ||
4687 inode
->generation
> fs_info
->last_trans_committed
)
4688 ret
= btrfs_commit_inode_delayed_items(trans
, inode
);
4690 ret
= btrfs_commit_inode_delayed_inode(inode
);
4693 btrfs_free_path(path
);
4694 btrfs_free_path(dst_path
);
4698 if (inode_only
== LOG_OTHER_INODE
) {
4699 inode_only
= LOG_INODE_EXISTS
;
4700 mutex_lock_nested(&inode
->log_mutex
, SINGLE_DEPTH_NESTING
);
4702 mutex_lock(&inode
->log_mutex
);
4706 * a brute force approach to making sure we get the most uptodate
4707 * copies of everything.
4709 if (S_ISDIR(inode
->vfs_inode
.i_mode
)) {
4710 int max_key_type
= BTRFS_DIR_LOG_INDEX_KEY
;
4712 if (inode_only
== LOG_INODE_EXISTS
)
4713 max_key_type
= BTRFS_XATTR_ITEM_KEY
;
4714 ret
= drop_objectid_items(trans
, log
, path
, ino
, max_key_type
);
4716 if (inode_only
== LOG_INODE_EXISTS
) {
4718 * Make sure the new inode item we write to the log has
4719 * the same isize as the current one (if it exists).
4720 * This is necessary to prevent data loss after log
4721 * replay, and also to prevent doing a wrong expanding
4722 * truncate - for e.g. create file, write 4K into offset
4723 * 0, fsync, write 4K into offset 4096, add hard link,
4724 * fsync some other file (to sync log), power fail - if
4725 * we use the inode's current i_size, after log replay
4726 * we get a 8Kb file, with the last 4Kb extent as a hole
4727 * (zeroes), as if an expanding truncate happened,
4728 * instead of getting a file of 4Kb only.
4730 err
= logged_inode_size(log
, inode
, path
, &logged_isize
);
4734 if (test_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
4735 &inode
->runtime_flags
)) {
4736 if (inode_only
== LOG_INODE_EXISTS
) {
4737 max_key
.type
= BTRFS_XATTR_ITEM_KEY
;
4738 ret
= drop_objectid_items(trans
, log
, path
, ino
,
4741 clear_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
4742 &inode
->runtime_flags
);
4743 clear_bit(BTRFS_INODE_COPY_EVERYTHING
,
4744 &inode
->runtime_flags
);
4746 ret
= btrfs_truncate_inode_items(trans
,
4747 log
, &inode
->vfs_inode
, 0, 0);
4752 } else if (test_and_clear_bit(BTRFS_INODE_COPY_EVERYTHING
,
4753 &inode
->runtime_flags
) ||
4754 inode_only
== LOG_INODE_EXISTS
) {
4755 if (inode_only
== LOG_INODE_ALL
)
4757 max_key
.type
= BTRFS_XATTR_ITEM_KEY
;
4758 ret
= drop_objectid_items(trans
, log
, path
, ino
,
4761 if (inode_only
== LOG_INODE_ALL
)
4774 ret
= btrfs_search_forward(root
, &min_key
,
4775 path
, trans
->transid
);
4783 /* note, ins_nr might be > 0 here, cleanup outside the loop */
4784 if (min_key
.objectid
!= ino
)
4786 if (min_key
.type
> max_key
.type
)
4789 if (min_key
.type
== BTRFS_INODE_ITEM_KEY
)
4790 need_log_inode_item
= false;
4792 if ((min_key
.type
== BTRFS_INODE_REF_KEY
||
4793 min_key
.type
== BTRFS_INODE_EXTREF_KEY
) &&
4794 inode
->generation
== trans
->transid
) {
4797 ret
= btrfs_check_ref_name_override(path
->nodes
[0],
4798 path
->slots
[0], &min_key
, inode
,
4803 } else if (ret
> 0 && ctx
&&
4804 other_ino
!= btrfs_ino(BTRFS_I(ctx
->inode
))) {
4805 struct btrfs_key inode_key
;
4806 struct inode
*other_inode
;
4812 ins_start_slot
= path
->slots
[0];
4814 ret
= copy_items(trans
, inode
, dst_path
, path
,
4815 &last_extent
, ins_start_slot
,
4823 btrfs_release_path(path
);
4824 inode_key
.objectid
= other_ino
;
4825 inode_key
.type
= BTRFS_INODE_ITEM_KEY
;
4826 inode_key
.offset
= 0;
4827 other_inode
= btrfs_iget(fs_info
->sb
,
4831 * If the other inode that had a conflicting dir
4832 * entry was deleted in the current transaction,
4833 * we don't need to do more work nor fallback to
4834 * a transaction commit.
4836 if (IS_ERR(other_inode
) &&
4837 PTR_ERR(other_inode
) == -ENOENT
) {
4839 } else if (IS_ERR(other_inode
)) {
4840 err
= PTR_ERR(other_inode
);
4844 * We are safe logging the other inode without
4845 * acquiring its i_mutex as long as we log with
4846 * the LOG_INODE_EXISTS mode. We're safe against
4847 * concurrent renames of the other inode as well
4848 * because during a rename we pin the log and
4849 * update the log with the new name before we
4852 err
= btrfs_log_inode(trans
, root
,
4853 BTRFS_I(other_inode
),
4854 LOG_OTHER_INODE
, 0, LLONG_MAX
,
4864 /* Skip xattrs, we log them later with btrfs_log_all_xattrs() */
4865 if (min_key
.type
== BTRFS_XATTR_ITEM_KEY
) {
4868 ret
= copy_items(trans
, inode
, dst_path
, path
,
4869 &last_extent
, ins_start_slot
,
4870 ins_nr
, inode_only
, logged_isize
);
4877 btrfs_release_path(path
);
4883 src
= path
->nodes
[0];
4884 if (ins_nr
&& ins_start_slot
+ ins_nr
== path
->slots
[0]) {
4887 } else if (!ins_nr
) {
4888 ins_start_slot
= path
->slots
[0];
4893 ret
= copy_items(trans
, inode
, dst_path
, path
, &last_extent
,
4894 ins_start_slot
, ins_nr
, inode_only
,
4902 btrfs_release_path(path
);
4906 ins_start_slot
= path
->slots
[0];
4909 nritems
= btrfs_header_nritems(path
->nodes
[0]);
4911 if (path
->slots
[0] < nritems
) {
4912 btrfs_item_key_to_cpu(path
->nodes
[0], &min_key
,
4917 ret
= copy_items(trans
, inode
, dst_path
, path
,
4918 &last_extent
, ins_start_slot
,
4919 ins_nr
, inode_only
, logged_isize
);
4927 btrfs_release_path(path
);
4929 if (min_key
.offset
< (u64
)-1) {
4931 } else if (min_key
.type
< max_key
.type
) {
4939 ret
= copy_items(trans
, inode
, dst_path
, path
, &last_extent
,
4940 ins_start_slot
, ins_nr
, inode_only
,
4950 btrfs_release_path(path
);
4951 btrfs_release_path(dst_path
);
4952 err
= btrfs_log_all_xattrs(trans
, root
, inode
, path
, dst_path
);
4955 if (max_key
.type
>= BTRFS_EXTENT_DATA_KEY
&& !fast_search
) {
4956 btrfs_release_path(path
);
4957 btrfs_release_path(dst_path
);
4958 err
= btrfs_log_trailing_hole(trans
, root
, inode
, path
);
4963 btrfs_release_path(path
);
4964 btrfs_release_path(dst_path
);
4965 if (need_log_inode_item
) {
4966 err
= log_inode_item(trans
, log
, dst_path
, inode
);
4971 ret
= btrfs_log_changed_extents(trans
, root
, inode
, dst_path
,
4972 &logged_list
, ctx
, start
, end
);
4977 } else if (inode_only
== LOG_INODE_ALL
) {
4978 struct extent_map
*em
, *n
;
4980 write_lock(&em_tree
->lock
);
4982 * We can't just remove every em if we're called for a ranged
4983 * fsync - that is, one that doesn't cover the whole possible
4984 * file range (0 to LLONG_MAX). This is because we can have
4985 * em's that fall outside the range we're logging and therefore
4986 * their ordered operations haven't completed yet
4987 * (btrfs_finish_ordered_io() not invoked yet). This means we
4988 * didn't get their respective file extent item in the fs/subvol
4989 * tree yet, and need to let the next fast fsync (one which
4990 * consults the list of modified extent maps) find the em so
4991 * that it logs a matching file extent item and waits for the
4992 * respective ordered operation to complete (if it's still
4995 * Removing every em outside the range we're logging would make
4996 * the next fast fsync not log their matching file extent items,
4997 * therefore making us lose data after a log replay.
4999 list_for_each_entry_safe(em
, n
, &em_tree
->modified_extents
,
5001 const u64 mod_end
= em
->mod_start
+ em
->mod_len
- 1;
5003 if (em
->mod_start
>= start
&& mod_end
<= end
)
5004 list_del_init(&em
->list
);
5006 write_unlock(&em_tree
->lock
);
5009 if (inode_only
== LOG_INODE_ALL
&& S_ISDIR(inode
->vfs_inode
.i_mode
)) {
5010 ret
= log_directory_changes(trans
, root
, inode
, path
, dst_path
,
5018 spin_lock(&inode
->lock
);
5019 inode
->logged_trans
= trans
->transid
;
5020 inode
->last_log_commit
= inode
->last_sub_trans
;
5021 spin_unlock(&inode
->lock
);
5024 btrfs_put_logged_extents(&logged_list
);
5026 btrfs_submit_logged_extents(&logged_list
, log
);
5027 mutex_unlock(&inode
->log_mutex
);
5029 btrfs_free_path(path
);
5030 btrfs_free_path(dst_path
);
5035 * Check if we must fallback to a transaction commit when logging an inode.
5036 * This must be called after logging the inode and is used only in the context
5037 * when fsyncing an inode requires the need to log some other inode - in which
5038 * case we can't lock the i_mutex of each other inode we need to log as that
5039 * can lead to deadlocks with concurrent fsync against other inodes (as we can
5040 * log inodes up or down in the hierarchy) or rename operations for example. So
5041 * we take the log_mutex of the inode after we have logged it and then check for
5042 * its last_unlink_trans value - this is safe because any task setting
5043 * last_unlink_trans must take the log_mutex and it must do this before it does
5044 * the actual unlink operation, so if we do this check before a concurrent task
5045 * sets last_unlink_trans it means we've logged a consistent version/state of
5046 * all the inode items, otherwise we are not sure and must do a transaction
5047 * commit (the concurrent task might have only updated last_unlink_trans before
5048 * we logged the inode or it might have also done the unlink).
5050 static bool btrfs_must_commit_transaction(struct btrfs_trans_handle
*trans
,
5051 struct btrfs_inode
*inode
)
5053 struct btrfs_fs_info
*fs_info
= inode
->root
->fs_info
;
5056 mutex_lock(&inode
->log_mutex
);
5057 if (inode
->last_unlink_trans
> fs_info
->last_trans_committed
) {
5059 * Make sure any commits to the log are forced to be full
5062 btrfs_set_log_full_commit(fs_info
, trans
);
5065 mutex_unlock(&inode
->log_mutex
);
5071 * follow the dentry parent pointers up the chain and see if any
5072 * of the directories in it require a full commit before they can
5073 * be logged. Returns zero if nothing special needs to be done or 1 if
5074 * a full commit is required.
5076 static noinline
int check_parent_dirs_for_sync(struct btrfs_trans_handle
*trans
,
5077 struct btrfs_inode
*inode
,
5078 struct dentry
*parent
,
5079 struct super_block
*sb
,
5083 struct dentry
*old_parent
= NULL
;
5084 struct btrfs_inode
*orig_inode
= inode
;
5087 * for regular files, if its inode is already on disk, we don't
5088 * have to worry about the parents at all. This is because
5089 * we can use the last_unlink_trans field to record renames
5090 * and other fun in this file.
5092 if (S_ISREG(inode
->vfs_inode
.i_mode
) &&
5093 inode
->generation
<= last_committed
&&
5094 inode
->last_unlink_trans
<= last_committed
)
5097 if (!S_ISDIR(inode
->vfs_inode
.i_mode
)) {
5098 if (!parent
|| d_really_is_negative(parent
) || sb
!= parent
->d_sb
)
5100 inode
= BTRFS_I(d_inode(parent
));
5105 * If we are logging a directory then we start with our inode,
5106 * not our parent's inode, so we need to skip setting the
5107 * logged_trans so that further down in the log code we don't
5108 * think this inode has already been logged.
5110 if (inode
!= orig_inode
)
5111 inode
->logged_trans
= trans
->transid
;
5114 if (btrfs_must_commit_transaction(trans
, inode
)) {
5119 if (!parent
|| d_really_is_negative(parent
) || sb
!= parent
->d_sb
)
5122 if (IS_ROOT(parent
)) {
5123 inode
= BTRFS_I(d_inode(parent
));
5124 if (btrfs_must_commit_transaction(trans
, inode
))
5129 parent
= dget_parent(parent
);
5131 old_parent
= parent
;
5132 inode
= BTRFS_I(d_inode(parent
));
5140 struct btrfs_dir_list
{
5142 struct list_head list
;
5146 * Log the inodes of the new dentries of a directory. See log_dir_items() for
5147 * details about the why it is needed.
5148 * This is a recursive operation - if an existing dentry corresponds to a
5149 * directory, that directory's new entries are logged too (same behaviour as
5150 * ext3/4, xfs, f2fs, reiserfs, nilfs2). Note that when logging the inodes
5151 * the dentries point to we do not lock their i_mutex, otherwise lockdep
5152 * complains about the following circular lock dependency / possible deadlock:
5156 * lock(&type->i_mutex_dir_key#3/2);
5157 * lock(sb_internal#2);
5158 * lock(&type->i_mutex_dir_key#3/2);
5159 * lock(&sb->s_type->i_mutex_key#14);
5161 * Where sb_internal is the lock (a counter that works as a lock) acquired by
5162 * sb_start_intwrite() in btrfs_start_transaction().
5163 * Not locking i_mutex of the inodes is still safe because:
5165 * 1) For regular files we log with a mode of LOG_INODE_EXISTS. It's possible
5166 * that while logging the inode new references (names) are added or removed
5167 * from the inode, leaving the logged inode item with a link count that does
5168 * not match the number of logged inode reference items. This is fine because
5169 * at log replay time we compute the real number of links and correct the
5170 * link count in the inode item (see replay_one_buffer() and
5171 * link_to_fixup_dir());
5173 * 2) For directories we log with a mode of LOG_INODE_ALL. It's possible that
5174 * while logging the inode's items new items with keys BTRFS_DIR_ITEM_KEY and
5175 * BTRFS_DIR_INDEX_KEY are added to fs/subvol tree and the logged inode item
5176 * has a size that doesn't match the sum of the lengths of all the logged
5177 * names. This does not result in a problem because if a dir_item key is
5178 * logged but its matching dir_index key is not logged, at log replay time we
5179 * don't use it to replay the respective name (see replay_one_name()). On the
5180 * other hand if only the dir_index key ends up being logged, the respective
5181 * name is added to the fs/subvol tree with both the dir_item and dir_index
5182 * keys created (see replay_one_name()).
5183 * The directory's inode item with a wrong i_size is not a problem as well,
5184 * since we don't use it at log replay time to set the i_size in the inode
5185 * item of the fs/subvol tree (see overwrite_item()).
5187 static int log_new_dir_dentries(struct btrfs_trans_handle
*trans
,
5188 struct btrfs_root
*root
,
5189 struct btrfs_inode
*start_inode
,
5190 struct btrfs_log_ctx
*ctx
)
5192 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5193 struct btrfs_root
*log
= root
->log_root
;
5194 struct btrfs_path
*path
;
5195 LIST_HEAD(dir_list
);
5196 struct btrfs_dir_list
*dir_elem
;
5199 path
= btrfs_alloc_path();
5203 dir_elem
= kmalloc(sizeof(*dir_elem
), GFP_NOFS
);
5205 btrfs_free_path(path
);
5208 dir_elem
->ino
= btrfs_ino(start_inode
);
5209 list_add_tail(&dir_elem
->list
, &dir_list
);
5211 while (!list_empty(&dir_list
)) {
5212 struct extent_buffer
*leaf
;
5213 struct btrfs_key min_key
;
5217 dir_elem
= list_first_entry(&dir_list
, struct btrfs_dir_list
,
5220 goto next_dir_inode
;
5222 min_key
.objectid
= dir_elem
->ino
;
5223 min_key
.type
= BTRFS_DIR_ITEM_KEY
;
5226 btrfs_release_path(path
);
5227 ret
= btrfs_search_forward(log
, &min_key
, path
, trans
->transid
);
5229 goto next_dir_inode
;
5230 } else if (ret
> 0) {
5232 goto next_dir_inode
;
5236 leaf
= path
->nodes
[0];
5237 nritems
= btrfs_header_nritems(leaf
);
5238 for (i
= path
->slots
[0]; i
< nritems
; i
++) {
5239 struct btrfs_dir_item
*di
;
5240 struct btrfs_key di_key
;
5241 struct inode
*di_inode
;
5242 struct btrfs_dir_list
*new_dir_elem
;
5243 int log_mode
= LOG_INODE_EXISTS
;
5246 btrfs_item_key_to_cpu(leaf
, &min_key
, i
);
5247 if (min_key
.objectid
!= dir_elem
->ino
||
5248 min_key
.type
!= BTRFS_DIR_ITEM_KEY
)
5249 goto next_dir_inode
;
5251 di
= btrfs_item_ptr(leaf
, i
, struct btrfs_dir_item
);
5252 type
= btrfs_dir_type(leaf
, di
);
5253 if (btrfs_dir_transid(leaf
, di
) < trans
->transid
&&
5254 type
!= BTRFS_FT_DIR
)
5256 btrfs_dir_item_key_to_cpu(leaf
, di
, &di_key
);
5257 if (di_key
.type
== BTRFS_ROOT_ITEM_KEY
)
5260 btrfs_release_path(path
);
5261 di_inode
= btrfs_iget(fs_info
->sb
, &di_key
, root
, NULL
);
5262 if (IS_ERR(di_inode
)) {
5263 ret
= PTR_ERR(di_inode
);
5264 goto next_dir_inode
;
5267 if (btrfs_inode_in_log(BTRFS_I(di_inode
), trans
->transid
)) {
5272 ctx
->log_new_dentries
= false;
5273 if (type
== BTRFS_FT_DIR
|| type
== BTRFS_FT_SYMLINK
)
5274 log_mode
= LOG_INODE_ALL
;
5275 ret
= btrfs_log_inode(trans
, root
, BTRFS_I(di_inode
),
5276 log_mode
, 0, LLONG_MAX
, ctx
);
5278 btrfs_must_commit_transaction(trans
, BTRFS_I(di_inode
)))
5282 goto next_dir_inode
;
5283 if (ctx
->log_new_dentries
) {
5284 new_dir_elem
= kmalloc(sizeof(*new_dir_elem
),
5286 if (!new_dir_elem
) {
5288 goto next_dir_inode
;
5290 new_dir_elem
->ino
= di_key
.objectid
;
5291 list_add_tail(&new_dir_elem
->list
, &dir_list
);
5296 ret
= btrfs_next_leaf(log
, path
);
5298 goto next_dir_inode
;
5299 } else if (ret
> 0) {
5301 goto next_dir_inode
;
5305 if (min_key
.offset
< (u64
)-1) {
5310 list_del(&dir_elem
->list
);
5314 btrfs_free_path(path
);
5318 static int btrfs_log_all_parents(struct btrfs_trans_handle
*trans
,
5319 struct btrfs_inode
*inode
,
5320 struct btrfs_log_ctx
*ctx
)
5322 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
5324 struct btrfs_path
*path
;
5325 struct btrfs_key key
;
5326 struct btrfs_root
*root
= inode
->root
;
5327 const u64 ino
= btrfs_ino(inode
);
5329 path
= btrfs_alloc_path();
5332 path
->skip_locking
= 1;
5333 path
->search_commit_root
= 1;
5336 key
.type
= BTRFS_INODE_REF_KEY
;
5338 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
5343 struct extent_buffer
*leaf
= path
->nodes
[0];
5344 int slot
= path
->slots
[0];
5349 if (slot
>= btrfs_header_nritems(leaf
)) {
5350 ret
= btrfs_next_leaf(root
, path
);
5358 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
5359 /* BTRFS_INODE_EXTREF_KEY is BTRFS_INODE_REF_KEY + 1 */
5360 if (key
.objectid
!= ino
|| key
.type
> BTRFS_INODE_EXTREF_KEY
)
5363 item_size
= btrfs_item_size_nr(leaf
, slot
);
5364 ptr
= btrfs_item_ptr_offset(leaf
, slot
);
5365 while (cur_offset
< item_size
) {
5366 struct btrfs_key inode_key
;
5367 struct inode
*dir_inode
;
5369 inode_key
.type
= BTRFS_INODE_ITEM_KEY
;
5370 inode_key
.offset
= 0;
5372 if (key
.type
== BTRFS_INODE_EXTREF_KEY
) {
5373 struct btrfs_inode_extref
*extref
;
5375 extref
= (struct btrfs_inode_extref
*)
5377 inode_key
.objectid
= btrfs_inode_extref_parent(
5379 cur_offset
+= sizeof(*extref
);
5380 cur_offset
+= btrfs_inode_extref_name_len(leaf
,
5383 inode_key
.objectid
= key
.offset
;
5384 cur_offset
= item_size
;
5387 dir_inode
= btrfs_iget(fs_info
->sb
, &inode_key
,
5389 /* If parent inode was deleted, skip it. */
5390 if (IS_ERR(dir_inode
))
5394 ctx
->log_new_dentries
= false;
5395 ret
= btrfs_log_inode(trans
, root
, BTRFS_I(dir_inode
),
5396 LOG_INODE_ALL
, 0, LLONG_MAX
, ctx
);
5398 btrfs_must_commit_transaction(trans
, BTRFS_I(dir_inode
)))
5400 if (!ret
&& ctx
&& ctx
->log_new_dentries
)
5401 ret
= log_new_dir_dentries(trans
, root
,
5402 BTRFS_I(dir_inode
), ctx
);
5411 btrfs_free_path(path
);
5416 * helper function around btrfs_log_inode to make sure newly created
5417 * parent directories also end up in the log. A minimal inode and backref
5418 * only logging is done of any parent directories that are older than
5419 * the last committed transaction
5421 static int btrfs_log_inode_parent(struct btrfs_trans_handle
*trans
,
5422 struct btrfs_root
*root
,
5423 struct btrfs_inode
*inode
,
5424 struct dentry
*parent
,
5428 struct btrfs_log_ctx
*ctx
)
5430 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5431 int inode_only
= exists_only
? LOG_INODE_EXISTS
: LOG_INODE_ALL
;
5432 struct super_block
*sb
;
5433 struct dentry
*old_parent
= NULL
;
5435 u64 last_committed
= fs_info
->last_trans_committed
;
5436 bool log_dentries
= false;
5437 struct btrfs_inode
*orig_inode
= inode
;
5439 sb
= inode
->vfs_inode
.i_sb
;
5441 if (btrfs_test_opt(fs_info
, NOTREELOG
)) {
5447 * The prev transaction commit doesn't complete, we need do
5448 * full commit by ourselves.
5450 if (fs_info
->last_trans_log_full_commit
>
5451 fs_info
->last_trans_committed
) {
5456 if (root
!= inode
->root
|| btrfs_root_refs(&root
->root_item
) == 0) {
5461 ret
= check_parent_dirs_for_sync(trans
, inode
, parent
, sb
,
5466 if (btrfs_inode_in_log(inode
, trans
->transid
)) {
5467 ret
= BTRFS_NO_LOG_SYNC
;
5471 ret
= start_log_trans(trans
, root
, ctx
);
5475 ret
= btrfs_log_inode(trans
, root
, inode
, inode_only
, start
, end
, ctx
);
5480 * for regular files, if its inode is already on disk, we don't
5481 * have to worry about the parents at all. This is because
5482 * we can use the last_unlink_trans field to record renames
5483 * and other fun in this file.
5485 if (S_ISREG(inode
->vfs_inode
.i_mode
) &&
5486 inode
->generation
<= last_committed
&&
5487 inode
->last_unlink_trans
<= last_committed
) {
5492 if (S_ISDIR(inode
->vfs_inode
.i_mode
) && ctx
&& ctx
->log_new_dentries
)
5493 log_dentries
= true;
5496 * On unlink we must make sure all our current and old parent directory
5497 * inodes are fully logged. This is to prevent leaving dangling
5498 * directory index entries in directories that were our parents but are
5499 * not anymore. Not doing this results in old parent directory being
5500 * impossible to delete after log replay (rmdir will always fail with
5501 * error -ENOTEMPTY).
5507 * ln testdir/foo testdir/bar
5509 * unlink testdir/bar
5510 * xfs_io -c fsync testdir/foo
5512 * mount fs, triggers log replay
5514 * If we don't log the parent directory (testdir), after log replay the
5515 * directory still has an entry pointing to the file inode using the bar
5516 * name, but a matching BTRFS_INODE_[REF|EXTREF]_KEY does not exist and
5517 * the file inode has a link count of 1.
5523 * ln foo testdir/foo2
5524 * ln foo testdir/foo3
5526 * unlink testdir/foo3
5527 * xfs_io -c fsync foo
5529 * mount fs, triggers log replay
5531 * Similar as the first example, after log replay the parent directory
5532 * testdir still has an entry pointing to the inode file with name foo3
5533 * but the file inode does not have a matching BTRFS_INODE_REF_KEY item
5534 * and has a link count of 2.
5536 if (inode
->last_unlink_trans
> last_committed
) {
5537 ret
= btrfs_log_all_parents(trans
, orig_inode
, ctx
);
5543 if (!parent
|| d_really_is_negative(parent
) || sb
!= parent
->d_sb
)
5546 inode
= BTRFS_I(d_inode(parent
));
5547 if (root
!= inode
->root
)
5550 if (inode
->generation
> last_committed
) {
5551 ret
= btrfs_log_inode(trans
, root
, inode
,
5552 LOG_INODE_EXISTS
, 0, LLONG_MAX
, ctx
);
5556 if (IS_ROOT(parent
))
5559 parent
= dget_parent(parent
);
5561 old_parent
= parent
;
5564 ret
= log_new_dir_dentries(trans
, root
, orig_inode
, ctx
);
5570 btrfs_set_log_full_commit(fs_info
, trans
);
5575 btrfs_remove_log_ctx(root
, ctx
);
5576 btrfs_end_log_trans(root
);
5582 * it is not safe to log dentry if the chunk root has added new
5583 * chunks. This returns 0 if the dentry was logged, and 1 otherwise.
5584 * If this returns 1, you must commit the transaction to safely get your
5587 int btrfs_log_dentry_safe(struct btrfs_trans_handle
*trans
,
5588 struct btrfs_root
*root
, struct dentry
*dentry
,
5591 struct btrfs_log_ctx
*ctx
)
5593 struct dentry
*parent
= dget_parent(dentry
);
5596 ret
= btrfs_log_inode_parent(trans
, root
, BTRFS_I(d_inode(dentry
)),
5597 parent
, start
, end
, 0, ctx
);
5604 * should be called during mount to recover any replay any log trees
5607 int btrfs_recover_log_trees(struct btrfs_root
*log_root_tree
)
5610 struct btrfs_path
*path
;
5611 struct btrfs_trans_handle
*trans
;
5612 struct btrfs_key key
;
5613 struct btrfs_key found_key
;
5614 struct btrfs_key tmp_key
;
5615 struct btrfs_root
*log
;
5616 struct btrfs_fs_info
*fs_info
= log_root_tree
->fs_info
;
5617 struct walk_control wc
= {
5618 .process_func
= process_one_buffer
,
5622 path
= btrfs_alloc_path();
5626 set_bit(BTRFS_FS_LOG_RECOVERING
, &fs_info
->flags
);
5628 trans
= btrfs_start_transaction(fs_info
->tree_root
, 0);
5629 if (IS_ERR(trans
)) {
5630 ret
= PTR_ERR(trans
);
5637 ret
= walk_log_tree(trans
, log_root_tree
, &wc
);
5639 btrfs_handle_fs_error(fs_info
, ret
,
5640 "Failed to pin buffers while recovering log root tree.");
5645 key
.objectid
= BTRFS_TREE_LOG_OBJECTID
;
5646 key
.offset
= (u64
)-1;
5647 key
.type
= BTRFS_ROOT_ITEM_KEY
;
5650 ret
= btrfs_search_slot(NULL
, log_root_tree
, &key
, path
, 0, 0);
5653 btrfs_handle_fs_error(fs_info
, ret
,
5654 "Couldn't find tree log root.");
5658 if (path
->slots
[0] == 0)
5662 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
5664 btrfs_release_path(path
);
5665 if (found_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
)
5668 log
= btrfs_read_fs_root(log_root_tree
, &found_key
);
5671 btrfs_handle_fs_error(fs_info
, ret
,
5672 "Couldn't read tree log root.");
5676 tmp_key
.objectid
= found_key
.offset
;
5677 tmp_key
.type
= BTRFS_ROOT_ITEM_KEY
;
5678 tmp_key
.offset
= (u64
)-1;
5680 wc
.replay_dest
= btrfs_read_fs_root_no_name(fs_info
, &tmp_key
);
5681 if (IS_ERR(wc
.replay_dest
)) {
5682 ret
= PTR_ERR(wc
.replay_dest
);
5683 free_extent_buffer(log
->node
);
5684 free_extent_buffer(log
->commit_root
);
5686 btrfs_handle_fs_error(fs_info
, ret
,
5687 "Couldn't read target root for tree log recovery.");
5691 wc
.replay_dest
->log_root
= log
;
5692 btrfs_record_root_in_trans(trans
, wc
.replay_dest
);
5693 ret
= walk_log_tree(trans
, log
, &wc
);
5695 if (!ret
&& wc
.stage
== LOG_WALK_REPLAY_ALL
) {
5696 ret
= fixup_inode_link_counts(trans
, wc
.replay_dest
,
5700 key
.offset
= found_key
.offset
- 1;
5701 wc
.replay_dest
->log_root
= NULL
;
5702 free_extent_buffer(log
->node
);
5703 free_extent_buffer(log
->commit_root
);
5709 if (found_key
.offset
== 0)
5712 btrfs_release_path(path
);
5714 /* step one is to pin it all, step two is to replay just inodes */
5717 wc
.process_func
= replay_one_buffer
;
5718 wc
.stage
= LOG_WALK_REPLAY_INODES
;
5721 /* step three is to replay everything */
5722 if (wc
.stage
< LOG_WALK_REPLAY_ALL
) {
5727 btrfs_free_path(path
);
5729 /* step 4: commit the transaction, which also unpins the blocks */
5730 ret
= btrfs_commit_transaction(trans
);
5734 free_extent_buffer(log_root_tree
->node
);
5735 log_root_tree
->log_root
= NULL
;
5736 clear_bit(BTRFS_FS_LOG_RECOVERING
, &fs_info
->flags
);
5737 kfree(log_root_tree
);
5742 btrfs_end_transaction(wc
.trans
);
5743 btrfs_free_path(path
);
5748 * there are some corner cases where we want to force a full
5749 * commit instead of allowing a directory to be logged.
5751 * They revolve around files there were unlinked from the directory, and
5752 * this function updates the parent directory so that a full commit is
5753 * properly done if it is fsync'd later after the unlinks are done.
5755 * Must be called before the unlink operations (updates to the subvolume tree,
5756 * inodes, etc) are done.
5758 void btrfs_record_unlink_dir(struct btrfs_trans_handle
*trans
,
5759 struct btrfs_inode
*dir
, struct btrfs_inode
*inode
,
5763 * when we're logging a file, if it hasn't been renamed
5764 * or unlinked, and its inode is fully committed on disk,
5765 * we don't have to worry about walking up the directory chain
5766 * to log its parents.
5768 * So, we use the last_unlink_trans field to put this transid
5769 * into the file. When the file is logged we check it and
5770 * don't log the parents if the file is fully on disk.
5772 mutex_lock(&inode
->log_mutex
);
5773 inode
->last_unlink_trans
= trans
->transid
;
5774 mutex_unlock(&inode
->log_mutex
);
5777 * if this directory was already logged any new
5778 * names for this file/dir will get recorded
5781 if (dir
->logged_trans
== trans
->transid
)
5785 * if the inode we're about to unlink was logged,
5786 * the log will be properly updated for any new names
5788 if (inode
->logged_trans
== trans
->transid
)
5792 * when renaming files across directories, if the directory
5793 * there we're unlinking from gets fsync'd later on, there's
5794 * no way to find the destination directory later and fsync it
5795 * properly. So, we have to be conservative and force commits
5796 * so the new name gets discovered.
5801 /* we can safely do the unlink without any special recording */
5805 mutex_lock(&dir
->log_mutex
);
5806 dir
->last_unlink_trans
= trans
->transid
;
5807 mutex_unlock(&dir
->log_mutex
);
5811 * Make sure that if someone attempts to fsync the parent directory of a deleted
5812 * snapshot, it ends up triggering a transaction commit. This is to guarantee
5813 * that after replaying the log tree of the parent directory's root we will not
5814 * see the snapshot anymore and at log replay time we will not see any log tree
5815 * corresponding to the deleted snapshot's root, which could lead to replaying
5816 * it after replaying the log tree of the parent directory (which would replay
5817 * the snapshot delete operation).
5819 * Must be called before the actual snapshot destroy operation (updates to the
5820 * parent root and tree of tree roots trees, etc) are done.
5822 void btrfs_record_snapshot_destroy(struct btrfs_trans_handle
*trans
,
5823 struct btrfs_inode
*dir
)
5825 mutex_lock(&dir
->log_mutex
);
5826 dir
->last_unlink_trans
= trans
->transid
;
5827 mutex_unlock(&dir
->log_mutex
);
5831 * Call this after adding a new name for a file and it will properly
5832 * update the log to reflect the new name.
5834 * It will return zero if all goes well, and it will return 1 if a
5835 * full transaction commit is required.
5837 int btrfs_log_new_name(struct btrfs_trans_handle
*trans
,
5838 struct btrfs_inode
*inode
, struct btrfs_inode
*old_dir
,
5839 struct dentry
*parent
)
5841 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
5842 struct btrfs_root
*root
= inode
->root
;
5845 * this will force the logging code to walk the dentry chain
5848 if (S_ISREG(inode
->vfs_inode
.i_mode
))
5849 inode
->last_unlink_trans
= trans
->transid
;
5852 * if this inode hasn't been logged and directory we're renaming it
5853 * from hasn't been logged, we don't need to log it
5855 if (inode
->logged_trans
<= fs_info
->last_trans_committed
&&
5856 (!old_dir
|| old_dir
->logged_trans
<= fs_info
->last_trans_committed
))
5859 return btrfs_log_inode_parent(trans
, root
, inode
, parent
, 0,
5860 LLONG_MAX
, 1, NULL
);