fs/btrfs/tree-log.c

64  * log. ---> check inode while renaming/linking.
68  * ---> check inode and old parent dir during rename
157 	 * First check if the log root tree was already created. If not, create
337 		struct btrfs_tree_parent_check check = {
342 		ret = btrfs_read_extent_buffer(eb, &check);
669 	 * first check to see if we already have this extent in the
908 	 * Whenever we need to check if a name exists or not, we check the
1007  * helper function to check a log tree for a named back reference in
1082 		/* check all the names in this back reference to see
1702  * record a given inode in the fixup dir so we can check its link
1704  * so the inode won't go away until we check it
2063 	/* check the next slot in the tree to see if it is a valid item */
2386 	struct btrfs_tree_parent_check check = {
2396 	ret = btrfs_read_extent_buffer(eb, &check);
2596 		struct btrfs_tree_parent_check check = { 0 };
2608 		check.transid = ptr_gen;
2609 		check.level = *level - 1;
2610 		check.has_first_key = true;
2611 		btrfs_node_key_to_cpu(cur, &check.first_key, path->slots[*level]);
2629 				ret = btrfs_read_extent_buffer(next, &check);
2644 		ret = btrfs_read_extent_buffer(next, &check);
3082 	 * check the full commit flag again
3947 			 * We check for the next key because there might have been
4795 	 * We must check if there is a prealloc extent that starts before the
5213  * When we are logging a new inode X, check if it doesn't have a reference that
5755 	 * calls. This check guarantees we can have only 1 level of recursion.
5819 		 * We did this check at add_conflicting_inode(), but here we do
7374 	 * into the file.  When the file is logged we check it and
7480 		 * NULL), check if old_dir was logged - if it was not we can return and