2 * Copyright (C) 2008 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/sched.h>
20 #include <linux/slab.h>
21 #include <linux/blkdev.h>
22 #include <linux/list_sort.h>
24 #include "transaction.h"
27 #include "print-tree.h"
32 /* magic values for the inode_only field in btrfs_log_inode:
34 * LOG_INODE_ALL means to log everything
35 * LOG_INODE_EXISTS means to log just enough to recreate the inode
38 #define LOG_INODE_ALL 0
39 #define LOG_INODE_EXISTS 1
42 * directory trouble cases
44 * 1) on rename or unlink, if the inode being unlinked isn't in the fsync
45 * log, we must force a full commit before doing an fsync of the directory
46 * where the unlink was done.
47 * ---> record transid of last unlink/rename per directory
51 * rename foo/some_dir foo2/some_dir
53 * fsync foo/some_dir/some_file
55 * The fsync above will unlink the original some_dir without recording
56 * it in its new location (foo2). After a crash, some_dir will be gone
57 * unless the fsync of some_file forces a full commit
59 * 2) we must log any new names for any file or dir that is in the fsync
60 * log. ---> check inode while renaming/linking.
62 * 2a) we must log any new names for any file or dir during rename
63 * when the directory they are being removed from was logged.
64 * ---> check inode and old parent dir during rename
66 * 2a is actually the more important variant. With the extra logging
67 * a crash might unlink the old name without recreating the new one
69 * 3) after a crash, we must go through any directories with a link count
70 * of zero and redo the rm -rf
77 * The directory f1 was fully removed from the FS, but fsync was never
78 * called on f1, only its parent dir. After a crash the rm -rf must
79 * be replayed. This must be able to recurse down the entire
80 * directory tree. The inode link count fixup code takes care of the
85 * stages for the tree walking. The first
86 * stage (0) is to only pin down the blocks we find
87 * the second stage (1) is to make sure that all the inodes
88 * we find in the log are created in the subvolume.
90 * The last stage is to deal with directories and links and extents
91 * and all the other fun semantics
93 #define LOG_WALK_PIN_ONLY 0
94 #define LOG_WALK_REPLAY_INODES 1
95 #define LOG_WALK_REPLAY_DIR_INDEX 2
96 #define LOG_WALK_REPLAY_ALL 3
98 static int btrfs_log_inode(struct btrfs_trans_handle
*trans
,
99 struct btrfs_root
*root
, struct inode
*inode
,
101 static int link_to_fixup_dir(struct btrfs_trans_handle
*trans
,
102 struct btrfs_root
*root
,
103 struct btrfs_path
*path
, u64 objectid
);
104 static noinline
int replay_dir_deletes(struct btrfs_trans_handle
*trans
,
105 struct btrfs_root
*root
,
106 struct btrfs_root
*log
,
107 struct btrfs_path
*path
,
108 u64 dirid
, int del_all
);
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
)
144 mutex_lock(&root
->log_mutex
);
145 if (root
->log_root
) {
146 if (!root
->log_start_pid
) {
147 root
->log_start_pid
= current
->pid
;
148 root
->log_multiple_pids
= false;
149 } else if (root
->log_start_pid
!= current
->pid
) {
150 root
->log_multiple_pids
= true;
153 atomic_inc(&root
->log_batch
);
154 atomic_inc(&root
->log_writers
);
155 mutex_unlock(&root
->log_mutex
);
158 root
->log_multiple_pids
= false;
159 root
->log_start_pid
= current
->pid
;
160 mutex_lock(&root
->fs_info
->tree_log_mutex
);
161 if (!root
->fs_info
->log_root_tree
) {
162 ret
= btrfs_init_log_root_tree(trans
, root
->fs_info
);
166 if (err
== 0 && !root
->log_root
) {
167 ret
= btrfs_add_log_tree(trans
, root
);
171 mutex_unlock(&root
->fs_info
->tree_log_mutex
);
172 atomic_inc(&root
->log_batch
);
173 atomic_inc(&root
->log_writers
);
174 mutex_unlock(&root
->log_mutex
);
179 * returns 0 if there was a log transaction running and we were able
180 * to join, or returns -ENOENT if there were not transactions
183 static int join_running_log_trans(struct btrfs_root
*root
)
191 mutex_lock(&root
->log_mutex
);
192 if (root
->log_root
) {
194 atomic_inc(&root
->log_writers
);
196 mutex_unlock(&root
->log_mutex
);
201 * This either makes the current running log transaction wait
202 * until you call btrfs_end_log_trans() or it makes any future
203 * log transactions wait until you call btrfs_end_log_trans()
205 int btrfs_pin_log_trans(struct btrfs_root
*root
)
209 mutex_lock(&root
->log_mutex
);
210 atomic_inc(&root
->log_writers
);
211 mutex_unlock(&root
->log_mutex
);
216 * indicate we're done making changes to the log tree
217 * and wake up anyone waiting to do a sync
219 void btrfs_end_log_trans(struct btrfs_root
*root
)
221 if (atomic_dec_and_test(&root
->log_writers
)) {
223 if (waitqueue_active(&root
->log_writer_wait
))
224 wake_up(&root
->log_writer_wait
);
230 * the walk control struct is used to pass state down the chain when
231 * processing the log tree. The stage field tells us which part
232 * of the log tree processing we are currently doing. The others
233 * are state fields used for that specific part
235 struct walk_control
{
236 /* should we free the extent on disk when done? This is used
237 * at transaction commit time while freeing a log tree
241 /* should we write out the extent buffer? This is used
242 * while flushing the log tree to disk during a sync
246 /* should we wait for the extent buffer io to finish? Also used
247 * while flushing the log tree to disk for a sync
251 /* pin only walk, we record which extents on disk belong to the
256 /* what stage of the replay code we're currently in */
259 /* the root we are currently replaying */
260 struct btrfs_root
*replay_dest
;
262 /* the trans handle for the current replay */
263 struct btrfs_trans_handle
*trans
;
265 /* the function that gets used to process blocks we find in the
266 * tree. Note the extent_buffer might not be up to date when it is
267 * passed in, and it must be checked or read if you need the data
270 int (*process_func
)(struct btrfs_root
*log
, struct extent_buffer
*eb
,
271 struct walk_control
*wc
, u64 gen
);
275 * process_func used to pin down extents, write them or wait on them
277 static int process_one_buffer(struct btrfs_root
*log
,
278 struct extent_buffer
*eb
,
279 struct walk_control
*wc
, u64 gen
)
284 * If this fs is mixed then we need to be able to process the leaves to
285 * pin down any logged extents, so we have to read the block.
287 if (btrfs_fs_incompat(log
->fs_info
, MIXED_GROUPS
)) {
288 ret
= btrfs_read_buffer(eb
, gen
);
294 ret
= btrfs_pin_extent_for_log_replay(log
->fs_info
->extent_root
,
297 if (!ret
&& btrfs_buffer_uptodate(eb
, gen
, 0)) {
298 if (wc
->pin
&& btrfs_header_level(eb
) == 0)
299 ret
= btrfs_exclude_logged_extents(log
, eb
);
301 btrfs_write_tree_block(eb
);
303 btrfs_wait_tree_block_writeback(eb
);
309 * Item overwrite used by replay and tree logging. eb, slot and key all refer
310 * to the src data we are copying out.
312 * root is the tree we are copying into, and path is a scratch
313 * path for use in this function (it should be released on entry and
314 * will be released on exit).
316 * If the key is already in the destination tree the existing item is
317 * overwritten. If the existing item isn't big enough, it is extended.
318 * If it is too large, it is truncated.
320 * If the key isn't in the destination yet, a new item is inserted.
322 static noinline
int overwrite_item(struct btrfs_trans_handle
*trans
,
323 struct btrfs_root
*root
,
324 struct btrfs_path
*path
,
325 struct extent_buffer
*eb
, int slot
,
326 struct btrfs_key
*key
)
330 u64 saved_i_size
= 0;
331 int save_old_i_size
= 0;
332 unsigned long src_ptr
;
333 unsigned long dst_ptr
;
334 int overwrite_root
= 0;
335 bool inode_item
= key
->type
== BTRFS_INODE_ITEM_KEY
;
337 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
)
340 item_size
= btrfs_item_size_nr(eb
, slot
);
341 src_ptr
= btrfs_item_ptr_offset(eb
, slot
);
343 /* look for the key in the destination tree */
344 ret
= btrfs_search_slot(NULL
, root
, key
, path
, 0, 0);
351 u32 dst_size
= btrfs_item_size_nr(path
->nodes
[0],
353 if (dst_size
!= item_size
)
356 if (item_size
== 0) {
357 btrfs_release_path(path
);
360 dst_copy
= kmalloc(item_size
, GFP_NOFS
);
361 src_copy
= kmalloc(item_size
, GFP_NOFS
);
362 if (!dst_copy
|| !src_copy
) {
363 btrfs_release_path(path
);
369 read_extent_buffer(eb
, src_copy
, src_ptr
, item_size
);
371 dst_ptr
= btrfs_item_ptr_offset(path
->nodes
[0], path
->slots
[0]);
372 read_extent_buffer(path
->nodes
[0], dst_copy
, dst_ptr
,
374 ret
= memcmp(dst_copy
, src_copy
, item_size
);
379 * they have the same contents, just return, this saves
380 * us from cowing blocks in the destination tree and doing
381 * extra writes that may not have been done by a previous
385 btrfs_release_path(path
);
390 * We need to load the old nbytes into the inode so when we
391 * replay the extents we've logged we get the right nbytes.
394 struct btrfs_inode_item
*item
;
398 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
399 struct btrfs_inode_item
);
400 nbytes
= btrfs_inode_nbytes(path
->nodes
[0], item
);
401 item
= btrfs_item_ptr(eb
, slot
,
402 struct btrfs_inode_item
);
403 btrfs_set_inode_nbytes(eb
, item
, nbytes
);
406 * If this is a directory we need to reset the i_size to
407 * 0 so that we can set it up properly when replaying
408 * the rest of the items in this log.
410 mode
= btrfs_inode_mode(eb
, item
);
412 btrfs_set_inode_size(eb
, item
, 0);
414 } else if (inode_item
) {
415 struct btrfs_inode_item
*item
;
419 * New inode, set nbytes to 0 so that the nbytes comes out
420 * properly when we replay the extents.
422 item
= btrfs_item_ptr(eb
, slot
, struct btrfs_inode_item
);
423 btrfs_set_inode_nbytes(eb
, item
, 0);
426 * If this is a directory we need to reset the i_size to 0 so
427 * that we can set it up properly when replaying the rest of
428 * the items in this log.
430 mode
= btrfs_inode_mode(eb
, item
);
432 btrfs_set_inode_size(eb
, item
, 0);
435 btrfs_release_path(path
);
436 /* try to insert the key into the destination tree */
437 ret
= btrfs_insert_empty_item(trans
, root
, path
,
440 /* make sure any existing item is the correct size */
441 if (ret
== -EEXIST
) {
443 found_size
= btrfs_item_size_nr(path
->nodes
[0],
445 if (found_size
> item_size
)
446 btrfs_truncate_item(root
, path
, item_size
, 1);
447 else if (found_size
< item_size
)
448 btrfs_extend_item(root
, path
,
449 item_size
- found_size
);
453 dst_ptr
= btrfs_item_ptr_offset(path
->nodes
[0],
456 /* don't overwrite an existing inode if the generation number
457 * was logged as zero. This is done when the tree logging code
458 * is just logging an inode to make sure it exists after recovery.
460 * Also, don't overwrite i_size on directories during replay.
461 * log replay inserts and removes directory items based on the
462 * state of the tree found in the subvolume, and i_size is modified
465 if (key
->type
== BTRFS_INODE_ITEM_KEY
&& ret
== -EEXIST
) {
466 struct btrfs_inode_item
*src_item
;
467 struct btrfs_inode_item
*dst_item
;
469 src_item
= (struct btrfs_inode_item
*)src_ptr
;
470 dst_item
= (struct btrfs_inode_item
*)dst_ptr
;
472 if (btrfs_inode_generation(eb
, src_item
) == 0)
475 if (overwrite_root
&&
476 S_ISDIR(btrfs_inode_mode(eb
, src_item
)) &&
477 S_ISDIR(btrfs_inode_mode(path
->nodes
[0], dst_item
))) {
479 saved_i_size
= btrfs_inode_size(path
->nodes
[0],
484 copy_extent_buffer(path
->nodes
[0], eb
, dst_ptr
,
487 if (save_old_i_size
) {
488 struct btrfs_inode_item
*dst_item
;
489 dst_item
= (struct btrfs_inode_item
*)dst_ptr
;
490 btrfs_set_inode_size(path
->nodes
[0], dst_item
, saved_i_size
);
493 /* make sure the generation is filled in */
494 if (key
->type
== BTRFS_INODE_ITEM_KEY
) {
495 struct btrfs_inode_item
*dst_item
;
496 dst_item
= (struct btrfs_inode_item
*)dst_ptr
;
497 if (btrfs_inode_generation(path
->nodes
[0], dst_item
) == 0) {
498 btrfs_set_inode_generation(path
->nodes
[0], dst_item
,
503 btrfs_mark_buffer_dirty(path
->nodes
[0]);
504 btrfs_release_path(path
);
509 * simple helper to read an inode off the disk from a given root
510 * This can only be called for subvolume roots and not for the log
512 static noinline
struct inode
*read_one_inode(struct btrfs_root
*root
,
515 struct btrfs_key key
;
518 key
.objectid
= objectid
;
519 key
.type
= BTRFS_INODE_ITEM_KEY
;
521 inode
= btrfs_iget(root
->fs_info
->sb
, &key
, root
, NULL
);
524 } else if (is_bad_inode(inode
)) {
531 /* replays a single extent in 'eb' at 'slot' with 'key' into the
532 * subvolume 'root'. path is released on entry and should be released
535 * extents in the log tree have not been allocated out of the extent
536 * tree yet. So, this completes the allocation, taking a reference
537 * as required if the extent already exists or creating a new extent
538 * if it isn't in the extent allocation tree yet.
540 * The extent is inserted into the file, dropping any existing extents
541 * from the file that overlap the new one.
543 static noinline
int replay_one_extent(struct btrfs_trans_handle
*trans
,
544 struct btrfs_root
*root
,
545 struct btrfs_path
*path
,
546 struct extent_buffer
*eb
, int slot
,
547 struct btrfs_key
*key
)
551 u64 start
= key
->offset
;
553 struct btrfs_file_extent_item
*item
;
554 struct inode
*inode
= NULL
;
558 item
= btrfs_item_ptr(eb
, slot
, struct btrfs_file_extent_item
);
559 found_type
= btrfs_file_extent_type(eb
, item
);
561 if (found_type
== BTRFS_FILE_EXTENT_REG
||
562 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
563 nbytes
= btrfs_file_extent_num_bytes(eb
, item
);
564 extent_end
= start
+ nbytes
;
567 * We don't add to the inodes nbytes if we are prealloc or a
570 if (btrfs_file_extent_disk_bytenr(eb
, item
) == 0)
572 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
573 size
= btrfs_file_extent_inline_len(eb
, item
);
574 nbytes
= btrfs_file_extent_ram_bytes(eb
, item
);
575 extent_end
= ALIGN(start
+ size
, root
->sectorsize
);
581 inode
= read_one_inode(root
, key
->objectid
);
588 * first check to see if we already have this extent in the
589 * file. This must be done before the btrfs_drop_extents run
590 * so we don't try to drop this extent.
592 ret
= btrfs_lookup_file_extent(trans
, root
, path
, btrfs_ino(inode
),
596 (found_type
== BTRFS_FILE_EXTENT_REG
||
597 found_type
== BTRFS_FILE_EXTENT_PREALLOC
)) {
598 struct btrfs_file_extent_item cmp1
;
599 struct btrfs_file_extent_item cmp2
;
600 struct btrfs_file_extent_item
*existing
;
601 struct extent_buffer
*leaf
;
603 leaf
= path
->nodes
[0];
604 existing
= btrfs_item_ptr(leaf
, path
->slots
[0],
605 struct btrfs_file_extent_item
);
607 read_extent_buffer(eb
, &cmp1
, (unsigned long)item
,
609 read_extent_buffer(leaf
, &cmp2
, (unsigned long)existing
,
613 * we already have a pointer to this exact extent,
614 * we don't have to do anything
616 if (memcmp(&cmp1
, &cmp2
, sizeof(cmp1
)) == 0) {
617 btrfs_release_path(path
);
621 btrfs_release_path(path
);
623 /* drop any overlapping extents */
624 ret
= btrfs_drop_extents(trans
, root
, inode
, start
, extent_end
, 1);
628 if (found_type
== BTRFS_FILE_EXTENT_REG
||
629 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
631 unsigned long dest_offset
;
632 struct btrfs_key ins
;
634 ret
= btrfs_insert_empty_item(trans
, root
, path
, key
,
638 dest_offset
= btrfs_item_ptr_offset(path
->nodes
[0],
640 copy_extent_buffer(path
->nodes
[0], eb
, dest_offset
,
641 (unsigned long)item
, sizeof(*item
));
643 ins
.objectid
= btrfs_file_extent_disk_bytenr(eb
, item
);
644 ins
.offset
= btrfs_file_extent_disk_num_bytes(eb
, item
);
645 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
646 offset
= key
->offset
- btrfs_file_extent_offset(eb
, item
);
648 if (ins
.objectid
> 0) {
651 LIST_HEAD(ordered_sums
);
653 * is this extent already allocated in the extent
654 * allocation tree? If so, just add a reference
656 ret
= btrfs_lookup_extent(root
, ins
.objectid
,
659 ret
= btrfs_inc_extent_ref(trans
, root
,
660 ins
.objectid
, ins
.offset
,
661 0, root
->root_key
.objectid
,
662 key
->objectid
, offset
, 0);
667 * insert the extent pointer in the extent
670 ret
= btrfs_alloc_logged_file_extent(trans
,
671 root
, root
->root_key
.objectid
,
672 key
->objectid
, offset
, &ins
);
676 btrfs_release_path(path
);
678 if (btrfs_file_extent_compression(eb
, item
)) {
679 csum_start
= ins
.objectid
;
680 csum_end
= csum_start
+ ins
.offset
;
682 csum_start
= ins
.objectid
+
683 btrfs_file_extent_offset(eb
, item
);
684 csum_end
= csum_start
+
685 btrfs_file_extent_num_bytes(eb
, item
);
688 ret
= btrfs_lookup_csums_range(root
->log_root
,
689 csum_start
, csum_end
- 1,
693 while (!list_empty(&ordered_sums
)) {
694 struct btrfs_ordered_sum
*sums
;
695 sums
= list_entry(ordered_sums
.next
,
696 struct btrfs_ordered_sum
,
699 ret
= btrfs_csum_file_blocks(trans
,
700 root
->fs_info
->csum_root
,
702 list_del(&sums
->list
);
708 btrfs_release_path(path
);
710 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
711 /* inline extents are easy, we just overwrite them */
712 ret
= overwrite_item(trans
, root
, path
, eb
, slot
, key
);
717 inode_add_bytes(inode
, nbytes
);
718 ret
= btrfs_update_inode(trans
, root
, inode
);
726 * when cleaning up conflicts between the directory names in the
727 * subvolume, directory names in the log and directory names in the
728 * inode back references, we may have to unlink inodes from directories.
730 * This is a helper function to do the unlink of a specific directory
733 static noinline
int drop_one_dir_item(struct btrfs_trans_handle
*trans
,
734 struct btrfs_root
*root
,
735 struct btrfs_path
*path
,
737 struct btrfs_dir_item
*di
)
742 struct extent_buffer
*leaf
;
743 struct btrfs_key location
;
746 leaf
= path
->nodes
[0];
748 btrfs_dir_item_key_to_cpu(leaf
, di
, &location
);
749 name_len
= btrfs_dir_name_len(leaf
, di
);
750 name
= kmalloc(name_len
, GFP_NOFS
);
754 read_extent_buffer(leaf
, name
, (unsigned long)(di
+ 1), name_len
);
755 btrfs_release_path(path
);
757 inode
= read_one_inode(root
, location
.objectid
);
763 ret
= link_to_fixup_dir(trans
, root
, path
, location
.objectid
);
767 ret
= btrfs_unlink_inode(trans
, root
, dir
, inode
, name
, name_len
);
771 ret
= btrfs_run_delayed_items(trans
, root
);
779 * helper function to see if a given name and sequence number found
780 * in an inode back reference are already in a directory and correctly
781 * point to this inode
783 static noinline
int inode_in_dir(struct btrfs_root
*root
,
784 struct btrfs_path
*path
,
785 u64 dirid
, u64 objectid
, u64 index
,
786 const char *name
, int name_len
)
788 struct btrfs_dir_item
*di
;
789 struct btrfs_key location
;
792 di
= btrfs_lookup_dir_index_item(NULL
, root
, path
, dirid
,
793 index
, name
, name_len
, 0);
794 if (di
&& !IS_ERR(di
)) {
795 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, &location
);
796 if (location
.objectid
!= objectid
)
800 btrfs_release_path(path
);
802 di
= btrfs_lookup_dir_item(NULL
, root
, path
, dirid
, name
, name_len
, 0);
803 if (di
&& !IS_ERR(di
)) {
804 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, &location
);
805 if (location
.objectid
!= objectid
)
811 btrfs_release_path(path
);
816 * helper function to check a log tree for a named back reference in
817 * an inode. This is used to decide if a back reference that is
818 * found in the subvolume conflicts with what we find in the log.
820 * inode backreferences may have multiple refs in a single item,
821 * during replay we process one reference at a time, and we don't
822 * want to delete valid links to a file from the subvolume if that
823 * link is also in the log.
825 static noinline
int backref_in_log(struct btrfs_root
*log
,
826 struct btrfs_key
*key
,
828 char *name
, int namelen
)
830 struct btrfs_path
*path
;
831 struct btrfs_inode_ref
*ref
;
833 unsigned long ptr_end
;
834 unsigned long name_ptr
;
840 path
= btrfs_alloc_path();
844 ret
= btrfs_search_slot(NULL
, log
, key
, path
, 0, 0);
848 ptr
= btrfs_item_ptr_offset(path
->nodes
[0], path
->slots
[0]);
850 if (key
->type
== BTRFS_INODE_EXTREF_KEY
) {
851 if (btrfs_find_name_in_ext_backref(path
, ref_objectid
,
852 name
, namelen
, NULL
))
858 item_size
= btrfs_item_size_nr(path
->nodes
[0], path
->slots
[0]);
859 ptr_end
= ptr
+ item_size
;
860 while (ptr
< ptr_end
) {
861 ref
= (struct btrfs_inode_ref
*)ptr
;
862 found_name_len
= btrfs_inode_ref_name_len(path
->nodes
[0], ref
);
863 if (found_name_len
== namelen
) {
864 name_ptr
= (unsigned long)(ref
+ 1);
865 ret
= memcmp_extent_buffer(path
->nodes
[0], name
,
872 ptr
= (unsigned long)(ref
+ 1) + found_name_len
;
875 btrfs_free_path(path
);
879 static inline int __add_inode_ref(struct btrfs_trans_handle
*trans
,
880 struct btrfs_root
*root
,
881 struct btrfs_path
*path
,
882 struct btrfs_root
*log_root
,
883 struct inode
*dir
, struct inode
*inode
,
884 struct extent_buffer
*eb
,
885 u64 inode_objectid
, u64 parent_objectid
,
886 u64 ref_index
, char *name
, int namelen
,
892 struct extent_buffer
*leaf
;
893 struct btrfs_dir_item
*di
;
894 struct btrfs_key search_key
;
895 struct btrfs_inode_extref
*extref
;
898 /* Search old style refs */
899 search_key
.objectid
= inode_objectid
;
900 search_key
.type
= BTRFS_INODE_REF_KEY
;
901 search_key
.offset
= parent_objectid
;
902 ret
= btrfs_search_slot(NULL
, root
, &search_key
, path
, 0, 0);
904 struct btrfs_inode_ref
*victim_ref
;
906 unsigned long ptr_end
;
908 leaf
= path
->nodes
[0];
910 /* are we trying to overwrite a back ref for the root directory
911 * if so, just jump out, we're done
913 if (search_key
.objectid
== search_key
.offset
)
916 /* check all the names in this back reference to see
917 * if they are in the log. if so, we allow them to stay
918 * otherwise they must be unlinked as a conflict
920 ptr
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
921 ptr_end
= ptr
+ btrfs_item_size_nr(leaf
, path
->slots
[0]);
922 while (ptr
< ptr_end
) {
923 victim_ref
= (struct btrfs_inode_ref
*)ptr
;
924 victim_name_len
= btrfs_inode_ref_name_len(leaf
,
926 victim_name
= kmalloc(victim_name_len
, GFP_NOFS
);
930 read_extent_buffer(leaf
, victim_name
,
931 (unsigned long)(victim_ref
+ 1),
934 if (!backref_in_log(log_root
, &search_key
,
939 btrfs_release_path(path
);
941 ret
= btrfs_unlink_inode(trans
, root
, dir
,
947 ret
= btrfs_run_delayed_items(trans
, root
);
955 ptr
= (unsigned long)(victim_ref
+ 1) + victim_name_len
;
959 * NOTE: we have searched root tree and checked the
960 * coresponding ref, it does not need to check again.
964 btrfs_release_path(path
);
966 /* Same search but for extended refs */
967 extref
= btrfs_lookup_inode_extref(NULL
, root
, path
, name
, namelen
,
968 inode_objectid
, parent_objectid
, 0,
970 if (!IS_ERR_OR_NULL(extref
)) {
974 struct inode
*victim_parent
;
976 leaf
= path
->nodes
[0];
978 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
979 base
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
981 while (cur_offset
< item_size
) {
982 extref
= (struct btrfs_inode_extref
*)base
+ cur_offset
;
984 victim_name_len
= btrfs_inode_extref_name_len(leaf
, extref
);
986 if (btrfs_inode_extref_parent(leaf
, extref
) != parent_objectid
)
989 victim_name
= kmalloc(victim_name_len
, GFP_NOFS
);
992 read_extent_buffer(leaf
, victim_name
, (unsigned long)&extref
->name
,
995 search_key
.objectid
= inode_objectid
;
996 search_key
.type
= BTRFS_INODE_EXTREF_KEY
;
997 search_key
.offset
= btrfs_extref_hash(parent_objectid
,
1001 if (!backref_in_log(log_root
, &search_key
,
1002 parent_objectid
, victim_name
,
1005 victim_parent
= read_one_inode(root
,
1007 if (victim_parent
) {
1009 btrfs_release_path(path
);
1011 ret
= btrfs_unlink_inode(trans
, root
,
1017 ret
= btrfs_run_delayed_items(
1020 iput(victim_parent
);
1031 cur_offset
+= victim_name_len
+ sizeof(*extref
);
1035 btrfs_release_path(path
);
1037 /* look for a conflicting sequence number */
1038 di
= btrfs_lookup_dir_index_item(trans
, root
, path
, btrfs_ino(dir
),
1039 ref_index
, name
, namelen
, 0);
1040 if (di
&& !IS_ERR(di
)) {
1041 ret
= drop_one_dir_item(trans
, root
, path
, dir
, di
);
1045 btrfs_release_path(path
);
1047 /* look for a conflicing name */
1048 di
= btrfs_lookup_dir_item(trans
, root
, path
, btrfs_ino(dir
),
1050 if (di
&& !IS_ERR(di
)) {
1051 ret
= drop_one_dir_item(trans
, root
, path
, dir
, di
);
1055 btrfs_release_path(path
);
1060 static int extref_get_fields(struct extent_buffer
*eb
, unsigned long ref_ptr
,
1061 u32
*namelen
, char **name
, u64
*index
,
1062 u64
*parent_objectid
)
1064 struct btrfs_inode_extref
*extref
;
1066 extref
= (struct btrfs_inode_extref
*)ref_ptr
;
1068 *namelen
= btrfs_inode_extref_name_len(eb
, extref
);
1069 *name
= kmalloc(*namelen
, GFP_NOFS
);
1073 read_extent_buffer(eb
, *name
, (unsigned long)&extref
->name
,
1076 *index
= btrfs_inode_extref_index(eb
, extref
);
1077 if (parent_objectid
)
1078 *parent_objectid
= btrfs_inode_extref_parent(eb
, extref
);
1083 static int ref_get_fields(struct extent_buffer
*eb
, unsigned long ref_ptr
,
1084 u32
*namelen
, char **name
, u64
*index
)
1086 struct btrfs_inode_ref
*ref
;
1088 ref
= (struct btrfs_inode_ref
*)ref_ptr
;
1090 *namelen
= btrfs_inode_ref_name_len(eb
, ref
);
1091 *name
= kmalloc(*namelen
, GFP_NOFS
);
1095 read_extent_buffer(eb
, *name
, (unsigned long)(ref
+ 1), *namelen
);
1097 *index
= btrfs_inode_ref_index(eb
, ref
);
1103 * replay one inode back reference item found in the log tree.
1104 * eb, slot and key refer to the buffer and key found in the log tree.
1105 * root is the destination we are replaying into, and path is for temp
1106 * use by this function. (it should be released on return).
1108 static noinline
int add_inode_ref(struct btrfs_trans_handle
*trans
,
1109 struct btrfs_root
*root
,
1110 struct btrfs_root
*log
,
1111 struct btrfs_path
*path
,
1112 struct extent_buffer
*eb
, int slot
,
1113 struct btrfs_key
*key
)
1115 struct inode
*dir
= NULL
;
1116 struct inode
*inode
= NULL
;
1117 unsigned long ref_ptr
;
1118 unsigned long ref_end
;
1122 int search_done
= 0;
1123 int log_ref_ver
= 0;
1124 u64 parent_objectid
;
1127 int ref_struct_size
;
1129 ref_ptr
= btrfs_item_ptr_offset(eb
, slot
);
1130 ref_end
= ref_ptr
+ btrfs_item_size_nr(eb
, slot
);
1132 if (key
->type
== BTRFS_INODE_EXTREF_KEY
) {
1133 struct btrfs_inode_extref
*r
;
1135 ref_struct_size
= sizeof(struct btrfs_inode_extref
);
1137 r
= (struct btrfs_inode_extref
*)ref_ptr
;
1138 parent_objectid
= btrfs_inode_extref_parent(eb
, r
);
1140 ref_struct_size
= sizeof(struct btrfs_inode_ref
);
1141 parent_objectid
= key
->offset
;
1143 inode_objectid
= key
->objectid
;
1146 * it is possible that we didn't log all the parent directories
1147 * for a given inode. If we don't find the dir, just don't
1148 * copy the back ref in. The link count fixup code will take
1151 dir
= read_one_inode(root
, parent_objectid
);
1157 inode
= read_one_inode(root
, inode_objectid
);
1163 while (ref_ptr
< ref_end
) {
1165 ret
= extref_get_fields(eb
, ref_ptr
, &namelen
, &name
,
1166 &ref_index
, &parent_objectid
);
1168 * parent object can change from one array
1172 dir
= read_one_inode(root
, parent_objectid
);
1178 ret
= ref_get_fields(eb
, ref_ptr
, &namelen
, &name
,
1184 /* if we already have a perfect match, we're done */
1185 if (!inode_in_dir(root
, path
, btrfs_ino(dir
), btrfs_ino(inode
),
1186 ref_index
, name
, namelen
)) {
1188 * look for a conflicting back reference in the
1189 * metadata. if we find one we have to unlink that name
1190 * of the file before we add our new link. Later on, we
1191 * overwrite any existing back reference, and we don't
1192 * want to create dangling pointers in the directory.
1196 ret
= __add_inode_ref(trans
, root
, path
, log
,
1200 ref_index
, name
, namelen
,
1209 /* insert our name */
1210 ret
= btrfs_add_link(trans
, dir
, inode
, name
, namelen
,
1215 btrfs_update_inode(trans
, root
, inode
);
1218 ref_ptr
= (unsigned long)(ref_ptr
+ ref_struct_size
) + namelen
;
1227 /* finally write the back reference in the inode */
1228 ret
= overwrite_item(trans
, root
, path
, eb
, slot
, key
);
1230 btrfs_release_path(path
);
1237 static int insert_orphan_item(struct btrfs_trans_handle
*trans
,
1238 struct btrfs_root
*root
, u64 offset
)
1241 ret
= btrfs_find_item(root
, NULL
, BTRFS_ORPHAN_OBJECTID
,
1242 offset
, BTRFS_ORPHAN_ITEM_KEY
, NULL
);
1244 ret
= btrfs_insert_orphan_item(trans
, root
, offset
);
1248 static int count_inode_extrefs(struct btrfs_root
*root
,
1249 struct inode
*inode
, struct btrfs_path
*path
)
1253 unsigned int nlink
= 0;
1256 u64 inode_objectid
= btrfs_ino(inode
);
1259 struct btrfs_inode_extref
*extref
;
1260 struct extent_buffer
*leaf
;
1263 ret
= btrfs_find_one_extref(root
, inode_objectid
, offset
, path
,
1268 leaf
= path
->nodes
[0];
1269 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1270 ptr
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
1272 while (cur_offset
< item_size
) {
1273 extref
= (struct btrfs_inode_extref
*) (ptr
+ cur_offset
);
1274 name_len
= btrfs_inode_extref_name_len(leaf
, extref
);
1278 cur_offset
+= name_len
+ sizeof(*extref
);
1282 btrfs_release_path(path
);
1284 btrfs_release_path(path
);
1291 static int count_inode_refs(struct btrfs_root
*root
,
1292 struct inode
*inode
, struct btrfs_path
*path
)
1295 struct btrfs_key key
;
1296 unsigned int nlink
= 0;
1298 unsigned long ptr_end
;
1300 u64 ino
= btrfs_ino(inode
);
1303 key
.type
= BTRFS_INODE_REF_KEY
;
1304 key
.offset
= (u64
)-1;
1307 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1311 if (path
->slots
[0] == 0)
1316 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
1318 if (key
.objectid
!= ino
||
1319 key
.type
!= BTRFS_INODE_REF_KEY
)
1321 ptr
= btrfs_item_ptr_offset(path
->nodes
[0], path
->slots
[0]);
1322 ptr_end
= ptr
+ btrfs_item_size_nr(path
->nodes
[0],
1324 while (ptr
< ptr_end
) {
1325 struct btrfs_inode_ref
*ref
;
1327 ref
= (struct btrfs_inode_ref
*)ptr
;
1328 name_len
= btrfs_inode_ref_name_len(path
->nodes
[0],
1330 ptr
= (unsigned long)(ref
+ 1) + name_len
;
1334 if (key
.offset
== 0)
1336 if (path
->slots
[0] > 0) {
1341 btrfs_release_path(path
);
1343 btrfs_release_path(path
);
1349 * There are a few corners where the link count of the file can't
1350 * be properly maintained during replay. So, instead of adding
1351 * lots of complexity to the log code, we just scan the backrefs
1352 * for any file that has been through replay.
1354 * The scan will update the link count on the inode to reflect the
1355 * number of back refs found. If it goes down to zero, the iput
1356 * will free the inode.
1358 static noinline
int fixup_inode_link_count(struct btrfs_trans_handle
*trans
,
1359 struct btrfs_root
*root
,
1360 struct inode
*inode
)
1362 struct btrfs_path
*path
;
1365 u64 ino
= btrfs_ino(inode
);
1367 path
= btrfs_alloc_path();
1371 ret
= count_inode_refs(root
, inode
, path
);
1377 ret
= count_inode_extrefs(root
, inode
, path
);
1388 if (nlink
!= inode
->i_nlink
) {
1389 set_nlink(inode
, nlink
);
1390 btrfs_update_inode(trans
, root
, inode
);
1392 BTRFS_I(inode
)->index_cnt
= (u64
)-1;
1394 if (inode
->i_nlink
== 0) {
1395 if (S_ISDIR(inode
->i_mode
)) {
1396 ret
= replay_dir_deletes(trans
, root
, NULL
, path
,
1401 ret
= insert_orphan_item(trans
, root
, ino
);
1405 btrfs_free_path(path
);
1409 static noinline
int fixup_inode_link_counts(struct btrfs_trans_handle
*trans
,
1410 struct btrfs_root
*root
,
1411 struct btrfs_path
*path
)
1414 struct btrfs_key key
;
1415 struct inode
*inode
;
1417 key
.objectid
= BTRFS_TREE_LOG_FIXUP_OBJECTID
;
1418 key
.type
= BTRFS_ORPHAN_ITEM_KEY
;
1419 key
.offset
= (u64
)-1;
1421 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1426 if (path
->slots
[0] == 0)
1431 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, path
->slots
[0]);
1432 if (key
.objectid
!= BTRFS_TREE_LOG_FIXUP_OBJECTID
||
1433 key
.type
!= BTRFS_ORPHAN_ITEM_KEY
)
1436 ret
= btrfs_del_item(trans
, root
, path
);
1440 btrfs_release_path(path
);
1441 inode
= read_one_inode(root
, key
.offset
);
1445 ret
= fixup_inode_link_count(trans
, root
, inode
);
1451 * fixup on a directory may create new entries,
1452 * make sure we always look for the highset possible
1455 key
.offset
= (u64
)-1;
1459 btrfs_release_path(path
);
1465 * record a given inode in the fixup dir so we can check its link
1466 * count when replay is done. The link count is incremented here
1467 * so the inode won't go away until we check it
1469 static noinline
int link_to_fixup_dir(struct btrfs_trans_handle
*trans
,
1470 struct btrfs_root
*root
,
1471 struct btrfs_path
*path
,
1474 struct btrfs_key key
;
1476 struct inode
*inode
;
1478 inode
= read_one_inode(root
, objectid
);
1482 key
.objectid
= BTRFS_TREE_LOG_FIXUP_OBJECTID
;
1483 btrfs_set_key_type(&key
, BTRFS_ORPHAN_ITEM_KEY
);
1484 key
.offset
= objectid
;
1486 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
, 0);
1488 btrfs_release_path(path
);
1490 if (!inode
->i_nlink
)
1491 set_nlink(inode
, 1);
1494 ret
= btrfs_update_inode(trans
, root
, inode
);
1495 } else if (ret
== -EEXIST
) {
1498 BUG(); /* Logic Error */
1506 * when replaying the log for a directory, we only insert names
1507 * for inodes that actually exist. This means an fsync on a directory
1508 * does not implicitly fsync all the new files in it
1510 static noinline
int insert_one_name(struct btrfs_trans_handle
*trans
,
1511 struct btrfs_root
*root
,
1512 struct btrfs_path
*path
,
1513 u64 dirid
, u64 index
,
1514 char *name
, int name_len
, u8 type
,
1515 struct btrfs_key
*location
)
1517 struct inode
*inode
;
1521 inode
= read_one_inode(root
, location
->objectid
);
1525 dir
= read_one_inode(root
, dirid
);
1531 ret
= btrfs_add_link(trans
, dir
, inode
, name
, name_len
, 1, index
);
1533 /* FIXME, put inode into FIXUP list */
1541 * take a single entry in a log directory item and replay it into
1544 * if a conflicting item exists in the subdirectory already,
1545 * the inode it points to is unlinked and put into the link count
1548 * If a name from the log points to a file or directory that does
1549 * not exist in the FS, it is skipped. fsyncs on directories
1550 * do not force down inodes inside that directory, just changes to the
1551 * names or unlinks in a directory.
1553 static noinline
int replay_one_name(struct btrfs_trans_handle
*trans
,
1554 struct btrfs_root
*root
,
1555 struct btrfs_path
*path
,
1556 struct extent_buffer
*eb
,
1557 struct btrfs_dir_item
*di
,
1558 struct btrfs_key
*key
)
1562 struct btrfs_dir_item
*dst_di
;
1563 struct btrfs_key found_key
;
1564 struct btrfs_key log_key
;
1569 bool update_size
= (key
->type
== BTRFS_DIR_INDEX_KEY
);
1571 dir
= read_one_inode(root
, key
->objectid
);
1575 name_len
= btrfs_dir_name_len(eb
, di
);
1576 name
= kmalloc(name_len
, GFP_NOFS
);
1582 log_type
= btrfs_dir_type(eb
, di
);
1583 read_extent_buffer(eb
, name
, (unsigned long)(di
+ 1),
1586 btrfs_dir_item_key_to_cpu(eb
, di
, &log_key
);
1587 exists
= btrfs_lookup_inode(trans
, root
, path
, &log_key
, 0);
1592 btrfs_release_path(path
);
1594 if (key
->type
== BTRFS_DIR_ITEM_KEY
) {
1595 dst_di
= btrfs_lookup_dir_item(trans
, root
, path
, key
->objectid
,
1597 } else if (key
->type
== BTRFS_DIR_INDEX_KEY
) {
1598 dst_di
= btrfs_lookup_dir_index_item(trans
, root
, path
,
1607 if (IS_ERR_OR_NULL(dst_di
)) {
1608 /* we need a sequence number to insert, so we only
1609 * do inserts for the BTRFS_DIR_INDEX_KEY types
1611 if (key
->type
!= BTRFS_DIR_INDEX_KEY
)
1616 btrfs_dir_item_key_to_cpu(path
->nodes
[0], dst_di
, &found_key
);
1617 /* the existing item matches the logged item */
1618 if (found_key
.objectid
== log_key
.objectid
&&
1619 found_key
.type
== log_key
.type
&&
1620 found_key
.offset
== log_key
.offset
&&
1621 btrfs_dir_type(path
->nodes
[0], dst_di
) == log_type
) {
1626 * don't drop the conflicting directory entry if the inode
1627 * for the new entry doesn't exist
1632 ret
= drop_one_dir_item(trans
, root
, path
, dir
, dst_di
);
1636 if (key
->type
== BTRFS_DIR_INDEX_KEY
)
1639 btrfs_release_path(path
);
1640 if (!ret
&& update_size
) {
1641 btrfs_i_size_write(dir
, dir
->i_size
+ name_len
* 2);
1642 ret
= btrfs_update_inode(trans
, root
, dir
);
1649 btrfs_release_path(path
);
1650 ret
= insert_one_name(trans
, root
, path
, key
->objectid
, key
->offset
,
1651 name
, name_len
, log_type
, &log_key
);
1652 if (ret
&& ret
!= -ENOENT
)
1654 update_size
= false;
1660 * find all the names in a directory item and reconcile them into
1661 * the subvolume. Only BTRFS_DIR_ITEM_KEY types will have more than
1662 * one name in a directory item, but the same code gets used for
1663 * both directory index types
1665 static noinline
int replay_one_dir_item(struct btrfs_trans_handle
*trans
,
1666 struct btrfs_root
*root
,
1667 struct btrfs_path
*path
,
1668 struct extent_buffer
*eb
, int slot
,
1669 struct btrfs_key
*key
)
1672 u32 item_size
= btrfs_item_size_nr(eb
, slot
);
1673 struct btrfs_dir_item
*di
;
1676 unsigned long ptr_end
;
1678 ptr
= btrfs_item_ptr_offset(eb
, slot
);
1679 ptr_end
= ptr
+ item_size
;
1680 while (ptr
< ptr_end
) {
1681 di
= (struct btrfs_dir_item
*)ptr
;
1682 if (verify_dir_item(root
, eb
, di
))
1684 name_len
= btrfs_dir_name_len(eb
, di
);
1685 ret
= replay_one_name(trans
, root
, path
, eb
, di
, key
);
1688 ptr
= (unsigned long)(di
+ 1);
1695 * directory replay has two parts. There are the standard directory
1696 * items in the log copied from the subvolume, and range items
1697 * created in the log while the subvolume was logged.
1699 * The range items tell us which parts of the key space the log
1700 * is authoritative for. During replay, if a key in the subvolume
1701 * directory is in a logged range item, but not actually in the log
1702 * that means it was deleted from the directory before the fsync
1703 * and should be removed.
1705 static noinline
int find_dir_range(struct btrfs_root
*root
,
1706 struct btrfs_path
*path
,
1707 u64 dirid
, int key_type
,
1708 u64
*start_ret
, u64
*end_ret
)
1710 struct btrfs_key key
;
1712 struct btrfs_dir_log_item
*item
;
1716 if (*start_ret
== (u64
)-1)
1719 key
.objectid
= dirid
;
1720 key
.type
= key_type
;
1721 key
.offset
= *start_ret
;
1723 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1727 if (path
->slots
[0] == 0)
1732 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, path
->slots
[0]);
1734 if (key
.type
!= key_type
|| key
.objectid
!= dirid
) {
1738 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
1739 struct btrfs_dir_log_item
);
1740 found_end
= btrfs_dir_log_end(path
->nodes
[0], item
);
1742 if (*start_ret
>= key
.offset
&& *start_ret
<= found_end
) {
1744 *start_ret
= key
.offset
;
1745 *end_ret
= found_end
;
1750 /* check the next slot in the tree to see if it is a valid item */
1751 nritems
= btrfs_header_nritems(path
->nodes
[0]);
1752 if (path
->slots
[0] >= nritems
) {
1753 ret
= btrfs_next_leaf(root
, path
);
1760 btrfs_item_key_to_cpu(path
->nodes
[0], &key
, path
->slots
[0]);
1762 if (key
.type
!= key_type
|| key
.objectid
!= dirid
) {
1766 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
1767 struct btrfs_dir_log_item
);
1768 found_end
= btrfs_dir_log_end(path
->nodes
[0], item
);
1769 *start_ret
= key
.offset
;
1770 *end_ret
= found_end
;
1773 btrfs_release_path(path
);
1778 * this looks for a given directory item in the log. If the directory
1779 * item is not in the log, the item is removed and the inode it points
1782 static noinline
int check_item_in_log(struct btrfs_trans_handle
*trans
,
1783 struct btrfs_root
*root
,
1784 struct btrfs_root
*log
,
1785 struct btrfs_path
*path
,
1786 struct btrfs_path
*log_path
,
1788 struct btrfs_key
*dir_key
)
1791 struct extent_buffer
*eb
;
1794 struct btrfs_dir_item
*di
;
1795 struct btrfs_dir_item
*log_di
;
1798 unsigned long ptr_end
;
1800 struct inode
*inode
;
1801 struct btrfs_key location
;
1804 eb
= path
->nodes
[0];
1805 slot
= path
->slots
[0];
1806 item_size
= btrfs_item_size_nr(eb
, slot
);
1807 ptr
= btrfs_item_ptr_offset(eb
, slot
);
1808 ptr_end
= ptr
+ item_size
;
1809 while (ptr
< ptr_end
) {
1810 di
= (struct btrfs_dir_item
*)ptr
;
1811 if (verify_dir_item(root
, eb
, di
)) {
1816 name_len
= btrfs_dir_name_len(eb
, di
);
1817 name
= kmalloc(name_len
, GFP_NOFS
);
1822 read_extent_buffer(eb
, name
, (unsigned long)(di
+ 1),
1825 if (log
&& dir_key
->type
== BTRFS_DIR_ITEM_KEY
) {
1826 log_di
= btrfs_lookup_dir_item(trans
, log
, log_path
,
1829 } else if (log
&& dir_key
->type
== BTRFS_DIR_INDEX_KEY
) {
1830 log_di
= btrfs_lookup_dir_index_item(trans
, log
,
1836 if (!log_di
|| (IS_ERR(log_di
) && PTR_ERR(log_di
) == -ENOENT
)) {
1837 btrfs_dir_item_key_to_cpu(eb
, di
, &location
);
1838 btrfs_release_path(path
);
1839 btrfs_release_path(log_path
);
1840 inode
= read_one_inode(root
, location
.objectid
);
1846 ret
= link_to_fixup_dir(trans
, root
,
1847 path
, location
.objectid
);
1855 ret
= btrfs_unlink_inode(trans
, root
, dir
, inode
,
1858 ret
= btrfs_run_delayed_items(trans
, root
);
1864 /* there might still be more names under this key
1865 * check and repeat if required
1867 ret
= btrfs_search_slot(NULL
, root
, dir_key
, path
,
1873 } else if (IS_ERR(log_di
)) {
1875 return PTR_ERR(log_di
);
1877 btrfs_release_path(log_path
);
1880 ptr
= (unsigned long)(di
+ 1);
1885 btrfs_release_path(path
);
1886 btrfs_release_path(log_path
);
1891 * deletion replay happens before we copy any new directory items
1892 * out of the log or out of backreferences from inodes. It
1893 * scans the log to find ranges of keys that log is authoritative for,
1894 * and then scans the directory to find items in those ranges that are
1895 * not present in the log.
1897 * Anything we don't find in the log is unlinked and removed from the
1900 static noinline
int replay_dir_deletes(struct btrfs_trans_handle
*trans
,
1901 struct btrfs_root
*root
,
1902 struct btrfs_root
*log
,
1903 struct btrfs_path
*path
,
1904 u64 dirid
, int del_all
)
1908 int key_type
= BTRFS_DIR_LOG_ITEM_KEY
;
1910 struct btrfs_key dir_key
;
1911 struct btrfs_key found_key
;
1912 struct btrfs_path
*log_path
;
1915 dir_key
.objectid
= dirid
;
1916 dir_key
.type
= BTRFS_DIR_ITEM_KEY
;
1917 log_path
= btrfs_alloc_path();
1921 dir
= read_one_inode(root
, dirid
);
1922 /* it isn't an error if the inode isn't there, that can happen
1923 * because we replay the deletes before we copy in the inode item
1927 btrfs_free_path(log_path
);
1935 range_end
= (u64
)-1;
1937 ret
= find_dir_range(log
, path
, dirid
, key_type
,
1938 &range_start
, &range_end
);
1943 dir_key
.offset
= range_start
;
1946 ret
= btrfs_search_slot(NULL
, root
, &dir_key
, path
,
1951 nritems
= btrfs_header_nritems(path
->nodes
[0]);
1952 if (path
->slots
[0] >= nritems
) {
1953 ret
= btrfs_next_leaf(root
, path
);
1957 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
1959 if (found_key
.objectid
!= dirid
||
1960 found_key
.type
!= dir_key
.type
)
1963 if (found_key
.offset
> range_end
)
1966 ret
= check_item_in_log(trans
, root
, log
, path
,
1971 if (found_key
.offset
== (u64
)-1)
1973 dir_key
.offset
= found_key
.offset
+ 1;
1975 btrfs_release_path(path
);
1976 if (range_end
== (u64
)-1)
1978 range_start
= range_end
+ 1;
1983 if (key_type
== BTRFS_DIR_LOG_ITEM_KEY
) {
1984 key_type
= BTRFS_DIR_LOG_INDEX_KEY
;
1985 dir_key
.type
= BTRFS_DIR_INDEX_KEY
;
1986 btrfs_release_path(path
);
1990 btrfs_release_path(path
);
1991 btrfs_free_path(log_path
);
1997 * the process_func used to replay items from the log tree. This
1998 * gets called in two different stages. The first stage just looks
1999 * for inodes and makes sure they are all copied into the subvolume.
2001 * The second stage copies all the other item types from the log into
2002 * the subvolume. The two stage approach is slower, but gets rid of
2003 * lots of complexity around inodes referencing other inodes that exist
2004 * only in the log (references come from either directory items or inode
2007 static int replay_one_buffer(struct btrfs_root
*log
, struct extent_buffer
*eb
,
2008 struct walk_control
*wc
, u64 gen
)
2011 struct btrfs_path
*path
;
2012 struct btrfs_root
*root
= wc
->replay_dest
;
2013 struct btrfs_key key
;
2018 ret
= btrfs_read_buffer(eb
, gen
);
2022 level
= btrfs_header_level(eb
);
2027 path
= btrfs_alloc_path();
2031 nritems
= btrfs_header_nritems(eb
);
2032 for (i
= 0; i
< nritems
; i
++) {
2033 btrfs_item_key_to_cpu(eb
, &key
, i
);
2035 /* inode keys are done during the first stage */
2036 if (key
.type
== BTRFS_INODE_ITEM_KEY
&&
2037 wc
->stage
== LOG_WALK_REPLAY_INODES
) {
2038 struct btrfs_inode_item
*inode_item
;
2041 inode_item
= btrfs_item_ptr(eb
, i
,
2042 struct btrfs_inode_item
);
2043 mode
= btrfs_inode_mode(eb
, inode_item
);
2044 if (S_ISDIR(mode
)) {
2045 ret
= replay_dir_deletes(wc
->trans
,
2046 root
, log
, path
, key
.objectid
, 0);
2050 ret
= overwrite_item(wc
->trans
, root
, path
,
2055 /* for regular files, make sure corresponding
2056 * orhpan item exist. extents past the new EOF
2057 * will be truncated later by orphan cleanup.
2059 if (S_ISREG(mode
)) {
2060 ret
= insert_orphan_item(wc
->trans
, root
,
2066 ret
= link_to_fixup_dir(wc
->trans
, root
,
2067 path
, key
.objectid
);
2072 if (key
.type
== BTRFS_DIR_INDEX_KEY
&&
2073 wc
->stage
== LOG_WALK_REPLAY_DIR_INDEX
) {
2074 ret
= replay_one_dir_item(wc
->trans
, root
, path
,
2080 if (wc
->stage
< LOG_WALK_REPLAY_ALL
)
2083 /* these keys are simply copied */
2084 if (key
.type
== BTRFS_XATTR_ITEM_KEY
) {
2085 ret
= overwrite_item(wc
->trans
, root
, path
,
2089 } else if (key
.type
== BTRFS_INODE_REF_KEY
||
2090 key
.type
== BTRFS_INODE_EXTREF_KEY
) {
2091 ret
= add_inode_ref(wc
->trans
, root
, log
, path
,
2093 if (ret
&& ret
!= -ENOENT
)
2096 } else if (key
.type
== BTRFS_EXTENT_DATA_KEY
) {
2097 ret
= replay_one_extent(wc
->trans
, root
, path
,
2101 } else if (key
.type
== BTRFS_DIR_ITEM_KEY
) {
2102 ret
= replay_one_dir_item(wc
->trans
, root
, path
,
2108 btrfs_free_path(path
);
2112 static noinline
int walk_down_log_tree(struct btrfs_trans_handle
*trans
,
2113 struct btrfs_root
*root
,
2114 struct btrfs_path
*path
, int *level
,
2115 struct walk_control
*wc
)
2120 struct extent_buffer
*next
;
2121 struct extent_buffer
*cur
;
2122 struct extent_buffer
*parent
;
2126 WARN_ON(*level
< 0);
2127 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2129 while (*level
> 0) {
2130 WARN_ON(*level
< 0);
2131 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2132 cur
= path
->nodes
[*level
];
2134 WARN_ON(btrfs_header_level(cur
) != *level
);
2136 if (path
->slots
[*level
] >=
2137 btrfs_header_nritems(cur
))
2140 bytenr
= btrfs_node_blockptr(cur
, path
->slots
[*level
]);
2141 ptr_gen
= btrfs_node_ptr_generation(cur
, path
->slots
[*level
]);
2142 blocksize
= btrfs_level_size(root
, *level
- 1);
2144 parent
= path
->nodes
[*level
];
2145 root_owner
= btrfs_header_owner(parent
);
2147 next
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
2152 ret
= wc
->process_func(root
, next
, wc
, ptr_gen
);
2154 free_extent_buffer(next
);
2158 path
->slots
[*level
]++;
2160 ret
= btrfs_read_buffer(next
, ptr_gen
);
2162 free_extent_buffer(next
);
2167 btrfs_tree_lock(next
);
2168 btrfs_set_lock_blocking(next
);
2169 clean_tree_block(trans
, root
, next
);
2170 btrfs_wait_tree_block_writeback(next
);
2171 btrfs_tree_unlock(next
);
2174 WARN_ON(root_owner
!=
2175 BTRFS_TREE_LOG_OBJECTID
);
2176 ret
= btrfs_free_and_pin_reserved_extent(root
,
2179 free_extent_buffer(next
);
2183 free_extent_buffer(next
);
2186 ret
= btrfs_read_buffer(next
, ptr_gen
);
2188 free_extent_buffer(next
);
2192 WARN_ON(*level
<= 0);
2193 if (path
->nodes
[*level
-1])
2194 free_extent_buffer(path
->nodes
[*level
-1]);
2195 path
->nodes
[*level
-1] = next
;
2196 *level
= btrfs_header_level(next
);
2197 path
->slots
[*level
] = 0;
2200 WARN_ON(*level
< 0);
2201 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2203 path
->slots
[*level
] = btrfs_header_nritems(path
->nodes
[*level
]);
2209 static noinline
int walk_up_log_tree(struct btrfs_trans_handle
*trans
,
2210 struct btrfs_root
*root
,
2211 struct btrfs_path
*path
, int *level
,
2212 struct walk_control
*wc
)
2219 for (i
= *level
; i
< BTRFS_MAX_LEVEL
- 1 && path
->nodes
[i
]; i
++) {
2220 slot
= path
->slots
[i
];
2221 if (slot
+ 1 < btrfs_header_nritems(path
->nodes
[i
])) {
2224 WARN_ON(*level
== 0);
2227 struct extent_buffer
*parent
;
2228 if (path
->nodes
[*level
] == root
->node
)
2229 parent
= path
->nodes
[*level
];
2231 parent
= path
->nodes
[*level
+ 1];
2233 root_owner
= btrfs_header_owner(parent
);
2234 ret
= wc
->process_func(root
, path
->nodes
[*level
], wc
,
2235 btrfs_header_generation(path
->nodes
[*level
]));
2240 struct extent_buffer
*next
;
2242 next
= path
->nodes
[*level
];
2245 btrfs_tree_lock(next
);
2246 btrfs_set_lock_blocking(next
);
2247 clean_tree_block(trans
, root
, next
);
2248 btrfs_wait_tree_block_writeback(next
);
2249 btrfs_tree_unlock(next
);
2252 WARN_ON(root_owner
!= BTRFS_TREE_LOG_OBJECTID
);
2253 ret
= btrfs_free_and_pin_reserved_extent(root
,
2254 path
->nodes
[*level
]->start
,
2255 path
->nodes
[*level
]->len
);
2259 free_extent_buffer(path
->nodes
[*level
]);
2260 path
->nodes
[*level
] = NULL
;
2268 * drop the reference count on the tree rooted at 'snap'. This traverses
2269 * the tree freeing any blocks that have a ref count of zero after being
2272 static int walk_log_tree(struct btrfs_trans_handle
*trans
,
2273 struct btrfs_root
*log
, struct walk_control
*wc
)
2278 struct btrfs_path
*path
;
2281 path
= btrfs_alloc_path();
2285 level
= btrfs_header_level(log
->node
);
2287 path
->nodes
[level
] = log
->node
;
2288 extent_buffer_get(log
->node
);
2289 path
->slots
[level
] = 0;
2292 wret
= walk_down_log_tree(trans
, log
, path
, &level
, wc
);
2300 wret
= walk_up_log_tree(trans
, log
, path
, &level
, wc
);
2309 /* was the root node processed? if not, catch it here */
2310 if (path
->nodes
[orig_level
]) {
2311 ret
= wc
->process_func(log
, path
->nodes
[orig_level
], wc
,
2312 btrfs_header_generation(path
->nodes
[orig_level
]));
2316 struct extent_buffer
*next
;
2318 next
= path
->nodes
[orig_level
];
2321 btrfs_tree_lock(next
);
2322 btrfs_set_lock_blocking(next
);
2323 clean_tree_block(trans
, log
, next
);
2324 btrfs_wait_tree_block_writeback(next
);
2325 btrfs_tree_unlock(next
);
2328 WARN_ON(log
->root_key
.objectid
!=
2329 BTRFS_TREE_LOG_OBJECTID
);
2330 ret
= btrfs_free_and_pin_reserved_extent(log
, next
->start
,
2338 btrfs_free_path(path
);
2343 * helper function to update the item for a given subvolumes log root
2344 * in the tree of log roots
2346 static int update_log_root(struct btrfs_trans_handle
*trans
,
2347 struct btrfs_root
*log
)
2351 if (log
->log_transid
== 1) {
2352 /* insert root item on the first sync */
2353 ret
= btrfs_insert_root(trans
, log
->fs_info
->log_root_tree
,
2354 &log
->root_key
, &log
->root_item
);
2356 ret
= btrfs_update_root(trans
, log
->fs_info
->log_root_tree
,
2357 &log
->root_key
, &log
->root_item
);
2362 static int wait_log_commit(struct btrfs_trans_handle
*trans
,
2363 struct btrfs_root
*root
, unsigned long transid
)
2366 int index
= transid
% 2;
2369 * we only allow two pending log transactions at a time,
2370 * so we know that if ours is more than 2 older than the
2371 * current transaction, we're done
2374 prepare_to_wait(&root
->log_commit_wait
[index
],
2375 &wait
, TASK_UNINTERRUPTIBLE
);
2376 mutex_unlock(&root
->log_mutex
);
2378 if (root
->fs_info
->last_trans_log_full_commit
!=
2379 trans
->transid
&& root
->log_transid
< transid
+ 2 &&
2380 atomic_read(&root
->log_commit
[index
]))
2383 finish_wait(&root
->log_commit_wait
[index
], &wait
);
2384 mutex_lock(&root
->log_mutex
);
2385 } while (root
->fs_info
->last_trans_log_full_commit
!=
2386 trans
->transid
&& root
->log_transid
< transid
+ 2 &&
2387 atomic_read(&root
->log_commit
[index
]));
2391 static void wait_for_writer(struct btrfs_trans_handle
*trans
,
2392 struct btrfs_root
*root
)
2395 while (root
->fs_info
->last_trans_log_full_commit
!=
2396 trans
->transid
&& atomic_read(&root
->log_writers
)) {
2397 prepare_to_wait(&root
->log_writer_wait
,
2398 &wait
, TASK_UNINTERRUPTIBLE
);
2399 mutex_unlock(&root
->log_mutex
);
2400 if (root
->fs_info
->last_trans_log_full_commit
!=
2401 trans
->transid
&& atomic_read(&root
->log_writers
))
2403 mutex_lock(&root
->log_mutex
);
2404 finish_wait(&root
->log_writer_wait
, &wait
);
2409 * btrfs_sync_log does sends a given tree log down to the disk and
2410 * updates the super blocks to record it. When this call is done,
2411 * you know that any inodes previously logged are safely on disk only
2414 * Any other return value means you need to call btrfs_commit_transaction.
2415 * Some of the edge cases for fsyncing directories that have had unlinks
2416 * or renames done in the past mean that sometimes the only safe
2417 * fsync is to commit the whole FS. When btrfs_sync_log returns -EAGAIN,
2418 * that has happened.
2420 int btrfs_sync_log(struct btrfs_trans_handle
*trans
,
2421 struct btrfs_root
*root
)
2427 struct btrfs_root
*log
= root
->log_root
;
2428 struct btrfs_root
*log_root_tree
= root
->fs_info
->log_root_tree
;
2429 unsigned long log_transid
= 0;
2430 struct blk_plug plug
;
2432 mutex_lock(&root
->log_mutex
);
2433 log_transid
= root
->log_transid
;
2434 index1
= root
->log_transid
% 2;
2435 if (atomic_read(&root
->log_commit
[index1
])) {
2436 wait_log_commit(trans
, root
, root
->log_transid
);
2437 mutex_unlock(&root
->log_mutex
);
2440 atomic_set(&root
->log_commit
[index1
], 1);
2442 /* wait for previous tree log sync to complete */
2443 if (atomic_read(&root
->log_commit
[(index1
+ 1) % 2]))
2444 wait_log_commit(trans
, root
, root
->log_transid
- 1);
2446 int batch
= atomic_read(&root
->log_batch
);
2447 /* when we're on an ssd, just kick the log commit out */
2448 if (!btrfs_test_opt(root
, SSD
) && root
->log_multiple_pids
) {
2449 mutex_unlock(&root
->log_mutex
);
2450 schedule_timeout_uninterruptible(1);
2451 mutex_lock(&root
->log_mutex
);
2453 wait_for_writer(trans
, root
);
2454 if (batch
== atomic_read(&root
->log_batch
))
2458 /* bail out if we need to do a full commit */
2459 if (root
->fs_info
->last_trans_log_full_commit
== trans
->transid
) {
2461 btrfs_free_logged_extents(log
, log_transid
);
2462 mutex_unlock(&root
->log_mutex
);
2466 if (log_transid
% 2 == 0)
2467 mark
= EXTENT_DIRTY
;
2471 /* we start IO on all the marked extents here, but we don't actually
2472 * wait for them until later.
2474 blk_start_plug(&plug
);
2475 ret
= btrfs_write_marked_extents(log
, &log
->dirty_log_pages
, mark
);
2477 blk_finish_plug(&plug
);
2478 btrfs_abort_transaction(trans
, root
, ret
);
2479 btrfs_free_logged_extents(log
, log_transid
);
2480 mutex_unlock(&root
->log_mutex
);
2484 btrfs_set_root_node(&log
->root_item
, log
->node
);
2486 root
->log_transid
++;
2487 log
->log_transid
= root
->log_transid
;
2488 root
->log_start_pid
= 0;
2491 * IO has been started, blocks of the log tree have WRITTEN flag set
2492 * in their headers. new modifications of the log will be written to
2493 * new positions. so it's safe to allow log writers to go in.
2495 mutex_unlock(&root
->log_mutex
);
2497 mutex_lock(&log_root_tree
->log_mutex
);
2498 atomic_inc(&log_root_tree
->log_batch
);
2499 atomic_inc(&log_root_tree
->log_writers
);
2500 mutex_unlock(&log_root_tree
->log_mutex
);
2502 ret
= update_log_root(trans
, log
);
2504 mutex_lock(&log_root_tree
->log_mutex
);
2505 if (atomic_dec_and_test(&log_root_tree
->log_writers
)) {
2507 if (waitqueue_active(&log_root_tree
->log_writer_wait
))
2508 wake_up(&log_root_tree
->log_writer_wait
);
2512 blk_finish_plug(&plug
);
2513 if (ret
!= -ENOSPC
) {
2514 btrfs_abort_transaction(trans
, root
, ret
);
2515 mutex_unlock(&log_root_tree
->log_mutex
);
2518 root
->fs_info
->last_trans_log_full_commit
= trans
->transid
;
2519 btrfs_wait_marked_extents(log
, &log
->dirty_log_pages
, mark
);
2520 btrfs_free_logged_extents(log
, log_transid
);
2521 mutex_unlock(&log_root_tree
->log_mutex
);
2526 index2
= log_root_tree
->log_transid
% 2;
2527 if (atomic_read(&log_root_tree
->log_commit
[index2
])) {
2528 blk_finish_plug(&plug
);
2529 btrfs_wait_marked_extents(log
, &log
->dirty_log_pages
, mark
);
2530 wait_log_commit(trans
, log_root_tree
,
2531 log_root_tree
->log_transid
);
2532 btrfs_free_logged_extents(log
, log_transid
);
2533 mutex_unlock(&log_root_tree
->log_mutex
);
2537 atomic_set(&log_root_tree
->log_commit
[index2
], 1);
2539 if (atomic_read(&log_root_tree
->log_commit
[(index2
+ 1) % 2])) {
2540 wait_log_commit(trans
, log_root_tree
,
2541 log_root_tree
->log_transid
- 1);
2544 wait_for_writer(trans
, log_root_tree
);
2547 * now that we've moved on to the tree of log tree roots,
2548 * check the full commit flag again
2550 if (root
->fs_info
->last_trans_log_full_commit
== trans
->transid
) {
2551 blk_finish_plug(&plug
);
2552 btrfs_wait_marked_extents(log
, &log
->dirty_log_pages
, mark
);
2553 btrfs_free_logged_extents(log
, log_transid
);
2554 mutex_unlock(&log_root_tree
->log_mutex
);
2556 goto out_wake_log_root
;
2559 ret
= btrfs_write_marked_extents(log_root_tree
,
2560 &log_root_tree
->dirty_log_pages
,
2561 EXTENT_DIRTY
| EXTENT_NEW
);
2562 blk_finish_plug(&plug
);
2564 btrfs_abort_transaction(trans
, root
, ret
);
2565 btrfs_free_logged_extents(log
, log_transid
);
2566 mutex_unlock(&log_root_tree
->log_mutex
);
2567 goto out_wake_log_root
;
2569 btrfs_wait_marked_extents(log
, &log
->dirty_log_pages
, mark
);
2570 btrfs_wait_marked_extents(log_root_tree
,
2571 &log_root_tree
->dirty_log_pages
,
2572 EXTENT_NEW
| EXTENT_DIRTY
);
2573 btrfs_wait_logged_extents(log
, log_transid
);
2575 btrfs_set_super_log_root(root
->fs_info
->super_for_commit
,
2576 log_root_tree
->node
->start
);
2577 btrfs_set_super_log_root_level(root
->fs_info
->super_for_commit
,
2578 btrfs_header_level(log_root_tree
->node
));
2580 log_root_tree
->log_transid
++;
2583 mutex_unlock(&log_root_tree
->log_mutex
);
2586 * nobody else is going to jump in and write the the ctree
2587 * super here because the log_commit atomic below is protecting
2588 * us. We must be called with a transaction handle pinning
2589 * the running transaction open, so a full commit can't hop
2590 * in and cause problems either.
2592 ret
= write_ctree_super(trans
, root
->fs_info
->tree_root
, 1);
2594 btrfs_abort_transaction(trans
, root
, ret
);
2595 goto out_wake_log_root
;
2598 mutex_lock(&root
->log_mutex
);
2599 if (root
->last_log_commit
< log_transid
)
2600 root
->last_log_commit
= log_transid
;
2601 mutex_unlock(&root
->log_mutex
);
2604 atomic_set(&log_root_tree
->log_commit
[index2
], 0);
2606 if (waitqueue_active(&log_root_tree
->log_commit_wait
[index2
]))
2607 wake_up(&log_root_tree
->log_commit_wait
[index2
]);
2609 atomic_set(&root
->log_commit
[index1
], 0);
2611 if (waitqueue_active(&root
->log_commit_wait
[index1
]))
2612 wake_up(&root
->log_commit_wait
[index1
]);
2616 static void free_log_tree(struct btrfs_trans_handle
*trans
,
2617 struct btrfs_root
*log
)
2622 struct walk_control wc
= {
2624 .process_func
= process_one_buffer
2627 ret
= walk_log_tree(trans
, log
, &wc
);
2628 /* I don't think this can happen but just in case */
2630 btrfs_abort_transaction(trans
, log
, ret
);
2633 ret
= find_first_extent_bit(&log
->dirty_log_pages
,
2634 0, &start
, &end
, EXTENT_DIRTY
| EXTENT_NEW
,
2639 clear_extent_bits(&log
->dirty_log_pages
, start
, end
,
2640 EXTENT_DIRTY
| EXTENT_NEW
, GFP_NOFS
);
2644 * We may have short-circuited the log tree with the full commit logic
2645 * and left ordered extents on our list, so clear these out to keep us
2646 * from leaking inodes and memory.
2648 btrfs_free_logged_extents(log
, 0);
2649 btrfs_free_logged_extents(log
, 1);
2651 free_extent_buffer(log
->node
);
2656 * free all the extents used by the tree log. This should be called
2657 * at commit time of the full transaction
2659 int btrfs_free_log(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
)
2661 if (root
->log_root
) {
2662 free_log_tree(trans
, root
->log_root
);
2663 root
->log_root
= NULL
;
2668 int btrfs_free_log_root_tree(struct btrfs_trans_handle
*trans
,
2669 struct btrfs_fs_info
*fs_info
)
2671 if (fs_info
->log_root_tree
) {
2672 free_log_tree(trans
, fs_info
->log_root_tree
);
2673 fs_info
->log_root_tree
= NULL
;
2679 * If both a file and directory are logged, and unlinks or renames are
2680 * mixed in, we have a few interesting corners:
2682 * create file X in dir Y
2683 * link file X to X.link in dir Y
2685 * unlink file X but leave X.link
2688 * After a crash we would expect only X.link to exist. But file X
2689 * didn't get fsync'd again so the log has back refs for X and X.link.
2691 * We solve this by removing directory entries and inode backrefs from the
2692 * log when a file that was logged in the current transaction is
2693 * unlinked. Any later fsync will include the updated log entries, and
2694 * we'll be able to reconstruct the proper directory items from backrefs.
2696 * This optimizations allows us to avoid relogging the entire inode
2697 * or the entire directory.
2699 int btrfs_del_dir_entries_in_log(struct btrfs_trans_handle
*trans
,
2700 struct btrfs_root
*root
,
2701 const char *name
, int name_len
,
2702 struct inode
*dir
, u64 index
)
2704 struct btrfs_root
*log
;
2705 struct btrfs_dir_item
*di
;
2706 struct btrfs_path
*path
;
2710 u64 dir_ino
= btrfs_ino(dir
);
2712 if (BTRFS_I(dir
)->logged_trans
< trans
->transid
)
2715 ret
= join_running_log_trans(root
);
2719 mutex_lock(&BTRFS_I(dir
)->log_mutex
);
2721 log
= root
->log_root
;
2722 path
= btrfs_alloc_path();
2728 di
= btrfs_lookup_dir_item(trans
, log
, path
, dir_ino
,
2729 name
, name_len
, -1);
2735 ret
= btrfs_delete_one_dir_name(trans
, log
, path
, di
);
2736 bytes_del
+= name_len
;
2742 btrfs_release_path(path
);
2743 di
= btrfs_lookup_dir_index_item(trans
, log
, path
, dir_ino
,
2744 index
, name
, name_len
, -1);
2750 ret
= btrfs_delete_one_dir_name(trans
, log
, path
, di
);
2751 bytes_del
+= name_len
;
2758 /* update the directory size in the log to reflect the names
2762 struct btrfs_key key
;
2764 key
.objectid
= dir_ino
;
2766 key
.type
= BTRFS_INODE_ITEM_KEY
;
2767 btrfs_release_path(path
);
2769 ret
= btrfs_search_slot(trans
, log
, &key
, path
, 0, 1);
2775 struct btrfs_inode_item
*item
;
2778 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
2779 struct btrfs_inode_item
);
2780 i_size
= btrfs_inode_size(path
->nodes
[0], item
);
2781 if (i_size
> bytes_del
)
2782 i_size
-= bytes_del
;
2785 btrfs_set_inode_size(path
->nodes
[0], item
, i_size
);
2786 btrfs_mark_buffer_dirty(path
->nodes
[0]);
2789 btrfs_release_path(path
);
2792 btrfs_free_path(path
);
2794 mutex_unlock(&BTRFS_I(dir
)->log_mutex
);
2795 if (ret
== -ENOSPC
) {
2796 root
->fs_info
->last_trans_log_full_commit
= trans
->transid
;
2799 btrfs_abort_transaction(trans
, root
, ret
);
2801 btrfs_end_log_trans(root
);
2806 /* see comments for btrfs_del_dir_entries_in_log */
2807 int btrfs_del_inode_ref_in_log(struct btrfs_trans_handle
*trans
,
2808 struct btrfs_root
*root
,
2809 const char *name
, int name_len
,
2810 struct inode
*inode
, u64 dirid
)
2812 struct btrfs_root
*log
;
2816 if (BTRFS_I(inode
)->logged_trans
< trans
->transid
)
2819 ret
= join_running_log_trans(root
);
2822 log
= root
->log_root
;
2823 mutex_lock(&BTRFS_I(inode
)->log_mutex
);
2825 ret
= btrfs_del_inode_ref(trans
, log
, name
, name_len
, btrfs_ino(inode
),
2827 mutex_unlock(&BTRFS_I(inode
)->log_mutex
);
2828 if (ret
== -ENOSPC
) {
2829 root
->fs_info
->last_trans_log_full_commit
= trans
->transid
;
2831 } else if (ret
< 0 && ret
!= -ENOENT
)
2832 btrfs_abort_transaction(trans
, root
, ret
);
2833 btrfs_end_log_trans(root
);
2839 * creates a range item in the log for 'dirid'. first_offset and
2840 * last_offset tell us which parts of the key space the log should
2841 * be considered authoritative for.
2843 static noinline
int insert_dir_log_key(struct btrfs_trans_handle
*trans
,
2844 struct btrfs_root
*log
,
2845 struct btrfs_path
*path
,
2846 int key_type
, u64 dirid
,
2847 u64 first_offset
, u64 last_offset
)
2850 struct btrfs_key key
;
2851 struct btrfs_dir_log_item
*item
;
2853 key
.objectid
= dirid
;
2854 key
.offset
= first_offset
;
2855 if (key_type
== BTRFS_DIR_ITEM_KEY
)
2856 key
.type
= BTRFS_DIR_LOG_ITEM_KEY
;
2858 key
.type
= BTRFS_DIR_LOG_INDEX_KEY
;
2859 ret
= btrfs_insert_empty_item(trans
, log
, path
, &key
, sizeof(*item
));
2863 item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
2864 struct btrfs_dir_log_item
);
2865 btrfs_set_dir_log_end(path
->nodes
[0], item
, last_offset
);
2866 btrfs_mark_buffer_dirty(path
->nodes
[0]);
2867 btrfs_release_path(path
);
2872 * log all the items included in the current transaction for a given
2873 * directory. This also creates the range items in the log tree required
2874 * to replay anything deleted before the fsync
2876 static noinline
int log_dir_items(struct btrfs_trans_handle
*trans
,
2877 struct btrfs_root
*root
, struct inode
*inode
,
2878 struct btrfs_path
*path
,
2879 struct btrfs_path
*dst_path
, int key_type
,
2880 u64 min_offset
, u64
*last_offset_ret
)
2882 struct btrfs_key min_key
;
2883 struct btrfs_root
*log
= root
->log_root
;
2884 struct extent_buffer
*src
;
2889 u64 first_offset
= min_offset
;
2890 u64 last_offset
= (u64
)-1;
2891 u64 ino
= btrfs_ino(inode
);
2893 log
= root
->log_root
;
2895 min_key
.objectid
= ino
;
2896 min_key
.type
= key_type
;
2897 min_key
.offset
= min_offset
;
2899 path
->keep_locks
= 1;
2901 ret
= btrfs_search_forward(root
, &min_key
, path
, trans
->transid
);
2904 * we didn't find anything from this transaction, see if there
2905 * is anything at all
2907 if (ret
!= 0 || min_key
.objectid
!= ino
|| min_key
.type
!= key_type
) {
2908 min_key
.objectid
= ino
;
2909 min_key
.type
= key_type
;
2910 min_key
.offset
= (u64
)-1;
2911 btrfs_release_path(path
);
2912 ret
= btrfs_search_slot(NULL
, root
, &min_key
, path
, 0, 0);
2914 btrfs_release_path(path
);
2917 ret
= btrfs_previous_item(root
, path
, ino
, key_type
);
2919 /* if ret == 0 there are items for this type,
2920 * create a range to tell us the last key of this type.
2921 * otherwise, there are no items in this directory after
2922 * *min_offset, and we create a range to indicate that.
2925 struct btrfs_key tmp
;
2926 btrfs_item_key_to_cpu(path
->nodes
[0], &tmp
,
2928 if (key_type
== tmp
.type
)
2929 first_offset
= max(min_offset
, tmp
.offset
) + 1;
2934 /* go backward to find any previous key */
2935 ret
= btrfs_previous_item(root
, path
, ino
, key_type
);
2937 struct btrfs_key tmp
;
2938 btrfs_item_key_to_cpu(path
->nodes
[0], &tmp
, path
->slots
[0]);
2939 if (key_type
== tmp
.type
) {
2940 first_offset
= tmp
.offset
;
2941 ret
= overwrite_item(trans
, log
, dst_path
,
2942 path
->nodes
[0], path
->slots
[0],
2950 btrfs_release_path(path
);
2952 /* find the first key from this transaction again */
2953 ret
= btrfs_search_slot(NULL
, root
, &min_key
, path
, 0, 0);
2954 if (WARN_ON(ret
!= 0))
2958 * we have a block from this transaction, log every item in it
2959 * from our directory
2962 struct btrfs_key tmp
;
2963 src
= path
->nodes
[0];
2964 nritems
= btrfs_header_nritems(src
);
2965 for (i
= path
->slots
[0]; i
< nritems
; i
++) {
2966 btrfs_item_key_to_cpu(src
, &min_key
, i
);
2968 if (min_key
.objectid
!= ino
|| min_key
.type
!= key_type
)
2970 ret
= overwrite_item(trans
, log
, dst_path
, src
, i
,
2977 path
->slots
[0] = nritems
;
2980 * look ahead to the next item and see if it is also
2981 * from this directory and from this transaction
2983 ret
= btrfs_next_leaf(root
, path
);
2985 last_offset
= (u64
)-1;
2988 btrfs_item_key_to_cpu(path
->nodes
[0], &tmp
, path
->slots
[0]);
2989 if (tmp
.objectid
!= ino
|| tmp
.type
!= key_type
) {
2990 last_offset
= (u64
)-1;
2993 if (btrfs_header_generation(path
->nodes
[0]) != trans
->transid
) {
2994 ret
= overwrite_item(trans
, log
, dst_path
,
2995 path
->nodes
[0], path
->slots
[0],
3000 last_offset
= tmp
.offset
;
3005 btrfs_release_path(path
);
3006 btrfs_release_path(dst_path
);
3009 *last_offset_ret
= last_offset
;
3011 * insert the log range keys to indicate where the log
3014 ret
= insert_dir_log_key(trans
, log
, path
, key_type
,
3015 ino
, first_offset
, last_offset
);
3023 * logging directories is very similar to logging inodes, We find all the items
3024 * from the current transaction and write them to the log.
3026 * The recovery code scans the directory in the subvolume, and if it finds a
3027 * key in the range logged that is not present in the log tree, then it means
3028 * that dir entry was unlinked during the transaction.
3030 * In order for that scan to work, we must include one key smaller than
3031 * the smallest logged by this transaction and one key larger than the largest
3032 * key logged by this transaction.
3034 static noinline
int log_directory_changes(struct btrfs_trans_handle
*trans
,
3035 struct btrfs_root
*root
, struct inode
*inode
,
3036 struct btrfs_path
*path
,
3037 struct btrfs_path
*dst_path
)
3042 int key_type
= BTRFS_DIR_ITEM_KEY
;
3048 ret
= log_dir_items(trans
, root
, inode
, path
,
3049 dst_path
, key_type
, min_key
,
3053 if (max_key
== (u64
)-1)
3055 min_key
= max_key
+ 1;
3058 if (key_type
== BTRFS_DIR_ITEM_KEY
) {
3059 key_type
= BTRFS_DIR_INDEX_KEY
;
3066 * a helper function to drop items from the log before we relog an
3067 * inode. max_key_type indicates the highest item type to remove.
3068 * This cannot be run for file data extents because it does not
3069 * free the extents they point to.
3071 static int drop_objectid_items(struct btrfs_trans_handle
*trans
,
3072 struct btrfs_root
*log
,
3073 struct btrfs_path
*path
,
3074 u64 objectid
, int max_key_type
)
3077 struct btrfs_key key
;
3078 struct btrfs_key found_key
;
3081 key
.objectid
= objectid
;
3082 key
.type
= max_key_type
;
3083 key
.offset
= (u64
)-1;
3086 ret
= btrfs_search_slot(trans
, log
, &key
, path
, -1, 1);
3087 BUG_ON(ret
== 0); /* Logic error */
3091 if (path
->slots
[0] == 0)
3095 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
3098 if (found_key
.objectid
!= objectid
)
3101 found_key
.offset
= 0;
3103 ret
= btrfs_bin_search(path
->nodes
[0], &found_key
, 0,
3106 ret
= btrfs_del_items(trans
, log
, path
, start_slot
,
3107 path
->slots
[0] - start_slot
+ 1);
3109 * If start slot isn't 0 then we don't need to re-search, we've
3110 * found the last guy with the objectid in this tree.
3112 if (ret
|| start_slot
!= 0)
3114 btrfs_release_path(path
);
3116 btrfs_release_path(path
);
3122 static void fill_inode_item(struct btrfs_trans_handle
*trans
,
3123 struct extent_buffer
*leaf
,
3124 struct btrfs_inode_item
*item
,
3125 struct inode
*inode
, int log_inode_only
)
3127 struct btrfs_map_token token
;
3129 btrfs_init_map_token(&token
);
3131 if (log_inode_only
) {
3132 /* set the generation to zero so the recover code
3133 * can tell the difference between an logging
3134 * just to say 'this inode exists' and a logging
3135 * to say 'update this inode with these values'
3137 btrfs_set_token_inode_generation(leaf
, item
, 0, &token
);
3138 btrfs_set_token_inode_size(leaf
, item
, 0, &token
);
3140 btrfs_set_token_inode_generation(leaf
, item
,
3141 BTRFS_I(inode
)->generation
,
3143 btrfs_set_token_inode_size(leaf
, item
, inode
->i_size
, &token
);
3146 btrfs_set_token_inode_uid(leaf
, item
, i_uid_read(inode
), &token
);
3147 btrfs_set_token_inode_gid(leaf
, item
, i_gid_read(inode
), &token
);
3148 btrfs_set_token_inode_mode(leaf
, item
, inode
->i_mode
, &token
);
3149 btrfs_set_token_inode_nlink(leaf
, item
, inode
->i_nlink
, &token
);
3151 btrfs_set_token_timespec_sec(leaf
, btrfs_inode_atime(item
),
3152 inode
->i_atime
.tv_sec
, &token
);
3153 btrfs_set_token_timespec_nsec(leaf
, btrfs_inode_atime(item
),
3154 inode
->i_atime
.tv_nsec
, &token
);
3156 btrfs_set_token_timespec_sec(leaf
, btrfs_inode_mtime(item
),
3157 inode
->i_mtime
.tv_sec
, &token
);
3158 btrfs_set_token_timespec_nsec(leaf
, btrfs_inode_mtime(item
),
3159 inode
->i_mtime
.tv_nsec
, &token
);
3161 btrfs_set_token_timespec_sec(leaf
, btrfs_inode_ctime(item
),
3162 inode
->i_ctime
.tv_sec
, &token
);
3163 btrfs_set_token_timespec_nsec(leaf
, btrfs_inode_ctime(item
),
3164 inode
->i_ctime
.tv_nsec
, &token
);
3166 btrfs_set_token_inode_nbytes(leaf
, item
, inode_get_bytes(inode
),
3169 btrfs_set_token_inode_sequence(leaf
, item
, inode
->i_version
, &token
);
3170 btrfs_set_token_inode_transid(leaf
, item
, trans
->transid
, &token
);
3171 btrfs_set_token_inode_rdev(leaf
, item
, inode
->i_rdev
, &token
);
3172 btrfs_set_token_inode_flags(leaf
, item
, BTRFS_I(inode
)->flags
, &token
);
3173 btrfs_set_token_inode_block_group(leaf
, item
, 0, &token
);
3176 static int log_inode_item(struct btrfs_trans_handle
*trans
,
3177 struct btrfs_root
*log
, struct btrfs_path
*path
,
3178 struct inode
*inode
)
3180 struct btrfs_inode_item
*inode_item
;
3183 ret
= btrfs_insert_empty_item(trans
, log
, path
,
3184 &BTRFS_I(inode
)->location
,
3185 sizeof(*inode_item
));
3186 if (ret
&& ret
!= -EEXIST
)
3188 inode_item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
3189 struct btrfs_inode_item
);
3190 fill_inode_item(trans
, path
->nodes
[0], inode_item
, inode
, 0);
3191 btrfs_release_path(path
);
3195 static noinline
int copy_items(struct btrfs_trans_handle
*trans
,
3196 struct inode
*inode
,
3197 struct btrfs_path
*dst_path
,
3198 struct btrfs_path
*src_path
, u64
*last_extent
,
3199 int start_slot
, int nr
, int inode_only
)
3201 unsigned long src_offset
;
3202 unsigned long dst_offset
;
3203 struct btrfs_root
*log
= BTRFS_I(inode
)->root
->log_root
;
3204 struct btrfs_file_extent_item
*extent
;
3205 struct btrfs_inode_item
*inode_item
;
3206 struct extent_buffer
*src
= src_path
->nodes
[0];
3207 struct btrfs_key first_key
, last_key
, key
;
3209 struct btrfs_key
*ins_keys
;
3213 struct list_head ordered_sums
;
3214 int skip_csum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
3215 bool has_extents
= false;
3216 bool need_find_last_extent
= (*last_extent
== 0);
3219 INIT_LIST_HEAD(&ordered_sums
);
3221 ins_data
= kmalloc(nr
* sizeof(struct btrfs_key
) +
3222 nr
* sizeof(u32
), GFP_NOFS
);
3226 first_key
.objectid
= (u64
)-1;
3228 ins_sizes
= (u32
*)ins_data
;
3229 ins_keys
= (struct btrfs_key
*)(ins_data
+ nr
* sizeof(u32
));
3231 for (i
= 0; i
< nr
; i
++) {
3232 ins_sizes
[i
] = btrfs_item_size_nr(src
, i
+ start_slot
);
3233 btrfs_item_key_to_cpu(src
, ins_keys
+ i
, i
+ start_slot
);
3235 ret
= btrfs_insert_empty_items(trans
, log
, dst_path
,
3236 ins_keys
, ins_sizes
, nr
);
3242 for (i
= 0; i
< nr
; i
++, dst_path
->slots
[0]++) {
3243 dst_offset
= btrfs_item_ptr_offset(dst_path
->nodes
[0],
3244 dst_path
->slots
[0]);
3246 src_offset
= btrfs_item_ptr_offset(src
, start_slot
+ i
);
3248 if ((i
== (nr
- 1)))
3249 last_key
= ins_keys
[i
];
3251 if (ins_keys
[i
].type
== BTRFS_INODE_ITEM_KEY
) {
3252 inode_item
= btrfs_item_ptr(dst_path
->nodes
[0],
3254 struct btrfs_inode_item
);
3255 fill_inode_item(trans
, dst_path
->nodes
[0], inode_item
,
3256 inode
, inode_only
== LOG_INODE_EXISTS
);
3258 copy_extent_buffer(dst_path
->nodes
[0], src
, dst_offset
,
3259 src_offset
, ins_sizes
[i
]);
3263 * We set need_find_last_extent here in case we know we were
3264 * processing other items and then walk into the first extent in
3265 * the inode. If we don't hit an extent then nothing changes,
3266 * we'll do the last search the next time around.
3268 if (ins_keys
[i
].type
== BTRFS_EXTENT_DATA_KEY
) {
3270 if (need_find_last_extent
&&
3271 first_key
.objectid
== (u64
)-1)
3272 first_key
= ins_keys
[i
];
3274 need_find_last_extent
= false;
3277 /* take a reference on file data extents so that truncates
3278 * or deletes of this inode don't have to relog the inode
3281 if (btrfs_key_type(ins_keys
+ i
) == BTRFS_EXTENT_DATA_KEY
&&
3284 extent
= btrfs_item_ptr(src
, start_slot
+ i
,
3285 struct btrfs_file_extent_item
);
3287 if (btrfs_file_extent_generation(src
, extent
) < trans
->transid
)
3290 found_type
= btrfs_file_extent_type(src
, extent
);
3291 if (found_type
== BTRFS_FILE_EXTENT_REG
) {
3293 ds
= btrfs_file_extent_disk_bytenr(src
,
3295 /* ds == 0 is a hole */
3299 dl
= btrfs_file_extent_disk_num_bytes(src
,
3301 cs
= btrfs_file_extent_offset(src
, extent
);
3302 cl
= btrfs_file_extent_num_bytes(src
,
3304 if (btrfs_file_extent_compression(src
,
3310 ret
= btrfs_lookup_csums_range(
3311 log
->fs_info
->csum_root
,
3312 ds
+ cs
, ds
+ cs
+ cl
- 1,
3315 btrfs_release_path(dst_path
);
3323 btrfs_mark_buffer_dirty(dst_path
->nodes
[0]);
3324 btrfs_release_path(dst_path
);
3328 * we have to do this after the loop above to avoid changing the
3329 * log tree while trying to change the log tree.
3332 while (!list_empty(&ordered_sums
)) {
3333 struct btrfs_ordered_sum
*sums
= list_entry(ordered_sums
.next
,
3334 struct btrfs_ordered_sum
,
3337 ret
= btrfs_csum_file_blocks(trans
, log
, sums
);
3338 list_del(&sums
->list
);
3346 * Because we use btrfs_search_forward we could skip leaves that were
3347 * not modified and then assume *last_extent is valid when it really
3348 * isn't. So back up to the previous leaf and read the end of the last
3349 * extent before we go and fill in holes.
3351 if (need_find_last_extent
) {
3354 ret
= btrfs_prev_leaf(BTRFS_I(inode
)->root
, src_path
);
3359 if (src_path
->slots
[0])
3360 src_path
->slots
[0]--;
3361 src
= src_path
->nodes
[0];
3362 btrfs_item_key_to_cpu(src
, &key
, src_path
->slots
[0]);
3363 if (key
.objectid
!= btrfs_ino(inode
) ||
3364 key
.type
!= BTRFS_EXTENT_DATA_KEY
)
3366 extent
= btrfs_item_ptr(src
, src_path
->slots
[0],
3367 struct btrfs_file_extent_item
);
3368 if (btrfs_file_extent_type(src
, extent
) ==
3369 BTRFS_FILE_EXTENT_INLINE
) {
3370 len
= btrfs_file_extent_inline_len(src
, extent
);
3371 *last_extent
= ALIGN(key
.offset
+ len
,
3374 len
= btrfs_file_extent_num_bytes(src
, extent
);
3375 *last_extent
= key
.offset
+ len
;
3379 /* So we did prev_leaf, now we need to move to the next leaf, but a few
3380 * things could have happened
3382 * 1) A merge could have happened, so we could currently be on a leaf
3383 * that holds what we were copying in the first place.
3384 * 2) A split could have happened, and now not all of the items we want
3385 * are on the same leaf.
3387 * So we need to adjust how we search for holes, we need to drop the
3388 * path and re-search for the first extent key we found, and then walk
3389 * forward until we hit the last one we copied.
3391 if (need_find_last_extent
) {
3392 /* btrfs_prev_leaf could return 1 without releasing the path */
3393 btrfs_release_path(src_path
);
3394 ret
= btrfs_search_slot(NULL
, BTRFS_I(inode
)->root
, &first_key
,
3399 src
= src_path
->nodes
[0];
3400 i
= src_path
->slots
[0];
3406 * Ok so here we need to go through and fill in any holes we may have
3407 * to make sure that holes are punched for those areas in case they had
3408 * extents previously.
3414 if (i
>= btrfs_header_nritems(src_path
->nodes
[0])) {
3415 ret
= btrfs_next_leaf(BTRFS_I(inode
)->root
, src_path
);
3419 src
= src_path
->nodes
[0];
3423 btrfs_item_key_to_cpu(src
, &key
, i
);
3424 if (!btrfs_comp_cpu_keys(&key
, &last_key
))
3426 if (key
.objectid
!= btrfs_ino(inode
) ||
3427 key
.type
!= BTRFS_EXTENT_DATA_KEY
) {
3431 extent
= btrfs_item_ptr(src
, i
, struct btrfs_file_extent_item
);
3432 if (btrfs_file_extent_type(src
, extent
) ==
3433 BTRFS_FILE_EXTENT_INLINE
) {
3434 len
= btrfs_file_extent_inline_len(src
, extent
);
3435 extent_end
= ALIGN(key
.offset
+ len
, log
->sectorsize
);
3437 len
= btrfs_file_extent_num_bytes(src
, extent
);
3438 extent_end
= key
.offset
+ len
;
3442 if (*last_extent
== key
.offset
) {
3443 *last_extent
= extent_end
;
3446 offset
= *last_extent
;
3447 len
= key
.offset
- *last_extent
;
3448 ret
= btrfs_insert_file_extent(trans
, log
, btrfs_ino(inode
),
3449 offset
, 0, 0, len
, 0, len
, 0,
3453 *last_extent
= offset
+ len
;
3456 * Need to let the callers know we dropped the path so they should
3459 if (!ret
&& need_find_last_extent
)
3464 static int extent_cmp(void *priv
, struct list_head
*a
, struct list_head
*b
)
3466 struct extent_map
*em1
, *em2
;
3468 em1
= list_entry(a
, struct extent_map
, list
);
3469 em2
= list_entry(b
, struct extent_map
, list
);
3471 if (em1
->start
< em2
->start
)
3473 else if (em1
->start
> em2
->start
)
3478 static int log_one_extent(struct btrfs_trans_handle
*trans
,
3479 struct inode
*inode
, struct btrfs_root
*root
,
3480 struct extent_map
*em
, struct btrfs_path
*path
)
3482 struct btrfs_root
*log
= root
->log_root
;
3483 struct btrfs_file_extent_item
*fi
;
3484 struct extent_buffer
*leaf
;
3485 struct btrfs_ordered_extent
*ordered
;
3486 struct list_head ordered_sums
;
3487 struct btrfs_map_token token
;
3488 struct btrfs_key key
;
3489 u64 mod_start
= em
->mod_start
;
3490 u64 mod_len
= em
->mod_len
;
3493 u64 extent_offset
= em
->start
- em
->orig_start
;
3496 int index
= log
->log_transid
% 2;
3497 bool skip_csum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
3499 ret
= __btrfs_drop_extents(trans
, log
, inode
, path
, em
->start
,
3500 em
->start
+ em
->len
, NULL
, 0);
3504 INIT_LIST_HEAD(&ordered_sums
);
3505 btrfs_init_map_token(&token
);
3506 key
.objectid
= btrfs_ino(inode
);
3507 key
.type
= BTRFS_EXTENT_DATA_KEY
;
3508 key
.offset
= em
->start
;
3510 ret
= btrfs_insert_empty_item(trans
, log
, path
, &key
, sizeof(*fi
));
3513 leaf
= path
->nodes
[0];
3514 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
3515 struct btrfs_file_extent_item
);
3517 btrfs_set_token_file_extent_generation(leaf
, fi
, em
->generation
,
3519 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
)) {
3521 btrfs_set_token_file_extent_type(leaf
, fi
,
3522 BTRFS_FILE_EXTENT_PREALLOC
,
3525 btrfs_set_token_file_extent_type(leaf
, fi
,
3526 BTRFS_FILE_EXTENT_REG
,
3528 if (em
->block_start
== EXTENT_MAP_HOLE
)
3532 block_len
= max(em
->block_len
, em
->orig_block_len
);
3533 if (em
->compress_type
!= BTRFS_COMPRESS_NONE
) {
3534 btrfs_set_token_file_extent_disk_bytenr(leaf
, fi
,
3537 btrfs_set_token_file_extent_disk_num_bytes(leaf
, fi
, block_len
,
3539 } else if (em
->block_start
< EXTENT_MAP_LAST_BYTE
) {
3540 btrfs_set_token_file_extent_disk_bytenr(leaf
, fi
,
3542 extent_offset
, &token
);
3543 btrfs_set_token_file_extent_disk_num_bytes(leaf
, fi
, block_len
,
3546 btrfs_set_token_file_extent_disk_bytenr(leaf
, fi
, 0, &token
);
3547 btrfs_set_token_file_extent_disk_num_bytes(leaf
, fi
, 0,
3551 btrfs_set_token_file_extent_offset(leaf
, fi
,
3552 em
->start
- em
->orig_start
,
3554 btrfs_set_token_file_extent_num_bytes(leaf
, fi
, em
->len
, &token
);
3555 btrfs_set_token_file_extent_ram_bytes(leaf
, fi
, em
->ram_bytes
, &token
);
3556 btrfs_set_token_file_extent_compression(leaf
, fi
, em
->compress_type
,
3558 btrfs_set_token_file_extent_encryption(leaf
, fi
, 0, &token
);
3559 btrfs_set_token_file_extent_other_encoding(leaf
, fi
, 0, &token
);
3560 btrfs_mark_buffer_dirty(leaf
);
3562 btrfs_release_path(path
);
3571 * First check and see if our csums are on our outstanding ordered
3575 spin_lock_irq(&log
->log_extents_lock
[index
]);
3576 list_for_each_entry(ordered
, &log
->logged_list
[index
], log_list
) {
3577 struct btrfs_ordered_sum
*sum
;
3582 if (ordered
->inode
!= inode
)
3585 if (ordered
->file_offset
+ ordered
->len
<= mod_start
||
3586 mod_start
+ mod_len
<= ordered
->file_offset
)
3590 * We are going to copy all the csums on this ordered extent, so
3591 * go ahead and adjust mod_start and mod_len in case this
3592 * ordered extent has already been logged.
3594 if (ordered
->file_offset
> mod_start
) {
3595 if (ordered
->file_offset
+ ordered
->len
>=
3596 mod_start
+ mod_len
)
3597 mod_len
= ordered
->file_offset
- mod_start
;
3599 * If we have this case
3601 * |--------- logged extent ---------|
3602 * |----- ordered extent ----|
3604 * Just don't mess with mod_start and mod_len, we'll
3605 * just end up logging more csums than we need and it
3609 if (ordered
->file_offset
+ ordered
->len
<
3610 mod_start
+ mod_len
) {
3611 mod_len
= (mod_start
+ mod_len
) -
3612 (ordered
->file_offset
+ ordered
->len
);
3613 mod_start
= ordered
->file_offset
+
3621 * To keep us from looping for the above case of an ordered
3622 * extent that falls inside of the logged extent.
3624 if (test_and_set_bit(BTRFS_ORDERED_LOGGED_CSUM
,
3627 atomic_inc(&ordered
->refs
);
3628 spin_unlock_irq(&log
->log_extents_lock
[index
]);
3630 * we've dropped the lock, we must either break or
3631 * start over after this.
3634 wait_event(ordered
->wait
, ordered
->csum_bytes_left
== 0);
3636 list_for_each_entry(sum
, &ordered
->list
, list
) {
3637 ret
= btrfs_csum_file_blocks(trans
, log
, sum
);
3639 btrfs_put_ordered_extent(ordered
);
3643 btrfs_put_ordered_extent(ordered
);
3647 spin_unlock_irq(&log
->log_extents_lock
[index
]);
3650 if (!mod_len
|| ret
)
3653 if (em
->compress_type
) {
3655 csum_len
= block_len
;
3657 csum_offset
= mod_start
- em
->start
;
3661 /* block start is already adjusted for the file extent offset. */
3662 ret
= btrfs_lookup_csums_range(log
->fs_info
->csum_root
,
3663 em
->block_start
+ csum_offset
,
3664 em
->block_start
+ csum_offset
+
3665 csum_len
- 1, &ordered_sums
, 0);
3669 while (!list_empty(&ordered_sums
)) {
3670 struct btrfs_ordered_sum
*sums
= list_entry(ordered_sums
.next
,
3671 struct btrfs_ordered_sum
,
3674 ret
= btrfs_csum_file_blocks(trans
, log
, sums
);
3675 list_del(&sums
->list
);
3682 static int btrfs_log_changed_extents(struct btrfs_trans_handle
*trans
,
3683 struct btrfs_root
*root
,
3684 struct inode
*inode
,
3685 struct btrfs_path
*path
)
3687 struct extent_map
*em
, *n
;
3688 struct list_head extents
;
3689 struct extent_map_tree
*tree
= &BTRFS_I(inode
)->extent_tree
;
3694 INIT_LIST_HEAD(&extents
);
3696 write_lock(&tree
->lock
);
3697 test_gen
= root
->fs_info
->last_trans_committed
;
3699 list_for_each_entry_safe(em
, n
, &tree
->modified_extents
, list
) {
3700 list_del_init(&em
->list
);
3703 * Just an arbitrary number, this can be really CPU intensive
3704 * once we start getting a lot of extents, and really once we
3705 * have a bunch of extents we just want to commit since it will
3708 if (++num
> 32768) {
3709 list_del_init(&tree
->modified_extents
);
3714 if (em
->generation
<= test_gen
)
3716 /* Need a ref to keep it from getting evicted from cache */
3717 atomic_inc(&em
->refs
);
3718 set_bit(EXTENT_FLAG_LOGGING
, &em
->flags
);
3719 list_add_tail(&em
->list
, &extents
);
3723 list_sort(NULL
, &extents
, extent_cmp
);
3726 while (!list_empty(&extents
)) {
3727 em
= list_entry(extents
.next
, struct extent_map
, list
);
3729 list_del_init(&em
->list
);
3732 * If we had an error we just need to delete everybody from our
3736 clear_em_logging(tree
, em
);
3737 free_extent_map(em
);
3741 write_unlock(&tree
->lock
);
3743 ret
= log_one_extent(trans
, inode
, root
, em
, path
);
3744 write_lock(&tree
->lock
);
3745 clear_em_logging(tree
, em
);
3746 free_extent_map(em
);
3748 WARN_ON(!list_empty(&extents
));
3749 write_unlock(&tree
->lock
);
3751 btrfs_release_path(path
);
3755 /* log a single inode in the tree log.
3756 * At least one parent directory for this inode must exist in the tree
3757 * or be logged already.
3759 * Any items from this inode changed by the current transaction are copied
3760 * to the log tree. An extra reference is taken on any extents in this
3761 * file, allowing us to avoid a whole pile of corner cases around logging
3762 * blocks that have been removed from the tree.
3764 * See LOG_INODE_ALL and related defines for a description of what inode_only
3767 * This handles both files and directories.
3769 static int btrfs_log_inode(struct btrfs_trans_handle
*trans
,
3770 struct btrfs_root
*root
, struct inode
*inode
,
3773 struct btrfs_path
*path
;
3774 struct btrfs_path
*dst_path
;
3775 struct btrfs_key min_key
;
3776 struct btrfs_key max_key
;
3777 struct btrfs_root
*log
= root
->log_root
;
3778 struct extent_buffer
*src
= NULL
;
3779 u64 last_extent
= 0;
3783 int ins_start_slot
= 0;
3785 bool fast_search
= false;
3786 u64 ino
= btrfs_ino(inode
);
3788 path
= btrfs_alloc_path();
3791 dst_path
= btrfs_alloc_path();
3793 btrfs_free_path(path
);
3797 min_key
.objectid
= ino
;
3798 min_key
.type
= BTRFS_INODE_ITEM_KEY
;
3801 max_key
.objectid
= ino
;
3804 /* today the code can only do partial logging of directories */
3805 if (S_ISDIR(inode
->i_mode
) ||
3806 (!test_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
3807 &BTRFS_I(inode
)->runtime_flags
) &&
3808 inode_only
== LOG_INODE_EXISTS
))
3809 max_key
.type
= BTRFS_XATTR_ITEM_KEY
;
3811 max_key
.type
= (u8
)-1;
3812 max_key
.offset
= (u64
)-1;
3814 /* Only run delayed items if we are a dir or a new file */
3815 if (S_ISDIR(inode
->i_mode
) ||
3816 BTRFS_I(inode
)->generation
> root
->fs_info
->last_trans_committed
) {
3817 ret
= btrfs_commit_inode_delayed_items(trans
, inode
);
3819 btrfs_free_path(path
);
3820 btrfs_free_path(dst_path
);
3825 mutex_lock(&BTRFS_I(inode
)->log_mutex
);
3827 btrfs_get_logged_extents(log
, inode
);
3830 * a brute force approach to making sure we get the most uptodate
3831 * copies of everything.
3833 if (S_ISDIR(inode
->i_mode
)) {
3834 int max_key_type
= BTRFS_DIR_LOG_INDEX_KEY
;
3836 if (inode_only
== LOG_INODE_EXISTS
)
3837 max_key_type
= BTRFS_XATTR_ITEM_KEY
;
3838 ret
= drop_objectid_items(trans
, log
, path
, ino
, max_key_type
);
3840 if (test_and_clear_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
3841 &BTRFS_I(inode
)->runtime_flags
)) {
3842 clear_bit(BTRFS_INODE_COPY_EVERYTHING
,
3843 &BTRFS_I(inode
)->runtime_flags
);
3844 ret
= btrfs_truncate_inode_items(trans
, log
,
3846 } else if (test_and_clear_bit(BTRFS_INODE_COPY_EVERYTHING
,
3847 &BTRFS_I(inode
)->runtime_flags
) ||
3848 inode_only
== LOG_INODE_EXISTS
) {
3849 if (inode_only
== LOG_INODE_ALL
)
3851 max_key
.type
= BTRFS_XATTR_ITEM_KEY
;
3852 ret
= drop_objectid_items(trans
, log
, path
, ino
,
3855 if (inode_only
== LOG_INODE_ALL
)
3857 ret
= log_inode_item(trans
, log
, dst_path
, inode
);
3870 path
->keep_locks
= 1;
3874 ret
= btrfs_search_forward(root
, &min_key
,
3875 path
, trans
->transid
);
3879 /* note, ins_nr might be > 0 here, cleanup outside the loop */
3880 if (min_key
.objectid
!= ino
)
3882 if (min_key
.type
> max_key
.type
)
3885 src
= path
->nodes
[0];
3886 if (ins_nr
&& ins_start_slot
+ ins_nr
== path
->slots
[0]) {
3889 } else if (!ins_nr
) {
3890 ins_start_slot
= path
->slots
[0];
3895 ret
= copy_items(trans
, inode
, dst_path
, path
, &last_extent
,
3896 ins_start_slot
, ins_nr
, inode_only
);
3902 btrfs_release_path(path
);
3906 ins_start_slot
= path
->slots
[0];
3909 nritems
= btrfs_header_nritems(path
->nodes
[0]);
3911 if (path
->slots
[0] < nritems
) {
3912 btrfs_item_key_to_cpu(path
->nodes
[0], &min_key
,
3917 ret
= copy_items(trans
, inode
, dst_path
, path
,
3918 &last_extent
, ins_start_slot
,
3919 ins_nr
, inode_only
);
3927 btrfs_release_path(path
);
3929 if (min_key
.offset
< (u64
)-1) {
3931 } else if (min_key
.type
< max_key
.type
) {
3939 ret
= copy_items(trans
, inode
, dst_path
, path
, &last_extent
,
3940 ins_start_slot
, ins_nr
, inode_only
);
3950 btrfs_release_path(path
);
3951 btrfs_release_path(dst_path
);
3953 ret
= btrfs_log_changed_extents(trans
, root
, inode
, dst_path
);
3958 } else if (inode_only
== LOG_INODE_ALL
) {
3959 struct extent_map_tree
*tree
= &BTRFS_I(inode
)->extent_tree
;
3960 struct extent_map
*em
, *n
;
3962 write_lock(&tree
->lock
);
3963 list_for_each_entry_safe(em
, n
, &tree
->modified_extents
, list
)
3964 list_del_init(&em
->list
);
3965 write_unlock(&tree
->lock
);
3968 if (inode_only
== LOG_INODE_ALL
&& S_ISDIR(inode
->i_mode
)) {
3969 ret
= log_directory_changes(trans
, root
, inode
, path
, dst_path
);
3975 BTRFS_I(inode
)->logged_trans
= trans
->transid
;
3976 BTRFS_I(inode
)->last_log_commit
= BTRFS_I(inode
)->last_sub_trans
;
3979 btrfs_free_logged_extents(log
, log
->log_transid
);
3980 mutex_unlock(&BTRFS_I(inode
)->log_mutex
);
3982 btrfs_free_path(path
);
3983 btrfs_free_path(dst_path
);
3988 * follow the dentry parent pointers up the chain and see if any
3989 * of the directories in it require a full commit before they can
3990 * be logged. Returns zero if nothing special needs to be done or 1 if
3991 * a full commit is required.
3993 static noinline
int check_parent_dirs_for_sync(struct btrfs_trans_handle
*trans
,
3994 struct inode
*inode
,
3995 struct dentry
*parent
,
3996 struct super_block
*sb
,
4000 struct btrfs_root
*root
;
4001 struct dentry
*old_parent
= NULL
;
4002 struct inode
*orig_inode
= inode
;
4005 * for regular files, if its inode is already on disk, we don't
4006 * have to worry about the parents at all. This is because
4007 * we can use the last_unlink_trans field to record renames
4008 * and other fun in this file.
4010 if (S_ISREG(inode
->i_mode
) &&
4011 BTRFS_I(inode
)->generation
<= last_committed
&&
4012 BTRFS_I(inode
)->last_unlink_trans
<= last_committed
)
4015 if (!S_ISDIR(inode
->i_mode
)) {
4016 if (!parent
|| !parent
->d_inode
|| sb
!= parent
->d_inode
->i_sb
)
4018 inode
= parent
->d_inode
;
4023 * If we are logging a directory then we start with our inode,
4024 * not our parents inode, so we need to skipp setting the
4025 * logged_trans so that further down in the log code we don't
4026 * think this inode has already been logged.
4028 if (inode
!= orig_inode
)
4029 BTRFS_I(inode
)->logged_trans
= trans
->transid
;
4032 if (BTRFS_I(inode
)->last_unlink_trans
> last_committed
) {
4033 root
= BTRFS_I(inode
)->root
;
4036 * make sure any commits to the log are forced
4037 * to be full commits
4039 root
->fs_info
->last_trans_log_full_commit
=
4045 if (!parent
|| !parent
->d_inode
|| sb
!= parent
->d_inode
->i_sb
)
4048 if (IS_ROOT(parent
))
4051 parent
= dget_parent(parent
);
4053 old_parent
= parent
;
4054 inode
= parent
->d_inode
;
4063 * helper function around btrfs_log_inode to make sure newly created
4064 * parent directories also end up in the log. A minimal inode and backref
4065 * only logging is done of any parent directories that are older than
4066 * the last committed transaction
4068 static int btrfs_log_inode_parent(struct btrfs_trans_handle
*trans
,
4069 struct btrfs_root
*root
, struct inode
*inode
,
4070 struct dentry
*parent
, int exists_only
)
4072 int inode_only
= exists_only
? LOG_INODE_EXISTS
: LOG_INODE_ALL
;
4073 struct super_block
*sb
;
4074 struct dentry
*old_parent
= NULL
;
4076 u64 last_committed
= root
->fs_info
->last_trans_committed
;
4080 if (btrfs_test_opt(root
, NOTREELOG
)) {
4085 if (root
->fs_info
->last_trans_log_full_commit
>
4086 root
->fs_info
->last_trans_committed
) {
4091 if (root
!= BTRFS_I(inode
)->root
||
4092 btrfs_root_refs(&root
->root_item
) == 0) {
4097 ret
= check_parent_dirs_for_sync(trans
, inode
, parent
,
4098 sb
, last_committed
);
4102 if (btrfs_inode_in_log(inode
, trans
->transid
)) {
4103 ret
= BTRFS_NO_LOG_SYNC
;
4107 ret
= start_log_trans(trans
, root
);
4111 ret
= btrfs_log_inode(trans
, root
, inode
, inode_only
);
4116 * for regular files, if its inode is already on disk, we don't
4117 * have to worry about the parents at all. This is because
4118 * we can use the last_unlink_trans field to record renames
4119 * and other fun in this file.
4121 if (S_ISREG(inode
->i_mode
) &&
4122 BTRFS_I(inode
)->generation
<= last_committed
&&
4123 BTRFS_I(inode
)->last_unlink_trans
<= last_committed
) {
4128 inode_only
= LOG_INODE_EXISTS
;
4130 if (!parent
|| !parent
->d_inode
|| sb
!= parent
->d_inode
->i_sb
)
4133 inode
= parent
->d_inode
;
4134 if (root
!= BTRFS_I(inode
)->root
)
4137 if (BTRFS_I(inode
)->generation
>
4138 root
->fs_info
->last_trans_committed
) {
4139 ret
= btrfs_log_inode(trans
, root
, inode
, inode_only
);
4143 if (IS_ROOT(parent
))
4146 parent
= dget_parent(parent
);
4148 old_parent
= parent
;
4154 root
->fs_info
->last_trans_log_full_commit
= trans
->transid
;
4157 btrfs_end_log_trans(root
);
4163 * it is not safe to log dentry if the chunk root has added new
4164 * chunks. This returns 0 if the dentry was logged, and 1 otherwise.
4165 * If this returns 1, you must commit the transaction to safely get your
4168 int btrfs_log_dentry_safe(struct btrfs_trans_handle
*trans
,
4169 struct btrfs_root
*root
, struct dentry
*dentry
)
4171 struct dentry
*parent
= dget_parent(dentry
);
4174 ret
= btrfs_log_inode_parent(trans
, root
, dentry
->d_inode
, parent
, 0);
4181 * should be called during mount to recover any replay any log trees
4184 int btrfs_recover_log_trees(struct btrfs_root
*log_root_tree
)
4187 struct btrfs_path
*path
;
4188 struct btrfs_trans_handle
*trans
;
4189 struct btrfs_key key
;
4190 struct btrfs_key found_key
;
4191 struct btrfs_key tmp_key
;
4192 struct btrfs_root
*log
;
4193 struct btrfs_fs_info
*fs_info
= log_root_tree
->fs_info
;
4194 struct walk_control wc
= {
4195 .process_func
= process_one_buffer
,
4199 path
= btrfs_alloc_path();
4203 fs_info
->log_root_recovering
= 1;
4205 trans
= btrfs_start_transaction(fs_info
->tree_root
, 0);
4206 if (IS_ERR(trans
)) {
4207 ret
= PTR_ERR(trans
);
4214 ret
= walk_log_tree(trans
, log_root_tree
, &wc
);
4216 btrfs_error(fs_info
, ret
, "Failed to pin buffers while "
4217 "recovering log root tree.");
4222 key
.objectid
= BTRFS_TREE_LOG_OBJECTID
;
4223 key
.offset
= (u64
)-1;
4224 btrfs_set_key_type(&key
, BTRFS_ROOT_ITEM_KEY
);
4227 ret
= btrfs_search_slot(NULL
, log_root_tree
, &key
, path
, 0, 0);
4230 btrfs_error(fs_info
, ret
,
4231 "Couldn't find tree log root.");
4235 if (path
->slots
[0] == 0)
4239 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
4241 btrfs_release_path(path
);
4242 if (found_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
)
4245 log
= btrfs_read_fs_root(log_root_tree
, &found_key
);
4248 btrfs_error(fs_info
, ret
,
4249 "Couldn't read tree log root.");
4253 tmp_key
.objectid
= found_key
.offset
;
4254 tmp_key
.type
= BTRFS_ROOT_ITEM_KEY
;
4255 tmp_key
.offset
= (u64
)-1;
4257 wc
.replay_dest
= btrfs_read_fs_root_no_name(fs_info
, &tmp_key
);
4258 if (IS_ERR(wc
.replay_dest
)) {
4259 ret
= PTR_ERR(wc
.replay_dest
);
4260 free_extent_buffer(log
->node
);
4261 free_extent_buffer(log
->commit_root
);
4263 btrfs_error(fs_info
, ret
, "Couldn't read target root "
4264 "for tree log recovery.");
4268 wc
.replay_dest
->log_root
= log
;
4269 btrfs_record_root_in_trans(trans
, wc
.replay_dest
);
4270 ret
= walk_log_tree(trans
, log
, &wc
);
4272 if (!ret
&& wc
.stage
== LOG_WALK_REPLAY_ALL
) {
4273 ret
= fixup_inode_link_counts(trans
, wc
.replay_dest
,
4277 key
.offset
= found_key
.offset
- 1;
4278 wc
.replay_dest
->log_root
= NULL
;
4279 free_extent_buffer(log
->node
);
4280 free_extent_buffer(log
->commit_root
);
4286 if (found_key
.offset
== 0)
4289 btrfs_release_path(path
);
4291 /* step one is to pin it all, step two is to replay just inodes */
4294 wc
.process_func
= replay_one_buffer
;
4295 wc
.stage
= LOG_WALK_REPLAY_INODES
;
4298 /* step three is to replay everything */
4299 if (wc
.stage
< LOG_WALK_REPLAY_ALL
) {
4304 btrfs_free_path(path
);
4306 /* step 4: commit the transaction, which also unpins the blocks */
4307 ret
= btrfs_commit_transaction(trans
, fs_info
->tree_root
);
4311 free_extent_buffer(log_root_tree
->node
);
4312 log_root_tree
->log_root
= NULL
;
4313 fs_info
->log_root_recovering
= 0;
4314 kfree(log_root_tree
);
4319 btrfs_end_transaction(wc
.trans
, fs_info
->tree_root
);
4320 btrfs_free_path(path
);
4325 * there are some corner cases where we want to force a full
4326 * commit instead of allowing a directory to be logged.
4328 * They revolve around files there were unlinked from the directory, and
4329 * this function updates the parent directory so that a full commit is
4330 * properly done if it is fsync'd later after the unlinks are done.
4332 void btrfs_record_unlink_dir(struct btrfs_trans_handle
*trans
,
4333 struct inode
*dir
, struct inode
*inode
,
4337 * when we're logging a file, if it hasn't been renamed
4338 * or unlinked, and its inode is fully committed on disk,
4339 * we don't have to worry about walking up the directory chain
4340 * to log its parents.
4342 * So, we use the last_unlink_trans field to put this transid
4343 * into the file. When the file is logged we check it and
4344 * don't log the parents if the file is fully on disk.
4346 if (S_ISREG(inode
->i_mode
))
4347 BTRFS_I(inode
)->last_unlink_trans
= trans
->transid
;
4350 * if this directory was already logged any new
4351 * names for this file/dir will get recorded
4354 if (BTRFS_I(dir
)->logged_trans
== trans
->transid
)
4358 * if the inode we're about to unlink was logged,
4359 * the log will be properly updated for any new names
4361 if (BTRFS_I(inode
)->logged_trans
== trans
->transid
)
4365 * when renaming files across directories, if the directory
4366 * there we're unlinking from gets fsync'd later on, there's
4367 * no way to find the destination directory later and fsync it
4368 * properly. So, we have to be conservative and force commits
4369 * so the new name gets discovered.
4374 /* we can safely do the unlink without any special recording */
4378 BTRFS_I(dir
)->last_unlink_trans
= trans
->transid
;
4382 * Call this after adding a new name for a file and it will properly
4383 * update the log to reflect the new name.
4385 * It will return zero if all goes well, and it will return 1 if a
4386 * full transaction commit is required.
4388 int btrfs_log_new_name(struct btrfs_trans_handle
*trans
,
4389 struct inode
*inode
, struct inode
*old_dir
,
4390 struct dentry
*parent
)
4392 struct btrfs_root
* root
= BTRFS_I(inode
)->root
;
4395 * this will force the logging code to walk the dentry chain
4398 if (S_ISREG(inode
->i_mode
))
4399 BTRFS_I(inode
)->last_unlink_trans
= trans
->transid
;
4402 * if this inode hasn't been logged and directory we're renaming it
4403 * from hasn't been logged, we don't need to log it
4405 if (BTRFS_I(inode
)->logged_trans
<=
4406 root
->fs_info
->last_trans_committed
&&
4407 (!old_dir
|| BTRFS_I(old_dir
)->logged_trans
<=
4408 root
->fs_info
->last_trans_committed
))
4411 return btrfs_log_inode_parent(trans
, root
, inode
, parent
, 1);