1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2008 Oracle. All rights reserved.
6 #include <linux/sched.h>
7 #include <linux/slab.h>
8 #include <linux/blkdev.h>
9 #include <linux/list_sort.h>
10 #include <linux/iversion.h>
16 #include "print-tree.h"
18 #include "compression.h"
20 #include "block-group.h"
21 #include "space-info.h"
24 /* magic values for the inode_only field in btrfs_log_inode:
26 * LOG_INODE_ALL means to log everything
27 * LOG_INODE_EXISTS means to log just enough to recreate the inode
38 * directory trouble cases
40 * 1) on rename or unlink, if the inode being unlinked isn't in the fsync
41 * log, we must force a full commit before doing an fsync of the directory
42 * where the unlink was done.
43 * ---> record transid of last unlink/rename per directory
47 * rename foo/some_dir foo2/some_dir
49 * fsync foo/some_dir/some_file
51 * The fsync above will unlink the original some_dir without recording
52 * it in its new location (foo2). After a crash, some_dir will be gone
53 * unless the fsync of some_file forces a full commit
55 * 2) we must log any new names for any file or dir that is in the fsync
56 * log. ---> check inode while renaming/linking.
58 * 2a) we must log any new names for any file or dir during rename
59 * when the directory they are being removed from was logged.
60 * ---> check inode and old parent dir during rename
62 * 2a is actually the more important variant. With the extra logging
63 * a crash might unlink the old name without recreating the new one
65 * 3) after a crash, we must go through any directories with a link count
66 * of zero and redo the rm -rf
73 * The directory f1 was fully removed from the FS, but fsync was never
74 * called on f1, only its parent dir. After a crash the rm -rf must
75 * be replayed. This must be able to recurse down the entire
76 * directory tree. The inode link count fixup code takes care of the
81 * stages for the tree walking. The first
82 * stage (0) is to only pin down the blocks we find
83 * the second stage (1) is to make sure that all the inodes
84 * we find in the log are created in the subvolume.
86 * The last stage is to deal with directories and links and extents
87 * and all the other fun semantics
91 LOG_WALK_REPLAY_INODES,
92 LOG_WALK_REPLAY_DIR_INDEX,
96 static int btrfs_log_inode(struct btrfs_trans_handle *trans,
97 struct btrfs_root *root, struct btrfs_inode *inode,
99 struct btrfs_log_ctx *ctx);
100 static int link_to_fixup_dir(struct btrfs_trans_handle *trans,
101 struct btrfs_root *root,
102 struct btrfs_path *path, u64 objectid);
103 static noinline int replay_dir_deletes(struct btrfs_trans_handle *trans,
104 struct btrfs_root *root,
105 struct btrfs_root *log,
106 struct btrfs_path *path,
107 u64 dirid, int del_all);
108 static void wait_log_commit(struct btrfs_root *root, int transid);
111 * tree logging is a special write ahead log used to make sure that
112 * fsyncs and O_SYNCs can happen without doing full tree commits.
114 * Full tree commits are expensive because they require commonly
115 * modified blocks to be recowed, creating many dirty pages in the
116 * extent tree an 4x-6x higher write load than ext3.
118 * Instead of doing a tree commit on every fsync, we use the
119 * key ranges and transaction ids to find items for a given file or directory
120 * that have changed in this transaction. Those items are copied into
121 * a special tree (one per subvolume root), that tree is written to disk
122 * and then the fsync is considered complete.
124 * After a crash, items are copied out of the log-tree back into the
125 * subvolume tree. Any file data extents found are recorded in the extent
126 * allocation tree, and the log-tree freed.
128 * The log tree is read three times, once to pin down all the extents it is
129 * using in ram and once, once to create all the inodes logged in the tree
130 * and once to do all the other items.
134 * start a sub transaction and setup the log tree
135 * this increments the log tree writer count to make the people
136 * syncing the tree wait for us to finish
138 static int start_log_trans(struct btrfs_trans_handle *trans,
139 struct btrfs_root *root,
140 struct btrfs_log_ctx *ctx)
142 struct btrfs_fs_info *fs_info = root->fs_info;
143 struct btrfs_root *tree_root = fs_info->tree_root;
144 const bool zoned = btrfs_is_zoned(fs_info);
146 bool created = false;
149 * First check if the log root tree was already created. If not, create
150 * it before locking the root's log_mutex, just to keep lockdep happy.
152 if (!test_bit(BTRFS_ROOT_HAS_LOG_TREE, &tree_root->state)) {
153 mutex_lock(&tree_root->log_mutex);
154 if (!fs_info->log_root_tree) {
155 ret = btrfs_init_log_root_tree(trans, fs_info);
157 set_bit(BTRFS_ROOT_HAS_LOG_TREE, &tree_root->state);
161 mutex_unlock(&tree_root->log_mutex);
166 mutex_lock(&root->log_mutex);
169 if (root->log_root) {
170 int index = (root->log_transid + 1) % 2;
172 if (btrfs_need_log_full_commit(trans)) {
177 if (zoned && atomic_read(&root->log_commit[index])) {
178 wait_log_commit(root, root->log_transid - 1);
182 if (!root->log_start_pid) {
183 clear_bit(BTRFS_ROOT_MULTI_LOG_TASKS, &root->state);
184 root->log_start_pid = current->pid;
185 } else if (root->log_start_pid != current->pid) {
186 set_bit(BTRFS_ROOT_MULTI_LOG_TASKS, &root->state);
190 * This means fs_info->log_root_tree was already created
191 * for some other FS trees. Do the full commit not to mix
192 * nodes from multiple log transactions to do sequential
195 if (zoned && !created) {
200 ret = btrfs_add_log_tree(trans, root);
204 set_bit(BTRFS_ROOT_HAS_LOG_TREE, &root->state);
205 clear_bit(BTRFS_ROOT_MULTI_LOG_TASKS, &root->state);
206 root->log_start_pid = current->pid;
209 atomic_inc(&root->log_writers);
210 if (ctx && !ctx->logging_new_name) {
211 int index = root->log_transid % 2;
212 list_add_tail(&ctx->list, &root->log_ctxs[index]);
213 ctx->log_transid = root->log_transid;
217 mutex_unlock(&root->log_mutex);
222 * returns 0 if there was a log transaction running and we were able
223 * to join, or returns -ENOENT if there were not transactions
226 static int join_running_log_trans(struct btrfs_root *root)
228 const bool zoned = btrfs_is_zoned(root->fs_info);
231 if (!test_bit(BTRFS_ROOT_HAS_LOG_TREE, &root->state))
234 mutex_lock(&root->log_mutex);
236 if (root->log_root) {
237 int index = (root->log_transid + 1) % 2;
240 if (zoned && atomic_read(&root->log_commit[index])) {
241 wait_log_commit(root, root->log_transid - 1);
244 atomic_inc(&root->log_writers);
246 mutex_unlock(&root->log_mutex);
251 * This either makes the current running log transaction wait
252 * until you call btrfs_end_log_trans() or it makes any future
253 * log transactions wait until you call btrfs_end_log_trans()
255 void btrfs_pin_log_trans(struct btrfs_root *root)
257 atomic_inc(&root->log_writers);
261 * indicate we're done making changes to the log tree
262 * and wake up anyone waiting to do a sync
264 void btrfs_end_log_trans(struct btrfs_root *root)
266 if (atomic_dec_and_test(&root->log_writers)) {
267 /* atomic_dec_and_test implies a barrier */
268 cond_wake_up_nomb(&root->log_writer_wait);
272 static int btrfs_write_tree_block(struct extent_buffer *buf)
274 return filemap_fdatawrite_range(buf->pages[0]->mapping, buf->start,
275 buf->start + buf->len - 1);
278 static void btrfs_wait_tree_block_writeback(struct extent_buffer *buf)
280 filemap_fdatawait_range(buf->pages[0]->mapping,
281 buf->start, buf->start + buf->len - 1);
285 * the walk control struct is used to pass state down the chain when
286 * processing the log tree. The stage field tells us which part
287 * of the log tree processing we are currently doing. The others
288 * are state fields used for that specific part
290 struct walk_control {
291 /* should we free the extent on disk when done? This is used
292 * at transaction commit time while freeing a log tree
296 /* should we write out the extent buffer? This is used
297 * while flushing the log tree to disk during a sync
301 /* should we wait for the extent buffer io to finish? Also used
302 * while flushing the log tree to disk for a sync
306 /* pin only walk, we record which extents on disk belong to the
311 /* what stage of the replay code we're currently in */
315 * Ignore any items from the inode currently being processed. Needs
316 * to be set every time we find a BTRFS_INODE_ITEM_KEY and we are in
317 * the LOG_WALK_REPLAY_INODES stage.
319 bool ignore_cur_inode;
321 /* the root we are currently replaying */
322 struct btrfs_root *replay_dest;
324 /* the trans handle for the current replay */
325 struct btrfs_trans_handle *trans;
327 /* the function that gets used to process blocks we find in the
328 * tree. Note the extent_buffer might not be up to date when it is
329 * passed in, and it must be checked or read if you need the data
332 int (*process_func)(struct btrfs_root *log, struct extent_buffer *eb,
333 struct walk_control *wc, u64 gen, int level);
337 * process_func used to pin down extents, write them or wait on them
339 static int process_one_buffer(struct btrfs_root *log,
340 struct extent_buffer *eb,
341 struct walk_control *wc, u64 gen, int level)
343 struct btrfs_fs_info *fs_info = log->fs_info;
347 * If this fs is mixed then we need to be able to process the leaves to
348 * pin down any logged extents, so we have to read the block.
350 if (btrfs_fs_incompat(fs_info, MIXED_GROUPS)) {
351 ret = btrfs_read_buffer(eb, gen, level, NULL);
357 ret = btrfs_pin_extent_for_log_replay(wc->trans, eb->start,
360 if (!ret && btrfs_buffer_uptodate(eb, gen, 0)) {
361 if (wc->pin && btrfs_header_level(eb) == 0)
362 ret = btrfs_exclude_logged_extents(eb);
364 btrfs_write_tree_block(eb);
366 btrfs_wait_tree_block_writeback(eb);
372 * Item overwrite used by replay and tree logging. eb, slot and key all refer
373 * to the src data we are copying out.
375 * root is the tree we are copying into, and path is a scratch
376 * path for use in this function (it should be released on entry and
377 * will be released on exit).
379 * If the key is already in the destination tree the existing item is
380 * overwritten. If the existing item isn't big enough, it is extended.
381 * If it is too large, it is truncated.
383 * If the key isn't in the destination yet, a new item is inserted.
385 static noinline int overwrite_item(struct btrfs_trans_handle *trans,
386 struct btrfs_root *root,
387 struct btrfs_path *path,
388 struct extent_buffer *eb, int slot,
389 struct btrfs_key *key)
393 u64 saved_i_size = 0;
394 int save_old_i_size = 0;
395 unsigned long src_ptr;
396 unsigned long dst_ptr;
397 int overwrite_root = 0;
398 bool inode_item = key->type == BTRFS_INODE_ITEM_KEY;
400 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID)
403 item_size = btrfs_item_size_nr(eb, slot);
404 src_ptr = btrfs_item_ptr_offset(eb, slot);
406 /* look for the key in the destination tree */
407 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
414 u32 dst_size = btrfs_item_size_nr(path->nodes[0],
416 if (dst_size != item_size)
419 if (item_size == 0) {
420 btrfs_release_path(path);
423 dst_copy = kmalloc(item_size, GFP_NOFS);
424 src_copy = kmalloc(item_size, GFP_NOFS);
425 if (!dst_copy || !src_copy) {
426 btrfs_release_path(path);
432 read_extent_buffer(eb, src_copy, src_ptr, item_size);
434 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], path->slots[0]);
435 read_extent_buffer(path->nodes[0], dst_copy, dst_ptr,
437 ret = memcmp(dst_copy, src_copy, item_size);
442 * they have the same contents, just return, this saves
443 * us from cowing blocks in the destination tree and doing
444 * extra writes that may not have been done by a previous
448 btrfs_release_path(path);
453 * We need to load the old nbytes into the inode so when we
454 * replay the extents we've logged we get the right nbytes.
457 struct btrfs_inode_item *item;
461 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
462 struct btrfs_inode_item);
463 nbytes = btrfs_inode_nbytes(path->nodes[0], item);
464 item = btrfs_item_ptr(eb, slot,
465 struct btrfs_inode_item);
466 btrfs_set_inode_nbytes(eb, item, nbytes);
469 * If this is a directory we need to reset the i_size to
470 * 0 so that we can set it up properly when replaying
471 * the rest of the items in this log.
473 mode = btrfs_inode_mode(eb, item);
475 btrfs_set_inode_size(eb, item, 0);
477 } else if (inode_item) {
478 struct btrfs_inode_item *item;
482 * New inode, set nbytes to 0 so that the nbytes comes out
483 * properly when we replay the extents.
485 item = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
486 btrfs_set_inode_nbytes(eb, item, 0);
489 * If this is a directory we need to reset the i_size to 0 so
490 * that we can set it up properly when replaying the rest of
491 * the items in this log.
493 mode = btrfs_inode_mode(eb, item);
495 btrfs_set_inode_size(eb, item, 0);
498 btrfs_release_path(path);
499 /* try to insert the key into the destination tree */
500 path->skip_release_on_error = 1;
501 ret = btrfs_insert_empty_item(trans, root, path,
503 path->skip_release_on_error = 0;
505 /* make sure any existing item is the correct size */
506 if (ret == -EEXIST || ret == -EOVERFLOW) {
508 found_size = btrfs_item_size_nr(path->nodes[0],
510 if (found_size > item_size)
511 btrfs_truncate_item(path, item_size, 1);
512 else if (found_size < item_size)
513 btrfs_extend_item(path, item_size - found_size);
517 dst_ptr = btrfs_item_ptr_offset(path->nodes[0],
520 /* don't overwrite an existing inode if the generation number
521 * was logged as zero. This is done when the tree logging code
522 * is just logging an inode to make sure it exists after recovery.
524 * Also, don't overwrite i_size on directories during replay.
525 * log replay inserts and removes directory items based on the
526 * state of the tree found in the subvolume, and i_size is modified
529 if (key->type == BTRFS_INODE_ITEM_KEY && ret == -EEXIST) {
530 struct btrfs_inode_item *src_item;
531 struct btrfs_inode_item *dst_item;
533 src_item = (struct btrfs_inode_item *)src_ptr;
534 dst_item = (struct btrfs_inode_item *)dst_ptr;
536 if (btrfs_inode_generation(eb, src_item) == 0) {
537 struct extent_buffer *dst_eb = path->nodes[0];
538 const u64 ino_size = btrfs_inode_size(eb, src_item);
541 * For regular files an ino_size == 0 is used only when
542 * logging that an inode exists, as part of a directory
543 * fsync, and the inode wasn't fsynced before. In this
544 * case don't set the size of the inode in the fs/subvol
545 * tree, otherwise we would be throwing valid data away.
547 if (S_ISREG(btrfs_inode_mode(eb, src_item)) &&
548 S_ISREG(btrfs_inode_mode(dst_eb, dst_item)) &&
550 btrfs_set_inode_size(dst_eb, dst_item, ino_size);
554 if (overwrite_root &&
555 S_ISDIR(btrfs_inode_mode(eb, src_item)) &&
556 S_ISDIR(btrfs_inode_mode(path->nodes[0], dst_item))) {
558 saved_i_size = btrfs_inode_size(path->nodes[0],
563 copy_extent_buffer(path->nodes[0], eb, dst_ptr,
566 if (save_old_i_size) {
567 struct btrfs_inode_item *dst_item;
568 dst_item = (struct btrfs_inode_item *)dst_ptr;
569 btrfs_set_inode_size(path->nodes[0], dst_item, saved_i_size);
572 /* make sure the generation is filled in */
573 if (key->type == BTRFS_INODE_ITEM_KEY) {
574 struct btrfs_inode_item *dst_item;
575 dst_item = (struct btrfs_inode_item *)dst_ptr;
576 if (btrfs_inode_generation(path->nodes[0], dst_item) == 0) {
577 btrfs_set_inode_generation(path->nodes[0], dst_item,
582 btrfs_mark_buffer_dirty(path->nodes[0]);
583 btrfs_release_path(path);
588 * simple helper to read an inode off the disk from a given root
589 * This can only be called for subvolume roots and not for the log
591 static noinline struct inode *read_one_inode(struct btrfs_root *root,
596 inode = btrfs_iget(root->fs_info->sb, objectid, root);
602 /* replays a single extent in 'eb' at 'slot' with 'key' into the
603 * subvolume 'root'. path is released on entry and should be released
606 * extents in the log tree have not been allocated out of the extent
607 * tree yet. So, this completes the allocation, taking a reference
608 * as required if the extent already exists or creating a new extent
609 * if it isn't in the extent allocation tree yet.
611 * The extent is inserted into the file, dropping any existing extents
612 * from the file that overlap the new one.
614 static noinline int replay_one_extent(struct btrfs_trans_handle *trans,
615 struct btrfs_root *root,
616 struct btrfs_path *path,
617 struct extent_buffer *eb, int slot,
618 struct btrfs_key *key)
620 struct btrfs_drop_extents_args drop_args = { 0 };
621 struct btrfs_fs_info *fs_info = root->fs_info;
624 u64 start = key->offset;
626 struct btrfs_file_extent_item *item;
627 struct inode *inode = NULL;
631 item = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
632 found_type = btrfs_file_extent_type(eb, item);
634 if (found_type == BTRFS_FILE_EXTENT_REG ||
635 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
636 nbytes = btrfs_file_extent_num_bytes(eb, item);
637 extent_end = start + nbytes;
640 * We don't add to the inodes nbytes if we are prealloc or a
643 if (btrfs_file_extent_disk_bytenr(eb, item) == 0)
645 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
646 size = btrfs_file_extent_ram_bytes(eb, item);
647 nbytes = btrfs_file_extent_ram_bytes(eb, item);
648 extent_end = ALIGN(start + size,
649 fs_info->sectorsize);
655 inode = read_one_inode(root, key->objectid);
662 * first check to see if we already have this extent in the
663 * file. This must be done before the btrfs_drop_extents run
664 * so we don't try to drop this extent.
666 ret = btrfs_lookup_file_extent(trans, root, path,
667 btrfs_ino(BTRFS_I(inode)), start, 0);
670 (found_type == BTRFS_FILE_EXTENT_REG ||
671 found_type == BTRFS_FILE_EXTENT_PREALLOC)) {
672 struct btrfs_file_extent_item cmp1;
673 struct btrfs_file_extent_item cmp2;
674 struct btrfs_file_extent_item *existing;
675 struct extent_buffer *leaf;
677 leaf = path->nodes[0];
678 existing = btrfs_item_ptr(leaf, path->slots[0],
679 struct btrfs_file_extent_item);
681 read_extent_buffer(eb, &cmp1, (unsigned long)item,
683 read_extent_buffer(leaf, &cmp2, (unsigned long)existing,
687 * we already have a pointer to this exact extent,
688 * we don't have to do anything
690 if (memcmp(&cmp1, &cmp2, sizeof(cmp1)) == 0) {
691 btrfs_release_path(path);
695 btrfs_release_path(path);
697 /* drop any overlapping extents */
698 drop_args.start = start;
699 drop_args.end = extent_end;
700 drop_args.drop_cache = true;
701 ret = btrfs_drop_extents(trans, root, BTRFS_I(inode), &drop_args);
705 if (found_type == BTRFS_FILE_EXTENT_REG ||
706 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
708 unsigned long dest_offset;
709 struct btrfs_key ins;
711 if (btrfs_file_extent_disk_bytenr(eb, item) == 0 &&
712 btrfs_fs_incompat(fs_info, NO_HOLES))
715 ret = btrfs_insert_empty_item(trans, root, path, key,
719 dest_offset = btrfs_item_ptr_offset(path->nodes[0],
721 copy_extent_buffer(path->nodes[0], eb, dest_offset,
722 (unsigned long)item, sizeof(*item));
724 ins.objectid = btrfs_file_extent_disk_bytenr(eb, item);
725 ins.offset = btrfs_file_extent_disk_num_bytes(eb, item);
726 ins.type = BTRFS_EXTENT_ITEM_KEY;
727 offset = key->offset - btrfs_file_extent_offset(eb, item);
730 * Manually record dirty extent, as here we did a shallow
731 * file extent item copy and skip normal backref update,
732 * but modifying extent tree all by ourselves.
733 * So need to manually record dirty extent for qgroup,
734 * as the owner of the file extent changed from log tree
735 * (doesn't affect qgroup) to fs/file tree(affects qgroup)
737 ret = btrfs_qgroup_trace_extent(trans,
738 btrfs_file_extent_disk_bytenr(eb, item),
739 btrfs_file_extent_disk_num_bytes(eb, item),
744 if (ins.objectid > 0) {
745 struct btrfs_ref ref = { 0 };
748 LIST_HEAD(ordered_sums);
751 * is this extent already allocated in the extent
752 * allocation tree? If so, just add a reference
754 ret = btrfs_lookup_data_extent(fs_info, ins.objectid,
757 btrfs_init_generic_ref(&ref,
758 BTRFS_ADD_DELAYED_REF,
759 ins.objectid, ins.offset, 0);
760 btrfs_init_data_ref(&ref,
761 root->root_key.objectid,
762 key->objectid, offset);
763 ret = btrfs_inc_extent_ref(trans, &ref);
768 * insert the extent pointer in the extent
771 ret = btrfs_alloc_logged_file_extent(trans,
772 root->root_key.objectid,
773 key->objectid, offset, &ins);
777 btrfs_release_path(path);
779 if (btrfs_file_extent_compression(eb, item)) {
780 csum_start = ins.objectid;
781 csum_end = csum_start + ins.offset;
783 csum_start = ins.objectid +
784 btrfs_file_extent_offset(eb, item);
785 csum_end = csum_start +
786 btrfs_file_extent_num_bytes(eb, item);
789 ret = btrfs_lookup_csums_range(root->log_root,
790 csum_start, csum_end - 1,
795 * Now delete all existing cums in the csum root that
796 * cover our range. We do this because we can have an
797 * extent that is completely referenced by one file
798 * extent item and partially referenced by another
799 * file extent item (like after using the clone or
800 * extent_same ioctls). In this case if we end up doing
801 * the replay of the one that partially references the
802 * extent first, and we do not do the csum deletion
803 * below, we can get 2 csum items in the csum tree that
804 * overlap each other. For example, imagine our log has
805 * the two following file extent items:
807 * key (257 EXTENT_DATA 409600)
808 * extent data disk byte 12845056 nr 102400
809 * extent data offset 20480 nr 20480 ram 102400
811 * key (257 EXTENT_DATA 819200)
812 * extent data disk byte 12845056 nr 102400
813 * extent data offset 0 nr 102400 ram 102400
815 * Where the second one fully references the 100K extent
816 * that starts at disk byte 12845056, and the log tree
817 * has a single csum item that covers the entire range
820 * key (EXTENT_CSUM EXTENT_CSUM 12845056) itemsize 100
822 * After the first file extent item is replayed, the
823 * csum tree gets the following csum item:
825 * key (EXTENT_CSUM EXTENT_CSUM 12865536) itemsize 20
827 * Which covers the 20K sub-range starting at offset 20K
828 * of our extent. Now when we replay the second file
829 * extent item, if we do not delete existing csum items
830 * that cover any of its blocks, we end up getting two
831 * csum items in our csum tree that overlap each other:
833 * key (EXTENT_CSUM EXTENT_CSUM 12845056) itemsize 100
834 * key (EXTENT_CSUM EXTENT_CSUM 12865536) itemsize 20
836 * Which is a problem, because after this anyone trying
837 * to lookup up for the checksum of any block of our
838 * extent starting at an offset of 40K or higher, will
839 * end up looking at the second csum item only, which
840 * does not contain the checksum for any block starting
841 * at offset 40K or higher of our extent.
843 while (!list_empty(&ordered_sums)) {
844 struct btrfs_ordered_sum *sums;
845 sums = list_entry(ordered_sums.next,
846 struct btrfs_ordered_sum,
849 ret = btrfs_del_csums(trans,
854 ret = btrfs_csum_file_blocks(trans,
855 fs_info->csum_root, sums);
856 list_del(&sums->list);
862 btrfs_release_path(path);
864 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
865 /* inline extents are easy, we just overwrite them */
866 ret = overwrite_item(trans, root, path, eb, slot, key);
871 ret = btrfs_inode_set_file_extent_range(BTRFS_I(inode), start,
877 btrfs_update_inode_bytes(BTRFS_I(inode), nbytes, drop_args.bytes_found);
878 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
886 * when cleaning up conflicts between the directory names in the
887 * subvolume, directory names in the log and directory names in the
888 * inode back references, we may have to unlink inodes from directories.
890 * This is a helper function to do the unlink of a specific directory
893 static noinline int drop_one_dir_item(struct btrfs_trans_handle *trans,
894 struct btrfs_root *root,
895 struct btrfs_path *path,
896 struct btrfs_inode *dir,
897 struct btrfs_dir_item *di)
902 struct extent_buffer *leaf;
903 struct btrfs_key location;
906 leaf = path->nodes[0];
908 btrfs_dir_item_key_to_cpu(leaf, di, &location);
909 name_len = btrfs_dir_name_len(leaf, di);
910 name = kmalloc(name_len, GFP_NOFS);
914 read_extent_buffer(leaf, name, (unsigned long)(di + 1), name_len);
915 btrfs_release_path(path);
917 inode = read_one_inode(root, location.objectid);
923 ret = link_to_fixup_dir(trans, root, path, location.objectid);
927 ret = btrfs_unlink_inode(trans, root, dir, BTRFS_I(inode), name,
932 ret = btrfs_run_delayed_items(trans);
940 * helper function to see if a given name and sequence number found
941 * in an inode back reference are already in a directory and correctly
942 * point to this inode
944 static noinline int inode_in_dir(struct btrfs_root *root,
945 struct btrfs_path *path,
946 u64 dirid, u64 objectid, u64 index,
947 const char *name, int name_len)
949 struct btrfs_dir_item *di;
950 struct btrfs_key location;
953 di = btrfs_lookup_dir_index_item(NULL, root, path, dirid,
954 index, name, name_len, 0);
955 if (di && !IS_ERR(di)) {
956 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
957 if (location.objectid != objectid)
961 btrfs_release_path(path);
963 di = btrfs_lookup_dir_item(NULL, root, path, dirid, name, name_len, 0);
964 if (di && !IS_ERR(di)) {
965 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
966 if (location.objectid != objectid)
972 btrfs_release_path(path);
977 * helper function to check a log tree for a named back reference in
978 * an inode. This is used to decide if a back reference that is
979 * found in the subvolume conflicts with what we find in the log.
981 * inode backreferences may have multiple refs in a single item,
982 * during replay we process one reference at a time, and we don't
983 * want to delete valid links to a file from the subvolume if that
984 * link is also in the log.
986 static noinline int backref_in_log(struct btrfs_root *log,
987 struct btrfs_key *key,
989 const char *name, int namelen)
991 struct btrfs_path *path;
994 path = btrfs_alloc_path();
998 ret = btrfs_search_slot(NULL, log, key, path, 0, 0);
1001 } else if (ret == 1) {
1006 if (key->type == BTRFS_INODE_EXTREF_KEY)
1007 ret = !!btrfs_find_name_in_ext_backref(path->nodes[0],
1012 ret = !!btrfs_find_name_in_backref(path->nodes[0],
1016 btrfs_free_path(path);
1020 static inline int __add_inode_ref(struct btrfs_trans_handle *trans,
1021 struct btrfs_root *root,
1022 struct btrfs_path *path,
1023 struct btrfs_root *log_root,
1024 struct btrfs_inode *dir,
1025 struct btrfs_inode *inode,
1026 u64 inode_objectid, u64 parent_objectid,
1027 u64 ref_index, char *name, int namelen,
1032 int victim_name_len;
1033 struct extent_buffer *leaf;
1034 struct btrfs_dir_item *di;
1035 struct btrfs_key search_key;
1036 struct btrfs_inode_extref *extref;
1039 /* Search old style refs */
1040 search_key.objectid = inode_objectid;
1041 search_key.type = BTRFS_INODE_REF_KEY;
1042 search_key.offset = parent_objectid;
1043 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
1045 struct btrfs_inode_ref *victim_ref;
1047 unsigned long ptr_end;
1049 leaf = path->nodes[0];
1051 /* are we trying to overwrite a back ref for the root directory
1052 * if so, just jump out, we're done
1054 if (search_key.objectid == search_key.offset)
1057 /* check all the names in this back reference to see
1058 * if they are in the log. if so, we allow them to stay
1059 * otherwise they must be unlinked as a conflict
1061 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
1062 ptr_end = ptr + btrfs_item_size_nr(leaf, path->slots[0]);
1063 while (ptr < ptr_end) {
1064 victim_ref = (struct btrfs_inode_ref *)ptr;
1065 victim_name_len = btrfs_inode_ref_name_len(leaf,
1067 victim_name = kmalloc(victim_name_len, GFP_NOFS);
1071 read_extent_buffer(leaf, victim_name,
1072 (unsigned long)(victim_ref + 1),
1075 ret = backref_in_log(log_root, &search_key,
1076 parent_objectid, victim_name,
1082 inc_nlink(&inode->vfs_inode);
1083 btrfs_release_path(path);
1085 ret = btrfs_unlink_inode(trans, root, dir, inode,
1086 victim_name, victim_name_len);
1090 ret = btrfs_run_delayed_items(trans);
1098 ptr = (unsigned long)(victim_ref + 1) + victim_name_len;
1102 * NOTE: we have searched root tree and checked the
1103 * corresponding ref, it does not need to check again.
1107 btrfs_release_path(path);
1109 /* Same search but for extended refs */
1110 extref = btrfs_lookup_inode_extref(NULL, root, path, name, namelen,
1111 inode_objectid, parent_objectid, 0,
1113 if (!IS_ERR_OR_NULL(extref)) {
1117 struct inode *victim_parent;
1119 leaf = path->nodes[0];
1121 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1122 base = btrfs_item_ptr_offset(leaf, path->slots[0]);
1124 while (cur_offset < item_size) {
1125 extref = (struct btrfs_inode_extref *)(base + cur_offset);
1127 victim_name_len = btrfs_inode_extref_name_len(leaf, extref);
1129 if (btrfs_inode_extref_parent(leaf, extref) != parent_objectid)
1132 victim_name = kmalloc(victim_name_len, GFP_NOFS);
1135 read_extent_buffer(leaf, victim_name, (unsigned long)&extref->name,
1138 search_key.objectid = inode_objectid;
1139 search_key.type = BTRFS_INODE_EXTREF_KEY;
1140 search_key.offset = btrfs_extref_hash(parent_objectid,
1143 ret = backref_in_log(log_root, &search_key,
1144 parent_objectid, victim_name,
1150 victim_parent = read_one_inode(root,
1152 if (victim_parent) {
1153 inc_nlink(&inode->vfs_inode);
1154 btrfs_release_path(path);
1156 ret = btrfs_unlink_inode(trans, root,
1157 BTRFS_I(victim_parent),
1162 ret = btrfs_run_delayed_items(
1165 iput(victim_parent);
1174 cur_offset += victim_name_len + sizeof(*extref);
1178 btrfs_release_path(path);
1180 /* look for a conflicting sequence number */
1181 di = btrfs_lookup_dir_index_item(trans, root, path, btrfs_ino(dir),
1182 ref_index, name, namelen, 0);
1183 if (di && !IS_ERR(di)) {
1184 ret = drop_one_dir_item(trans, root, path, dir, di);
1188 btrfs_release_path(path);
1190 /* look for a conflicting name */
1191 di = btrfs_lookup_dir_item(trans, root, path, btrfs_ino(dir),
1193 if (di && !IS_ERR(di)) {
1194 ret = drop_one_dir_item(trans, root, path, dir, di);
1198 btrfs_release_path(path);
1203 static int extref_get_fields(struct extent_buffer *eb, unsigned long ref_ptr,
1204 u32 *namelen, char **name, u64 *index,
1205 u64 *parent_objectid)
1207 struct btrfs_inode_extref *extref;
1209 extref = (struct btrfs_inode_extref *)ref_ptr;
1211 *namelen = btrfs_inode_extref_name_len(eb, extref);
1212 *name = kmalloc(*namelen, GFP_NOFS);
1216 read_extent_buffer(eb, *name, (unsigned long)&extref->name,
1220 *index = btrfs_inode_extref_index(eb, extref);
1221 if (parent_objectid)
1222 *parent_objectid = btrfs_inode_extref_parent(eb, extref);
1227 static int ref_get_fields(struct extent_buffer *eb, unsigned long ref_ptr,
1228 u32 *namelen, char **name, u64 *index)
1230 struct btrfs_inode_ref *ref;
1232 ref = (struct btrfs_inode_ref *)ref_ptr;
1234 *namelen = btrfs_inode_ref_name_len(eb, ref);
1235 *name = kmalloc(*namelen, GFP_NOFS);
1239 read_extent_buffer(eb, *name, (unsigned long)(ref + 1), *namelen);
1242 *index = btrfs_inode_ref_index(eb, ref);
1248 * Take an inode reference item from the log tree and iterate all names from the
1249 * inode reference item in the subvolume tree with the same key (if it exists).
1250 * For any name that is not in the inode reference item from the log tree, do a
1251 * proper unlink of that name (that is, remove its entry from the inode
1252 * reference item and both dir index keys).
1254 static int unlink_old_inode_refs(struct btrfs_trans_handle *trans,
1255 struct btrfs_root *root,
1256 struct btrfs_path *path,
1257 struct btrfs_inode *inode,
1258 struct extent_buffer *log_eb,
1260 struct btrfs_key *key)
1263 unsigned long ref_ptr;
1264 unsigned long ref_end;
1265 struct extent_buffer *eb;
1268 btrfs_release_path(path);
1269 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
1277 eb = path->nodes[0];
1278 ref_ptr = btrfs_item_ptr_offset(eb, path->slots[0]);
1279 ref_end = ref_ptr + btrfs_item_size_nr(eb, path->slots[0]);
1280 while (ref_ptr < ref_end) {
1285 if (key->type == BTRFS_INODE_EXTREF_KEY) {
1286 ret = extref_get_fields(eb, ref_ptr, &namelen, &name,
1289 parent_id = key->offset;
1290 ret = ref_get_fields(eb, ref_ptr, &namelen, &name,
1296 if (key->type == BTRFS_INODE_EXTREF_KEY)
1297 ret = !!btrfs_find_name_in_ext_backref(log_eb, log_slot,
1301 ret = !!btrfs_find_name_in_backref(log_eb, log_slot,
1307 btrfs_release_path(path);
1308 dir = read_one_inode(root, parent_id);
1314 ret = btrfs_unlink_inode(trans, root, BTRFS_I(dir),
1315 inode, name, namelen);
1325 if (key->type == BTRFS_INODE_EXTREF_KEY)
1326 ref_ptr += sizeof(struct btrfs_inode_extref);
1328 ref_ptr += sizeof(struct btrfs_inode_ref);
1332 btrfs_release_path(path);
1336 static int btrfs_inode_ref_exists(struct inode *inode, struct inode *dir,
1337 const u8 ref_type, const char *name,
1340 struct btrfs_key key;
1341 struct btrfs_path *path;
1342 const u64 parent_id = btrfs_ino(BTRFS_I(dir));
1345 path = btrfs_alloc_path();
1349 key.objectid = btrfs_ino(BTRFS_I(inode));
1350 key.type = ref_type;
1351 if (key.type == BTRFS_INODE_REF_KEY)
1352 key.offset = parent_id;
1354 key.offset = btrfs_extref_hash(parent_id, name, namelen);
1356 ret = btrfs_search_slot(NULL, BTRFS_I(inode)->root, &key, path, 0, 0);
1363 if (key.type == BTRFS_INODE_EXTREF_KEY)
1364 ret = !!btrfs_find_name_in_ext_backref(path->nodes[0],
1365 path->slots[0], parent_id, name, namelen);
1367 ret = !!btrfs_find_name_in_backref(path->nodes[0], path->slots[0],
1371 btrfs_free_path(path);
1375 static int add_link(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1376 struct inode *dir, struct inode *inode, const char *name,
1377 int namelen, u64 ref_index)
1379 struct btrfs_dir_item *dir_item;
1380 struct btrfs_key key;
1381 struct btrfs_path *path;
1382 struct inode *other_inode = NULL;
1385 path = btrfs_alloc_path();
1389 dir_item = btrfs_lookup_dir_item(NULL, root, path,
1390 btrfs_ino(BTRFS_I(dir)),
1393 btrfs_release_path(path);
1395 } else if (IS_ERR(dir_item)) {
1396 ret = PTR_ERR(dir_item);
1401 * Our inode's dentry collides with the dentry of another inode which is
1402 * in the log but not yet processed since it has a higher inode number.
1403 * So delete that other dentry.
1405 btrfs_dir_item_key_to_cpu(path->nodes[0], dir_item, &key);
1406 btrfs_release_path(path);
1407 other_inode = read_one_inode(root, key.objectid);
1412 ret = btrfs_unlink_inode(trans, root, BTRFS_I(dir), BTRFS_I(other_inode),
1417 * If we dropped the link count to 0, bump it so that later the iput()
1418 * on the inode will not free it. We will fixup the link count later.
1420 if (other_inode->i_nlink == 0)
1421 inc_nlink(other_inode);
1423 ret = btrfs_run_delayed_items(trans);
1427 ret = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode),
1428 name, namelen, 0, ref_index);
1431 btrfs_free_path(path);
1437 * replay one inode back reference item found in the log tree.
1438 * eb, slot and key refer to the buffer and key found in the log tree.
1439 * root is the destination we are replaying into, and path is for temp
1440 * use by this function. (it should be released on return).
1442 static noinline int add_inode_ref(struct btrfs_trans_handle *trans,
1443 struct btrfs_root *root,
1444 struct btrfs_root *log,
1445 struct btrfs_path *path,
1446 struct extent_buffer *eb, int slot,
1447 struct btrfs_key *key)
1449 struct inode *dir = NULL;
1450 struct inode *inode = NULL;
1451 unsigned long ref_ptr;
1452 unsigned long ref_end;
1456 int search_done = 0;
1457 int log_ref_ver = 0;
1458 u64 parent_objectid;
1461 int ref_struct_size;
1463 ref_ptr = btrfs_item_ptr_offset(eb, slot);
1464 ref_end = ref_ptr + btrfs_item_size_nr(eb, slot);
1466 if (key->type == BTRFS_INODE_EXTREF_KEY) {
1467 struct btrfs_inode_extref *r;
1469 ref_struct_size = sizeof(struct btrfs_inode_extref);
1471 r = (struct btrfs_inode_extref *)ref_ptr;
1472 parent_objectid = btrfs_inode_extref_parent(eb, r);
1474 ref_struct_size = sizeof(struct btrfs_inode_ref);
1475 parent_objectid = key->offset;
1477 inode_objectid = key->objectid;
1480 * it is possible that we didn't log all the parent directories
1481 * for a given inode. If we don't find the dir, just don't
1482 * copy the back ref in. The link count fixup code will take
1485 dir = read_one_inode(root, parent_objectid);
1491 inode = read_one_inode(root, inode_objectid);
1497 while (ref_ptr < ref_end) {
1499 ret = extref_get_fields(eb, ref_ptr, &namelen, &name,
1500 &ref_index, &parent_objectid);
1502 * parent object can change from one array
1506 dir = read_one_inode(root, parent_objectid);
1512 ret = ref_get_fields(eb, ref_ptr, &namelen, &name,
1518 /* if we already have a perfect match, we're done */
1519 if (!inode_in_dir(root, path, btrfs_ino(BTRFS_I(dir)),
1520 btrfs_ino(BTRFS_I(inode)), ref_index,
1523 * look for a conflicting back reference in the
1524 * metadata. if we find one we have to unlink that name
1525 * of the file before we add our new link. Later on, we
1526 * overwrite any existing back reference, and we don't
1527 * want to create dangling pointers in the directory.
1531 ret = __add_inode_ref(trans, root, path, log,
1536 ref_index, name, namelen,
1546 * If a reference item already exists for this inode
1547 * with the same parent and name, but different index,
1548 * drop it and the corresponding directory index entries
1549 * from the parent before adding the new reference item
1550 * and dir index entries, otherwise we would fail with
1551 * -EEXIST returned from btrfs_add_link() below.
1553 ret = btrfs_inode_ref_exists(inode, dir, key->type,
1556 ret = btrfs_unlink_inode(trans, root,
1561 * If we dropped the link count to 0, bump it so
1562 * that later the iput() on the inode will not
1563 * free it. We will fixup the link count later.
1565 if (!ret && inode->i_nlink == 0)
1571 /* insert our name */
1572 ret = add_link(trans, root, dir, inode, name, namelen,
1577 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
1582 ref_ptr = (unsigned long)(ref_ptr + ref_struct_size) + namelen;
1592 * Before we overwrite the inode reference item in the subvolume tree
1593 * with the item from the log tree, we must unlink all names from the
1594 * parent directory that are in the subvolume's tree inode reference
1595 * item, otherwise we end up with an inconsistent subvolume tree where
1596 * dir index entries exist for a name but there is no inode reference
1597 * item with the same name.
1599 ret = unlink_old_inode_refs(trans, root, path, BTRFS_I(inode), eb, slot,
1604 /* finally write the back reference in the inode */
1605 ret = overwrite_item(trans, root, path, eb, slot, key);
1607 btrfs_release_path(path);
1614 static int count_inode_extrefs(struct btrfs_root *root,
1615 struct btrfs_inode *inode, struct btrfs_path *path)
1619 unsigned int nlink = 0;
1622 u64 inode_objectid = btrfs_ino(inode);
1625 struct btrfs_inode_extref *extref;
1626 struct extent_buffer *leaf;
1629 ret = btrfs_find_one_extref(root, inode_objectid, offset, path,
1634 leaf = path->nodes[0];
1635 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1636 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
1639 while (cur_offset < item_size) {
1640 extref = (struct btrfs_inode_extref *) (ptr + cur_offset);
1641 name_len = btrfs_inode_extref_name_len(leaf, extref);
1645 cur_offset += name_len + sizeof(*extref);
1649 btrfs_release_path(path);
1651 btrfs_release_path(path);
1653 if (ret < 0 && ret != -ENOENT)
1658 static int count_inode_refs(struct btrfs_root *root,
1659 struct btrfs_inode *inode, struct btrfs_path *path)
1662 struct btrfs_key key;
1663 unsigned int nlink = 0;
1665 unsigned long ptr_end;
1667 u64 ino = btrfs_ino(inode);
1670 key.type = BTRFS_INODE_REF_KEY;
1671 key.offset = (u64)-1;
1674 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1678 if (path->slots[0] == 0)
1683 btrfs_item_key_to_cpu(path->nodes[0], &key,
1685 if (key.objectid != ino ||
1686 key.type != BTRFS_INODE_REF_KEY)
1688 ptr = btrfs_item_ptr_offset(path->nodes[0], path->slots[0]);
1689 ptr_end = ptr + btrfs_item_size_nr(path->nodes[0],
1691 while (ptr < ptr_end) {
1692 struct btrfs_inode_ref *ref;
1694 ref = (struct btrfs_inode_ref *)ptr;
1695 name_len = btrfs_inode_ref_name_len(path->nodes[0],
1697 ptr = (unsigned long)(ref + 1) + name_len;
1701 if (key.offset == 0)
1703 if (path->slots[0] > 0) {
1708 btrfs_release_path(path);
1710 btrfs_release_path(path);
1716 * There are a few corners where the link count of the file can't
1717 * be properly maintained during replay. So, instead of adding
1718 * lots of complexity to the log code, we just scan the backrefs
1719 * for any file that has been through replay.
1721 * The scan will update the link count on the inode to reflect the
1722 * number of back refs found. If it goes down to zero, the iput
1723 * will free the inode.
1725 static noinline int fixup_inode_link_count(struct btrfs_trans_handle *trans,
1726 struct btrfs_root *root,
1727 struct inode *inode)
1729 struct btrfs_path *path;
1732 u64 ino = btrfs_ino(BTRFS_I(inode));
1734 path = btrfs_alloc_path();
1738 ret = count_inode_refs(root, BTRFS_I(inode), path);
1744 ret = count_inode_extrefs(root, BTRFS_I(inode), path);
1752 if (nlink != inode->i_nlink) {
1753 set_nlink(inode, nlink);
1754 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
1758 BTRFS_I(inode)->index_cnt = (u64)-1;
1760 if (inode->i_nlink == 0) {
1761 if (S_ISDIR(inode->i_mode)) {
1762 ret = replay_dir_deletes(trans, root, NULL, path,
1767 ret = btrfs_insert_orphan_item(trans, root, ino);
1773 btrfs_free_path(path);
1777 static noinline int fixup_inode_link_counts(struct btrfs_trans_handle *trans,
1778 struct btrfs_root *root,
1779 struct btrfs_path *path)
1782 struct btrfs_key key;
1783 struct inode *inode;
1785 key.objectid = BTRFS_TREE_LOG_FIXUP_OBJECTID;
1786 key.type = BTRFS_ORPHAN_ITEM_KEY;
1787 key.offset = (u64)-1;
1789 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1795 if (path->slots[0] == 0)
1800 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1801 if (key.objectid != BTRFS_TREE_LOG_FIXUP_OBJECTID ||
1802 key.type != BTRFS_ORPHAN_ITEM_KEY)
1805 ret = btrfs_del_item(trans, root, path);
1809 btrfs_release_path(path);
1810 inode = read_one_inode(root, key.offset);
1816 ret = fixup_inode_link_count(trans, root, inode);
1822 * fixup on a directory may create new entries,
1823 * make sure we always look for the highset possible
1826 key.offset = (u64)-1;
1828 btrfs_release_path(path);
1834 * record a given inode in the fixup dir so we can check its link
1835 * count when replay is done. The link count is incremented here
1836 * so the inode won't go away until we check it
1838 static noinline int link_to_fixup_dir(struct btrfs_trans_handle *trans,
1839 struct btrfs_root *root,
1840 struct btrfs_path *path,
1843 struct btrfs_key key;
1845 struct inode *inode;
1847 inode = read_one_inode(root, objectid);
1851 key.objectid = BTRFS_TREE_LOG_FIXUP_OBJECTID;
1852 key.type = BTRFS_ORPHAN_ITEM_KEY;
1853 key.offset = objectid;
1855 ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
1857 btrfs_release_path(path);
1859 if (!inode->i_nlink)
1860 set_nlink(inode, 1);
1863 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
1864 } else if (ret == -EEXIST) {
1873 * when replaying the log for a directory, we only insert names
1874 * for inodes that actually exist. This means an fsync on a directory
1875 * does not implicitly fsync all the new files in it
1877 static noinline int insert_one_name(struct btrfs_trans_handle *trans,
1878 struct btrfs_root *root,
1879 u64 dirid, u64 index,
1880 char *name, int name_len,
1881 struct btrfs_key *location)
1883 struct inode *inode;
1887 inode = read_one_inode(root, location->objectid);
1891 dir = read_one_inode(root, dirid);
1897 ret = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode), name,
1898 name_len, 1, index);
1900 /* FIXME, put inode into FIXUP list */
1908 * take a single entry in a log directory item and replay it into
1911 * if a conflicting item exists in the subdirectory already,
1912 * the inode it points to is unlinked and put into the link count
1915 * If a name from the log points to a file or directory that does
1916 * not exist in the FS, it is skipped. fsyncs on directories
1917 * do not force down inodes inside that directory, just changes to the
1918 * names or unlinks in a directory.
1920 * Returns < 0 on error, 0 if the name wasn't replayed (dentry points to a
1921 * non-existing inode) and 1 if the name was replayed.
1923 static noinline int replay_one_name(struct btrfs_trans_handle *trans,
1924 struct btrfs_root *root,
1925 struct btrfs_path *path,
1926 struct extent_buffer *eb,
1927 struct btrfs_dir_item *di,
1928 struct btrfs_key *key)
1932 struct btrfs_dir_item *dst_di;
1933 struct btrfs_key found_key;
1934 struct btrfs_key log_key;
1939 bool update_size = (key->type == BTRFS_DIR_INDEX_KEY);
1940 bool name_added = false;
1942 dir = read_one_inode(root, key->objectid);
1946 name_len = btrfs_dir_name_len(eb, di);
1947 name = kmalloc(name_len, GFP_NOFS);
1953 log_type = btrfs_dir_type(eb, di);
1954 read_extent_buffer(eb, name, (unsigned long)(di + 1),
1957 btrfs_dir_item_key_to_cpu(eb, di, &log_key);
1958 exists = btrfs_lookup_inode(trans, root, path, &log_key, 0);
1963 btrfs_release_path(path);
1965 if (key->type == BTRFS_DIR_ITEM_KEY) {
1966 dst_di = btrfs_lookup_dir_item(trans, root, path, key->objectid,
1968 } else if (key->type == BTRFS_DIR_INDEX_KEY) {
1969 dst_di = btrfs_lookup_dir_index_item(trans, root, path,
1978 if (IS_ERR_OR_NULL(dst_di)) {
1979 /* we need a sequence number to insert, so we only
1980 * do inserts for the BTRFS_DIR_INDEX_KEY types
1982 if (key->type != BTRFS_DIR_INDEX_KEY)
1987 btrfs_dir_item_key_to_cpu(path->nodes[0], dst_di, &found_key);
1988 /* the existing item matches the logged item */
1989 if (found_key.objectid == log_key.objectid &&
1990 found_key.type == log_key.type &&
1991 found_key.offset == log_key.offset &&
1992 btrfs_dir_type(path->nodes[0], dst_di) == log_type) {
1993 update_size = false;
1998 * don't drop the conflicting directory entry if the inode
1999 * for the new entry doesn't exist
2004 ret = drop_one_dir_item(trans, root, path, BTRFS_I(dir), dst_di);
2008 if (key->type == BTRFS_DIR_INDEX_KEY)
2011 btrfs_release_path(path);
2012 if (!ret && update_size) {
2013 btrfs_i_size_write(BTRFS_I(dir), dir->i_size + name_len * 2);
2014 ret = btrfs_update_inode(trans, root, BTRFS_I(dir));
2018 if (!ret && name_added)
2024 * Check if the inode reference exists in the log for the given name,
2025 * inode and parent inode
2027 found_key.objectid = log_key.objectid;
2028 found_key.type = BTRFS_INODE_REF_KEY;
2029 found_key.offset = key->objectid;
2030 ret = backref_in_log(root->log_root, &found_key, 0, name, name_len);
2034 /* The dentry will be added later. */
2036 update_size = false;
2040 found_key.objectid = log_key.objectid;
2041 found_key.type = BTRFS_INODE_EXTREF_KEY;
2042 found_key.offset = key->objectid;
2043 ret = backref_in_log(root->log_root, &found_key, key->objectid, name,
2048 /* The dentry will be added later. */
2050 update_size = false;
2053 btrfs_release_path(path);
2054 ret = insert_one_name(trans, root, key->objectid, key->offset,
2055 name, name_len, &log_key);
2056 if (ret && ret != -ENOENT && ret != -EEXIST)
2060 update_size = false;
2066 * find all the names in a directory item and reconcile them into
2067 * the subvolume. Only BTRFS_DIR_ITEM_KEY types will have more than
2068 * one name in a directory item, but the same code gets used for
2069 * both directory index types
2071 static noinline int replay_one_dir_item(struct btrfs_trans_handle *trans,
2072 struct btrfs_root *root,
2073 struct btrfs_path *path,
2074 struct extent_buffer *eb, int slot,
2075 struct btrfs_key *key)
2078 u32 item_size = btrfs_item_size_nr(eb, slot);
2079 struct btrfs_dir_item *di;
2082 unsigned long ptr_end;
2083 struct btrfs_path *fixup_path = NULL;
2085 ptr = btrfs_item_ptr_offset(eb, slot);
2086 ptr_end = ptr + item_size;
2087 while (ptr < ptr_end) {
2088 di = (struct btrfs_dir_item *)ptr;
2089 name_len = btrfs_dir_name_len(eb, di);
2090 ret = replay_one_name(trans, root, path, eb, di, key);
2093 ptr = (unsigned long)(di + 1);
2097 * If this entry refers to a non-directory (directories can not
2098 * have a link count > 1) and it was added in the transaction
2099 * that was not committed, make sure we fixup the link count of
2100 * the inode it the entry points to. Otherwise something like
2101 * the following would result in a directory pointing to an
2102 * inode with a wrong link that does not account for this dir
2110 * ln testdir/bar testdir/bar_link
2111 * ln testdir/foo testdir/foo_link
2112 * xfs_io -c "fsync" testdir/bar
2116 * mount fs, log replay happens
2118 * File foo would remain with a link count of 1 when it has two
2119 * entries pointing to it in the directory testdir. This would
2120 * make it impossible to ever delete the parent directory has
2121 * it would result in stale dentries that can never be deleted.
2123 if (ret == 1 && btrfs_dir_type(eb, di) != BTRFS_FT_DIR) {
2124 struct btrfs_key di_key;
2127 fixup_path = btrfs_alloc_path();
2134 btrfs_dir_item_key_to_cpu(eb, di, &di_key);
2135 ret = link_to_fixup_dir(trans, root, fixup_path,
2142 btrfs_free_path(fixup_path);
2147 * directory replay has two parts. There are the standard directory
2148 * items in the log copied from the subvolume, and range items
2149 * created in the log while the subvolume was logged.
2151 * The range items tell us which parts of the key space the log
2152 * is authoritative for. During replay, if a key in the subvolume
2153 * directory is in a logged range item, but not actually in the log
2154 * that means it was deleted from the directory before the fsync
2155 * and should be removed.
2157 static noinline int find_dir_range(struct btrfs_root *root,
2158 struct btrfs_path *path,
2159 u64 dirid, int key_type,
2160 u64 *start_ret, u64 *end_ret)
2162 struct btrfs_key key;
2164 struct btrfs_dir_log_item *item;
2168 if (*start_ret == (u64)-1)
2171 key.objectid = dirid;
2172 key.type = key_type;
2173 key.offset = *start_ret;
2175 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2179 if (path->slots[0] == 0)
2184 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
2186 if (key.type != key_type || key.objectid != dirid) {
2190 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
2191 struct btrfs_dir_log_item);
2192 found_end = btrfs_dir_log_end(path->nodes[0], item);
2194 if (*start_ret >= key.offset && *start_ret <= found_end) {
2196 *start_ret = key.offset;
2197 *end_ret = found_end;
2202 /* check the next slot in the tree to see if it is a valid item */
2203 nritems = btrfs_header_nritems(path->nodes[0]);
2205 if (path->slots[0] >= nritems) {
2206 ret = btrfs_next_leaf(root, path);
2211 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
2213 if (key.type != key_type || key.objectid != dirid) {
2217 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
2218 struct btrfs_dir_log_item);
2219 found_end = btrfs_dir_log_end(path->nodes[0], item);
2220 *start_ret = key.offset;
2221 *end_ret = found_end;
2224 btrfs_release_path(path);
2229 * this looks for a given directory item in the log. If the directory
2230 * item is not in the log, the item is removed and the inode it points
2233 static noinline int check_item_in_log(struct btrfs_trans_handle *trans,
2234 struct btrfs_root *root,
2235 struct btrfs_root *log,
2236 struct btrfs_path *path,
2237 struct btrfs_path *log_path,
2239 struct btrfs_key *dir_key)
2242 struct extent_buffer *eb;
2245 struct btrfs_dir_item *di;
2246 struct btrfs_dir_item *log_di;
2249 unsigned long ptr_end;
2251 struct inode *inode;
2252 struct btrfs_key location;
2255 eb = path->nodes[0];
2256 slot = path->slots[0];
2257 item_size = btrfs_item_size_nr(eb, slot);
2258 ptr = btrfs_item_ptr_offset(eb, slot);
2259 ptr_end = ptr + item_size;
2260 while (ptr < ptr_end) {
2261 di = (struct btrfs_dir_item *)ptr;
2262 name_len = btrfs_dir_name_len(eb, di);
2263 name = kmalloc(name_len, GFP_NOFS);
2268 read_extent_buffer(eb, name, (unsigned long)(di + 1),
2271 if (log && dir_key->type == BTRFS_DIR_ITEM_KEY) {
2272 log_di = btrfs_lookup_dir_item(trans, log, log_path,
2275 } else if (log && dir_key->type == BTRFS_DIR_INDEX_KEY) {
2276 log_di = btrfs_lookup_dir_index_item(trans, log,
2282 if (!log_di || log_di == ERR_PTR(-ENOENT)) {
2283 btrfs_dir_item_key_to_cpu(eb, di, &location);
2284 btrfs_release_path(path);
2285 btrfs_release_path(log_path);
2286 inode = read_one_inode(root, location.objectid);
2292 ret = link_to_fixup_dir(trans, root,
2293 path, location.objectid);
2301 ret = btrfs_unlink_inode(trans, root, BTRFS_I(dir),
2302 BTRFS_I(inode), name, name_len);
2304 ret = btrfs_run_delayed_items(trans);
2310 /* there might still be more names under this key
2311 * check and repeat if required
2313 ret = btrfs_search_slot(NULL, root, dir_key, path,
2319 } else if (IS_ERR(log_di)) {
2321 return PTR_ERR(log_di);
2323 btrfs_release_path(log_path);
2326 ptr = (unsigned long)(di + 1);
2331 btrfs_release_path(path);
2332 btrfs_release_path(log_path);
2336 static int replay_xattr_deletes(struct btrfs_trans_handle *trans,
2337 struct btrfs_root *root,
2338 struct btrfs_root *log,
2339 struct btrfs_path *path,
2342 struct btrfs_key search_key;
2343 struct btrfs_path *log_path;
2348 log_path = btrfs_alloc_path();
2352 search_key.objectid = ino;
2353 search_key.type = BTRFS_XATTR_ITEM_KEY;
2354 search_key.offset = 0;
2356 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
2360 nritems = btrfs_header_nritems(path->nodes[0]);
2361 for (i = path->slots[0]; i < nritems; i++) {
2362 struct btrfs_key key;
2363 struct btrfs_dir_item *di;
2364 struct btrfs_dir_item *log_di;
2368 btrfs_item_key_to_cpu(path->nodes[0], &key, i);
2369 if (key.objectid != ino || key.type != BTRFS_XATTR_ITEM_KEY) {
2374 di = btrfs_item_ptr(path->nodes[0], i, struct btrfs_dir_item);
2375 total_size = btrfs_item_size_nr(path->nodes[0], i);
2377 while (cur < total_size) {
2378 u16 name_len = btrfs_dir_name_len(path->nodes[0], di);
2379 u16 data_len = btrfs_dir_data_len(path->nodes[0], di);
2380 u32 this_len = sizeof(*di) + name_len + data_len;
2383 name = kmalloc(name_len, GFP_NOFS);
2388 read_extent_buffer(path->nodes[0], name,
2389 (unsigned long)(di + 1), name_len);
2391 log_di = btrfs_lookup_xattr(NULL, log, log_path, ino,
2393 btrfs_release_path(log_path);
2395 /* Doesn't exist in log tree, so delete it. */
2396 btrfs_release_path(path);
2397 di = btrfs_lookup_xattr(trans, root, path, ino,
2398 name, name_len, -1);
2405 ret = btrfs_delete_one_dir_name(trans, root,
2409 btrfs_release_path(path);
2414 if (IS_ERR(log_di)) {
2415 ret = PTR_ERR(log_di);
2419 di = (struct btrfs_dir_item *)((char *)di + this_len);
2422 ret = btrfs_next_leaf(root, path);
2428 btrfs_free_path(log_path);
2429 btrfs_release_path(path);
2435 * deletion replay happens before we copy any new directory items
2436 * out of the log or out of backreferences from inodes. It
2437 * scans the log to find ranges of keys that log is authoritative for,
2438 * and then scans the directory to find items in those ranges that are
2439 * not present in the log.
2441 * Anything we don't find in the log is unlinked and removed from the
2444 static noinline int replay_dir_deletes(struct btrfs_trans_handle *trans,
2445 struct btrfs_root *root,
2446 struct btrfs_root *log,
2447 struct btrfs_path *path,
2448 u64 dirid, int del_all)
2452 int key_type = BTRFS_DIR_LOG_ITEM_KEY;
2454 struct btrfs_key dir_key;
2455 struct btrfs_key found_key;
2456 struct btrfs_path *log_path;
2459 dir_key.objectid = dirid;
2460 dir_key.type = BTRFS_DIR_ITEM_KEY;
2461 log_path = btrfs_alloc_path();
2465 dir = read_one_inode(root, dirid);
2466 /* it isn't an error if the inode isn't there, that can happen
2467 * because we replay the deletes before we copy in the inode item
2471 btrfs_free_path(log_path);
2479 range_end = (u64)-1;
2481 ret = find_dir_range(log, path, dirid, key_type,
2482 &range_start, &range_end);
2487 dir_key.offset = range_start;
2490 ret = btrfs_search_slot(NULL, root, &dir_key, path,
2495 nritems = btrfs_header_nritems(path->nodes[0]);
2496 if (path->slots[0] >= nritems) {
2497 ret = btrfs_next_leaf(root, path);
2503 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
2505 if (found_key.objectid != dirid ||
2506 found_key.type != dir_key.type)
2509 if (found_key.offset > range_end)
2512 ret = check_item_in_log(trans, root, log, path,
2517 if (found_key.offset == (u64)-1)
2519 dir_key.offset = found_key.offset + 1;
2521 btrfs_release_path(path);
2522 if (range_end == (u64)-1)
2524 range_start = range_end + 1;
2529 if (key_type == BTRFS_DIR_LOG_ITEM_KEY) {
2530 key_type = BTRFS_DIR_LOG_INDEX_KEY;
2531 dir_key.type = BTRFS_DIR_INDEX_KEY;
2532 btrfs_release_path(path);
2536 btrfs_release_path(path);
2537 btrfs_free_path(log_path);
2543 * the process_func used to replay items from the log tree. This
2544 * gets called in two different stages. The first stage just looks
2545 * for inodes and makes sure they are all copied into the subvolume.
2547 * The second stage copies all the other item types from the log into
2548 * the subvolume. The two stage approach is slower, but gets rid of
2549 * lots of complexity around inodes referencing other inodes that exist
2550 * only in the log (references come from either directory items or inode
2553 static int replay_one_buffer(struct btrfs_root *log, struct extent_buffer *eb,
2554 struct walk_control *wc, u64 gen, int level)
2557 struct btrfs_path *path;
2558 struct btrfs_root *root = wc->replay_dest;
2559 struct btrfs_key key;
2563 ret = btrfs_read_buffer(eb, gen, level, NULL);
2567 level = btrfs_header_level(eb);
2572 path = btrfs_alloc_path();
2576 nritems = btrfs_header_nritems(eb);
2577 for (i = 0; i < nritems; i++) {
2578 btrfs_item_key_to_cpu(eb, &key, i);
2580 /* inode keys are done during the first stage */
2581 if (key.type == BTRFS_INODE_ITEM_KEY &&
2582 wc->stage == LOG_WALK_REPLAY_INODES) {
2583 struct btrfs_inode_item *inode_item;
2586 inode_item = btrfs_item_ptr(eb, i,
2587 struct btrfs_inode_item);
2589 * If we have a tmpfile (O_TMPFILE) that got fsync'ed
2590 * and never got linked before the fsync, skip it, as
2591 * replaying it is pointless since it would be deleted
2592 * later. We skip logging tmpfiles, but it's always
2593 * possible we are replaying a log created with a kernel
2594 * that used to log tmpfiles.
2596 if (btrfs_inode_nlink(eb, inode_item) == 0) {
2597 wc->ignore_cur_inode = true;
2600 wc->ignore_cur_inode = false;
2602 ret = replay_xattr_deletes(wc->trans, root, log,
2603 path, key.objectid);
2606 mode = btrfs_inode_mode(eb, inode_item);
2607 if (S_ISDIR(mode)) {
2608 ret = replay_dir_deletes(wc->trans,
2609 root, log, path, key.objectid, 0);
2613 ret = overwrite_item(wc->trans, root, path,
2619 * Before replaying extents, truncate the inode to its
2620 * size. We need to do it now and not after log replay
2621 * because before an fsync we can have prealloc extents
2622 * added beyond the inode's i_size. If we did it after,
2623 * through orphan cleanup for example, we would drop
2624 * those prealloc extents just after replaying them.
2626 if (S_ISREG(mode)) {
2627 struct btrfs_drop_extents_args drop_args = { 0 };
2628 struct inode *inode;
2631 inode = read_one_inode(root, key.objectid);
2636 from = ALIGN(i_size_read(inode),
2637 root->fs_info->sectorsize);
2638 drop_args.start = from;
2639 drop_args.end = (u64)-1;
2640 drop_args.drop_cache = true;
2641 ret = btrfs_drop_extents(wc->trans, root,
2645 inode_sub_bytes(inode,
2646 drop_args.bytes_found);
2647 /* Update the inode's nbytes. */
2648 ret = btrfs_update_inode(wc->trans,
2649 root, BTRFS_I(inode));
2656 ret = link_to_fixup_dir(wc->trans, root,
2657 path, key.objectid);
2662 if (wc->ignore_cur_inode)
2665 if (key.type == BTRFS_DIR_INDEX_KEY &&
2666 wc->stage == LOG_WALK_REPLAY_DIR_INDEX) {
2667 ret = replay_one_dir_item(wc->trans, root, path,
2673 if (wc->stage < LOG_WALK_REPLAY_ALL)
2676 /* these keys are simply copied */
2677 if (key.type == BTRFS_XATTR_ITEM_KEY) {
2678 ret = overwrite_item(wc->trans, root, path,
2682 } else if (key.type == BTRFS_INODE_REF_KEY ||
2683 key.type == BTRFS_INODE_EXTREF_KEY) {
2684 ret = add_inode_ref(wc->trans, root, log, path,
2686 if (ret && ret != -ENOENT)
2689 } else if (key.type == BTRFS_EXTENT_DATA_KEY) {
2690 ret = replay_one_extent(wc->trans, root, path,
2694 } else if (key.type == BTRFS_DIR_ITEM_KEY) {
2695 ret = replay_one_dir_item(wc->trans, root, path,
2701 btrfs_free_path(path);
2706 * Correctly adjust the reserved bytes occupied by a log tree extent buffer
2708 static void unaccount_log_buffer(struct btrfs_fs_info *fs_info, u64 start)
2710 struct btrfs_block_group *cache;
2712 cache = btrfs_lookup_block_group(fs_info, start);
2714 btrfs_err(fs_info, "unable to find block group for %llu", start);
2718 spin_lock(&cache->space_info->lock);
2719 spin_lock(&cache->lock);
2720 cache->reserved -= fs_info->nodesize;
2721 cache->space_info->bytes_reserved -= fs_info->nodesize;
2722 spin_unlock(&cache->lock);
2723 spin_unlock(&cache->space_info->lock);
2725 btrfs_put_block_group(cache);
2728 static noinline int walk_down_log_tree(struct btrfs_trans_handle *trans,
2729 struct btrfs_root *root,
2730 struct btrfs_path *path, int *level,
2731 struct walk_control *wc)
2733 struct btrfs_fs_info *fs_info = root->fs_info;
2736 struct extent_buffer *next;
2737 struct extent_buffer *cur;
2741 while (*level > 0) {
2742 struct btrfs_key first_key;
2744 cur = path->nodes[*level];
2746 WARN_ON(btrfs_header_level(cur) != *level);
2748 if (path->slots[*level] >=
2749 btrfs_header_nritems(cur))
2752 bytenr = btrfs_node_blockptr(cur, path->slots[*level]);
2753 ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]);
2754 btrfs_node_key_to_cpu(cur, &first_key, path->slots[*level]);
2755 blocksize = fs_info->nodesize;
2757 next = btrfs_find_create_tree_block(fs_info, bytenr,
2758 btrfs_header_owner(cur),
2761 return PTR_ERR(next);
2764 ret = wc->process_func(root, next, wc, ptr_gen,
2767 free_extent_buffer(next);
2771 path->slots[*level]++;
2773 ret = btrfs_read_buffer(next, ptr_gen,
2774 *level - 1, &first_key);
2776 free_extent_buffer(next);
2781 btrfs_tree_lock(next);
2782 btrfs_clean_tree_block(next);
2783 btrfs_wait_tree_block_writeback(next);
2784 btrfs_tree_unlock(next);
2785 ret = btrfs_pin_reserved_extent(trans,
2788 free_extent_buffer(next);
2791 btrfs_redirty_list_add(
2792 trans->transaction, next);
2794 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &next->bflags))
2795 clear_extent_buffer_dirty(next);
2796 unaccount_log_buffer(fs_info, bytenr);
2799 free_extent_buffer(next);
2802 ret = btrfs_read_buffer(next, ptr_gen, *level - 1, &first_key);
2804 free_extent_buffer(next);
2808 if (path->nodes[*level-1])
2809 free_extent_buffer(path->nodes[*level-1]);
2810 path->nodes[*level-1] = next;
2811 *level = btrfs_header_level(next);
2812 path->slots[*level] = 0;
2815 path->slots[*level] = btrfs_header_nritems(path->nodes[*level]);
2821 static noinline int walk_up_log_tree(struct btrfs_trans_handle *trans,
2822 struct btrfs_root *root,
2823 struct btrfs_path *path, int *level,
2824 struct walk_control *wc)
2826 struct btrfs_fs_info *fs_info = root->fs_info;
2831 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
2832 slot = path->slots[i];
2833 if (slot + 1 < btrfs_header_nritems(path->nodes[i])) {
2836 WARN_ON(*level == 0);
2839 ret = wc->process_func(root, path->nodes[*level], wc,
2840 btrfs_header_generation(path->nodes[*level]),
2846 struct extent_buffer *next;
2848 next = path->nodes[*level];
2851 btrfs_tree_lock(next);
2852 btrfs_clean_tree_block(next);
2853 btrfs_wait_tree_block_writeback(next);
2854 btrfs_tree_unlock(next);
2855 ret = btrfs_pin_reserved_extent(trans,
2856 path->nodes[*level]->start,
2857 path->nodes[*level]->len);
2861 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &next->bflags))
2862 clear_extent_buffer_dirty(next);
2864 unaccount_log_buffer(fs_info,
2865 path->nodes[*level]->start);
2868 free_extent_buffer(path->nodes[*level]);
2869 path->nodes[*level] = NULL;
2877 * drop the reference count on the tree rooted at 'snap'. This traverses
2878 * the tree freeing any blocks that have a ref count of zero after being
2881 static int walk_log_tree(struct btrfs_trans_handle *trans,
2882 struct btrfs_root *log, struct walk_control *wc)
2884 struct btrfs_fs_info *fs_info = log->fs_info;
2888 struct btrfs_path *path;
2891 path = btrfs_alloc_path();
2895 level = btrfs_header_level(log->node);
2897 path->nodes[level] = log->node;
2898 atomic_inc(&log->node->refs);
2899 path->slots[level] = 0;
2902 wret = walk_down_log_tree(trans, log, path, &level, wc);
2910 wret = walk_up_log_tree(trans, log, path, &level, wc);
2919 /* was the root node processed? if not, catch it here */
2920 if (path->nodes[orig_level]) {
2921 ret = wc->process_func(log, path->nodes[orig_level], wc,
2922 btrfs_header_generation(path->nodes[orig_level]),
2927 struct extent_buffer *next;
2929 next = path->nodes[orig_level];
2932 btrfs_tree_lock(next);
2933 btrfs_clean_tree_block(next);
2934 btrfs_wait_tree_block_writeback(next);
2935 btrfs_tree_unlock(next);
2936 ret = btrfs_pin_reserved_extent(trans,
2937 next->start, next->len);
2941 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &next->bflags))
2942 clear_extent_buffer_dirty(next);
2943 unaccount_log_buffer(fs_info, next->start);
2949 btrfs_free_path(path);
2954 * helper function to update the item for a given subvolumes log root
2955 * in the tree of log roots
2957 static int update_log_root(struct btrfs_trans_handle *trans,
2958 struct btrfs_root *log,
2959 struct btrfs_root_item *root_item)
2961 struct btrfs_fs_info *fs_info = log->fs_info;
2964 if (log->log_transid == 1) {
2965 /* insert root item on the first sync */
2966 ret = btrfs_insert_root(trans, fs_info->log_root_tree,
2967 &log->root_key, root_item);
2969 ret = btrfs_update_root(trans, fs_info->log_root_tree,
2970 &log->root_key, root_item);
2975 static void wait_log_commit(struct btrfs_root *root, int transid)
2978 int index = transid % 2;
2981 * we only allow two pending log transactions at a time,
2982 * so we know that if ours is more than 2 older than the
2983 * current transaction, we're done
2986 prepare_to_wait(&root->log_commit_wait[index],
2987 &wait, TASK_UNINTERRUPTIBLE);
2989 if (!(root->log_transid_committed < transid &&
2990 atomic_read(&root->log_commit[index])))
2993 mutex_unlock(&root->log_mutex);
2995 mutex_lock(&root->log_mutex);
2997 finish_wait(&root->log_commit_wait[index], &wait);
3000 static void wait_for_writer(struct btrfs_root *root)
3005 prepare_to_wait(&root->log_writer_wait, &wait,
3006 TASK_UNINTERRUPTIBLE);
3007 if (!atomic_read(&root->log_writers))
3010 mutex_unlock(&root->log_mutex);
3012 mutex_lock(&root->log_mutex);
3014 finish_wait(&root->log_writer_wait, &wait);
3017 static inline void btrfs_remove_log_ctx(struct btrfs_root *root,
3018 struct btrfs_log_ctx *ctx)
3023 mutex_lock(&root->log_mutex);
3024 list_del_init(&ctx->list);
3025 mutex_unlock(&root->log_mutex);
3029 * Invoked in log mutex context, or be sure there is no other task which
3030 * can access the list.
3032 static inline void btrfs_remove_all_log_ctxs(struct btrfs_root *root,
3033 int index, int error)
3035 struct btrfs_log_ctx *ctx;
3036 struct btrfs_log_ctx *safe;
3038 list_for_each_entry_safe(ctx, safe, &root->log_ctxs[index], list) {
3039 list_del_init(&ctx->list);
3040 ctx->log_ret = error;
3043 INIT_LIST_HEAD(&root->log_ctxs[index]);
3047 * btrfs_sync_log does sends a given tree log down to the disk and
3048 * updates the super blocks to record it. When this call is done,
3049 * you know that any inodes previously logged are safely on disk only
3052 * Any other return value means you need to call btrfs_commit_transaction.
3053 * Some of the edge cases for fsyncing directories that have had unlinks
3054 * or renames done in the past mean that sometimes the only safe
3055 * fsync is to commit the whole FS. When btrfs_sync_log returns -EAGAIN,
3056 * that has happened.
3058 int btrfs_sync_log(struct btrfs_trans_handle *trans,
3059 struct btrfs_root *root, struct btrfs_log_ctx *ctx)
3065 struct btrfs_fs_info *fs_info = root->fs_info;
3066 struct btrfs_root *log = root->log_root;
3067 struct btrfs_root *log_root_tree = fs_info->log_root_tree;
3068 struct btrfs_root_item new_root_item;
3069 int log_transid = 0;
3070 struct btrfs_log_ctx root_log_ctx;
3071 struct blk_plug plug;
3075 mutex_lock(&root->log_mutex);
3076 log_transid = ctx->log_transid;
3077 if (root->log_transid_committed >= log_transid) {
3078 mutex_unlock(&root->log_mutex);
3079 return ctx->log_ret;
3082 index1 = log_transid % 2;
3083 if (atomic_read(&root->log_commit[index1])) {
3084 wait_log_commit(root, log_transid);
3085 mutex_unlock(&root->log_mutex);
3086 return ctx->log_ret;
3088 ASSERT(log_transid == root->log_transid);
3089 atomic_set(&root->log_commit[index1], 1);
3091 /* wait for previous tree log sync to complete */
3092 if (atomic_read(&root->log_commit[(index1 + 1) % 2]))
3093 wait_log_commit(root, log_transid - 1);
3096 int batch = atomic_read(&root->log_batch);
3097 /* when we're on an ssd, just kick the log commit out */
3098 if (!btrfs_test_opt(fs_info, SSD) &&
3099 test_bit(BTRFS_ROOT_MULTI_LOG_TASKS, &root->state)) {
3100 mutex_unlock(&root->log_mutex);
3101 schedule_timeout_uninterruptible(1);
3102 mutex_lock(&root->log_mutex);
3104 wait_for_writer(root);
3105 if (batch == atomic_read(&root->log_batch))
3109 /* bail out if we need to do a full commit */
3110 if (btrfs_need_log_full_commit(trans)) {
3112 mutex_unlock(&root->log_mutex);
3116 if (log_transid % 2 == 0)
3117 mark = EXTENT_DIRTY;
3121 /* we start IO on all the marked extents here, but we don't actually
3122 * wait for them until later.
3124 blk_start_plug(&plug);
3125 ret = btrfs_write_marked_extents(fs_info, &log->dirty_log_pages, mark);
3127 * -EAGAIN happens when someone, e.g., a concurrent transaction
3128 * commit, writes a dirty extent in this tree-log commit. This
3129 * concurrent write will create a hole writing out the extents,
3130 * and we cannot proceed on a zoned filesystem, requiring
3131 * sequential writing. While we can bail out to a full commit
3132 * here, but we can continue hoping the concurrent writing fills
3135 if (ret == -EAGAIN && btrfs_is_zoned(fs_info))
3138 blk_finish_plug(&plug);
3139 btrfs_abort_transaction(trans, ret);
3140 btrfs_set_log_full_commit(trans);
3141 mutex_unlock(&root->log_mutex);
3146 * We _must_ update under the root->log_mutex in order to make sure we
3147 * have a consistent view of the log root we are trying to commit at
3150 * We _must_ copy this into a local copy, because we are not holding the
3151 * log_root_tree->log_mutex yet. This is important because when we
3152 * commit the log_root_tree we must have a consistent view of the
3153 * log_root_tree when we update the super block to point at the
3154 * log_root_tree bytenr. If we update the log_root_tree here we'll race
3155 * with the commit and possibly point at the new block which we may not
3158 btrfs_set_root_node(&log->root_item, log->node);
3159 memcpy(&new_root_item, &log->root_item, sizeof(new_root_item));
3161 root->log_transid++;
3162 log->log_transid = root->log_transid;
3163 root->log_start_pid = 0;
3165 * IO has been started, blocks of the log tree have WRITTEN flag set
3166 * in their headers. new modifications of the log will be written to
3167 * new positions. so it's safe to allow log writers to go in.
3169 mutex_unlock(&root->log_mutex);
3171 if (btrfs_is_zoned(fs_info)) {
3172 mutex_lock(&fs_info->tree_root->log_mutex);
3173 if (!log_root_tree->node) {
3174 ret = btrfs_alloc_log_tree_node(trans, log_root_tree);
3176 mutex_unlock(&fs_info->tree_log_mutex);
3180 mutex_unlock(&fs_info->tree_root->log_mutex);
3183 btrfs_init_log_ctx(&root_log_ctx, NULL);
3185 mutex_lock(&log_root_tree->log_mutex);
3187 index2 = log_root_tree->log_transid % 2;
3188 list_add_tail(&root_log_ctx.list, &log_root_tree->log_ctxs[index2]);
3189 root_log_ctx.log_transid = log_root_tree->log_transid;
3192 * Now we are safe to update the log_root_tree because we're under the
3193 * log_mutex, and we're a current writer so we're holding the commit
3194 * open until we drop the log_mutex.
3196 ret = update_log_root(trans, log, &new_root_item);
3198 if (!list_empty(&root_log_ctx.list))
3199 list_del_init(&root_log_ctx.list);
3201 blk_finish_plug(&plug);
3202 btrfs_set_log_full_commit(trans);
3204 if (ret != -ENOSPC) {
3205 btrfs_abort_transaction(trans, ret);
3206 mutex_unlock(&log_root_tree->log_mutex);
3209 btrfs_wait_tree_log_extents(log, mark);
3210 mutex_unlock(&log_root_tree->log_mutex);
3215 if (log_root_tree->log_transid_committed >= root_log_ctx.log_transid) {
3216 blk_finish_plug(&plug);
3217 list_del_init(&root_log_ctx.list);
3218 mutex_unlock(&log_root_tree->log_mutex);
3219 ret = root_log_ctx.log_ret;
3223 index2 = root_log_ctx.log_transid % 2;
3224 if (atomic_read(&log_root_tree->log_commit[index2])) {
3225 blk_finish_plug(&plug);
3226 ret = btrfs_wait_tree_log_extents(log, mark);
3227 wait_log_commit(log_root_tree,
3228 root_log_ctx.log_transid);
3229 mutex_unlock(&log_root_tree->log_mutex);
3231 ret = root_log_ctx.log_ret;
3234 ASSERT(root_log_ctx.log_transid == log_root_tree->log_transid);
3235 atomic_set(&log_root_tree->log_commit[index2], 1);
3237 if (atomic_read(&log_root_tree->log_commit[(index2 + 1) % 2])) {
3238 wait_log_commit(log_root_tree,
3239 root_log_ctx.log_transid - 1);
3243 * now that we've moved on to the tree of log tree roots,
3244 * check the full commit flag again
3246 if (btrfs_need_log_full_commit(trans)) {
3247 blk_finish_plug(&plug);
3248 btrfs_wait_tree_log_extents(log, mark);
3249 mutex_unlock(&log_root_tree->log_mutex);
3251 goto out_wake_log_root;
3254 ret = btrfs_write_marked_extents(fs_info,
3255 &log_root_tree->dirty_log_pages,
3256 EXTENT_DIRTY | EXTENT_NEW);
3257 blk_finish_plug(&plug);
3259 * As described above, -EAGAIN indicates a hole in the extents. We
3260 * cannot wait for these write outs since the waiting cause a
3261 * deadlock. Bail out to the full commit instead.
3263 if (ret == -EAGAIN && btrfs_is_zoned(fs_info)) {
3264 btrfs_set_log_full_commit(trans);
3265 btrfs_wait_tree_log_extents(log, mark);
3266 mutex_unlock(&log_root_tree->log_mutex);
3267 goto out_wake_log_root;
3269 btrfs_set_log_full_commit(trans);
3270 btrfs_abort_transaction(trans, ret);
3271 mutex_unlock(&log_root_tree->log_mutex);
3272 goto out_wake_log_root;
3274 ret = btrfs_wait_tree_log_extents(log, mark);
3276 ret = btrfs_wait_tree_log_extents(log_root_tree,
3277 EXTENT_NEW | EXTENT_DIRTY);
3279 btrfs_set_log_full_commit(trans);
3280 mutex_unlock(&log_root_tree->log_mutex);
3281 goto out_wake_log_root;
3284 log_root_start = log_root_tree->node->start;
3285 log_root_level = btrfs_header_level(log_root_tree->node);
3286 log_root_tree->log_transid++;
3287 mutex_unlock(&log_root_tree->log_mutex);
3290 * Here we are guaranteed that nobody is going to write the superblock
3291 * for the current transaction before us and that neither we do write
3292 * our superblock before the previous transaction finishes its commit
3293 * and writes its superblock, because:
3295 * 1) We are holding a handle on the current transaction, so no body
3296 * can commit it until we release the handle;
3298 * 2) Before writing our superblock we acquire the tree_log_mutex, so
3299 * if the previous transaction is still committing, and hasn't yet
3300 * written its superblock, we wait for it to do it, because a
3301 * transaction commit acquires the tree_log_mutex when the commit
3302 * begins and releases it only after writing its superblock.
3304 mutex_lock(&fs_info->tree_log_mutex);
3307 * The previous transaction writeout phase could have failed, and thus
3308 * marked the fs in an error state. We must not commit here, as we
3309 * could have updated our generation in the super_for_commit and
3310 * writing the super here would result in transid mismatches. If there
3311 * is an error here just bail.
3313 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) {
3315 btrfs_set_log_full_commit(trans);
3316 btrfs_abort_transaction(trans, ret);
3317 mutex_unlock(&fs_info->tree_log_mutex);
3318 goto out_wake_log_root;
3321 btrfs_set_super_log_root(fs_info->super_for_commit, log_root_start);
3322 btrfs_set_super_log_root_level(fs_info->super_for_commit, log_root_level);
3323 ret = write_all_supers(fs_info, 1);
3324 mutex_unlock(&fs_info->tree_log_mutex);
3326 btrfs_set_log_full_commit(trans);
3327 btrfs_abort_transaction(trans, ret);
3328 goto out_wake_log_root;
3331 mutex_lock(&root->log_mutex);
3332 if (root->last_log_commit < log_transid)
3333 root->last_log_commit = log_transid;
3334 mutex_unlock(&root->log_mutex);
3337 mutex_lock(&log_root_tree->log_mutex);
3338 btrfs_remove_all_log_ctxs(log_root_tree, index2, ret);
3340 log_root_tree->log_transid_committed++;
3341 atomic_set(&log_root_tree->log_commit[index2], 0);
3342 mutex_unlock(&log_root_tree->log_mutex);
3345 * The barrier before waitqueue_active (in cond_wake_up) is needed so
3346 * all the updates above are seen by the woken threads. It might not be
3347 * necessary, but proving that seems to be hard.
3349 cond_wake_up(&log_root_tree->log_commit_wait[index2]);
3351 mutex_lock(&root->log_mutex);
3352 btrfs_remove_all_log_ctxs(root, index1, ret);
3353 root->log_transid_committed++;
3354 atomic_set(&root->log_commit[index1], 0);
3355 mutex_unlock(&root->log_mutex);
3358 * The barrier before waitqueue_active (in cond_wake_up) is needed so
3359 * all the updates above are seen by the woken threads. It might not be
3360 * necessary, but proving that seems to be hard.
3362 cond_wake_up(&root->log_commit_wait[index1]);
3366 static void free_log_tree(struct btrfs_trans_handle *trans,
3367 struct btrfs_root *log)
3370 struct walk_control wc = {
3372 .process_func = process_one_buffer
3376 ret = walk_log_tree(trans, log, &wc);
3379 btrfs_abort_transaction(trans, ret);
3381 btrfs_handle_fs_error(log->fs_info, ret, NULL);
3385 clear_extent_bits(&log->dirty_log_pages, 0, (u64)-1,
3386 EXTENT_DIRTY | EXTENT_NEW | EXTENT_NEED_WAIT);
3387 extent_io_tree_release(&log->log_csum_range);
3389 if (trans && log->node)
3390 btrfs_redirty_list_add(trans->transaction, log->node);
3391 btrfs_put_root(log);
3395 * free all the extents used by the tree log. This should be called
3396 * at commit time of the full transaction
3398 int btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root)
3400 if (root->log_root) {
3401 free_log_tree(trans, root->log_root);
3402 root->log_root = NULL;
3403 clear_bit(BTRFS_ROOT_HAS_LOG_TREE, &root->state);
3408 int btrfs_free_log_root_tree(struct btrfs_trans_handle *trans,
3409 struct btrfs_fs_info *fs_info)
3411 if (fs_info->log_root_tree) {
3412 free_log_tree(trans, fs_info->log_root_tree);
3413 fs_info->log_root_tree = NULL;
3414 clear_bit(BTRFS_ROOT_HAS_LOG_TREE, &fs_info->tree_root->state);
3420 * Check if an inode was logged in the current transaction. We can't always rely
3421 * on an inode's logged_trans value, because it's an in-memory only field and
3422 * therefore not persisted. This means that its value is lost if the inode gets
3423 * evicted and loaded again from disk (in which case it has a value of 0, and
3424 * certainly it is smaller then any possible transaction ID), when that happens
3425 * the full_sync flag is set in the inode's runtime flags, so on that case we
3426 * assume eviction happened and ignore the logged_trans value, assuming the
3427 * worst case, that the inode was logged before in the current transaction.
3429 static bool inode_logged(struct btrfs_trans_handle *trans,
3430 struct btrfs_inode *inode)
3432 if (inode->logged_trans == trans->transid)
3435 if (inode->last_trans == trans->transid &&
3436 test_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags) &&
3437 !test_bit(BTRFS_FS_LOG_RECOVERING, &trans->fs_info->flags))
3444 * If both a file and directory are logged, and unlinks or renames are
3445 * mixed in, we have a few interesting corners:
3447 * create file X in dir Y
3448 * link file X to X.link in dir Y
3450 * unlink file X but leave X.link
3453 * After a crash we would expect only X.link to exist. But file X
3454 * didn't get fsync'd again so the log has back refs for X and X.link.
3456 * We solve this by removing directory entries and inode backrefs from the
3457 * log when a file that was logged in the current transaction is
3458 * unlinked. Any later fsync will include the updated log entries, and
3459 * we'll be able to reconstruct the proper directory items from backrefs.
3461 * This optimizations allows us to avoid relogging the entire inode
3462 * or the entire directory.
3464 int btrfs_del_dir_entries_in_log(struct btrfs_trans_handle *trans,
3465 struct btrfs_root *root,
3466 const char *name, int name_len,
3467 struct btrfs_inode *dir, u64 index)
3469 struct btrfs_root *log;
3470 struct btrfs_dir_item *di;
3471 struct btrfs_path *path;
3474 u64 dir_ino = btrfs_ino(dir);
3476 if (!inode_logged(trans, dir))
3479 ret = join_running_log_trans(root);
3483 mutex_lock(&dir->log_mutex);
3485 log = root->log_root;
3486 path = btrfs_alloc_path();
3492 di = btrfs_lookup_dir_item(trans, log, path, dir_ino,
3493 name, name_len, -1);
3499 ret = btrfs_delete_one_dir_name(trans, log, path, di);
3505 btrfs_release_path(path);
3506 di = btrfs_lookup_dir_index_item(trans, log, path, dir_ino,
3507 index, name, name_len, -1);
3513 ret = btrfs_delete_one_dir_name(trans, log, path, di);
3521 * We do not need to update the size field of the directory's inode item
3522 * because on log replay we update the field to reflect all existing
3523 * entries in the directory (see overwrite_item()).
3526 btrfs_free_path(path);
3528 mutex_unlock(&dir->log_mutex);
3529 if (err == -ENOSPC) {
3530 btrfs_set_log_full_commit(trans);
3532 } else if (err < 0 && err != -ENOENT) {
3533 /* ENOENT can be returned if the entry hasn't been fsynced yet */
3534 btrfs_abort_transaction(trans, err);
3537 btrfs_end_log_trans(root);
3542 /* see comments for btrfs_del_dir_entries_in_log */
3543 int btrfs_del_inode_ref_in_log(struct btrfs_trans_handle *trans,
3544 struct btrfs_root *root,
3545 const char *name, int name_len,
3546 struct btrfs_inode *inode, u64 dirid)
3548 struct btrfs_root *log;
3552 if (!inode_logged(trans, inode))
3555 ret = join_running_log_trans(root);
3558 log = root->log_root;
3559 mutex_lock(&inode->log_mutex);
3561 ret = btrfs_del_inode_ref(trans, log, name, name_len, btrfs_ino(inode),
3563 mutex_unlock(&inode->log_mutex);
3564 if (ret == -ENOSPC) {
3565 btrfs_set_log_full_commit(trans);
3567 } else if (ret < 0 && ret != -ENOENT)
3568 btrfs_abort_transaction(trans, ret);
3569 btrfs_end_log_trans(root);
3575 * creates a range item in the log for 'dirid'. first_offset and
3576 * last_offset tell us which parts of the key space the log should
3577 * be considered authoritative for.
3579 static noinline int insert_dir_log_key(struct btrfs_trans_handle *trans,
3580 struct btrfs_root *log,
3581 struct btrfs_path *path,
3582 int key_type, u64 dirid,
3583 u64 first_offset, u64 last_offset)
3586 struct btrfs_key key;
3587 struct btrfs_dir_log_item *item;
3589 key.objectid = dirid;
3590 key.offset = first_offset;
3591 if (key_type == BTRFS_DIR_ITEM_KEY)
3592 key.type = BTRFS_DIR_LOG_ITEM_KEY;
3594 key.type = BTRFS_DIR_LOG_INDEX_KEY;
3595 ret = btrfs_insert_empty_item(trans, log, path, &key, sizeof(*item));
3599 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
3600 struct btrfs_dir_log_item);
3601 btrfs_set_dir_log_end(path->nodes[0], item, last_offset);
3602 btrfs_mark_buffer_dirty(path->nodes[0]);
3603 btrfs_release_path(path);
3608 * log all the items included in the current transaction for a given
3609 * directory. This also creates the range items in the log tree required
3610 * to replay anything deleted before the fsync
3612 static noinline int log_dir_items(struct btrfs_trans_handle *trans,
3613 struct btrfs_root *root, struct btrfs_inode *inode,
3614 struct btrfs_path *path,
3615 struct btrfs_path *dst_path, int key_type,
3616 struct btrfs_log_ctx *ctx,
3617 u64 min_offset, u64 *last_offset_ret)
3619 struct btrfs_key min_key;
3620 struct btrfs_root *log = root->log_root;
3621 struct extent_buffer *src;
3626 u64 first_offset = min_offset;
3627 u64 last_offset = (u64)-1;
3628 u64 ino = btrfs_ino(inode);
3630 log = root->log_root;
3632 min_key.objectid = ino;
3633 min_key.type = key_type;
3634 min_key.offset = min_offset;
3636 ret = btrfs_search_forward(root, &min_key, path, trans->transid);
3639 * we didn't find anything from this transaction, see if there
3640 * is anything at all
3642 if (ret != 0 || min_key.objectid != ino || min_key.type != key_type) {
3643 min_key.objectid = ino;
3644 min_key.type = key_type;
3645 min_key.offset = (u64)-1;
3646 btrfs_release_path(path);
3647 ret = btrfs_search_slot(NULL, root, &min_key, path, 0, 0);
3649 btrfs_release_path(path);
3652 ret = btrfs_previous_item(root, path, ino, key_type);
3654 /* if ret == 0 there are items for this type,
3655 * create a range to tell us the last key of this type.
3656 * otherwise, there are no items in this directory after
3657 * *min_offset, and we create a range to indicate that.
3660 struct btrfs_key tmp;
3661 btrfs_item_key_to_cpu(path->nodes[0], &tmp,
3663 if (key_type == tmp.type)
3664 first_offset = max(min_offset, tmp.offset) + 1;
3669 /* go backward to find any previous key */
3670 ret = btrfs_previous_item(root, path, ino, key_type);
3672 struct btrfs_key tmp;
3673 btrfs_item_key_to_cpu(path->nodes[0], &tmp, path->slots[0]);
3674 if (key_type == tmp.type) {
3675 first_offset = tmp.offset;
3676 ret = overwrite_item(trans, log, dst_path,
3677 path->nodes[0], path->slots[0],
3685 btrfs_release_path(path);
3688 * Find the first key from this transaction again. See the note for
3689 * log_new_dir_dentries, if we're logging a directory recursively we
3690 * won't be holding its i_mutex, which means we can modify the directory
3691 * while we're logging it. If we remove an entry between our first
3692 * search and this search we'll not find the key again and can just
3696 ret = btrfs_search_slot(NULL, root, &min_key, path, 0, 0);
3701 * we have a block from this transaction, log every item in it
3702 * from our directory
3705 struct btrfs_key tmp;
3706 src = path->nodes[0];
3707 nritems = btrfs_header_nritems(src);
3708 for (i = path->slots[0]; i < nritems; i++) {
3709 struct btrfs_dir_item *di;
3711 btrfs_item_key_to_cpu(src, &min_key, i);
3713 if (min_key.objectid != ino || min_key.type != key_type)
3716 if (need_resched()) {
3717 btrfs_release_path(path);
3722 ret = overwrite_item(trans, log, dst_path, src, i,
3730 * We must make sure that when we log a directory entry,
3731 * the corresponding inode, after log replay, has a
3732 * matching link count. For example:
3738 * xfs_io -c "fsync" mydir
3740 * <mount fs and log replay>
3742 * Would result in a fsync log that when replayed, our
3743 * file inode would have a link count of 1, but we get
3744 * two directory entries pointing to the same inode.
3745 * After removing one of the names, it would not be
3746 * possible to remove the other name, which resulted
3747 * always in stale file handle errors, and would not
3748 * be possible to rmdir the parent directory, since
3749 * its i_size could never decrement to the value
3750 * BTRFS_EMPTY_DIR_SIZE, resulting in -ENOTEMPTY errors.
3752 di = btrfs_item_ptr(src, i, struct btrfs_dir_item);
3753 btrfs_dir_item_key_to_cpu(src, di, &tmp);
3755 (btrfs_dir_transid(src, di) == trans->transid ||
3756 btrfs_dir_type(src, di) == BTRFS_FT_DIR) &&
3757 tmp.type != BTRFS_ROOT_ITEM_KEY)
3758 ctx->log_new_dentries = true;
3760 path->slots[0] = nritems;
3763 * look ahead to the next item and see if it is also
3764 * from this directory and from this transaction
3766 ret = btrfs_next_leaf(root, path);
3769 last_offset = (u64)-1;
3774 btrfs_item_key_to_cpu(path->nodes[0], &tmp, path->slots[0]);
3775 if (tmp.objectid != ino || tmp.type != key_type) {
3776 last_offset = (u64)-1;
3779 if (btrfs_header_generation(path->nodes[0]) != trans->transid) {
3780 ret = overwrite_item(trans, log, dst_path,
3781 path->nodes[0], path->slots[0],
3786 last_offset = tmp.offset;
3791 btrfs_release_path(path);
3792 btrfs_release_path(dst_path);
3795 *last_offset_ret = last_offset;
3797 * insert the log range keys to indicate where the log
3800 ret = insert_dir_log_key(trans, log, path, key_type,
3801 ino, first_offset, last_offset);
3809 * logging directories is very similar to logging inodes, We find all the items
3810 * from the current transaction and write them to the log.
3812 * The recovery code scans the directory in the subvolume, and if it finds a
3813 * key in the range logged that is not present in the log tree, then it means
3814 * that dir entry was unlinked during the transaction.
3816 * In order for that scan to work, we must include one key smaller than
3817 * the smallest logged by this transaction and one key larger than the largest
3818 * key logged by this transaction.
3820 static noinline int log_directory_changes(struct btrfs_trans_handle *trans,
3821 struct btrfs_root *root, struct btrfs_inode *inode,
3822 struct btrfs_path *path,
3823 struct btrfs_path *dst_path,
3824 struct btrfs_log_ctx *ctx)
3829 int key_type = BTRFS_DIR_ITEM_KEY;
3835 ret = log_dir_items(trans, root, inode, path, dst_path, key_type,
3836 ctx, min_key, &max_key);
3839 if (max_key == (u64)-1)
3841 min_key = max_key + 1;
3844 if (key_type == BTRFS_DIR_ITEM_KEY) {
3845 key_type = BTRFS_DIR_INDEX_KEY;
3852 * a helper function to drop items from the log before we relog an
3853 * inode. max_key_type indicates the highest item type to remove.
3854 * This cannot be run for file data extents because it does not
3855 * free the extents they point to.
3857 static int drop_objectid_items(struct btrfs_trans_handle *trans,
3858 struct btrfs_root *log,
3859 struct btrfs_path *path,
3860 u64 objectid, int max_key_type)
3863 struct btrfs_key key;
3864 struct btrfs_key found_key;
3867 key.objectid = objectid;
3868 key.type = max_key_type;
3869 key.offset = (u64)-1;
3872 ret = btrfs_search_slot(trans, log, &key, path, -1, 1);
3873 BUG_ON(ret == 0); /* Logic error */
3877 if (path->slots[0] == 0)
3881 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
3884 if (found_key.objectid != objectid)
3887 found_key.offset = 0;
3889 ret = btrfs_bin_search(path->nodes[0], &found_key, &start_slot);
3893 ret = btrfs_del_items(trans, log, path, start_slot,
3894 path->slots[0] - start_slot + 1);
3896 * If start slot isn't 0 then we don't need to re-search, we've
3897 * found the last guy with the objectid in this tree.
3899 if (ret || start_slot != 0)
3901 btrfs_release_path(path);
3903 btrfs_release_path(path);
3909 static void fill_inode_item(struct btrfs_trans_handle *trans,
3910 struct extent_buffer *leaf,
3911 struct btrfs_inode_item *item,
3912 struct inode *inode, int log_inode_only,
3915 struct btrfs_map_token token;
3917 btrfs_init_map_token(&token, leaf);
3919 if (log_inode_only) {
3920 /* set the generation to zero so the recover code
3921 * can tell the difference between an logging
3922 * just to say 'this inode exists' and a logging
3923 * to say 'update this inode with these values'
3925 btrfs_set_token_inode_generation(&token, item, 0);
3926 btrfs_set_token_inode_size(&token, item, logged_isize);
3928 btrfs_set_token_inode_generation(&token, item,
3929 BTRFS_I(inode)->generation);
3930 btrfs_set_token_inode_size(&token, item, inode->i_size);
3933 btrfs_set_token_inode_uid(&token, item, i_uid_read(inode));
3934 btrfs_set_token_inode_gid(&token, item, i_gid_read(inode));
3935 btrfs_set_token_inode_mode(&token, item, inode->i_mode);
3936 btrfs_set_token_inode_nlink(&token, item, inode->i_nlink);
3938 btrfs_set_token_timespec_sec(&token, &item->atime,
3939 inode->i_atime.tv_sec);
3940 btrfs_set_token_timespec_nsec(&token, &item->atime,
3941 inode->i_atime.tv_nsec);
3943 btrfs_set_token_timespec_sec(&token, &item->mtime,
3944 inode->i_mtime.tv_sec);
3945 btrfs_set_token_timespec_nsec(&token, &item->mtime,
3946 inode->i_mtime.tv_nsec);
3948 btrfs_set_token_timespec_sec(&token, &item->ctime,
3949 inode->i_ctime.tv_sec);
3950 btrfs_set_token_timespec_nsec(&token, &item->ctime,
3951 inode->i_ctime.tv_nsec);
3954 * We do not need to set the nbytes field, in fact during a fast fsync
3955 * its value may not even be correct, since a fast fsync does not wait
3956 * for ordered extent completion, which is where we update nbytes, it
3957 * only waits for writeback to complete. During log replay as we find
3958 * file extent items and replay them, we adjust the nbytes field of the
3959 * inode item in subvolume tree as needed (see overwrite_item()).
3962 btrfs_set_token_inode_sequence(&token, item, inode_peek_iversion(inode));
3963 btrfs_set_token_inode_transid(&token, item, trans->transid);
3964 btrfs_set_token_inode_rdev(&token, item, inode->i_rdev);
3965 btrfs_set_token_inode_flags(&token, item, BTRFS_I(inode)->flags);
3966 btrfs_set_token_inode_block_group(&token, item, 0);
3969 static int log_inode_item(struct btrfs_trans_handle *trans,
3970 struct btrfs_root *log, struct btrfs_path *path,
3971 struct btrfs_inode *inode)
3973 struct btrfs_inode_item *inode_item;
3976 ret = btrfs_insert_empty_item(trans, log, path,
3977 &inode->location, sizeof(*inode_item));
3978 if (ret && ret != -EEXIST)
3980 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
3981 struct btrfs_inode_item);
3982 fill_inode_item(trans, path->nodes[0], inode_item, &inode->vfs_inode,
3984 btrfs_release_path(path);
3988 static int log_csums(struct btrfs_trans_handle *trans,
3989 struct btrfs_inode *inode,
3990 struct btrfs_root *log_root,
3991 struct btrfs_ordered_sum *sums)
3993 const u64 lock_end = sums->bytenr + sums->len - 1;
3994 struct extent_state *cached_state = NULL;
3998 * If this inode was not used for reflink operations in the current
3999 * transaction with new extents, then do the fast path, no need to
4000 * worry about logging checksum items with overlapping ranges.
4002 if (inode->last_reflink_trans < trans->transid)
4003 return btrfs_csum_file_blocks(trans, log_root, sums);
4006 * Serialize logging for checksums. This is to avoid racing with the
4007 * same checksum being logged by another task that is logging another
4008 * file which happens to refer to the same extent as well. Such races
4009 * can leave checksum items in the log with overlapping ranges.
4011 ret = lock_extent_bits(&log_root->log_csum_range, sums->bytenr,
4012 lock_end, &cached_state);
4016 * Due to extent cloning, we might have logged a csum item that covers a
4017 * subrange of a cloned extent, and later we can end up logging a csum
4018 * item for a larger subrange of the same extent or the entire range.
4019 * This would leave csum items in the log tree that cover the same range
4020 * and break the searches for checksums in the log tree, resulting in
4021 * some checksums missing in the fs/subvolume tree. So just delete (or
4022 * trim and adjust) any existing csum items in the log for this range.
4024 ret = btrfs_del_csums(trans, log_root, sums->bytenr, sums->len);
4026 ret = btrfs_csum_file_blocks(trans, log_root, sums);
4028 unlock_extent_cached(&log_root->log_csum_range, sums->bytenr, lock_end,
4034 static noinline int copy_items(struct btrfs_trans_handle *trans,
4035 struct btrfs_inode *inode,
4036 struct btrfs_path *dst_path,
4037 struct btrfs_path *src_path,
4038 int start_slot, int nr, int inode_only,
4041 struct btrfs_fs_info *fs_info = trans->fs_info;
4042 unsigned long src_offset;
4043 unsigned long dst_offset;
4044 struct btrfs_root *log = inode->root->log_root;
4045 struct btrfs_file_extent_item *extent;
4046 struct btrfs_inode_item *inode_item;
4047 struct extent_buffer *src = src_path->nodes[0];
4049 struct btrfs_key *ins_keys;
4053 struct list_head ordered_sums;
4054 int skip_csum = inode->flags & BTRFS_INODE_NODATASUM;
4056 INIT_LIST_HEAD(&ordered_sums);
4058 ins_data = kmalloc(nr * sizeof(struct btrfs_key) +
4059 nr * sizeof(u32), GFP_NOFS);
4063 ins_sizes = (u32 *)ins_data;
4064 ins_keys = (struct btrfs_key *)(ins_data + nr * sizeof(u32));
4066 for (i = 0; i < nr; i++) {
4067 ins_sizes[i] = btrfs_item_size_nr(src, i + start_slot);
4068 btrfs_item_key_to_cpu(src, ins_keys + i, i + start_slot);
4070 ret = btrfs_insert_empty_items(trans, log, dst_path,
4071 ins_keys, ins_sizes, nr);
4077 for (i = 0; i < nr; i++, dst_path->slots[0]++) {
4078 dst_offset = btrfs_item_ptr_offset(dst_path->nodes[0],
4079 dst_path->slots[0]);
4081 src_offset = btrfs_item_ptr_offset(src, start_slot + i);
4083 if (ins_keys[i].type == BTRFS_INODE_ITEM_KEY) {
4084 inode_item = btrfs_item_ptr(dst_path->nodes[0],
4086 struct btrfs_inode_item);
4087 fill_inode_item(trans, dst_path->nodes[0], inode_item,
4089 inode_only == LOG_INODE_EXISTS,
4092 copy_extent_buffer(dst_path->nodes[0], src, dst_offset,
4093 src_offset, ins_sizes[i]);
4096 /* take a reference on file data extents so that truncates
4097 * or deletes of this inode don't have to relog the inode
4100 if (ins_keys[i].type == BTRFS_EXTENT_DATA_KEY &&
4103 extent = btrfs_item_ptr(src, start_slot + i,
4104 struct btrfs_file_extent_item);
4106 if (btrfs_file_extent_generation(src, extent) < trans->transid)
4109 found_type = btrfs_file_extent_type(src, extent);
4110 if (found_type == BTRFS_FILE_EXTENT_REG) {
4112 ds = btrfs_file_extent_disk_bytenr(src,
4114 /* ds == 0 is a hole */
4118 dl = btrfs_file_extent_disk_num_bytes(src,
4120 cs = btrfs_file_extent_offset(src, extent);
4121 cl = btrfs_file_extent_num_bytes(src,
4123 if (btrfs_file_extent_compression(src,
4129 ret = btrfs_lookup_csums_range(
4131 ds + cs, ds + cs + cl - 1,
4139 btrfs_mark_buffer_dirty(dst_path->nodes[0]);
4140 btrfs_release_path(dst_path);
4144 * we have to do this after the loop above to avoid changing the
4145 * log tree while trying to change the log tree.
4147 while (!list_empty(&ordered_sums)) {
4148 struct btrfs_ordered_sum *sums = list_entry(ordered_sums.next,
4149 struct btrfs_ordered_sum,
4152 ret = log_csums(trans, inode, log, sums);
4153 list_del(&sums->list);
4160 static int extent_cmp(void *priv, const struct list_head *a,
4161 const struct list_head *b)
4163 struct extent_map *em1, *em2;
4165 em1 = list_entry(a, struct extent_map, list);
4166 em2 = list_entry(b, struct extent_map, list);
4168 if (em1->start < em2->start)
4170 else if (em1->start > em2->start)
4175 static int log_extent_csums(struct btrfs_trans_handle *trans,
4176 struct btrfs_inode *inode,
4177 struct btrfs_root *log_root,
4178 const struct extent_map *em,
4179 struct btrfs_log_ctx *ctx)
4181 struct btrfs_ordered_extent *ordered;
4184 u64 mod_start = em->mod_start;
4185 u64 mod_len = em->mod_len;
4186 LIST_HEAD(ordered_sums);
4189 if (inode->flags & BTRFS_INODE_NODATASUM ||
4190 test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
4191 em->block_start == EXTENT_MAP_HOLE)
4194 list_for_each_entry(ordered, &ctx->ordered_extents, log_list) {
4195 const u64 ordered_end = ordered->file_offset + ordered->num_bytes;
4196 const u64 mod_end = mod_start + mod_len;
4197 struct btrfs_ordered_sum *sums;
4202 if (ordered_end <= mod_start)
4204 if (mod_end <= ordered->file_offset)
4208 * We are going to copy all the csums on this ordered extent, so
4209 * go ahead and adjust mod_start and mod_len in case this ordered
4210 * extent has already been logged.
4212 if (ordered->file_offset > mod_start) {
4213 if (ordered_end >= mod_end)
4214 mod_len = ordered->file_offset - mod_start;
4216 * If we have this case
4218 * |--------- logged extent ---------|
4219 * |----- ordered extent ----|
4221 * Just don't mess with mod_start and mod_len, we'll
4222 * just end up logging more csums than we need and it
4226 if (ordered_end < mod_end) {
4227 mod_len = mod_end - ordered_end;
4228 mod_start = ordered_end;
4235 * To keep us from looping for the above case of an ordered
4236 * extent that falls inside of the logged extent.
4238 if (test_and_set_bit(BTRFS_ORDERED_LOGGED_CSUM, &ordered->flags))
4241 list_for_each_entry(sums, &ordered->list, list) {
4242 ret = log_csums(trans, inode, log_root, sums);
4248 /* We're done, found all csums in the ordered extents. */
4252 /* If we're compressed we have to save the entire range of csums. */
4253 if (em->compress_type) {
4255 csum_len = max(em->block_len, em->orig_block_len);
4257 csum_offset = mod_start - em->start;
4261 /* block start is already adjusted for the file extent offset. */
4262 ret = btrfs_lookup_csums_range(trans->fs_info->csum_root,
4263 em->block_start + csum_offset,
4264 em->block_start + csum_offset +
4265 csum_len - 1, &ordered_sums, 0);
4269 while (!list_empty(&ordered_sums)) {
4270 struct btrfs_ordered_sum *sums = list_entry(ordered_sums.next,
4271 struct btrfs_ordered_sum,
4274 ret = log_csums(trans, inode, log_root, sums);
4275 list_del(&sums->list);
4282 static int log_one_extent(struct btrfs_trans_handle *trans,
4283 struct btrfs_inode *inode, struct btrfs_root *root,
4284 const struct extent_map *em,
4285 struct btrfs_path *path,
4286 struct btrfs_log_ctx *ctx)
4288 struct btrfs_drop_extents_args drop_args = { 0 };
4289 struct btrfs_root *log = root->log_root;
4290 struct btrfs_file_extent_item *fi;
4291 struct extent_buffer *leaf;
4292 struct btrfs_map_token token;
4293 struct btrfs_key key;
4294 u64 extent_offset = em->start - em->orig_start;
4298 ret = log_extent_csums(trans, inode, log, em, ctx);
4302 drop_args.path = path;
4303 drop_args.start = em->start;
4304 drop_args.end = em->start + em->len;
4305 drop_args.replace_extent = true;
4306 drop_args.extent_item_size = sizeof(*fi);
4307 ret = btrfs_drop_extents(trans, log, inode, &drop_args);
4311 if (!drop_args.extent_inserted) {
4312 key.objectid = btrfs_ino(inode);
4313 key.type = BTRFS_EXTENT_DATA_KEY;
4314 key.offset = em->start;
4316 ret = btrfs_insert_empty_item(trans, log, path, &key,
4321 leaf = path->nodes[0];
4322 btrfs_init_map_token(&token, leaf);
4323 fi = btrfs_item_ptr(leaf, path->slots[0],
4324 struct btrfs_file_extent_item);
4326 btrfs_set_token_file_extent_generation(&token, fi, trans->transid);
4327 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
4328 btrfs_set_token_file_extent_type(&token, fi,
4329 BTRFS_FILE_EXTENT_PREALLOC);
4331 btrfs_set_token_file_extent_type(&token, fi,
4332 BTRFS_FILE_EXTENT_REG);
4334 block_len = max(em->block_len, em->orig_block_len);
4335 if (em->compress_type != BTRFS_COMPRESS_NONE) {
4336 btrfs_set_token_file_extent_disk_bytenr(&token, fi,
4338 btrfs_set_token_file_extent_disk_num_bytes(&token, fi, block_len);
4339 } else if (em->block_start < EXTENT_MAP_LAST_BYTE) {
4340 btrfs_set_token_file_extent_disk_bytenr(&token, fi,
4343 btrfs_set_token_file_extent_disk_num_bytes(&token, fi, block_len);
4345 btrfs_set_token_file_extent_disk_bytenr(&token, fi, 0);
4346 btrfs_set_token_file_extent_disk_num_bytes(&token, fi, 0);
4349 btrfs_set_token_file_extent_offset(&token, fi, extent_offset);
4350 btrfs_set_token_file_extent_num_bytes(&token, fi, em->len);
4351 btrfs_set_token_file_extent_ram_bytes(&token, fi, em->ram_bytes);
4352 btrfs_set_token_file_extent_compression(&token, fi, em->compress_type);
4353 btrfs_set_token_file_extent_encryption(&token, fi, 0);
4354 btrfs_set_token_file_extent_other_encoding(&token, fi, 0);
4355 btrfs_mark_buffer_dirty(leaf);
4357 btrfs_release_path(path);
4363 * Log all prealloc extents beyond the inode's i_size to make sure we do not
4364 * lose them after doing a fast fsync and replaying the log. We scan the
4365 * subvolume's root instead of iterating the inode's extent map tree because
4366 * otherwise we can log incorrect extent items based on extent map conversion.
4367 * That can happen due to the fact that extent maps are merged when they
4368 * are not in the extent map tree's list of modified extents.
4370 static int btrfs_log_prealloc_extents(struct btrfs_trans_handle *trans,
4371 struct btrfs_inode *inode,
4372 struct btrfs_path *path)
4374 struct btrfs_root *root = inode->root;
4375 struct btrfs_key key;
4376 const u64 i_size = i_size_read(&inode->vfs_inode);
4377 const u64 ino = btrfs_ino(inode);
4378 struct btrfs_path *dst_path = NULL;
4379 bool dropped_extents = false;
4380 u64 truncate_offset = i_size;
4381 struct extent_buffer *leaf;
4387 if (!(inode->flags & BTRFS_INODE_PREALLOC))
4391 key.type = BTRFS_EXTENT_DATA_KEY;
4392 key.offset = i_size;
4393 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4398 * We must check if there is a prealloc extent that starts before the
4399 * i_size and crosses the i_size boundary. This is to ensure later we
4400 * truncate down to the end of that extent and not to the i_size, as
4401 * otherwise we end up losing part of the prealloc extent after a log
4402 * replay and with an implicit hole if there is another prealloc extent
4403 * that starts at an offset beyond i_size.
4405 ret = btrfs_previous_item(root, path, ino, BTRFS_EXTENT_DATA_KEY);
4410 struct btrfs_file_extent_item *ei;
4412 leaf = path->nodes[0];
4413 slot = path->slots[0];
4414 ei = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
4416 if (btrfs_file_extent_type(leaf, ei) ==
4417 BTRFS_FILE_EXTENT_PREALLOC) {
4420 btrfs_item_key_to_cpu(leaf, &key, slot);
4421 extent_end = key.offset +
4422 btrfs_file_extent_num_bytes(leaf, ei);
4424 if (extent_end > i_size)
4425 truncate_offset = extent_end;
4432 leaf = path->nodes[0];
4433 slot = path->slots[0];
4435 if (slot >= btrfs_header_nritems(leaf)) {
4437 ret = copy_items(trans, inode, dst_path, path,
4438 start_slot, ins_nr, 1, 0);
4443 ret = btrfs_next_leaf(root, path);
4453 btrfs_item_key_to_cpu(leaf, &key, slot);
4454 if (key.objectid > ino)
4456 if (WARN_ON_ONCE(key.objectid < ino) ||
4457 key.type < BTRFS_EXTENT_DATA_KEY ||
4458 key.offset < i_size) {
4462 if (!dropped_extents) {
4464 * Avoid logging extent items logged in past fsync calls
4465 * and leading to duplicate keys in the log tree.
4468 ret = btrfs_truncate_inode_items(trans,
4470 inode, truncate_offset,
4471 BTRFS_EXTENT_DATA_KEY);
4472 } while (ret == -EAGAIN);
4475 dropped_extents = true;
4482 dst_path = btrfs_alloc_path();
4490 ret = copy_items(trans, inode, dst_path, path,
4491 start_slot, ins_nr, 1, 0);
4493 btrfs_release_path(path);
4494 btrfs_free_path(dst_path);
4498 static int btrfs_log_changed_extents(struct btrfs_trans_handle *trans,
4499 struct btrfs_root *root,
4500 struct btrfs_inode *inode,
4501 struct btrfs_path *path,
4502 struct btrfs_log_ctx *ctx)
4504 struct btrfs_ordered_extent *ordered;
4505 struct btrfs_ordered_extent *tmp;
4506 struct extent_map *em, *n;
4507 struct list_head extents;
4508 struct extent_map_tree *tree = &inode->extent_tree;
4512 INIT_LIST_HEAD(&extents);
4514 write_lock(&tree->lock);
4516 list_for_each_entry_safe(em, n, &tree->modified_extents, list) {
4517 list_del_init(&em->list);
4519 * Just an arbitrary number, this can be really CPU intensive
4520 * once we start getting a lot of extents, and really once we
4521 * have a bunch of extents we just want to commit since it will
4524 if (++num > 32768) {
4525 list_del_init(&tree->modified_extents);
4530 if (em->generation < trans->transid)
4533 /* We log prealloc extents beyond eof later. */
4534 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) &&
4535 em->start >= i_size_read(&inode->vfs_inode))
4538 /* Need a ref to keep it from getting evicted from cache */
4539 refcount_inc(&em->refs);
4540 set_bit(EXTENT_FLAG_LOGGING, &em->flags);
4541 list_add_tail(&em->list, &extents);
4545 list_sort(NULL, &extents, extent_cmp);
4547 while (!list_empty(&extents)) {
4548 em = list_entry(extents.next, struct extent_map, list);
4550 list_del_init(&em->list);
4553 * If we had an error we just need to delete everybody from our
4557 clear_em_logging(tree, em);
4558 free_extent_map(em);
4562 write_unlock(&tree->lock);
4564 ret = log_one_extent(trans, inode, root, em, path, ctx);
4565 write_lock(&tree->lock);
4566 clear_em_logging(tree, em);
4567 free_extent_map(em);
4569 WARN_ON(!list_empty(&extents));
4570 write_unlock(&tree->lock);
4572 btrfs_release_path(path);
4574 ret = btrfs_log_prealloc_extents(trans, inode, path);
4579 * We have logged all extents successfully, now make sure the commit of
4580 * the current transaction waits for the ordered extents to complete
4581 * before it commits and wipes out the log trees, otherwise we would
4582 * lose data if an ordered extents completes after the transaction
4583 * commits and a power failure happens after the transaction commit.
4585 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) {
4586 list_del_init(&ordered->log_list);
4587 set_bit(BTRFS_ORDERED_LOGGED, &ordered->flags);
4589 if (!test_bit(BTRFS_ORDERED_COMPLETE, &ordered->flags)) {
4590 spin_lock_irq(&inode->ordered_tree.lock);
4591 if (!test_bit(BTRFS_ORDERED_COMPLETE, &ordered->flags)) {
4592 set_bit(BTRFS_ORDERED_PENDING, &ordered->flags);
4593 atomic_inc(&trans->transaction->pending_ordered);
4595 spin_unlock_irq(&inode->ordered_tree.lock);
4597 btrfs_put_ordered_extent(ordered);
4603 static int logged_inode_size(struct btrfs_root *log, struct btrfs_inode *inode,
4604 struct btrfs_path *path, u64 *size_ret)
4606 struct btrfs_key key;
4609 key.objectid = btrfs_ino(inode);
4610 key.type = BTRFS_INODE_ITEM_KEY;
4613 ret = btrfs_search_slot(NULL, log, &key, path, 0, 0);
4616 } else if (ret > 0) {
4619 struct btrfs_inode_item *item;
4621 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
4622 struct btrfs_inode_item);
4623 *size_ret = btrfs_inode_size(path->nodes[0], item);
4625 * If the in-memory inode's i_size is smaller then the inode
4626 * size stored in the btree, return the inode's i_size, so
4627 * that we get a correct inode size after replaying the log
4628 * when before a power failure we had a shrinking truncate
4629 * followed by addition of a new name (rename / new hard link).
4630 * Otherwise return the inode size from the btree, to avoid
4631 * data loss when replaying a log due to previously doing a
4632 * write that expands the inode's size and logging a new name
4633 * immediately after.
4635 if (*size_ret > inode->vfs_inode.i_size)
4636 *size_ret = inode->vfs_inode.i_size;
4639 btrfs_release_path(path);
4644 * At the moment we always log all xattrs. This is to figure out at log replay
4645 * time which xattrs must have their deletion replayed. If a xattr is missing
4646 * in the log tree and exists in the fs/subvol tree, we delete it. This is
4647 * because if a xattr is deleted, the inode is fsynced and a power failure
4648 * happens, causing the log to be replayed the next time the fs is mounted,
4649 * we want the xattr to not exist anymore (same behaviour as other filesystems
4650 * with a journal, ext3/4, xfs, f2fs, etc).
4652 static int btrfs_log_all_xattrs(struct btrfs_trans_handle *trans,
4653 struct btrfs_root *root,
4654 struct btrfs_inode *inode,
4655 struct btrfs_path *path,
4656 struct btrfs_path *dst_path)
4659 struct btrfs_key key;
4660 const u64 ino = btrfs_ino(inode);
4663 bool found_xattrs = false;
4665 if (test_bit(BTRFS_INODE_NO_XATTRS, &inode->runtime_flags))
4669 key.type = BTRFS_XATTR_ITEM_KEY;
4672 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4677 int slot = path->slots[0];
4678 struct extent_buffer *leaf = path->nodes[0];
4679 int nritems = btrfs_header_nritems(leaf);
4681 if (slot >= nritems) {
4683 ret = copy_items(trans, inode, dst_path, path,
4684 start_slot, ins_nr, 1, 0);
4689 ret = btrfs_next_leaf(root, path);
4697 btrfs_item_key_to_cpu(leaf, &key, slot);
4698 if (key.objectid != ino || key.type != BTRFS_XATTR_ITEM_KEY)
4705 found_xattrs = true;
4709 ret = copy_items(trans, inode, dst_path, path,
4710 start_slot, ins_nr, 1, 0);
4716 set_bit(BTRFS_INODE_NO_XATTRS, &inode->runtime_flags);
4722 * When using the NO_HOLES feature if we punched a hole that causes the
4723 * deletion of entire leafs or all the extent items of the first leaf (the one
4724 * that contains the inode item and references) we may end up not processing
4725 * any extents, because there are no leafs with a generation matching the
4726 * current transaction that have extent items for our inode. So we need to find
4727 * if any holes exist and then log them. We also need to log holes after any
4728 * truncate operation that changes the inode's size.
4730 static int btrfs_log_holes(struct btrfs_trans_handle *trans,
4731 struct btrfs_root *root,
4732 struct btrfs_inode *inode,
4733 struct btrfs_path *path)
4735 struct btrfs_fs_info *fs_info = root->fs_info;
4736 struct btrfs_key key;
4737 const u64 ino = btrfs_ino(inode);
4738 const u64 i_size = i_size_read(&inode->vfs_inode);
4739 u64 prev_extent_end = 0;
4742 if (!btrfs_fs_incompat(fs_info, NO_HOLES) || i_size == 0)
4746 key.type = BTRFS_EXTENT_DATA_KEY;
4749 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4754 struct extent_buffer *leaf = path->nodes[0];
4756 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
4757 ret = btrfs_next_leaf(root, path);
4764 leaf = path->nodes[0];
4767 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4768 if (key.objectid != ino || key.type != BTRFS_EXTENT_DATA_KEY)
4771 /* We have a hole, log it. */
4772 if (prev_extent_end < key.offset) {
4773 const u64 hole_len = key.offset - prev_extent_end;
4776 * Release the path to avoid deadlocks with other code
4777 * paths that search the root while holding locks on
4778 * leafs from the log root.
4780 btrfs_release_path(path);
4781 ret = btrfs_insert_file_extent(trans, root->log_root,
4782 ino, prev_extent_end, 0,
4783 0, hole_len, 0, hole_len,
4789 * Search for the same key again in the root. Since it's
4790 * an extent item and we are holding the inode lock, the
4791 * key must still exist. If it doesn't just emit warning
4792 * and return an error to fall back to a transaction
4795 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4798 if (WARN_ON(ret > 0))
4800 leaf = path->nodes[0];
4803 prev_extent_end = btrfs_file_extent_end(path);
4808 if (prev_extent_end < i_size) {
4811 btrfs_release_path(path);
4812 hole_len = ALIGN(i_size - prev_extent_end, fs_info->sectorsize);
4813 ret = btrfs_insert_file_extent(trans, root->log_root,
4814 ino, prev_extent_end, 0, 0,
4815 hole_len, 0, hole_len,
4825 * When we are logging a new inode X, check if it doesn't have a reference that
4826 * matches the reference from some other inode Y created in a past transaction
4827 * and that was renamed in the current transaction. If we don't do this, then at
4828 * log replay time we can lose inode Y (and all its files if it's a directory):
4831 * echo "hello world" > /mnt/x/foobar
4834 * mkdir /mnt/x # or touch /mnt/x
4835 * xfs_io -c fsync /mnt/x
4837 * mount fs, trigger log replay
4839 * After the log replay procedure, we would lose the first directory and all its
4840 * files (file foobar).
4841 * For the case where inode Y is not a directory we simply end up losing it:
4843 * echo "123" > /mnt/foo
4845 * mv /mnt/foo /mnt/bar
4846 * echo "abc" > /mnt/foo
4847 * xfs_io -c fsync /mnt/foo
4850 * We also need this for cases where a snapshot entry is replaced by some other
4851 * entry (file or directory) otherwise we end up with an unreplayable log due to
4852 * attempts to delete the snapshot entry (entry of type BTRFS_ROOT_ITEM_KEY) as
4853 * if it were a regular entry:
4856 * btrfs subvolume snapshot /mnt /mnt/x/snap
4857 * btrfs subvolume delete /mnt/x/snap
4860 * fsync /mnt/x or fsync some new file inside it
4863 * The snapshot delete, rmdir of x, mkdir of a new x and the fsync all happen in
4864 * the same transaction.
4866 static int btrfs_check_ref_name_override(struct extent_buffer *eb,
4868 const struct btrfs_key *key,
4869 struct btrfs_inode *inode,
4870 u64 *other_ino, u64 *other_parent)
4873 struct btrfs_path *search_path;
4876 u32 item_size = btrfs_item_size_nr(eb, slot);
4878 unsigned long ptr = btrfs_item_ptr_offset(eb, slot);
4880 search_path = btrfs_alloc_path();
4883 search_path->search_commit_root = 1;
4884 search_path->skip_locking = 1;
4886 while (cur_offset < item_size) {
4890 unsigned long name_ptr;
4891 struct btrfs_dir_item *di;
4893 if (key->type == BTRFS_INODE_REF_KEY) {
4894 struct btrfs_inode_ref *iref;
4896 iref = (struct btrfs_inode_ref *)(ptr + cur_offset);
4897 parent = key->offset;
4898 this_name_len = btrfs_inode_ref_name_len(eb, iref);
4899 name_ptr = (unsigned long)(iref + 1);
4900 this_len = sizeof(*iref) + this_name_len;
4902 struct btrfs_inode_extref *extref;
4904 extref = (struct btrfs_inode_extref *)(ptr +
4906 parent = btrfs_inode_extref_parent(eb, extref);
4907 this_name_len = btrfs_inode_extref_name_len(eb, extref);
4908 name_ptr = (unsigned long)&extref->name;
4909 this_len = sizeof(*extref) + this_name_len;
4912 if (this_name_len > name_len) {
4915 new_name = krealloc(name, this_name_len, GFP_NOFS);
4920 name_len = this_name_len;
4924 read_extent_buffer(eb, name, name_ptr, this_name_len);
4925 di = btrfs_lookup_dir_item(NULL, inode->root, search_path,
4926 parent, name, this_name_len, 0);
4927 if (di && !IS_ERR(di)) {
4928 struct btrfs_key di_key;
4930 btrfs_dir_item_key_to_cpu(search_path->nodes[0],
4932 if (di_key.type == BTRFS_INODE_ITEM_KEY) {
4933 if (di_key.objectid != key->objectid) {
4935 *other_ino = di_key.objectid;
4936 *other_parent = parent;
4944 } else if (IS_ERR(di)) {
4948 btrfs_release_path(search_path);
4950 cur_offset += this_len;
4954 btrfs_free_path(search_path);
4959 struct btrfs_ino_list {
4962 struct list_head list;
4965 static int log_conflicting_inodes(struct btrfs_trans_handle *trans,
4966 struct btrfs_root *root,
4967 struct btrfs_path *path,
4968 struct btrfs_log_ctx *ctx,
4969 u64 ino, u64 parent)
4971 struct btrfs_ino_list *ino_elem;
4972 LIST_HEAD(inode_list);
4975 ino_elem = kmalloc(sizeof(*ino_elem), GFP_NOFS);
4978 ino_elem->ino = ino;
4979 ino_elem->parent = parent;
4980 list_add_tail(&ino_elem->list, &inode_list);
4982 while (!list_empty(&inode_list)) {
4983 struct btrfs_fs_info *fs_info = root->fs_info;
4984 struct btrfs_key key;
4985 struct inode *inode;
4987 ino_elem = list_first_entry(&inode_list, struct btrfs_ino_list,
4989 ino = ino_elem->ino;
4990 parent = ino_elem->parent;
4991 list_del(&ino_elem->list);
4996 btrfs_release_path(path);
4998 inode = btrfs_iget(fs_info->sb, ino, root);
5000 * If the other inode that had a conflicting dir entry was
5001 * deleted in the current transaction, we need to log its parent
5004 if (IS_ERR(inode)) {
5005 ret = PTR_ERR(inode);
5006 if (ret == -ENOENT) {
5007 inode = btrfs_iget(fs_info->sb, parent, root);
5008 if (IS_ERR(inode)) {
5009 ret = PTR_ERR(inode);
5011 ret = btrfs_log_inode(trans, root,
5013 LOG_OTHER_INODE_ALL,
5015 btrfs_add_delayed_iput(inode);
5021 * If the inode was already logged skip it - otherwise we can
5022 * hit an infinite loop. Example:
5024 * From the commit root (previous transaction) we have the
5027 * inode 257 a directory
5028 * inode 258 with references "zz" and "zz_link" on inode 257
5029 * inode 259 with reference "a" on inode 257
5031 * And in the current (uncommitted) transaction we have:
5033 * inode 257 a directory, unchanged
5034 * inode 258 with references "a" and "a2" on inode 257
5035 * inode 259 with reference "zz_link" on inode 257
5036 * inode 261 with reference "zz" on inode 257
5038 * When logging inode 261 the following infinite loop could
5039 * happen if we don't skip already logged inodes:
5041 * - we detect inode 258 as a conflicting inode, with inode 261
5042 * on reference "zz", and log it;
5044 * - we detect inode 259 as a conflicting inode, with inode 258
5045 * on reference "a", and log it;
5047 * - we detect inode 258 as a conflicting inode, with inode 259
5048 * on reference "zz_link", and log it - again! After this we
5049 * repeat the above steps forever.
5051 spin_lock(&BTRFS_I(inode)->lock);
5053 * Check the inode's logged_trans only instead of
5054 * btrfs_inode_in_log(). This is because the last_log_commit of
5055 * the inode is not updated when we only log that it exists and
5056 * it has the full sync bit set (see btrfs_log_inode()).
5058 if (BTRFS_I(inode)->logged_trans == trans->transid) {
5059 spin_unlock(&BTRFS_I(inode)->lock);
5060 btrfs_add_delayed_iput(inode);
5063 spin_unlock(&BTRFS_I(inode)->lock);
5065 * We are safe logging the other inode without acquiring its
5066 * lock as long as we log with the LOG_INODE_EXISTS mode. We
5067 * are safe against concurrent renames of the other inode as
5068 * well because during a rename we pin the log and update the
5069 * log with the new name before we unpin it.
5071 ret = btrfs_log_inode(trans, root, BTRFS_I(inode),
5072 LOG_OTHER_INODE, ctx);
5074 btrfs_add_delayed_iput(inode);
5079 key.type = BTRFS_INODE_REF_KEY;
5081 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5083 btrfs_add_delayed_iput(inode);
5088 struct extent_buffer *leaf = path->nodes[0];
5089 int slot = path->slots[0];
5091 u64 other_parent = 0;
5093 if (slot >= btrfs_header_nritems(leaf)) {
5094 ret = btrfs_next_leaf(root, path);
5097 } else if (ret > 0) {
5104 btrfs_item_key_to_cpu(leaf, &key, slot);
5105 if (key.objectid != ino ||
5106 (key.type != BTRFS_INODE_REF_KEY &&
5107 key.type != BTRFS_INODE_EXTREF_KEY)) {
5112 ret = btrfs_check_ref_name_override(leaf, slot, &key,
5113 BTRFS_I(inode), &other_ino,
5118 ino_elem = kmalloc(sizeof(*ino_elem), GFP_NOFS);
5123 ino_elem->ino = other_ino;
5124 ino_elem->parent = other_parent;
5125 list_add_tail(&ino_elem->list, &inode_list);
5130 btrfs_add_delayed_iput(inode);
5136 static int copy_inode_items_to_log(struct btrfs_trans_handle *trans,
5137 struct btrfs_inode *inode,
5138 struct btrfs_key *min_key,
5139 const struct btrfs_key *max_key,
5140 struct btrfs_path *path,
5141 struct btrfs_path *dst_path,
5142 const u64 logged_isize,
5143 const bool recursive_logging,
5144 const int inode_only,
5145 struct btrfs_log_ctx *ctx,
5146 bool *need_log_inode_item)
5148 struct btrfs_root *root = inode->root;
5149 int ins_start_slot = 0;
5154 ret = btrfs_search_forward(root, min_key, path, trans->transid);
5162 /* Note, ins_nr might be > 0 here, cleanup outside the loop */
5163 if (min_key->objectid != max_key->objectid)
5165 if (min_key->type > max_key->type)
5168 if (min_key->type == BTRFS_INODE_ITEM_KEY)
5169 *need_log_inode_item = false;
5171 if ((min_key->type == BTRFS_INODE_REF_KEY ||
5172 min_key->type == BTRFS_INODE_EXTREF_KEY) &&
5173 inode->generation == trans->transid &&
5174 !recursive_logging) {
5176 u64 other_parent = 0;
5178 ret = btrfs_check_ref_name_override(path->nodes[0],
5179 path->slots[0], min_key, inode,
5180 &other_ino, &other_parent);
5183 } else if (ret > 0 && ctx &&
5184 other_ino != btrfs_ino(BTRFS_I(ctx->inode))) {
5189 ins_start_slot = path->slots[0];
5191 ret = copy_items(trans, inode, dst_path, path,
5192 ins_start_slot, ins_nr,
5193 inode_only, logged_isize);
5198 ret = log_conflicting_inodes(trans, root, path,
5199 ctx, other_ino, other_parent);
5202 btrfs_release_path(path);
5207 /* Skip xattrs, we log them later with btrfs_log_all_xattrs() */
5208 if (min_key->type == BTRFS_XATTR_ITEM_KEY) {
5211 ret = copy_items(trans, inode, dst_path, path,
5213 ins_nr, inode_only, logged_isize);
5220 if (ins_nr && ins_start_slot + ins_nr == path->slots[0]) {
5223 } else if (!ins_nr) {
5224 ins_start_slot = path->slots[0];
5229 ret = copy_items(trans, inode, dst_path, path, ins_start_slot,
5230 ins_nr, inode_only, logged_isize);
5234 ins_start_slot = path->slots[0];
5237 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) {
5238 btrfs_item_key_to_cpu(path->nodes[0], min_key,
5243 ret = copy_items(trans, inode, dst_path, path,
5244 ins_start_slot, ins_nr, inode_only,
5250 btrfs_release_path(path);
5252 if (min_key->offset < (u64)-1) {
5254 } else if (min_key->type < max_key->type) {
5256 min_key->offset = 0;
5262 ret = copy_items(trans, inode, dst_path, path, ins_start_slot,
5263 ins_nr, inode_only, logged_isize);
5268 /* log a single inode in the tree log.
5269 * At least one parent directory for this inode must exist in the tree
5270 * or be logged already.
5272 * Any items from this inode changed by the current transaction are copied
5273 * to the log tree. An extra reference is taken on any extents in this
5274 * file, allowing us to avoid a whole pile of corner cases around logging
5275 * blocks that have been removed from the tree.
5277 * See LOG_INODE_ALL and related defines for a description of what inode_only
5280 * This handles both files and directories.
5282 static int btrfs_log_inode(struct btrfs_trans_handle *trans,
5283 struct btrfs_root *root, struct btrfs_inode *inode,
5285 struct btrfs_log_ctx *ctx)
5287 struct btrfs_path *path;
5288 struct btrfs_path *dst_path;
5289 struct btrfs_key min_key;
5290 struct btrfs_key max_key;
5291 struct btrfs_root *log = root->log_root;
5294 bool fast_search = false;
5295 u64 ino = btrfs_ino(inode);
5296 struct extent_map_tree *em_tree = &inode->extent_tree;
5297 u64 logged_isize = 0;
5298 bool need_log_inode_item = true;
5299 bool xattrs_logged = false;
5300 bool recursive_logging = false;
5302 path = btrfs_alloc_path();
5305 dst_path = btrfs_alloc_path();
5307 btrfs_free_path(path);
5311 min_key.objectid = ino;
5312 min_key.type = BTRFS_INODE_ITEM_KEY;
5315 max_key.objectid = ino;
5318 /* today the code can only do partial logging of directories */
5319 if (S_ISDIR(inode->vfs_inode.i_mode) ||
5320 (!test_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
5321 &inode->runtime_flags) &&
5322 inode_only >= LOG_INODE_EXISTS))
5323 max_key.type = BTRFS_XATTR_ITEM_KEY;
5325 max_key.type = (u8)-1;
5326 max_key.offset = (u64)-1;
5329 * Only run delayed items if we are a directory. We want to make sure
5330 * all directory indexes hit the fs/subvolume tree so we can find them
5331 * and figure out which index ranges have to be logged.
5333 * Otherwise commit the delayed inode only if the full sync flag is set,
5334 * as we want to make sure an up to date version is in the subvolume
5335 * tree so copy_inode_items_to_log() / copy_items() can find it and copy
5336 * it to the log tree. For a non full sync, we always log the inode item
5337 * based on the in-memory struct btrfs_inode which is always up to date.
5339 if (S_ISDIR(inode->vfs_inode.i_mode))
5340 ret = btrfs_commit_inode_delayed_items(trans, inode);
5341 else if (test_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags))
5342 ret = btrfs_commit_inode_delayed_inode(inode);
5345 btrfs_free_path(path);
5346 btrfs_free_path(dst_path);
5350 if (inode_only == LOG_OTHER_INODE || inode_only == LOG_OTHER_INODE_ALL) {
5351 recursive_logging = true;
5352 if (inode_only == LOG_OTHER_INODE)
5353 inode_only = LOG_INODE_EXISTS;
5355 inode_only = LOG_INODE_ALL;
5356 mutex_lock_nested(&inode->log_mutex, SINGLE_DEPTH_NESTING);
5358 mutex_lock(&inode->log_mutex);
5362 * This is for cases where logging a directory could result in losing a
5363 * a file after replaying the log. For example, if we move a file from a
5364 * directory A to a directory B, then fsync directory A, we have no way
5365 * to known the file was moved from A to B, so logging just A would
5366 * result in losing the file after a log replay.
5368 if (S_ISDIR(inode->vfs_inode.i_mode) &&
5369 inode_only == LOG_INODE_ALL &&
5370 inode->last_unlink_trans >= trans->transid) {
5371 btrfs_set_log_full_commit(trans);
5377 * a brute force approach to making sure we get the most uptodate
5378 * copies of everything.
5380 if (S_ISDIR(inode->vfs_inode.i_mode)) {
5381 int max_key_type = BTRFS_DIR_LOG_INDEX_KEY;
5383 clear_bit(BTRFS_INODE_COPY_EVERYTHING, &inode->runtime_flags);
5384 if (inode_only == LOG_INODE_EXISTS)
5385 max_key_type = BTRFS_XATTR_ITEM_KEY;
5386 ret = drop_objectid_items(trans, log, path, ino, max_key_type);
5388 if (inode_only == LOG_INODE_EXISTS) {
5390 * Make sure the new inode item we write to the log has
5391 * the same isize as the current one (if it exists).
5392 * This is necessary to prevent data loss after log
5393 * replay, and also to prevent doing a wrong expanding
5394 * truncate - for e.g. create file, write 4K into offset
5395 * 0, fsync, write 4K into offset 4096, add hard link,
5396 * fsync some other file (to sync log), power fail - if
5397 * we use the inode's current i_size, after log replay
5398 * we get a 8Kb file, with the last 4Kb extent as a hole
5399 * (zeroes), as if an expanding truncate happened,
5400 * instead of getting a file of 4Kb only.
5402 err = logged_inode_size(log, inode, path, &logged_isize);
5406 if (test_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
5407 &inode->runtime_flags)) {
5408 if (inode_only == LOG_INODE_EXISTS) {
5409 max_key.type = BTRFS_XATTR_ITEM_KEY;
5410 ret = drop_objectid_items(trans, log, path, ino,
5413 clear_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
5414 &inode->runtime_flags);
5415 clear_bit(BTRFS_INODE_COPY_EVERYTHING,
5416 &inode->runtime_flags);
5418 ret = btrfs_truncate_inode_items(trans,
5424 } else if (test_and_clear_bit(BTRFS_INODE_COPY_EVERYTHING,
5425 &inode->runtime_flags) ||
5426 inode_only == LOG_INODE_EXISTS) {
5427 if (inode_only == LOG_INODE_ALL)
5429 max_key.type = BTRFS_XATTR_ITEM_KEY;
5430 ret = drop_objectid_items(trans, log, path, ino,
5433 if (inode_only == LOG_INODE_ALL)
5444 err = copy_inode_items_to_log(trans, inode, &min_key, &max_key,
5445 path, dst_path, logged_isize,
5446 recursive_logging, inode_only, ctx,
5447 &need_log_inode_item);
5451 btrfs_release_path(path);
5452 btrfs_release_path(dst_path);
5453 err = btrfs_log_all_xattrs(trans, root, inode, path, dst_path);
5456 xattrs_logged = true;
5457 if (max_key.type >= BTRFS_EXTENT_DATA_KEY && !fast_search) {
5458 btrfs_release_path(path);
5459 btrfs_release_path(dst_path);
5460 err = btrfs_log_holes(trans, root, inode, path);
5465 btrfs_release_path(path);
5466 btrfs_release_path(dst_path);
5467 if (need_log_inode_item) {
5468 err = log_inode_item(trans, log, dst_path, inode);
5469 if (!err && !xattrs_logged) {
5470 err = btrfs_log_all_xattrs(trans, root, inode, path,
5472 btrfs_release_path(path);
5478 ret = btrfs_log_changed_extents(trans, root, inode, dst_path,
5484 } else if (inode_only == LOG_INODE_ALL) {
5485 struct extent_map *em, *n;
5487 write_lock(&em_tree->lock);
5488 list_for_each_entry_safe(em, n, &em_tree->modified_extents, list)
5489 list_del_init(&em->list);
5490 write_unlock(&em_tree->lock);
5493 if (inode_only == LOG_INODE_ALL && S_ISDIR(inode->vfs_inode.i_mode)) {
5494 ret = log_directory_changes(trans, root, inode, path, dst_path,
5503 * If we are logging that an ancestor inode exists as part of logging a
5504 * new name from a link or rename operation, don't mark the inode as
5505 * logged - otherwise if an explicit fsync is made against an ancestor,
5506 * the fsync considers the inode in the log and doesn't sync the log,
5507 * resulting in the ancestor missing after a power failure unless the
5508 * log was synced as part of an fsync against any other unrelated inode.
5509 * So keep it simple for this case and just don't flag the ancestors as
5513 !(S_ISDIR(inode->vfs_inode.i_mode) && ctx->logging_new_name &&
5514 &inode->vfs_inode != ctx->inode)) {
5515 spin_lock(&inode->lock);
5516 inode->logged_trans = trans->transid;
5518 * Don't update last_log_commit if we logged that an inode exists
5519 * after it was loaded to memory (full_sync bit set).
5520 * This is to prevent data loss when we do a write to the inode,
5521 * then the inode gets evicted after all delalloc was flushed,
5522 * then we log it exists (due to a rename for example) and then
5523 * fsync it. This last fsync would do nothing (not logging the
5524 * extents previously written).
5526 if (inode_only != LOG_INODE_EXISTS ||
5527 !test_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags))
5528 inode->last_log_commit = inode->last_sub_trans;
5529 spin_unlock(&inode->lock);
5532 mutex_unlock(&inode->log_mutex);
5534 btrfs_free_path(path);
5535 btrfs_free_path(dst_path);
5540 * Check if we need to log an inode. This is used in contexts where while
5541 * logging an inode we need to log another inode (either that it exists or in
5542 * full mode). This is used instead of btrfs_inode_in_log() because the later
5543 * requires the inode to be in the log and have the log transaction committed,
5544 * while here we do not care if the log transaction was already committed - our
5545 * caller will commit the log later - and we want to avoid logging an inode
5546 * multiple times when multiple tasks have joined the same log transaction.
5548 static bool need_log_inode(struct btrfs_trans_handle *trans,
5549 struct btrfs_inode *inode)
5552 * If this inode does not have new/updated/deleted xattrs since the last
5553 * time it was logged and is flagged as logged in the current transaction,
5554 * we can skip logging it. As for new/deleted names, those are updated in
5555 * the log by link/unlink/rename operations.
5556 * In case the inode was logged and then evicted and reloaded, its
5557 * logged_trans will be 0, in which case we have to fully log it since
5558 * logged_trans is a transient field, not persisted.
5560 if (inode->logged_trans == trans->transid &&
5561 !test_bit(BTRFS_INODE_COPY_EVERYTHING, &inode->runtime_flags))
5567 struct btrfs_dir_list {
5569 struct list_head list;
5573 * Log the inodes of the new dentries of a directory. See log_dir_items() for
5574 * details about the why it is needed.
5575 * This is a recursive operation - if an existing dentry corresponds to a
5576 * directory, that directory's new entries are logged too (same behaviour as
5577 * ext3/4, xfs, f2fs, reiserfs, nilfs2). Note that when logging the inodes
5578 * the dentries point to we do not lock their i_mutex, otherwise lockdep
5579 * complains about the following circular lock dependency / possible deadlock:
5583 * lock(&type->i_mutex_dir_key#3/2);
5584 * lock(sb_internal#2);
5585 * lock(&type->i_mutex_dir_key#3/2);
5586 * lock(&sb->s_type->i_mutex_key#14);
5588 * Where sb_internal is the lock (a counter that works as a lock) acquired by
5589 * sb_start_intwrite() in btrfs_start_transaction().
5590 * Not locking i_mutex of the inodes is still safe because:
5592 * 1) For regular files we log with a mode of LOG_INODE_EXISTS. It's possible
5593 * that while logging the inode new references (names) are added or removed
5594 * from the inode, leaving the logged inode item with a link count that does
5595 * not match the number of logged inode reference items. This is fine because
5596 * at log replay time we compute the real number of links and correct the
5597 * link count in the inode item (see replay_one_buffer() and
5598 * link_to_fixup_dir());
5600 * 2) For directories we log with a mode of LOG_INODE_ALL. It's possible that
5601 * while logging the inode's items new items with keys BTRFS_DIR_ITEM_KEY and
5602 * BTRFS_DIR_INDEX_KEY are added to fs/subvol tree and the logged inode item
5603 * has a size that doesn't match the sum of the lengths of all the logged
5604 * names. This does not result in a problem because if a dir_item key is
5605 * logged but its matching dir_index key is not logged, at log replay time we
5606 * don't use it to replay the respective name (see replay_one_name()). On the
5607 * other hand if only the dir_index key ends up being logged, the respective
5608 * name is added to the fs/subvol tree with both the dir_item and dir_index
5609 * keys created (see replay_one_name()).
5610 * The directory's inode item with a wrong i_size is not a problem as well,
5611 * since we don't use it at log replay time to set the i_size in the inode
5612 * item of the fs/subvol tree (see overwrite_item()).
5614 static int log_new_dir_dentries(struct btrfs_trans_handle *trans,
5615 struct btrfs_root *root,
5616 struct btrfs_inode *start_inode,
5617 struct btrfs_log_ctx *ctx)
5619 struct btrfs_fs_info *fs_info = root->fs_info;
5620 struct btrfs_root *log = root->log_root;
5621 struct btrfs_path *path;
5622 LIST_HEAD(dir_list);
5623 struct btrfs_dir_list *dir_elem;
5626 path = btrfs_alloc_path();
5630 dir_elem = kmalloc(sizeof(*dir_elem), GFP_NOFS);
5632 btrfs_free_path(path);
5635 dir_elem->ino = btrfs_ino(start_inode);
5636 list_add_tail(&dir_elem->list, &dir_list);
5638 while (!list_empty(&dir_list)) {
5639 struct extent_buffer *leaf;
5640 struct btrfs_key min_key;
5644 dir_elem = list_first_entry(&dir_list, struct btrfs_dir_list,
5647 goto next_dir_inode;
5649 min_key.objectid = dir_elem->ino;
5650 min_key.type = BTRFS_DIR_ITEM_KEY;
5653 btrfs_release_path(path);
5654 ret = btrfs_search_forward(log, &min_key, path, trans->transid);
5656 goto next_dir_inode;
5657 } else if (ret > 0) {
5659 goto next_dir_inode;
5663 leaf = path->nodes[0];
5664 nritems = btrfs_header_nritems(leaf);
5665 for (i = path->slots[0]; i < nritems; i++) {
5666 struct btrfs_dir_item *di;
5667 struct btrfs_key di_key;
5668 struct inode *di_inode;
5669 struct btrfs_dir_list *new_dir_elem;
5670 int log_mode = LOG_INODE_EXISTS;
5673 btrfs_item_key_to_cpu(leaf, &min_key, i);
5674 if (min_key.objectid != dir_elem->ino ||
5675 min_key.type != BTRFS_DIR_ITEM_KEY)
5676 goto next_dir_inode;
5678 di = btrfs_item_ptr(leaf, i, struct btrfs_dir_item);
5679 type = btrfs_dir_type(leaf, di);
5680 if (btrfs_dir_transid(leaf, di) < trans->transid &&
5681 type != BTRFS_FT_DIR)
5683 btrfs_dir_item_key_to_cpu(leaf, di, &di_key);
5684 if (di_key.type == BTRFS_ROOT_ITEM_KEY)
5687 btrfs_release_path(path);
5688 di_inode = btrfs_iget(fs_info->sb, di_key.objectid, root);
5689 if (IS_ERR(di_inode)) {
5690 ret = PTR_ERR(di_inode);
5691 goto next_dir_inode;
5694 if (!need_log_inode(trans, BTRFS_I(di_inode))) {
5695 btrfs_add_delayed_iput(di_inode);
5699 ctx->log_new_dentries = false;
5700 if (type == BTRFS_FT_DIR || type == BTRFS_FT_SYMLINK)
5701 log_mode = LOG_INODE_ALL;
5702 ret = btrfs_log_inode(trans, root, BTRFS_I(di_inode),
5704 btrfs_add_delayed_iput(di_inode);
5706 goto next_dir_inode;
5707 if (ctx->log_new_dentries) {
5708 new_dir_elem = kmalloc(sizeof(*new_dir_elem),
5710 if (!new_dir_elem) {
5712 goto next_dir_inode;
5714 new_dir_elem->ino = di_key.objectid;
5715 list_add_tail(&new_dir_elem->list, &dir_list);
5720 ret = btrfs_next_leaf(log, path);
5722 goto next_dir_inode;
5723 } else if (ret > 0) {
5725 goto next_dir_inode;
5729 if (min_key.offset < (u64)-1) {
5734 list_del(&dir_elem->list);
5738 btrfs_free_path(path);
5742 static int btrfs_log_all_parents(struct btrfs_trans_handle *trans,
5743 struct btrfs_inode *inode,
5744 struct btrfs_log_ctx *ctx)
5746 struct btrfs_fs_info *fs_info = trans->fs_info;
5748 struct btrfs_path *path;
5749 struct btrfs_key key;
5750 struct btrfs_root *root = inode->root;
5751 const u64 ino = btrfs_ino(inode);
5753 path = btrfs_alloc_path();
5756 path->skip_locking = 1;
5757 path->search_commit_root = 1;
5760 key.type = BTRFS_INODE_REF_KEY;
5762 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5767 struct extent_buffer *leaf = path->nodes[0];
5768 int slot = path->slots[0];
5773 if (slot >= btrfs_header_nritems(leaf)) {
5774 ret = btrfs_next_leaf(root, path);
5782 btrfs_item_key_to_cpu(leaf, &key, slot);
5783 /* BTRFS_INODE_EXTREF_KEY is BTRFS_INODE_REF_KEY + 1 */
5784 if (key.objectid != ino || key.type > BTRFS_INODE_EXTREF_KEY)
5787 item_size = btrfs_item_size_nr(leaf, slot);
5788 ptr = btrfs_item_ptr_offset(leaf, slot);
5789 while (cur_offset < item_size) {
5790 struct btrfs_key inode_key;
5791 struct inode *dir_inode;
5793 inode_key.type = BTRFS_INODE_ITEM_KEY;
5794 inode_key.offset = 0;
5796 if (key.type == BTRFS_INODE_EXTREF_KEY) {
5797 struct btrfs_inode_extref *extref;
5799 extref = (struct btrfs_inode_extref *)
5801 inode_key.objectid = btrfs_inode_extref_parent(
5803 cur_offset += sizeof(*extref);
5804 cur_offset += btrfs_inode_extref_name_len(leaf,
5807 inode_key.objectid = key.offset;
5808 cur_offset = item_size;
5811 dir_inode = btrfs_iget(fs_info->sb, inode_key.objectid,
5814 * If the parent inode was deleted, return an error to
5815 * fallback to a transaction commit. This is to prevent
5816 * getting an inode that was moved from one parent A to
5817 * a parent B, got its former parent A deleted and then
5818 * it got fsync'ed, from existing at both parents after
5819 * a log replay (and the old parent still existing).
5826 * mv /mnt/B/bar /mnt/A/bar
5827 * mv -T /mnt/A /mnt/B
5831 * If we ignore the old parent B which got deleted,
5832 * after a log replay we would have file bar linked
5833 * at both parents and the old parent B would still
5836 if (IS_ERR(dir_inode)) {
5837 ret = PTR_ERR(dir_inode);
5841 if (!need_log_inode(trans, BTRFS_I(dir_inode))) {
5842 btrfs_add_delayed_iput(dir_inode);
5847 ctx->log_new_dentries = false;
5848 ret = btrfs_log_inode(trans, root, BTRFS_I(dir_inode),
5849 LOG_INODE_ALL, ctx);
5850 if (!ret && ctx && ctx->log_new_dentries)
5851 ret = log_new_dir_dentries(trans, root,
5852 BTRFS_I(dir_inode), ctx);
5853 btrfs_add_delayed_iput(dir_inode);
5861 btrfs_free_path(path);
5865 static int log_new_ancestors(struct btrfs_trans_handle *trans,
5866 struct btrfs_root *root,
5867 struct btrfs_path *path,
5868 struct btrfs_log_ctx *ctx)
5870 struct btrfs_key found_key;
5872 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]);
5875 struct btrfs_fs_info *fs_info = root->fs_info;
5876 struct extent_buffer *leaf = path->nodes[0];
5877 int slot = path->slots[0];
5878 struct btrfs_key search_key;
5879 struct inode *inode;
5883 btrfs_release_path(path);
5885 ino = found_key.offset;
5887 search_key.objectid = found_key.offset;
5888 search_key.type = BTRFS_INODE_ITEM_KEY;
5889 search_key.offset = 0;
5890 inode = btrfs_iget(fs_info->sb, ino, root);
5892 return PTR_ERR(inode);
5894 if (BTRFS_I(inode)->generation >= trans->transid &&
5895 need_log_inode(trans, BTRFS_I(inode)))
5896 ret = btrfs_log_inode(trans, root, BTRFS_I(inode),
5897 LOG_INODE_EXISTS, ctx);
5898 btrfs_add_delayed_iput(inode);
5902 if (search_key.objectid == BTRFS_FIRST_FREE_OBJECTID)
5905 search_key.type = BTRFS_INODE_REF_KEY;
5906 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
5910 leaf = path->nodes[0];
5911 slot = path->slots[0];
5912 if (slot >= btrfs_header_nritems(leaf)) {
5913 ret = btrfs_next_leaf(root, path);
5918 leaf = path->nodes[0];
5919 slot = path->slots[0];
5922 btrfs_item_key_to_cpu(leaf, &found_key, slot);
5923 if (found_key.objectid != search_key.objectid ||
5924 found_key.type != BTRFS_INODE_REF_KEY)
5930 static int log_new_ancestors_fast(struct btrfs_trans_handle *trans,
5931 struct btrfs_inode *inode,
5932 struct dentry *parent,
5933 struct btrfs_log_ctx *ctx)
5935 struct btrfs_root *root = inode->root;
5936 struct dentry *old_parent = NULL;
5937 struct super_block *sb = inode->vfs_inode.i_sb;
5941 if (!parent || d_really_is_negative(parent) ||
5945 inode = BTRFS_I(d_inode(parent));
5946 if (root != inode->root)
5949 if (inode->generation >= trans->transid &&
5950 need_log_inode(trans, inode)) {
5951 ret = btrfs_log_inode(trans, root, inode,
5952 LOG_INODE_EXISTS, ctx);
5956 if (IS_ROOT(parent))
5959 parent = dget_parent(parent);
5961 old_parent = parent;
5968 static int log_all_new_ancestors(struct btrfs_trans_handle *trans,
5969 struct btrfs_inode *inode,
5970 struct dentry *parent,
5971 struct btrfs_log_ctx *ctx)
5973 struct btrfs_root *root = inode->root;
5974 const u64 ino = btrfs_ino(inode);
5975 struct btrfs_path *path;
5976 struct btrfs_key search_key;
5980 * For a single hard link case, go through a fast path that does not
5981 * need to iterate the fs/subvolume tree.
5983 if (inode->vfs_inode.i_nlink < 2)
5984 return log_new_ancestors_fast(trans, inode, parent, ctx);
5986 path = btrfs_alloc_path();
5990 search_key.objectid = ino;
5991 search_key.type = BTRFS_INODE_REF_KEY;
5992 search_key.offset = 0;
5994 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
6001 struct extent_buffer *leaf = path->nodes[0];
6002 int slot = path->slots[0];
6003 struct btrfs_key found_key;
6005 if (slot >= btrfs_header_nritems(leaf)) {
6006 ret = btrfs_next_leaf(root, path);
6014 btrfs_item_key_to_cpu(leaf, &found_key, slot);
6015 if (found_key.objectid != ino ||
6016 found_key.type > BTRFS_INODE_EXTREF_KEY)
6020 * Don't deal with extended references because they are rare
6021 * cases and too complex to deal with (we would need to keep
6022 * track of which subitem we are processing for each item in
6023 * this loop, etc). So just return some error to fallback to
6024 * a transaction commit.
6026 if (found_key.type == BTRFS_INODE_EXTREF_KEY) {
6032 * Logging ancestors needs to do more searches on the fs/subvol
6033 * tree, so it releases the path as needed to avoid deadlocks.
6034 * Keep track of the last inode ref key and resume from that key
6035 * after logging all new ancestors for the current hard link.
6037 memcpy(&search_key, &found_key, sizeof(search_key));
6039 ret = log_new_ancestors(trans, root, path, ctx);
6042 btrfs_release_path(path);
6047 btrfs_free_path(path);
6052 * helper function around btrfs_log_inode to make sure newly created
6053 * parent directories also end up in the log. A minimal inode and backref
6054 * only logging is done of any parent directories that are older than
6055 * the last committed transaction
6057 static int btrfs_log_inode_parent(struct btrfs_trans_handle *trans,
6058 struct btrfs_inode *inode,
6059 struct dentry *parent,
6061 struct btrfs_log_ctx *ctx)
6063 struct btrfs_root *root = inode->root;
6064 struct btrfs_fs_info *fs_info = root->fs_info;
6066 bool log_dentries = false;
6068 if (btrfs_test_opt(fs_info, NOTREELOG)) {
6073 if (btrfs_root_refs(&root->root_item) == 0) {
6079 * Skip already logged inodes or inodes corresponding to tmpfiles
6080 * (since logging them is pointless, a link count of 0 means they
6081 * will never be accessible).
6083 if ((btrfs_inode_in_log(inode, trans->transid) &&
6084 list_empty(&ctx->ordered_extents)) ||
6085 inode->vfs_inode.i_nlink == 0) {
6086 ret = BTRFS_NO_LOG_SYNC;
6090 ret = start_log_trans(trans, root, ctx);
6094 ret = btrfs_log_inode(trans, root, inode, inode_only, ctx);
6099 * for regular files, if its inode is already on disk, we don't
6100 * have to worry about the parents at all. This is because
6101 * we can use the last_unlink_trans field to record renames
6102 * and other fun in this file.
6104 if (S_ISREG(inode->vfs_inode.i_mode) &&
6105 inode->generation < trans->transid &&
6106 inode->last_unlink_trans < trans->transid) {
6111 if (S_ISDIR(inode->vfs_inode.i_mode) && ctx && ctx->log_new_dentries)
6112 log_dentries = true;
6115 * On unlink we must make sure all our current and old parent directory
6116 * inodes are fully logged. This is to prevent leaving dangling
6117 * directory index entries in directories that were our parents but are
6118 * not anymore. Not doing this results in old parent directory being
6119 * impossible to delete after log replay (rmdir will always fail with
6120 * error -ENOTEMPTY).
6126 * ln testdir/foo testdir/bar
6128 * unlink testdir/bar
6129 * xfs_io -c fsync testdir/foo
6131 * mount fs, triggers log replay
6133 * If we don't log the parent directory (testdir), after log replay the
6134 * directory still has an entry pointing to the file inode using the bar
6135 * name, but a matching BTRFS_INODE_[REF|EXTREF]_KEY does not exist and
6136 * the file inode has a link count of 1.
6142 * ln foo testdir/foo2
6143 * ln foo testdir/foo3
6145 * unlink testdir/foo3
6146 * xfs_io -c fsync foo
6148 * mount fs, triggers log replay
6150 * Similar as the first example, after log replay the parent directory
6151 * testdir still has an entry pointing to the inode file with name foo3
6152 * but the file inode does not have a matching BTRFS_INODE_REF_KEY item
6153 * and has a link count of 2.
6155 if (inode->last_unlink_trans >= trans->transid) {
6156 ret = btrfs_log_all_parents(trans, inode, ctx);
6161 ret = log_all_new_ancestors(trans, inode, parent, ctx);
6166 ret = log_new_dir_dentries(trans, root, inode, ctx);
6171 btrfs_set_log_full_commit(trans);
6176 btrfs_remove_log_ctx(root, ctx);
6177 btrfs_end_log_trans(root);
6183 * it is not safe to log dentry if the chunk root has added new
6184 * chunks. This returns 0 if the dentry was logged, and 1 otherwise.
6185 * If this returns 1, you must commit the transaction to safely get your
6188 int btrfs_log_dentry_safe(struct btrfs_trans_handle *trans,
6189 struct dentry *dentry,
6190 struct btrfs_log_ctx *ctx)
6192 struct dentry *parent = dget_parent(dentry);
6195 ret = btrfs_log_inode_parent(trans, BTRFS_I(d_inode(dentry)), parent,
6196 LOG_INODE_ALL, ctx);
6203 * should be called during mount to recover any replay any log trees
6206 int btrfs_recover_log_trees(struct btrfs_root *log_root_tree)
6209 struct btrfs_path *path;
6210 struct btrfs_trans_handle *trans;
6211 struct btrfs_key key;
6212 struct btrfs_key found_key;
6213 struct btrfs_root *log;
6214 struct btrfs_fs_info *fs_info = log_root_tree->fs_info;
6215 struct walk_control wc = {
6216 .process_func = process_one_buffer,
6217 .stage = LOG_WALK_PIN_ONLY,
6220 path = btrfs_alloc_path();
6224 set_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags);
6226 trans = btrfs_start_transaction(fs_info->tree_root, 0);
6227 if (IS_ERR(trans)) {
6228 ret = PTR_ERR(trans);
6235 ret = walk_log_tree(trans, log_root_tree, &wc);
6237 btrfs_handle_fs_error(fs_info, ret,
6238 "Failed to pin buffers while recovering log root tree.");
6243 key.objectid = BTRFS_TREE_LOG_OBJECTID;
6244 key.offset = (u64)-1;
6245 key.type = BTRFS_ROOT_ITEM_KEY;
6248 ret = btrfs_search_slot(NULL, log_root_tree, &key, path, 0, 0);
6251 btrfs_handle_fs_error(fs_info, ret,
6252 "Couldn't find tree log root.");
6256 if (path->slots[0] == 0)
6260 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
6262 btrfs_release_path(path);
6263 if (found_key.objectid != BTRFS_TREE_LOG_OBJECTID)
6266 log = btrfs_read_tree_root(log_root_tree, &found_key);
6269 btrfs_handle_fs_error(fs_info, ret,
6270 "Couldn't read tree log root.");
6274 wc.replay_dest = btrfs_get_fs_root(fs_info, found_key.offset,
6276 if (IS_ERR(wc.replay_dest)) {
6277 ret = PTR_ERR(wc.replay_dest);
6280 * We didn't find the subvol, likely because it was
6281 * deleted. This is ok, simply skip this log and go to
6284 * We need to exclude the root because we can't have
6285 * other log replays overwriting this log as we'll read
6286 * it back in a few more times. This will keep our
6287 * block from being modified, and we'll just bail for
6288 * each subsequent pass.
6291 ret = btrfs_pin_extent_for_log_replay(trans,
6294 btrfs_put_root(log);
6298 btrfs_handle_fs_error(fs_info, ret,
6299 "Couldn't read target root for tree log recovery.");
6303 wc.replay_dest->log_root = log;
6304 ret = btrfs_record_root_in_trans(trans, wc.replay_dest);
6306 /* The loop needs to continue due to the root refs */
6307 btrfs_handle_fs_error(fs_info, ret,
6308 "failed to record the log root in transaction");
6310 ret = walk_log_tree(trans, log, &wc);
6312 if (!ret && wc.stage == LOG_WALK_REPLAY_ALL) {
6313 ret = fixup_inode_link_counts(trans, wc.replay_dest,
6317 if (!ret && wc.stage == LOG_WALK_REPLAY_ALL) {
6318 struct btrfs_root *root = wc.replay_dest;
6320 btrfs_release_path(path);
6323 * We have just replayed everything, and the highest
6324 * objectid of fs roots probably has changed in case
6325 * some inode_item's got replayed.
6327 * root->objectid_mutex is not acquired as log replay
6328 * could only happen during mount.
6330 ret = btrfs_init_root_free_objectid(root);
6333 wc.replay_dest->log_root = NULL;
6334 btrfs_put_root(wc.replay_dest);
6335 btrfs_put_root(log);
6340 if (found_key.offset == 0)
6342 key.offset = found_key.offset - 1;
6344 btrfs_release_path(path);
6346 /* step one is to pin it all, step two is to replay just inodes */
6349 wc.process_func = replay_one_buffer;
6350 wc.stage = LOG_WALK_REPLAY_INODES;
6353 /* step three is to replay everything */
6354 if (wc.stage < LOG_WALK_REPLAY_ALL) {
6359 btrfs_free_path(path);
6361 /* step 4: commit the transaction, which also unpins the blocks */
6362 ret = btrfs_commit_transaction(trans);
6366 log_root_tree->log_root = NULL;
6367 clear_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags);
6368 btrfs_put_root(log_root_tree);
6373 btrfs_end_transaction(wc.trans);
6374 btrfs_free_path(path);
6379 * there are some corner cases where we want to force a full
6380 * commit instead of allowing a directory to be logged.
6382 * They revolve around files there were unlinked from the directory, and
6383 * this function updates the parent directory so that a full commit is
6384 * properly done if it is fsync'd later after the unlinks are done.
6386 * Must be called before the unlink operations (updates to the subvolume tree,
6387 * inodes, etc) are done.
6389 void btrfs_record_unlink_dir(struct btrfs_trans_handle *trans,
6390 struct btrfs_inode *dir, struct btrfs_inode *inode,
6394 * when we're logging a file, if it hasn't been renamed
6395 * or unlinked, and its inode is fully committed on disk,
6396 * we don't have to worry about walking up the directory chain
6397 * to log its parents.
6399 * So, we use the last_unlink_trans field to put this transid
6400 * into the file. When the file is logged we check it and
6401 * don't log the parents if the file is fully on disk.
6403 mutex_lock(&inode->log_mutex);
6404 inode->last_unlink_trans = trans->transid;
6405 mutex_unlock(&inode->log_mutex);
6408 * if this directory was already logged any new
6409 * names for this file/dir will get recorded
6411 if (dir->logged_trans == trans->transid)
6415 * if the inode we're about to unlink was logged,
6416 * the log will be properly updated for any new names
6418 if (inode->logged_trans == trans->transid)
6422 * when renaming files across directories, if the directory
6423 * there we're unlinking from gets fsync'd later on, there's
6424 * no way to find the destination directory later and fsync it
6425 * properly. So, we have to be conservative and force commits
6426 * so the new name gets discovered.
6431 /* we can safely do the unlink without any special recording */
6435 mutex_lock(&dir->log_mutex);
6436 dir->last_unlink_trans = trans->transid;
6437 mutex_unlock(&dir->log_mutex);
6441 * Make sure that if someone attempts to fsync the parent directory of a deleted
6442 * snapshot, it ends up triggering a transaction commit. This is to guarantee
6443 * that after replaying the log tree of the parent directory's root we will not
6444 * see the snapshot anymore and at log replay time we will not see any log tree
6445 * corresponding to the deleted snapshot's root, which could lead to replaying
6446 * it after replaying the log tree of the parent directory (which would replay
6447 * the snapshot delete operation).
6449 * Must be called before the actual snapshot destroy operation (updates to the
6450 * parent root and tree of tree roots trees, etc) are done.
6452 void btrfs_record_snapshot_destroy(struct btrfs_trans_handle *trans,
6453 struct btrfs_inode *dir)
6455 mutex_lock(&dir->log_mutex);
6456 dir->last_unlink_trans = trans->transid;
6457 mutex_unlock(&dir->log_mutex);
6461 * Call this after adding a new name for a file and it will properly
6462 * update the log to reflect the new name.
6464 void btrfs_log_new_name(struct btrfs_trans_handle *trans,
6465 struct btrfs_inode *inode, struct btrfs_inode *old_dir,
6466 struct dentry *parent)
6468 struct btrfs_log_ctx ctx;
6471 * this will force the logging code to walk the dentry chain
6474 if (!S_ISDIR(inode->vfs_inode.i_mode))
6475 inode->last_unlink_trans = trans->transid;
6478 * if this inode hasn't been logged and directory we're renaming it
6479 * from hasn't been logged, we don't need to log it
6481 if (inode->logged_trans < trans->transid &&
6482 (!old_dir || old_dir->logged_trans < trans->transid))
6486 * If we are doing a rename (old_dir is not NULL) from a directory that
6487 * was previously logged, make sure the next log attempt on the directory
6488 * is not skipped and logs the inode again. This is because the log may
6489 * not currently be authoritative for a range including the old
6490 * BTRFS_DIR_ITEM_KEY and BTRFS_DIR_INDEX_KEY keys, so we want to make
6491 * sure after a log replay we do not end up with both the new and old
6492 * dentries around (in case the inode is a directory we would have a
6493 * directory with two hard links and 2 inode references for different
6494 * parents). The next log attempt of old_dir will happen at
6495 * btrfs_log_all_parents(), called through btrfs_log_inode_parent()
6496 * below, because we have previously set inode->last_unlink_trans to the
6497 * current transaction ID, either here or at btrfs_record_unlink_dir() in
6498 * case inode is a directory.
6501 old_dir->logged_trans = 0;
6503 btrfs_init_log_ctx(&ctx, &inode->vfs_inode);
6504 ctx.logging_new_name = true;
6506 * We don't care about the return value. If we fail to log the new name
6507 * then we know the next attempt to sync the log will fallback to a full
6508 * transaction commit (due to a call to btrfs_set_log_full_commit()), so
6509 * we don't need to worry about getting a log committed that has an
6510 * inconsistent state after a rename operation.
6512 btrfs_log_inode_parent(trans, inode, parent, LOG_INODE_EXISTS, &ctx);