2 * Copyright (C) 2012 Alexander Block. 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/bsearch.h>
21 #include <linux/file.h>
22 #include <linux/sort.h>
23 #include <linux/mount.h>
24 #include <linux/xattr.h>
25 #include <linux/posix_acl_xattr.h>
26 #include <linux/radix-tree.h>
27 #include <linux/crc32c.h>
28 #include <linux/vmalloc.h>
34 #include "btrfs_inode.h"
35 #include "transaction.h"
37 static int g_verbose = 0;
39 #define verbose_printk(...) if (g_verbose) printk(__VA_ARGS__)
42 * A fs_path is a helper to dynamically build path names with unknown size.
43 * It reallocates the internal buffer on demand.
44 * It allows fast adding of path elements on the right side (normal path) and
45 * fast adding to the left side (reversed path). A reversed path can also be
46 * unreversed if needed.
64 #define FS_PATH_INLINE_SIZE \
65 (sizeof(struct fs_path) - offsetof(struct fs_path, inline_buf))
68 /* reused for each extent */
70 struct btrfs_root *root;
77 #define SEND_CTX_MAX_NAME_CACHE_SIZE 128
78 #define SEND_CTX_NAME_CACHE_CLEAN_SIZE (SEND_CTX_MAX_NAME_CACHE_SIZE * 2)
81 struct file *send_filp;
87 u64 cmd_send_size[BTRFS_SEND_C_MAX + 1];
91 struct btrfs_root *send_root;
92 struct btrfs_root *parent_root;
93 struct clone_root *clone_roots;
96 /* current state of the compare_tree call */
97 struct btrfs_path *left_path;
98 struct btrfs_path *right_path;
99 struct btrfs_key *cmp_key;
102 * infos of the currently processed inode. In case of deleted inodes,
103 * these are the values from the deleted inode.
108 int cur_inode_new_gen;
109 int cur_inode_deleted;
115 struct list_head new_refs;
116 struct list_head deleted_refs;
118 struct radix_tree_root name_cache;
119 struct list_head name_cache_list;
122 struct file *cur_inode_filp;
126 struct name_cache_entry {
127 struct list_head list;
133 int need_later_update;
138 static void fs_path_reset(struct fs_path *p)
141 p->start = p->buf + p->buf_len - 1;
151 static struct fs_path *fs_path_alloc(struct send_ctx *sctx)
155 p = kmalloc(sizeof(*p), GFP_NOFS);
160 p->buf = p->inline_buf;
161 p->buf_len = FS_PATH_INLINE_SIZE;
166 static struct fs_path *fs_path_alloc_reversed(struct send_ctx *sctx)
170 p = fs_path_alloc(sctx);
178 static void fs_path_free(struct send_ctx *sctx, struct fs_path *p)
182 if (p->buf != p->inline_buf) {
191 static int fs_path_len(struct fs_path *p)
193 return p->end - p->start;
196 static int fs_path_ensure_buf(struct fs_path *p, int len)
204 if (p->buf_len >= len)
207 path_len = p->end - p->start;
208 old_buf_len = p->buf_len;
209 len = PAGE_ALIGN(len);
211 if (p->buf == p->inline_buf) {
212 tmp_buf = kmalloc(len, GFP_NOFS);
214 tmp_buf = vmalloc(len);
219 memcpy(tmp_buf, p->buf, p->buf_len);
223 if (p->virtual_mem) {
224 tmp_buf = vmalloc(len);
227 memcpy(tmp_buf, p->buf, p->buf_len);
230 tmp_buf = krealloc(p->buf, len, GFP_NOFS);
232 tmp_buf = vmalloc(len);
235 memcpy(tmp_buf, p->buf, p->buf_len);
244 tmp_buf = p->buf + old_buf_len - path_len - 1;
245 p->end = p->buf + p->buf_len - 1;
246 p->start = p->end - path_len;
247 memmove(p->start, tmp_buf, path_len + 1);
250 p->end = p->start + path_len;
255 static int fs_path_prepare_for_add(struct fs_path *p, int name_len)
260 new_len = p->end - p->start + name_len;
261 if (p->start != p->end)
263 ret = fs_path_ensure_buf(p, new_len);
268 if (p->start != p->end)
270 p->start -= name_len;
271 p->prepared = p->start;
273 if (p->start != p->end)
275 p->prepared = p->end;
284 static int fs_path_add(struct fs_path *p, const char *name, int name_len)
288 ret = fs_path_prepare_for_add(p, name_len);
291 memcpy(p->prepared, name, name_len);
298 static int fs_path_add_path(struct fs_path *p, struct fs_path *p2)
302 ret = fs_path_prepare_for_add(p, p2->end - p2->start);
305 memcpy(p->prepared, p2->start, p2->end - p2->start);
312 static int fs_path_add_from_extent_buffer(struct fs_path *p,
313 struct extent_buffer *eb,
314 unsigned long off, int len)
318 ret = fs_path_prepare_for_add(p, len);
322 read_extent_buffer(eb, p->prepared, off, len);
330 static void fs_path_remove(struct fs_path *p)
333 while (p->start != p->end && *p->end != '/')
339 static int fs_path_copy(struct fs_path *p, struct fs_path *from)
343 p->reversed = from->reversed;
346 ret = fs_path_add_path(p, from);
352 static void fs_path_unreverse(struct fs_path *p)
361 len = p->end - p->start;
363 p->end = p->start + len;
364 memmove(p->start, tmp, len + 1);
368 static struct btrfs_path *alloc_path_for_send(void)
370 struct btrfs_path *path;
372 path = btrfs_alloc_path();
375 path->search_commit_root = 1;
376 path->skip_locking = 1;
380 static int write_buf(struct send_ctx *sctx, const void *buf, u32 len)
390 ret = vfs_write(sctx->send_filp, (char *)buf + pos, len - pos,
392 /* TODO handle that correctly */
393 /*if (ret == -ERESTARTSYS) {
412 static int tlv_put(struct send_ctx *sctx, u16 attr, const void *data, int len)
414 struct btrfs_tlv_header *hdr;
415 int total_len = sizeof(*hdr) + len;
416 int left = sctx->send_max_size - sctx->send_size;
418 if (unlikely(left < total_len))
421 hdr = (struct btrfs_tlv_header *) (sctx->send_buf + sctx->send_size);
422 hdr->tlv_type = cpu_to_le16(attr);
423 hdr->tlv_len = cpu_to_le16(len);
424 memcpy(hdr + 1, data, len);
425 sctx->send_size += total_len;
431 static int tlv_put_u8(struct send_ctx *sctx, u16 attr, u8 value)
433 return tlv_put(sctx, attr, &value, sizeof(value));
436 static int tlv_put_u16(struct send_ctx *sctx, u16 attr, u16 value)
438 __le16 tmp = cpu_to_le16(value);
439 return tlv_put(sctx, attr, &tmp, sizeof(tmp));
442 static int tlv_put_u32(struct send_ctx *sctx, u16 attr, u32 value)
444 __le32 tmp = cpu_to_le32(value);
445 return tlv_put(sctx, attr, &tmp, sizeof(tmp));
449 static int tlv_put_u64(struct send_ctx *sctx, u16 attr, u64 value)
451 __le64 tmp = cpu_to_le64(value);
452 return tlv_put(sctx, attr, &tmp, sizeof(tmp));
455 static int tlv_put_string(struct send_ctx *sctx, u16 attr,
456 const char *str, int len)
460 return tlv_put(sctx, attr, str, len);
463 static int tlv_put_uuid(struct send_ctx *sctx, u16 attr,
466 return tlv_put(sctx, attr, uuid, BTRFS_UUID_SIZE);
470 static int tlv_put_timespec(struct send_ctx *sctx, u16 attr,
473 struct btrfs_timespec bts;
474 bts.sec = cpu_to_le64(ts->tv_sec);
475 bts.nsec = cpu_to_le32(ts->tv_nsec);
476 return tlv_put(sctx, attr, &bts, sizeof(bts));
480 static int tlv_put_btrfs_timespec(struct send_ctx *sctx, u16 attr,
481 struct extent_buffer *eb,
482 struct btrfs_timespec *ts)
484 struct btrfs_timespec bts;
485 read_extent_buffer(eb, &bts, (unsigned long)ts, sizeof(bts));
486 return tlv_put(sctx, attr, &bts, sizeof(bts));
490 #define TLV_PUT(sctx, attrtype, attrlen, data) \
492 ret = tlv_put(sctx, attrtype, attrlen, data); \
494 goto tlv_put_failure; \
497 #define TLV_PUT_INT(sctx, attrtype, bits, value) \
499 ret = tlv_put_u##bits(sctx, attrtype, value); \
501 goto tlv_put_failure; \
504 #define TLV_PUT_U8(sctx, attrtype, data) TLV_PUT_INT(sctx, attrtype, 8, data)
505 #define TLV_PUT_U16(sctx, attrtype, data) TLV_PUT_INT(sctx, attrtype, 16, data)
506 #define TLV_PUT_U32(sctx, attrtype, data) TLV_PUT_INT(sctx, attrtype, 32, data)
507 #define TLV_PUT_U64(sctx, attrtype, data) TLV_PUT_INT(sctx, attrtype, 64, data)
508 #define TLV_PUT_STRING(sctx, attrtype, str, len) \
510 ret = tlv_put_string(sctx, attrtype, str, len); \
512 goto tlv_put_failure; \
514 #define TLV_PUT_PATH(sctx, attrtype, p) \
516 ret = tlv_put_string(sctx, attrtype, p->start, \
517 p->end - p->start); \
519 goto tlv_put_failure; \
521 #define TLV_PUT_UUID(sctx, attrtype, uuid) \
523 ret = tlv_put_uuid(sctx, attrtype, uuid); \
525 goto tlv_put_failure; \
527 #define TLV_PUT_TIMESPEC(sctx, attrtype, ts) \
529 ret = tlv_put_timespec(sctx, attrtype, ts); \
531 goto tlv_put_failure; \
533 #define TLV_PUT_BTRFS_TIMESPEC(sctx, attrtype, eb, ts) \
535 ret = tlv_put_btrfs_timespec(sctx, attrtype, eb, ts); \
537 goto tlv_put_failure; \
540 static int send_header(struct send_ctx *sctx)
542 struct btrfs_stream_header hdr;
544 strcpy(hdr.magic, BTRFS_SEND_STREAM_MAGIC);
545 hdr.version = cpu_to_le32(BTRFS_SEND_STREAM_VERSION);
547 return write_buf(sctx, &hdr, sizeof(hdr));
551 * For each command/item we want to send to userspace, we call this function.
553 static int begin_cmd(struct send_ctx *sctx, int cmd)
555 struct btrfs_cmd_header *hdr;
557 if (!sctx->send_buf) {
562 BUG_ON(sctx->send_size);
564 sctx->send_size += sizeof(*hdr);
565 hdr = (struct btrfs_cmd_header *)sctx->send_buf;
566 hdr->cmd = cpu_to_le16(cmd);
571 static int send_cmd(struct send_ctx *sctx)
574 struct btrfs_cmd_header *hdr;
577 hdr = (struct btrfs_cmd_header *)sctx->send_buf;
578 hdr->len = cpu_to_le32(sctx->send_size - sizeof(*hdr));
581 crc = crc32c(0, (unsigned char *)sctx->send_buf, sctx->send_size);
582 hdr->crc = cpu_to_le32(crc);
584 ret = write_buf(sctx, sctx->send_buf, sctx->send_size);
586 sctx->total_send_size += sctx->send_size;
587 sctx->cmd_send_size[le16_to_cpu(hdr->cmd)] += sctx->send_size;
594 * Sends a move instruction to user space
596 static int send_rename(struct send_ctx *sctx,
597 struct fs_path *from, struct fs_path *to)
601 verbose_printk("btrfs: send_rename %s -> %s\n", from->start, to->start);
603 ret = begin_cmd(sctx, BTRFS_SEND_C_RENAME);
607 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, from);
608 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH_TO, to);
610 ret = send_cmd(sctx);
618 * Sends a link instruction to user space
620 static int send_link(struct send_ctx *sctx,
621 struct fs_path *path, struct fs_path *lnk)
625 verbose_printk("btrfs: send_link %s -> %s\n", path->start, lnk->start);
627 ret = begin_cmd(sctx, BTRFS_SEND_C_LINK);
631 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, path);
632 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH_LINK, lnk);
634 ret = send_cmd(sctx);
642 * Sends an unlink instruction to user space
644 static int send_unlink(struct send_ctx *sctx, struct fs_path *path)
648 verbose_printk("btrfs: send_unlink %s\n", path->start);
650 ret = begin_cmd(sctx, BTRFS_SEND_C_UNLINK);
654 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, path);
656 ret = send_cmd(sctx);
664 * Sends a rmdir instruction to user space
666 static int send_rmdir(struct send_ctx *sctx, struct fs_path *path)
670 verbose_printk("btrfs: send_rmdir %s\n", path->start);
672 ret = begin_cmd(sctx, BTRFS_SEND_C_RMDIR);
676 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, path);
678 ret = send_cmd(sctx);
686 * Helper function to retrieve some fields from an inode item.
688 static int get_inode_info(struct btrfs_root *root,
689 u64 ino, u64 *size, u64 *gen,
690 u64 *mode, u64 *uid, u64 *gid,
694 struct btrfs_inode_item *ii;
695 struct btrfs_key key;
696 struct btrfs_path *path;
698 path = alloc_path_for_send();
703 key.type = BTRFS_INODE_ITEM_KEY;
705 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
713 ii = btrfs_item_ptr(path->nodes[0], path->slots[0],
714 struct btrfs_inode_item);
716 *size = btrfs_inode_size(path->nodes[0], ii);
718 *gen = btrfs_inode_generation(path->nodes[0], ii);
720 *mode = btrfs_inode_mode(path->nodes[0], ii);
722 *uid = btrfs_inode_uid(path->nodes[0], ii);
724 *gid = btrfs_inode_gid(path->nodes[0], ii);
726 *rdev = btrfs_inode_rdev(path->nodes[0], ii);
729 btrfs_free_path(path);
733 typedef int (*iterate_inode_ref_t)(int num, u64 dir, int index,
738 * Helper function to iterate the entries in ONE btrfs_inode_ref.
739 * The iterate callback may return a non zero value to stop iteration. This can
740 * be a negative value for error codes or 1 to simply stop it.
742 * path must point to the INODE_REF when called.
744 static int iterate_inode_ref(struct send_ctx *sctx,
745 struct btrfs_root *root, struct btrfs_path *path,
746 struct btrfs_key *found_key, int resolve,
747 iterate_inode_ref_t iterate, void *ctx)
749 struct extent_buffer *eb;
750 struct btrfs_item *item;
751 struct btrfs_inode_ref *iref;
752 struct btrfs_path *tmp_path;
764 p = fs_path_alloc_reversed(sctx);
768 tmp_path = alloc_path_for_send();
770 fs_path_free(sctx, p);
775 slot = path->slots[0];
776 item = btrfs_item_nr(eb, slot);
777 iref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref);
780 total = btrfs_item_size(eb, item);
783 while (cur < total) {
786 name_len = btrfs_inode_ref_name_len(eb, iref);
787 index = btrfs_inode_ref_index(eb, iref);
789 start = btrfs_iref_to_path(root, tmp_path, iref, eb,
790 found_key->offset, p->buf,
793 ret = PTR_ERR(start);
796 if (start < p->buf) {
797 /* overflow , try again with larger buffer */
798 ret = fs_path_ensure_buf(p,
799 p->buf_len + p->buf - start);
802 start = btrfs_iref_to_path(root, tmp_path, iref,
803 eb, found_key->offset, p->buf,
806 ret = PTR_ERR(start);
809 BUG_ON(start < p->buf);
813 ret = fs_path_add_from_extent_buffer(p, eb,
814 (unsigned long)(iref + 1), name_len);
820 len = sizeof(*iref) + name_len;
821 iref = (struct btrfs_inode_ref *)((char *)iref + len);
824 ret = iterate(num, found_key->offset, index, p, ctx);
832 btrfs_free_path(tmp_path);
833 fs_path_free(sctx, p);
837 typedef int (*iterate_dir_item_t)(int num, struct btrfs_key *di_key,
838 const char *name, int name_len,
839 const char *data, int data_len,
843 * Helper function to iterate the entries in ONE btrfs_dir_item.
844 * The iterate callback may return a non zero value to stop iteration. This can
845 * be a negative value for error codes or 1 to simply stop it.
847 * path must point to the dir item when called.
849 static int iterate_dir_item(struct send_ctx *sctx,
850 struct btrfs_root *root, struct btrfs_path *path,
851 struct btrfs_key *found_key,
852 iterate_dir_item_t iterate, void *ctx)
855 struct extent_buffer *eb;
856 struct btrfs_item *item;
857 struct btrfs_dir_item *di;
858 struct btrfs_path *tmp_path = NULL;
859 struct btrfs_key di_key;
874 buf = kmalloc(buf_len, GFP_NOFS);
880 tmp_path = alloc_path_for_send();
887 slot = path->slots[0];
888 item = btrfs_item_nr(eb, slot);
889 di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
892 total = btrfs_item_size(eb, item);
895 while (cur < total) {
896 name_len = btrfs_dir_name_len(eb, di);
897 data_len = btrfs_dir_data_len(eb, di);
898 type = btrfs_dir_type(eb, di);
899 btrfs_dir_item_key_to_cpu(eb, di, &di_key);
901 if (name_len + data_len > buf_len) {
902 buf_len = PAGE_ALIGN(name_len + data_len);
904 buf2 = vmalloc(buf_len);
911 buf2 = krealloc(buf, buf_len, GFP_NOFS);
913 buf2 = vmalloc(buf_len);
927 read_extent_buffer(eb, buf, (unsigned long)(di + 1),
928 name_len + data_len);
930 len = sizeof(*di) + name_len + data_len;
931 di = (struct btrfs_dir_item *)((char *)di + len);
934 ret = iterate(num, &di_key, buf, name_len, buf + name_len,
935 data_len, type, ctx);
947 btrfs_free_path(tmp_path);
955 static int __copy_first_ref(int num, u64 dir, int index,
956 struct fs_path *p, void *ctx)
959 struct fs_path *pt = ctx;
961 ret = fs_path_copy(pt, p);
965 /* we want the first only */
970 * Retrieve the first path of an inode. If an inode has more then one
971 * ref/hardlink, this is ignored.
973 static int get_inode_path(struct send_ctx *sctx, struct btrfs_root *root,
974 u64 ino, struct fs_path *path)
977 struct btrfs_key key, found_key;
978 struct btrfs_path *p;
980 p = alloc_path_for_send();
987 key.type = BTRFS_INODE_REF_KEY;
990 ret = btrfs_search_slot_for_read(root, &key, p, 1, 0);
997 btrfs_item_key_to_cpu(p->nodes[0], &found_key, p->slots[0]);
998 if (found_key.objectid != ino ||
999 found_key.type != BTRFS_INODE_REF_KEY) {
1004 ret = iterate_inode_ref(sctx, root, p, &found_key, 1,
1005 __copy_first_ref, path);
1015 struct backref_ctx {
1016 struct send_ctx *sctx;
1018 /* number of total found references */
1022 * used for clones found in send_root. clones found behind cur_objectid
1023 * and cur_offset are not considered as allowed clones.
1028 /* may be truncated in case it's the last extent in a file */
1031 /* Just to check for bugs in backref resolving */
1035 static int __clone_root_cmp_bsearch(const void *key, const void *elt)
1037 u64 root = (u64)key;
1038 struct clone_root *cr = (struct clone_root *)elt;
1040 if (root < cr->root->objectid)
1042 if (root > cr->root->objectid)
1047 static int __clone_root_cmp_sort(const void *e1, const void *e2)
1049 struct clone_root *cr1 = (struct clone_root *)e1;
1050 struct clone_root *cr2 = (struct clone_root *)e2;
1052 if (cr1->root->objectid < cr2->root->objectid)
1054 if (cr1->root->objectid > cr2->root->objectid)
1060 * Called for every backref that is found for the current extent.
1062 static int __iterate_backrefs(u64 ino, u64 offset, u64 root, void *ctx_)
1064 struct backref_ctx *bctx = ctx_;
1065 struct clone_root *found;
1069 /* First check if the root is in the list of accepted clone sources */
1070 found = bsearch((void *)root, bctx->sctx->clone_roots,
1071 bctx->sctx->clone_roots_cnt,
1072 sizeof(struct clone_root),
1073 __clone_root_cmp_bsearch);
1077 if (found->root == bctx->sctx->send_root &&
1078 ino == bctx->cur_objectid &&
1079 offset == bctx->cur_offset) {
1080 bctx->found_itself = 1;
1084 * There are inodes that have extents that lie behind it's i_size. Don't
1085 * accept clones from these extents.
1087 ret = get_inode_info(found->root, ino, &i_size, NULL, NULL, NULL, NULL,
1092 if (offset + bctx->extent_len > i_size)
1096 * Make sure we don't consider clones from send_root that are
1097 * behind the current inode/offset.
1099 if (found->root == bctx->sctx->send_root) {
1101 * TODO for the moment we don't accept clones from the inode
1102 * that is currently send. We may change this when
1103 * BTRFS_IOC_CLONE_RANGE supports cloning from and to the same
1106 if (ino >= bctx->cur_objectid)
1108 /*if (ino > ctx->cur_objectid)
1110 if (offset + ctx->extent_len > ctx->cur_offset)
1115 found->found_refs++;
1116 if (ino < found->ino) {
1118 found->offset = offset;
1119 } else if (found->ino == ino) {
1121 * same extent found more then once in the same file.
1123 if (found->offset > offset + bctx->extent_len)
1124 found->offset = offset;
1131 * path must point to the extent item when called.
1133 static int find_extent_clone(struct send_ctx *sctx,
1134 struct btrfs_path *path,
1135 u64 ino, u64 data_offset,
1137 struct clone_root **found)
1143 u64 extent_item_pos;
1144 struct btrfs_file_extent_item *fi;
1145 struct extent_buffer *eb = path->nodes[0];
1146 struct backref_ctx *backref_ctx = NULL;
1147 struct clone_root *cur_clone_root;
1148 struct btrfs_key found_key;
1149 struct btrfs_path *tmp_path;
1152 tmp_path = alloc_path_for_send();
1156 backref_ctx = kmalloc(sizeof(*backref_ctx), GFP_NOFS);
1162 if (data_offset >= ino_size) {
1164 * There may be extents that lie behind the file's size.
1165 * I at least had this in combination with snapshotting while
1166 * writing large files.
1172 fi = btrfs_item_ptr(eb, path->slots[0],
1173 struct btrfs_file_extent_item);
1174 extent_type = btrfs_file_extent_type(eb, fi);
1175 if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1180 num_bytes = btrfs_file_extent_num_bytes(eb, fi);
1181 logical = btrfs_file_extent_disk_bytenr(eb, fi);
1186 logical += btrfs_file_extent_offset(eb, fi);
1188 ret = extent_from_logical(sctx->send_root->fs_info,
1189 logical, tmp_path, &found_key);
1190 btrfs_release_path(tmp_path);
1194 if (ret & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
1200 * Setup the clone roots.
1202 for (i = 0; i < sctx->clone_roots_cnt; i++) {
1203 cur_clone_root = sctx->clone_roots + i;
1204 cur_clone_root->ino = (u64)-1;
1205 cur_clone_root->offset = 0;
1206 cur_clone_root->found_refs = 0;
1209 backref_ctx->sctx = sctx;
1210 backref_ctx->found = 0;
1211 backref_ctx->cur_objectid = ino;
1212 backref_ctx->cur_offset = data_offset;
1213 backref_ctx->found_itself = 0;
1214 backref_ctx->extent_len = num_bytes;
1217 * The last extent of a file may be too large due to page alignment.
1218 * We need to adjust extent_len in this case so that the checks in
1219 * __iterate_backrefs work.
1221 if (data_offset + num_bytes >= ino_size)
1222 backref_ctx->extent_len = ino_size - data_offset;
1225 * Now collect all backrefs.
1227 extent_item_pos = logical - found_key.objectid;
1228 ret = iterate_extent_inodes(sctx->send_root->fs_info,
1229 found_key.objectid, extent_item_pos, 1,
1230 __iterate_backrefs, backref_ctx);
1234 if (!backref_ctx->found_itself) {
1235 /* found a bug in backref code? */
1237 printk(KERN_ERR "btrfs: ERROR did not find backref in "
1238 "send_root. inode=%llu, offset=%llu, "
1240 ino, data_offset, logical);
1244 verbose_printk(KERN_DEBUG "btrfs: find_extent_clone: data_offset=%llu, "
1246 "num_bytes=%llu, logical=%llu\n",
1247 data_offset, ino, num_bytes, logical);
1249 if (!backref_ctx->found)
1250 verbose_printk("btrfs: no clones found\n");
1252 cur_clone_root = NULL;
1253 for (i = 0; i < sctx->clone_roots_cnt; i++) {
1254 if (sctx->clone_roots[i].found_refs) {
1255 if (!cur_clone_root)
1256 cur_clone_root = sctx->clone_roots + i;
1257 else if (sctx->clone_roots[i].root == sctx->send_root)
1258 /* prefer clones from send_root over others */
1259 cur_clone_root = sctx->clone_roots + i;
1265 if (cur_clone_root) {
1266 *found = cur_clone_root;
1273 btrfs_free_path(tmp_path);
1278 static int read_symlink(struct send_ctx *sctx,
1279 struct btrfs_root *root,
1281 struct fs_path *dest)
1284 struct btrfs_path *path;
1285 struct btrfs_key key;
1286 struct btrfs_file_extent_item *ei;
1292 path = alloc_path_for_send();
1297 key.type = BTRFS_EXTENT_DATA_KEY;
1299 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1304 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
1305 struct btrfs_file_extent_item);
1306 type = btrfs_file_extent_type(path->nodes[0], ei);
1307 compression = btrfs_file_extent_compression(path->nodes[0], ei);
1308 BUG_ON(type != BTRFS_FILE_EXTENT_INLINE);
1309 BUG_ON(compression);
1311 off = btrfs_file_extent_inline_start(ei);
1312 len = btrfs_file_extent_inline_len(path->nodes[0], ei);
1314 ret = fs_path_add_from_extent_buffer(dest, path->nodes[0], off, len);
1319 btrfs_free_path(path);
1324 * Helper function to generate a file name that is unique in the root of
1325 * send_root and parent_root. This is used to generate names for orphan inodes.
1327 static int gen_unique_name(struct send_ctx *sctx,
1329 struct fs_path *dest)
1332 struct btrfs_path *path;
1333 struct btrfs_dir_item *di;
1338 path = alloc_path_for_send();
1343 len = snprintf(tmp, sizeof(tmp) - 1, "o%llu-%llu-%llu",
1345 if (len >= sizeof(tmp)) {
1346 /* should really not happen */
1351 di = btrfs_lookup_dir_item(NULL, sctx->send_root,
1352 path, BTRFS_FIRST_FREE_OBJECTID,
1353 tmp, strlen(tmp), 0);
1354 btrfs_release_path(path);
1360 /* not unique, try again */
1365 if (!sctx->parent_root) {
1371 di = btrfs_lookup_dir_item(NULL, sctx->parent_root,
1372 path, BTRFS_FIRST_FREE_OBJECTID,
1373 tmp, strlen(tmp), 0);
1374 btrfs_release_path(path);
1380 /* not unique, try again */
1388 ret = fs_path_add(dest, tmp, strlen(tmp));
1391 btrfs_free_path(path);
1396 inode_state_no_change,
1397 inode_state_will_create,
1398 inode_state_did_create,
1399 inode_state_will_delete,
1400 inode_state_did_delete,
1403 static int get_cur_inode_state(struct send_ctx *sctx, u64 ino, u64 gen)
1411 ret = get_inode_info(sctx->send_root, ino, NULL, &left_gen, NULL, NULL,
1413 if (ret < 0 && ret != -ENOENT)
1417 if (!sctx->parent_root) {
1418 right_ret = -ENOENT;
1420 ret = get_inode_info(sctx->parent_root, ino, NULL, &right_gen,
1421 NULL, NULL, NULL, NULL);
1422 if (ret < 0 && ret != -ENOENT)
1427 if (!left_ret && !right_ret) {
1428 if (left_gen == gen && right_gen == gen)
1429 ret = inode_state_no_change;
1430 else if (left_gen == gen) {
1431 if (ino < sctx->send_progress)
1432 ret = inode_state_did_create;
1434 ret = inode_state_will_create;
1435 } else if (right_gen == gen) {
1436 if (ino < sctx->send_progress)
1437 ret = inode_state_did_delete;
1439 ret = inode_state_will_delete;
1443 } else if (!left_ret) {
1444 if (left_gen == gen) {
1445 if (ino < sctx->send_progress)
1446 ret = inode_state_did_create;
1448 ret = inode_state_will_create;
1452 } else if (!right_ret) {
1453 if (right_gen == gen) {
1454 if (ino < sctx->send_progress)
1455 ret = inode_state_did_delete;
1457 ret = inode_state_will_delete;
1469 static int is_inode_existent(struct send_ctx *sctx, u64 ino, u64 gen)
1473 ret = get_cur_inode_state(sctx, ino, gen);
1477 if (ret == inode_state_no_change ||
1478 ret == inode_state_did_create ||
1479 ret == inode_state_will_delete)
1489 * Helper function to lookup a dir item in a dir.
1491 static int lookup_dir_item_inode(struct btrfs_root *root,
1492 u64 dir, const char *name, int name_len,
1497 struct btrfs_dir_item *di;
1498 struct btrfs_key key;
1499 struct btrfs_path *path;
1501 path = alloc_path_for_send();
1505 di = btrfs_lookup_dir_item(NULL, root, path,
1506 dir, name, name_len, 0);
1515 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
1516 *found_inode = key.objectid;
1517 *found_type = btrfs_dir_type(path->nodes[0], di);
1520 btrfs_free_path(path);
1524 static int get_first_ref(struct send_ctx *sctx,
1525 struct btrfs_root *root, u64 ino,
1526 u64 *dir, u64 *dir_gen, struct fs_path *name)
1529 struct btrfs_key key;
1530 struct btrfs_key found_key;
1531 struct btrfs_path *path;
1532 struct btrfs_inode_ref *iref;
1535 path = alloc_path_for_send();
1540 key.type = BTRFS_INODE_REF_KEY;
1543 ret = btrfs_search_slot_for_read(root, &key, path, 1, 0);
1547 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1549 if (ret || found_key.objectid != key.objectid ||
1550 found_key.type != key.type) {
1555 iref = btrfs_item_ptr(path->nodes[0], path->slots[0],
1556 struct btrfs_inode_ref);
1557 len = btrfs_inode_ref_name_len(path->nodes[0], iref);
1558 ret = fs_path_add_from_extent_buffer(name, path->nodes[0],
1559 (unsigned long)(iref + 1), len);
1562 btrfs_release_path(path);
1564 ret = get_inode_info(root, found_key.offset, NULL, dir_gen, NULL, NULL,
1569 *dir = found_key.offset;
1572 btrfs_free_path(path);
1576 static int is_first_ref(struct send_ctx *sctx,
1577 struct btrfs_root *root,
1579 const char *name, int name_len)
1582 struct fs_path *tmp_name;
1586 tmp_name = fs_path_alloc(sctx);
1590 ret = get_first_ref(sctx, root, ino, &tmp_dir, &tmp_dir_gen, tmp_name);
1594 if (dir != tmp_dir || name_len != fs_path_len(tmp_name)) {
1599 ret = memcmp(tmp_name->start, name, name_len);
1606 fs_path_free(sctx, tmp_name);
1610 static int will_overwrite_ref(struct send_ctx *sctx, u64 dir, u64 dir_gen,
1611 const char *name, int name_len,
1612 u64 *who_ino, u64 *who_gen)
1615 u64 other_inode = 0;
1618 if (!sctx->parent_root)
1621 ret = is_inode_existent(sctx, dir, dir_gen);
1625 ret = lookup_dir_item_inode(sctx->parent_root, dir, name, name_len,
1626 &other_inode, &other_type);
1627 if (ret < 0 && ret != -ENOENT)
1634 if (other_inode > sctx->send_progress) {
1635 ret = get_inode_info(sctx->parent_root, other_inode, NULL,
1636 who_gen, NULL, NULL, NULL, NULL);
1641 *who_ino = other_inode;
1650 static int did_overwrite_ref(struct send_ctx *sctx,
1651 u64 dir, u64 dir_gen,
1652 u64 ino, u64 ino_gen,
1653 const char *name, int name_len)
1660 if (!sctx->parent_root)
1663 ret = is_inode_existent(sctx, dir, dir_gen);
1667 /* check if the ref was overwritten by another ref */
1668 ret = lookup_dir_item_inode(sctx->send_root, dir, name, name_len,
1669 &ow_inode, &other_type);
1670 if (ret < 0 && ret != -ENOENT)
1673 /* was never and will never be overwritten */
1678 ret = get_inode_info(sctx->send_root, ow_inode, NULL, &gen, NULL, NULL,
1683 if (ow_inode == ino && gen == ino_gen) {
1688 /* we know that it is or will be overwritten. check this now */
1689 if (ow_inode < sctx->send_progress)
1698 static int did_overwrite_first_ref(struct send_ctx *sctx, u64 ino, u64 gen)
1701 struct fs_path *name = NULL;
1705 if (!sctx->parent_root)
1708 name = fs_path_alloc(sctx);
1712 ret = get_first_ref(sctx, sctx->parent_root, ino, &dir, &dir_gen, name);
1716 ret = did_overwrite_ref(sctx, dir, dir_gen, ino, gen,
1717 name->start, fs_path_len(name));
1722 fs_path_free(sctx, name);
1726 static int name_cache_insert(struct send_ctx *sctx,
1727 struct name_cache_entry *nce)
1730 struct name_cache_entry **ncea;
1732 ncea = radix_tree_lookup(&sctx->name_cache, nce->ino);
1741 ncea = kmalloc(sizeof(void *) * 2, GFP_NOFS);
1747 ret = radix_tree_insert(&sctx->name_cache, nce->ino, ncea);
1751 list_add_tail(&nce->list, &sctx->name_cache_list);
1752 sctx->name_cache_size++;
1757 static void name_cache_delete(struct send_ctx *sctx,
1758 struct name_cache_entry *nce)
1760 struct name_cache_entry **ncea;
1762 ncea = radix_tree_lookup(&sctx->name_cache, nce->ino);
1767 else if (ncea[1] == nce)
1772 if (!ncea[0] && !ncea[1]) {
1773 radix_tree_delete(&sctx->name_cache, nce->ino);
1777 list_del(&nce->list);
1779 sctx->name_cache_size--;
1782 static struct name_cache_entry *name_cache_search(struct send_ctx *sctx,
1785 struct name_cache_entry **ncea;
1787 ncea = radix_tree_lookup(&sctx->name_cache, ino);
1791 if (ncea[0] && ncea[0]->gen == gen)
1793 else if (ncea[1] && ncea[1]->gen == gen)
1798 static void name_cache_used(struct send_ctx *sctx, struct name_cache_entry *nce)
1800 list_del(&nce->list);
1801 list_add_tail(&nce->list, &sctx->name_cache_list);
1804 static void name_cache_clean_unused(struct send_ctx *sctx)
1806 struct name_cache_entry *nce;
1808 if (sctx->name_cache_size < SEND_CTX_NAME_CACHE_CLEAN_SIZE)
1811 while (sctx->name_cache_size > SEND_CTX_MAX_NAME_CACHE_SIZE) {
1812 nce = list_entry(sctx->name_cache_list.next,
1813 struct name_cache_entry, list);
1814 name_cache_delete(sctx, nce);
1819 static void name_cache_free(struct send_ctx *sctx)
1821 struct name_cache_entry *nce;
1822 struct name_cache_entry *tmp;
1824 list_for_each_entry_safe(nce, tmp, &sctx->name_cache_list, list) {
1825 name_cache_delete(sctx, nce);
1829 static int __get_cur_name_and_parent(struct send_ctx *sctx,
1833 struct fs_path *dest)
1837 struct btrfs_path *path = NULL;
1838 struct name_cache_entry *nce = NULL;
1840 nce = name_cache_search(sctx, ino, gen);
1842 if (ino < sctx->send_progress && nce->need_later_update) {
1843 name_cache_delete(sctx, nce);
1847 name_cache_used(sctx, nce);
1848 *parent_ino = nce->parent_ino;
1849 *parent_gen = nce->parent_gen;
1850 ret = fs_path_add(dest, nce->name, nce->name_len);
1858 path = alloc_path_for_send();
1862 ret = is_inode_existent(sctx, ino, gen);
1867 ret = gen_unique_name(sctx, ino, gen, dest);
1874 if (ino < sctx->send_progress)
1875 ret = get_first_ref(sctx, sctx->send_root, ino,
1876 parent_ino, parent_gen, dest);
1878 ret = get_first_ref(sctx, sctx->parent_root, ino,
1879 parent_ino, parent_gen, dest);
1883 ret = did_overwrite_ref(sctx, *parent_ino, *parent_gen, ino, gen,
1884 dest->start, dest->end - dest->start);
1888 fs_path_reset(dest);
1889 ret = gen_unique_name(sctx, ino, gen, dest);
1896 nce = kmalloc(sizeof(*nce) + fs_path_len(dest) + 1, GFP_NOFS);
1904 nce->parent_ino = *parent_ino;
1905 nce->parent_gen = *parent_gen;
1906 nce->name_len = fs_path_len(dest);
1908 strcpy(nce->name, dest->start);
1910 if (ino < sctx->send_progress)
1911 nce->need_later_update = 0;
1913 nce->need_later_update = 1;
1915 nce_ret = name_cache_insert(sctx, nce);
1918 name_cache_clean_unused(sctx);
1921 btrfs_free_path(path);
1926 * Magic happens here. This function returns the first ref to an inode as it
1927 * would look like while receiving the stream at this point in time.
1928 * We walk the path up to the root. For every inode in between, we check if it
1929 * was already processed/sent. If yes, we continue with the parent as found
1930 * in send_root. If not, we continue with the parent as found in parent_root.
1931 * If we encounter an inode that was deleted at this point in time, we use the
1932 * inodes "orphan" name instead of the real name and stop. Same with new inodes
1933 * that were not created yet and overwritten inodes/refs.
1935 * When do we have have orphan inodes:
1936 * 1. When an inode is freshly created and thus no valid refs are available yet
1937 * 2. When a directory lost all it's refs (deleted) but still has dir items
1938 * inside which were not processed yet (pending for move/delete). If anyone
1939 * tried to get the path to the dir items, it would get a path inside that
1941 * 3. When an inode is moved around or gets new links, it may overwrite the ref
1942 * of an unprocessed inode. If in that case the first ref would be
1943 * overwritten, the overwritten inode gets "orphanized". Later when we
1944 * process this overwritten inode, it is restored at a new place by moving
1947 * sctx->send_progress tells this function at which point in time receiving
1950 static int get_cur_path(struct send_ctx *sctx, u64 ino, u64 gen,
1951 struct fs_path *dest)
1954 struct fs_path *name = NULL;
1955 u64 parent_inode = 0;
1959 name = fs_path_alloc(sctx);
1966 fs_path_reset(dest);
1968 while (!stop && ino != BTRFS_FIRST_FREE_OBJECTID) {
1969 fs_path_reset(name);
1971 ret = __get_cur_name_and_parent(sctx, ino, gen,
1972 &parent_inode, &parent_gen, name);
1978 ret = fs_path_add_path(dest, name);
1987 fs_path_free(sctx, name);
1989 fs_path_unreverse(dest);
1994 * Called for regular files when sending extents data. Opens a struct file
1995 * to read from the file.
1997 static int open_cur_inode_file(struct send_ctx *sctx)
2000 struct btrfs_key key;
2002 struct inode *inode;
2003 struct dentry *dentry;
2007 if (sctx->cur_inode_filp)
2010 key.objectid = sctx->cur_ino;
2011 key.type = BTRFS_INODE_ITEM_KEY;
2014 inode = btrfs_iget(sctx->send_root->fs_info->sb, &key, sctx->send_root,
2016 if (IS_ERR(inode)) {
2017 ret = PTR_ERR(inode);
2021 dentry = d_obtain_alias(inode);
2023 if (IS_ERR(dentry)) {
2024 ret = PTR_ERR(dentry);
2028 path.mnt = sctx->mnt;
2029 path.dentry = dentry;
2030 filp = dentry_open(&path, O_RDONLY | O_LARGEFILE, current_cred());
2034 ret = PTR_ERR(filp);
2037 sctx->cur_inode_filp = filp;
2041 * no xxxput required here as every vfs op
2042 * does it by itself on failure
2048 * Closes the struct file that was created in open_cur_inode_file
2050 static int close_cur_inode_file(struct send_ctx *sctx)
2054 if (!sctx->cur_inode_filp)
2057 ret = filp_close(sctx->cur_inode_filp, NULL);
2058 sctx->cur_inode_filp = NULL;
2065 * Sends a BTRFS_SEND_C_SUBVOL command/item to userspace
2067 static int send_subvol_begin(struct send_ctx *sctx)
2070 struct btrfs_root *send_root = sctx->send_root;
2071 struct btrfs_root *parent_root = sctx->parent_root;
2072 struct btrfs_path *path;
2073 struct btrfs_key key;
2074 struct btrfs_root_ref *ref;
2075 struct extent_buffer *leaf;
2079 path = alloc_path_for_send();
2083 name = kmalloc(BTRFS_PATH_NAME_MAX, GFP_NOFS);
2085 btrfs_free_path(path);
2089 key.objectid = send_root->objectid;
2090 key.type = BTRFS_ROOT_BACKREF_KEY;
2093 ret = btrfs_search_slot_for_read(send_root->fs_info->tree_root,
2102 leaf = path->nodes[0];
2103 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2104 if (key.type != BTRFS_ROOT_BACKREF_KEY ||
2105 key.objectid != send_root->objectid) {
2109 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
2110 namelen = btrfs_root_ref_name_len(leaf, ref);
2111 read_extent_buffer(leaf, name, (unsigned long)(ref + 1), namelen);
2112 btrfs_release_path(path);
2118 ret = begin_cmd(sctx, BTRFS_SEND_C_SNAPSHOT);
2122 ret = begin_cmd(sctx, BTRFS_SEND_C_SUBVOL);
2127 TLV_PUT_STRING(sctx, BTRFS_SEND_A_PATH, name, namelen);
2128 TLV_PUT_UUID(sctx, BTRFS_SEND_A_UUID,
2129 sctx->send_root->root_item.uuid);
2130 TLV_PUT_U64(sctx, BTRFS_SEND_A_CTRANSID,
2131 sctx->send_root->root_item.ctransid);
2133 TLV_PUT_UUID(sctx, BTRFS_SEND_A_CLONE_UUID,
2134 sctx->parent_root->root_item.uuid);
2135 TLV_PUT_U64(sctx, BTRFS_SEND_A_CLONE_CTRANSID,
2136 sctx->parent_root->root_item.ctransid);
2139 ret = send_cmd(sctx);
2143 btrfs_free_path(path);
2148 static int send_truncate(struct send_ctx *sctx, u64 ino, u64 gen, u64 size)
2153 verbose_printk("btrfs: send_truncate %llu size=%llu\n", ino, size);
2155 p = fs_path_alloc(sctx);
2159 ret = begin_cmd(sctx, BTRFS_SEND_C_TRUNCATE);
2163 ret = get_cur_path(sctx, ino, gen, p);
2166 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
2167 TLV_PUT_U64(sctx, BTRFS_SEND_A_SIZE, size);
2169 ret = send_cmd(sctx);
2173 fs_path_free(sctx, p);
2177 static int send_chmod(struct send_ctx *sctx, u64 ino, u64 gen, u64 mode)
2182 verbose_printk("btrfs: send_chmod %llu mode=%llu\n", ino, mode);
2184 p = fs_path_alloc(sctx);
2188 ret = begin_cmd(sctx, BTRFS_SEND_C_CHMOD);
2192 ret = get_cur_path(sctx, ino, gen, p);
2195 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
2196 TLV_PUT_U64(sctx, BTRFS_SEND_A_MODE, mode & 07777);
2198 ret = send_cmd(sctx);
2202 fs_path_free(sctx, p);
2206 static int send_chown(struct send_ctx *sctx, u64 ino, u64 gen, u64 uid, u64 gid)
2211 verbose_printk("btrfs: send_chown %llu uid=%llu, gid=%llu\n", ino, uid, gid);
2213 p = fs_path_alloc(sctx);
2217 ret = begin_cmd(sctx, BTRFS_SEND_C_CHOWN);
2221 ret = get_cur_path(sctx, ino, gen, p);
2224 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
2225 TLV_PUT_U64(sctx, BTRFS_SEND_A_UID, uid);
2226 TLV_PUT_U64(sctx, BTRFS_SEND_A_GID, gid);
2228 ret = send_cmd(sctx);
2232 fs_path_free(sctx, p);
2236 static int send_utimes(struct send_ctx *sctx, u64 ino, u64 gen)
2239 struct fs_path *p = NULL;
2240 struct btrfs_inode_item *ii;
2241 struct btrfs_path *path = NULL;
2242 struct extent_buffer *eb;
2243 struct btrfs_key key;
2246 verbose_printk("btrfs: send_utimes %llu\n", ino);
2248 p = fs_path_alloc(sctx);
2252 path = alloc_path_for_send();
2259 key.type = BTRFS_INODE_ITEM_KEY;
2261 ret = btrfs_search_slot(NULL, sctx->send_root, &key, path, 0, 0);
2265 eb = path->nodes[0];
2266 slot = path->slots[0];
2267 ii = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
2269 ret = begin_cmd(sctx, BTRFS_SEND_C_UTIMES);
2273 ret = get_cur_path(sctx, ino, gen, p);
2276 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
2277 TLV_PUT_BTRFS_TIMESPEC(sctx, BTRFS_SEND_A_ATIME, eb,
2278 btrfs_inode_atime(ii));
2279 TLV_PUT_BTRFS_TIMESPEC(sctx, BTRFS_SEND_A_MTIME, eb,
2280 btrfs_inode_mtime(ii));
2281 TLV_PUT_BTRFS_TIMESPEC(sctx, BTRFS_SEND_A_CTIME, eb,
2282 btrfs_inode_ctime(ii));
2285 ret = send_cmd(sctx);
2289 fs_path_free(sctx, p);
2290 btrfs_free_path(path);
2295 * Sends a BTRFS_SEND_C_MKXXX or SYMLINK command to user space. We don't have
2296 * a valid path yet because we did not process the refs yet. So, the inode
2297 * is created as orphan.
2299 static int send_create_inode(struct send_ctx *sctx, u64 ino)
2308 verbose_printk("btrfs: send_create_inode %llu\n", ino);
2310 p = fs_path_alloc(sctx);
2314 ret = get_inode_info(sctx->send_root, ino, NULL, &gen, &mode, NULL,
2320 cmd = BTRFS_SEND_C_MKFILE;
2321 else if (S_ISDIR(mode))
2322 cmd = BTRFS_SEND_C_MKDIR;
2323 else if (S_ISLNK(mode))
2324 cmd = BTRFS_SEND_C_SYMLINK;
2325 else if (S_ISCHR(mode) || S_ISBLK(mode))
2326 cmd = BTRFS_SEND_C_MKNOD;
2327 else if (S_ISFIFO(mode))
2328 cmd = BTRFS_SEND_C_MKFIFO;
2329 else if (S_ISSOCK(mode))
2330 cmd = BTRFS_SEND_C_MKSOCK;
2332 printk(KERN_WARNING "btrfs: unexpected inode type %o",
2333 (int)(mode & S_IFMT));
2338 ret = begin_cmd(sctx, cmd);
2342 ret = gen_unique_name(sctx, ino, gen, p);
2346 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
2347 TLV_PUT_U64(sctx, BTRFS_SEND_A_INO, ino);
2349 if (S_ISLNK(mode)) {
2351 ret = read_symlink(sctx, sctx->send_root, ino, p);
2354 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH_LINK, p);
2355 } else if (S_ISCHR(mode) || S_ISBLK(mode) ||
2356 S_ISFIFO(mode) || S_ISSOCK(mode)) {
2357 TLV_PUT_U64(sctx, BTRFS_SEND_A_RDEV, rdev);
2360 ret = send_cmd(sctx);
2367 fs_path_free(sctx, p);
2372 * We need some special handling for inodes that get processed before the parent
2373 * directory got created. See process_recorded_refs for details.
2374 * This function does the check if we already created the dir out of order.
2376 static int did_create_dir(struct send_ctx *sctx, u64 dir)
2379 struct btrfs_path *path = NULL;
2380 struct btrfs_key key;
2381 struct btrfs_key found_key;
2382 struct btrfs_key di_key;
2383 struct extent_buffer *eb;
2384 struct btrfs_dir_item *di;
2387 path = alloc_path_for_send();
2394 key.type = BTRFS_DIR_INDEX_KEY;
2397 ret = btrfs_search_slot_for_read(sctx->send_root, &key, path,
2402 eb = path->nodes[0];
2403 slot = path->slots[0];
2404 btrfs_item_key_to_cpu(eb, &found_key, slot);
2406 if (ret || found_key.objectid != key.objectid ||
2407 found_key.type != key.type) {
2412 di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
2413 btrfs_dir_item_key_to_cpu(eb, di, &di_key);
2415 if (di_key.objectid < sctx->send_progress) {
2420 key.offset = found_key.offset + 1;
2421 btrfs_release_path(path);
2425 btrfs_free_path(path);
2430 * Only creates the inode if it is:
2431 * 1. Not a directory
2432 * 2. Or a directory which was not created already due to out of order
2433 * directories. See did_create_dir and process_recorded_refs for details.
2435 static int send_create_inode_if_needed(struct send_ctx *sctx)
2439 if (S_ISDIR(sctx->cur_inode_mode)) {
2440 ret = did_create_dir(sctx, sctx->cur_ino);
2449 ret = send_create_inode(sctx, sctx->cur_ino);
2457 struct recorded_ref {
2458 struct list_head list;
2461 struct fs_path *full_path;
2469 * We need to process new refs before deleted refs, but compare_tree gives us
2470 * everything mixed. So we first record all refs and later process them.
2471 * This function is a helper to record one ref.
2473 static int record_ref(struct list_head *head, u64 dir,
2474 u64 dir_gen, struct fs_path *path)
2476 struct recorded_ref *ref;
2479 ref = kmalloc(sizeof(*ref), GFP_NOFS);
2484 ref->dir_gen = dir_gen;
2485 ref->full_path = path;
2487 tmp = strrchr(ref->full_path->start, '/');
2489 ref->name_len = ref->full_path->end - ref->full_path->start;
2490 ref->name = ref->full_path->start;
2491 ref->dir_path_len = 0;
2492 ref->dir_path = ref->full_path->start;
2495 ref->name_len = ref->full_path->end - tmp;
2497 ref->dir_path = ref->full_path->start;
2498 ref->dir_path_len = ref->full_path->end -
2499 ref->full_path->start - 1 - ref->name_len;
2502 list_add_tail(&ref->list, head);
2506 static void __free_recorded_refs(struct send_ctx *sctx, struct list_head *head)
2508 struct recorded_ref *cur;
2509 struct recorded_ref *tmp;
2511 list_for_each_entry_safe(cur, tmp, head, list) {
2512 fs_path_free(sctx, cur->full_path);
2515 INIT_LIST_HEAD(head);
2518 static void free_recorded_refs(struct send_ctx *sctx)
2520 __free_recorded_refs(sctx, &sctx->new_refs);
2521 __free_recorded_refs(sctx, &sctx->deleted_refs);
2525 * Renames/moves a file/dir to it's orphan name. Used when the first
2526 * ref of an unprocessed inode gets overwritten and for all non empty
2529 static int orphanize_inode(struct send_ctx *sctx, u64 ino, u64 gen,
2530 struct fs_path *path)
2533 struct fs_path *orphan;
2535 orphan = fs_path_alloc(sctx);
2539 ret = gen_unique_name(sctx, ino, gen, orphan);
2543 ret = send_rename(sctx, path, orphan);
2546 fs_path_free(sctx, orphan);
2551 * Returns 1 if a directory can be removed at this point in time.
2552 * We check this by iterating all dir items and checking if the inode behind
2553 * the dir item was already processed.
2555 static int can_rmdir(struct send_ctx *sctx, u64 dir, u64 send_progress)
2558 struct btrfs_root *root = sctx->parent_root;
2559 struct btrfs_path *path;
2560 struct btrfs_key key;
2561 struct btrfs_key found_key;
2562 struct btrfs_key loc;
2563 struct btrfs_dir_item *di;
2565 path = alloc_path_for_send();
2570 key.type = BTRFS_DIR_INDEX_KEY;
2574 ret = btrfs_search_slot_for_read(root, &key, path, 1, 0);
2578 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
2581 if (ret || found_key.objectid != key.objectid ||
2582 found_key.type != key.type) {
2586 di = btrfs_item_ptr(path->nodes[0], path->slots[0],
2587 struct btrfs_dir_item);
2588 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &loc);
2590 if (loc.objectid > send_progress) {
2595 btrfs_release_path(path);
2596 key.offset = found_key.offset + 1;
2602 btrfs_free_path(path);
2607 * This does all the move/link/unlink/rmdir magic.
2609 static int process_recorded_refs(struct send_ctx *sctx)
2612 struct recorded_ref *cur;
2613 struct recorded_ref *cur2;
2614 struct ulist *check_dirs = NULL;
2615 struct ulist_iterator uit;
2616 struct ulist_node *un;
2617 struct fs_path *valid_path = NULL;
2620 int did_overwrite = 0;
2623 verbose_printk("btrfs: process_recorded_refs %llu\n", sctx->cur_ino);
2625 valid_path = fs_path_alloc(sctx);
2631 check_dirs = ulist_alloc(GFP_NOFS);
2638 * First, check if the first ref of the current inode was overwritten
2639 * before. If yes, we know that the current inode was already orphanized
2640 * and thus use the orphan name. If not, we can use get_cur_path to
2641 * get the path of the first ref as it would like while receiving at
2642 * this point in time.
2643 * New inodes are always orphan at the beginning, so force to use the
2644 * orphan name in this case.
2645 * The first ref is stored in valid_path and will be updated if it
2646 * gets moved around.
2648 if (!sctx->cur_inode_new) {
2649 ret = did_overwrite_first_ref(sctx, sctx->cur_ino,
2650 sctx->cur_inode_gen);
2656 if (sctx->cur_inode_new || did_overwrite) {
2657 ret = gen_unique_name(sctx, sctx->cur_ino,
2658 sctx->cur_inode_gen, valid_path);
2663 ret = get_cur_path(sctx, sctx->cur_ino, sctx->cur_inode_gen,
2669 list_for_each_entry(cur, &sctx->new_refs, list) {
2671 * We may have refs where the parent directory does not exist
2672 * yet. This happens if the parent directories inum is higher
2673 * the the current inum. To handle this case, we create the
2674 * parent directory out of order. But we need to check if this
2675 * did already happen before due to other refs in the same dir.
2677 ret = get_cur_inode_state(sctx, cur->dir, cur->dir_gen);
2680 if (ret == inode_state_will_create) {
2683 * First check if any of the current inodes refs did
2684 * already create the dir.
2686 list_for_each_entry(cur2, &sctx->new_refs, list) {
2689 if (cur2->dir == cur->dir) {
2696 * If that did not happen, check if a previous inode
2697 * did already create the dir.
2700 ret = did_create_dir(sctx, cur->dir);
2704 ret = send_create_inode(sctx, cur->dir);
2711 * Check if this new ref would overwrite the first ref of
2712 * another unprocessed inode. If yes, orphanize the
2713 * overwritten inode. If we find an overwritten ref that is
2714 * not the first ref, simply unlink it.
2716 ret = will_overwrite_ref(sctx, cur->dir, cur->dir_gen,
2717 cur->name, cur->name_len,
2718 &ow_inode, &ow_gen);
2722 ret = is_first_ref(sctx, sctx->parent_root,
2723 ow_inode, cur->dir, cur->name,
2728 ret = orphanize_inode(sctx, ow_inode, ow_gen,
2733 ret = send_unlink(sctx, cur->full_path);
2740 * link/move the ref to the new place. If we have an orphan
2741 * inode, move it and update valid_path. If not, link or move
2742 * it depending on the inode mode.
2745 ret = send_rename(sctx, valid_path, cur->full_path);
2749 ret = fs_path_copy(valid_path, cur->full_path);
2753 if (S_ISDIR(sctx->cur_inode_mode)) {
2755 * Dirs can't be linked, so move it. For moved
2756 * dirs, we always have one new and one deleted
2757 * ref. The deleted ref is ignored later.
2759 ret = send_rename(sctx, valid_path,
2763 ret = fs_path_copy(valid_path, cur->full_path);
2767 ret = send_link(sctx, cur->full_path,
2773 ret = ulist_add(check_dirs, cur->dir, cur->dir_gen,
2779 if (S_ISDIR(sctx->cur_inode_mode) && sctx->cur_inode_deleted) {
2781 * Check if we can already rmdir the directory. If not,
2782 * orphanize it. For every dir item inside that gets deleted
2783 * later, we do this check again and rmdir it then if possible.
2784 * See the use of check_dirs for more details.
2786 ret = can_rmdir(sctx, sctx->cur_ino, sctx->cur_ino);
2790 ret = send_rmdir(sctx, valid_path);
2793 } else if (!is_orphan) {
2794 ret = orphanize_inode(sctx, sctx->cur_ino,
2795 sctx->cur_inode_gen, valid_path);
2801 list_for_each_entry(cur, &sctx->deleted_refs, list) {
2802 ret = ulist_add(check_dirs, cur->dir, cur->dir_gen,
2807 } else if (S_ISDIR(sctx->cur_inode_mode) &&
2808 !list_empty(&sctx->deleted_refs)) {
2810 * We have a moved dir. Add the old parent to check_dirs
2812 cur = list_entry(sctx->deleted_refs.next, struct recorded_ref,
2814 ret = ulist_add(check_dirs, cur->dir, cur->dir_gen,
2818 } else if (!S_ISDIR(sctx->cur_inode_mode)) {
2820 * We have a non dir inode. Go through all deleted refs and
2821 * unlink them if they were not already overwritten by other
2824 list_for_each_entry(cur, &sctx->deleted_refs, list) {
2825 ret = did_overwrite_ref(sctx, cur->dir, cur->dir_gen,
2826 sctx->cur_ino, sctx->cur_inode_gen,
2827 cur->name, cur->name_len);
2831 ret = send_unlink(sctx, cur->full_path);
2835 ret = ulist_add(check_dirs, cur->dir, cur->dir_gen,
2842 * If the inode is still orphan, unlink the orphan. This may
2843 * happen when a previous inode did overwrite the first ref
2844 * of this inode and no new refs were added for the current
2848 ret = send_unlink(sctx, valid_path);
2855 * We did collect all parent dirs where cur_inode was once located. We
2856 * now go through all these dirs and check if they are pending for
2857 * deletion and if it's finally possible to perform the rmdir now.
2858 * We also update the inode stats of the parent dirs here.
2860 ULIST_ITER_INIT(&uit);
2861 while ((un = ulist_next(check_dirs, &uit))) {
2862 if (un->val > sctx->cur_ino)
2865 ret = get_cur_inode_state(sctx, un->val, un->aux);
2869 if (ret == inode_state_did_create ||
2870 ret == inode_state_no_change) {
2871 /* TODO delayed utimes */
2872 ret = send_utimes(sctx, un->val, un->aux);
2875 } else if (ret == inode_state_did_delete) {
2876 ret = can_rmdir(sctx, un->val, sctx->cur_ino);
2880 ret = get_cur_path(sctx, un->val, un->aux,
2884 ret = send_rmdir(sctx, valid_path);
2892 * Current inode is now at it's new position, so we must increase
2895 sctx->send_progress = sctx->cur_ino + 1;
2900 free_recorded_refs(sctx);
2901 ulist_free(check_dirs);
2902 fs_path_free(sctx, valid_path);
2906 static int __record_new_ref(int num, u64 dir, int index,
2907 struct fs_path *name,
2911 struct send_ctx *sctx = ctx;
2915 p = fs_path_alloc(sctx);
2919 ret = get_inode_info(sctx->send_root, dir, NULL, &gen, NULL, NULL,
2924 ret = get_cur_path(sctx, dir, gen, p);
2927 ret = fs_path_add_path(p, name);
2931 ret = record_ref(&sctx->new_refs, dir, gen, p);
2935 fs_path_free(sctx, p);
2939 static int __record_deleted_ref(int num, u64 dir, int index,
2940 struct fs_path *name,
2944 struct send_ctx *sctx = ctx;
2948 p = fs_path_alloc(sctx);
2952 ret = get_inode_info(sctx->parent_root, dir, NULL, &gen, NULL, NULL,
2957 ret = get_cur_path(sctx, dir, gen, p);
2960 ret = fs_path_add_path(p, name);
2964 ret = record_ref(&sctx->deleted_refs, dir, gen, p);
2968 fs_path_free(sctx, p);
2972 static int record_new_ref(struct send_ctx *sctx)
2976 ret = iterate_inode_ref(sctx, sctx->send_root, sctx->left_path,
2977 sctx->cmp_key, 0, __record_new_ref, sctx);
2986 static int record_deleted_ref(struct send_ctx *sctx)
2990 ret = iterate_inode_ref(sctx, sctx->parent_root, sctx->right_path,
2991 sctx->cmp_key, 0, __record_deleted_ref, sctx);
3000 struct find_ref_ctx {
3002 struct fs_path *name;
3006 static int __find_iref(int num, u64 dir, int index,
3007 struct fs_path *name,
3010 struct find_ref_ctx *ctx = ctx_;
3012 if (dir == ctx->dir && fs_path_len(name) == fs_path_len(ctx->name) &&
3013 strncmp(name->start, ctx->name->start, fs_path_len(name)) == 0) {
3014 ctx->found_idx = num;
3020 static int find_iref(struct send_ctx *sctx,
3021 struct btrfs_root *root,
3022 struct btrfs_path *path,
3023 struct btrfs_key *key,
3024 u64 dir, struct fs_path *name)
3027 struct find_ref_ctx ctx;
3033 ret = iterate_inode_ref(sctx, root, path, key, 0, __find_iref, &ctx);
3037 if (ctx.found_idx == -1)
3040 return ctx.found_idx;
3043 static int __record_changed_new_ref(int num, u64 dir, int index,
3044 struct fs_path *name,
3048 struct send_ctx *sctx = ctx;
3050 ret = find_iref(sctx, sctx->parent_root, sctx->right_path,
3051 sctx->cmp_key, dir, name);
3053 ret = __record_new_ref(num, dir, index, name, sctx);
3060 static int __record_changed_deleted_ref(int num, u64 dir, int index,
3061 struct fs_path *name,
3065 struct send_ctx *sctx = ctx;
3067 ret = find_iref(sctx, sctx->send_root, sctx->left_path, sctx->cmp_key,
3070 ret = __record_deleted_ref(num, dir, index, name, sctx);
3077 static int record_changed_ref(struct send_ctx *sctx)
3081 ret = iterate_inode_ref(sctx, sctx->send_root, sctx->left_path,
3082 sctx->cmp_key, 0, __record_changed_new_ref, sctx);
3085 ret = iterate_inode_ref(sctx, sctx->parent_root, sctx->right_path,
3086 sctx->cmp_key, 0, __record_changed_deleted_ref, sctx);
3096 * Record and process all refs at once. Needed when an inode changes the
3097 * generation number, which means that it was deleted and recreated.
3099 static int process_all_refs(struct send_ctx *sctx,
3100 enum btrfs_compare_tree_result cmd)
3103 struct btrfs_root *root;
3104 struct btrfs_path *path;
3105 struct btrfs_key key;
3106 struct btrfs_key found_key;
3107 struct extent_buffer *eb;
3109 iterate_inode_ref_t cb;
3111 path = alloc_path_for_send();
3115 if (cmd == BTRFS_COMPARE_TREE_NEW) {
3116 root = sctx->send_root;
3117 cb = __record_new_ref;
3118 } else if (cmd == BTRFS_COMPARE_TREE_DELETED) {
3119 root = sctx->parent_root;
3120 cb = __record_deleted_ref;
3125 key.objectid = sctx->cmp_key->objectid;
3126 key.type = BTRFS_INODE_REF_KEY;
3129 ret = btrfs_search_slot_for_read(root, &key, path, 1, 0);
3131 btrfs_release_path(path);
3135 btrfs_release_path(path);
3139 eb = path->nodes[0];
3140 slot = path->slots[0];
3141 btrfs_item_key_to_cpu(eb, &found_key, slot);
3143 if (found_key.objectid != key.objectid ||
3144 found_key.type != key.type) {
3145 btrfs_release_path(path);
3149 ret = iterate_inode_ref(sctx, sctx->parent_root, path,
3150 &found_key, 0, cb, sctx);
3151 btrfs_release_path(path);
3155 key.offset = found_key.offset + 1;
3158 ret = process_recorded_refs(sctx);
3161 btrfs_free_path(path);
3165 static int send_set_xattr(struct send_ctx *sctx,
3166 struct fs_path *path,
3167 const char *name, int name_len,
3168 const char *data, int data_len)
3172 ret = begin_cmd(sctx, BTRFS_SEND_C_SET_XATTR);
3176 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, path);
3177 TLV_PUT_STRING(sctx, BTRFS_SEND_A_XATTR_NAME, name, name_len);
3178 TLV_PUT(sctx, BTRFS_SEND_A_XATTR_DATA, data, data_len);
3180 ret = send_cmd(sctx);
3187 static int send_remove_xattr(struct send_ctx *sctx,
3188 struct fs_path *path,
3189 const char *name, int name_len)
3193 ret = begin_cmd(sctx, BTRFS_SEND_C_REMOVE_XATTR);
3197 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, path);
3198 TLV_PUT_STRING(sctx, BTRFS_SEND_A_XATTR_NAME, name, name_len);
3200 ret = send_cmd(sctx);
3207 static int __process_new_xattr(int num, struct btrfs_key *di_key,
3208 const char *name, int name_len,
3209 const char *data, int data_len,
3213 struct send_ctx *sctx = ctx;
3215 posix_acl_xattr_header dummy_acl;
3217 p = fs_path_alloc(sctx);
3222 * This hack is needed because empty acl's are stored as zero byte
3223 * data in xattrs. Problem with that is, that receiving these zero byte
3224 * acl's will fail later. To fix this, we send a dummy acl list that
3225 * only contains the version number and no entries.
3227 if (!strncmp(name, XATTR_NAME_POSIX_ACL_ACCESS, name_len) ||
3228 !strncmp(name, XATTR_NAME_POSIX_ACL_DEFAULT, name_len)) {
3229 if (data_len == 0) {
3230 dummy_acl.a_version =
3231 cpu_to_le32(POSIX_ACL_XATTR_VERSION);
3232 data = (char *)&dummy_acl;
3233 data_len = sizeof(dummy_acl);
3237 ret = get_cur_path(sctx, sctx->cur_ino, sctx->cur_inode_gen, p);
3241 ret = send_set_xattr(sctx, p, name, name_len, data, data_len);
3244 fs_path_free(sctx, p);
3248 static int __process_deleted_xattr(int num, struct btrfs_key *di_key,
3249 const char *name, int name_len,
3250 const char *data, int data_len,
3254 struct send_ctx *sctx = ctx;
3257 p = fs_path_alloc(sctx);
3261 ret = get_cur_path(sctx, sctx->cur_ino, sctx->cur_inode_gen, p);
3265 ret = send_remove_xattr(sctx, p, name, name_len);
3268 fs_path_free(sctx, p);
3272 static int process_new_xattr(struct send_ctx *sctx)
3276 ret = iterate_dir_item(sctx, sctx->send_root, sctx->left_path,
3277 sctx->cmp_key, __process_new_xattr, sctx);
3282 static int process_deleted_xattr(struct send_ctx *sctx)
3286 ret = iterate_dir_item(sctx, sctx->parent_root, sctx->right_path,
3287 sctx->cmp_key, __process_deleted_xattr, sctx);
3292 struct find_xattr_ctx {
3300 static int __find_xattr(int num, struct btrfs_key *di_key,
3301 const char *name, int name_len,
3302 const char *data, int data_len,
3303 u8 type, void *vctx)
3305 struct find_xattr_ctx *ctx = vctx;
3307 if (name_len == ctx->name_len &&
3308 strncmp(name, ctx->name, name_len) == 0) {
3309 ctx->found_idx = num;
3310 ctx->found_data_len = data_len;
3311 ctx->found_data = kmalloc(data_len, GFP_NOFS);
3312 if (!ctx->found_data)
3314 memcpy(ctx->found_data, data, data_len);
3320 static int find_xattr(struct send_ctx *sctx,
3321 struct btrfs_root *root,
3322 struct btrfs_path *path,
3323 struct btrfs_key *key,
3324 const char *name, int name_len,
3325 char **data, int *data_len)
3328 struct find_xattr_ctx ctx;
3331 ctx.name_len = name_len;
3333 ctx.found_data = NULL;
3334 ctx.found_data_len = 0;
3336 ret = iterate_dir_item(sctx, root, path, key, __find_xattr, &ctx);
3340 if (ctx.found_idx == -1)
3343 *data = ctx.found_data;
3344 *data_len = ctx.found_data_len;
3346 kfree(ctx.found_data);
3348 return ctx.found_idx;
3352 static int __process_changed_new_xattr(int num, struct btrfs_key *di_key,
3353 const char *name, int name_len,
3354 const char *data, int data_len,
3358 struct send_ctx *sctx = ctx;
3359 char *found_data = NULL;
3360 int found_data_len = 0;
3361 struct fs_path *p = NULL;
3363 ret = find_xattr(sctx, sctx->parent_root, sctx->right_path,
3364 sctx->cmp_key, name, name_len, &found_data,
3366 if (ret == -ENOENT) {
3367 ret = __process_new_xattr(num, di_key, name, name_len, data,
3368 data_len, type, ctx);
3369 } else if (ret >= 0) {
3370 if (data_len != found_data_len ||
3371 memcmp(data, found_data, data_len)) {
3372 ret = __process_new_xattr(num, di_key, name, name_len,
3373 data, data_len, type, ctx);
3380 fs_path_free(sctx, p);
3384 static int __process_changed_deleted_xattr(int num, struct btrfs_key *di_key,
3385 const char *name, int name_len,
3386 const char *data, int data_len,
3390 struct send_ctx *sctx = ctx;
3392 ret = find_xattr(sctx, sctx->send_root, sctx->left_path, sctx->cmp_key,
3393 name, name_len, NULL, NULL);
3395 ret = __process_deleted_xattr(num, di_key, name, name_len, data,
3396 data_len, type, ctx);
3403 static int process_changed_xattr(struct send_ctx *sctx)
3407 ret = iterate_dir_item(sctx, sctx->send_root, sctx->left_path,
3408 sctx->cmp_key, __process_changed_new_xattr, sctx);
3411 ret = iterate_dir_item(sctx, sctx->parent_root, sctx->right_path,
3412 sctx->cmp_key, __process_changed_deleted_xattr, sctx);
3418 static int process_all_new_xattrs(struct send_ctx *sctx)
3421 struct btrfs_root *root;
3422 struct btrfs_path *path;
3423 struct btrfs_key key;
3424 struct btrfs_key found_key;
3425 struct extent_buffer *eb;
3428 path = alloc_path_for_send();
3432 root = sctx->send_root;
3434 key.objectid = sctx->cmp_key->objectid;
3435 key.type = BTRFS_XATTR_ITEM_KEY;
3438 ret = btrfs_search_slot_for_read(root, &key, path, 1, 0);
3446 eb = path->nodes[0];
3447 slot = path->slots[0];
3448 btrfs_item_key_to_cpu(eb, &found_key, slot);
3450 if (found_key.objectid != key.objectid ||
3451 found_key.type != key.type) {
3456 ret = iterate_dir_item(sctx, root, path, &found_key,
3457 __process_new_xattr, sctx);
3461 btrfs_release_path(path);
3462 key.offset = found_key.offset + 1;
3466 btrfs_free_path(path);
3471 * Read some bytes from the current inode/file and send a write command to
3474 static int send_write(struct send_ctx *sctx, u64 offset, u32 len)
3478 loff_t pos = offset;
3480 mm_segment_t old_fs;
3482 p = fs_path_alloc(sctx);
3487 * vfs normally only accepts user space buffers for security reasons.
3488 * we only read from the file and also only provide the read_buf buffer
3489 * to vfs. As this buffer does not come from a user space call, it's
3490 * ok to temporary allow kernel space buffers.
3495 verbose_printk("btrfs: send_write offset=%llu, len=%d\n", offset, len);
3497 ret = open_cur_inode_file(sctx);
3501 ret = vfs_read(sctx->cur_inode_filp, sctx->read_buf, len, &pos);
3508 ret = begin_cmd(sctx, BTRFS_SEND_C_WRITE);
3512 ret = get_cur_path(sctx, sctx->cur_ino, sctx->cur_inode_gen, p);
3516 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
3517 TLV_PUT_U64(sctx, BTRFS_SEND_A_FILE_OFFSET, offset);
3518 TLV_PUT(sctx, BTRFS_SEND_A_DATA, sctx->read_buf, readed);
3520 ret = send_cmd(sctx);
3524 fs_path_free(sctx, p);
3532 * Send a clone command to user space.
3534 static int send_clone(struct send_ctx *sctx,
3535 u64 offset, u32 len,
3536 struct clone_root *clone_root)
3539 struct btrfs_root *clone_root2 = clone_root->root;
3543 verbose_printk("btrfs: send_clone offset=%llu, len=%d, clone_root=%llu, "
3544 "clone_inode=%llu, clone_offset=%llu\n", offset, len,
3545 clone_root->root->objectid, clone_root->ino,
3546 clone_root->offset);
3548 p = fs_path_alloc(sctx);
3552 ret = begin_cmd(sctx, BTRFS_SEND_C_CLONE);
3556 ret = get_cur_path(sctx, sctx->cur_ino, sctx->cur_inode_gen, p);
3560 TLV_PUT_U64(sctx, BTRFS_SEND_A_FILE_OFFSET, offset);
3561 TLV_PUT_U64(sctx, BTRFS_SEND_A_CLONE_LEN, len);
3562 TLV_PUT_PATH(sctx, BTRFS_SEND_A_PATH, p);
3564 if (clone_root2 == sctx->send_root) {
3565 ret = get_inode_info(sctx->send_root, clone_root->ino, NULL,
3566 &gen, NULL, NULL, NULL, NULL);
3569 ret = get_cur_path(sctx, clone_root->ino, gen, p);
3571 ret = get_inode_path(sctx, clone_root2, clone_root->ino, p);
3576 TLV_PUT_UUID(sctx, BTRFS_SEND_A_CLONE_UUID,
3577 clone_root2->root_item.uuid);
3578 TLV_PUT_U64(sctx, BTRFS_SEND_A_CLONE_CTRANSID,
3579 clone_root2->root_item.ctransid);
3580 TLV_PUT_PATH(sctx, BTRFS_SEND_A_CLONE_PATH, p);
3581 TLV_PUT_U64(sctx, BTRFS_SEND_A_CLONE_OFFSET,
3582 clone_root->offset);
3584 ret = send_cmd(sctx);
3588 fs_path_free(sctx, p);
3592 static int send_write_or_clone(struct send_ctx *sctx,
3593 struct btrfs_path *path,
3594 struct btrfs_key *key,
3595 struct clone_root *clone_root)
3598 struct btrfs_file_extent_item *ei;
3599 u64 offset = key->offset;
3605 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
3606 struct btrfs_file_extent_item);
3607 type = btrfs_file_extent_type(path->nodes[0], ei);
3608 if (type == BTRFS_FILE_EXTENT_INLINE)
3609 len = btrfs_file_extent_inline_len(path->nodes[0], ei);
3611 len = btrfs_file_extent_num_bytes(path->nodes[0], ei);
3613 if (offset + len > sctx->cur_inode_size)
3614 len = sctx->cur_inode_size - offset;
3623 if (l > BTRFS_SEND_READ_SIZE)
3624 l = BTRFS_SEND_READ_SIZE;
3625 ret = send_write(sctx, pos + offset, l);
3634 ret = send_clone(sctx, offset, len, clone_root);
3641 static int is_extent_unchanged(struct send_ctx *sctx,
3642 struct btrfs_path *left_path,
3643 struct btrfs_key *ekey)
3646 struct btrfs_key key;
3647 struct btrfs_path *path = NULL;
3648 struct extent_buffer *eb;
3650 struct btrfs_key found_key;
3651 struct btrfs_file_extent_item *ei;
3656 u64 left_offset_fixed;
3662 path = alloc_path_for_send();
3666 eb = left_path->nodes[0];
3667 slot = left_path->slots[0];
3669 ei = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
3670 left_type = btrfs_file_extent_type(eb, ei);
3671 left_disknr = btrfs_file_extent_disk_bytenr(eb, ei);
3672 left_len = btrfs_file_extent_num_bytes(eb, ei);
3673 left_offset = btrfs_file_extent_offset(eb, ei);
3675 if (left_type != BTRFS_FILE_EXTENT_REG) {
3681 * Following comments will refer to these graphics. L is the left
3682 * extents which we are checking at the moment. 1-8 are the right
3683 * extents that we iterate.
3686 * |-1-|-2a-|-3-|-4-|-5-|-6-|
3689 * |--1--|-2b-|...(same as above)
3691 * Alternative situation. Happens on files where extents got split.
3693 * |-----------7-----------|-6-|
3695 * Alternative situation. Happens on files which got larger.
3698 * Nothing follows after 8.
3701 key.objectid = ekey->objectid;
3702 key.type = BTRFS_EXTENT_DATA_KEY;
3703 key.offset = ekey->offset;
3704 ret = btrfs_search_slot_for_read(sctx->parent_root, &key, path, 0, 0);
3713 * Handle special case where the right side has no extents at all.
3715 eb = path->nodes[0];
3716 slot = path->slots[0];
3717 btrfs_item_key_to_cpu(eb, &found_key, slot);
3718 if (found_key.objectid != key.objectid ||
3719 found_key.type != key.type) {
3725 * We're now on 2a, 2b or 7.
3728 while (key.offset < ekey->offset + left_len) {
3729 ei = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
3730 right_type = btrfs_file_extent_type(eb, ei);
3731 right_disknr = btrfs_file_extent_disk_bytenr(eb, ei);
3732 right_len = btrfs_file_extent_num_bytes(eb, ei);
3733 right_offset = btrfs_file_extent_offset(eb, ei);
3735 if (right_type != BTRFS_FILE_EXTENT_REG) {
3741 * Are we at extent 8? If yes, we know the extent is changed.
3742 * This may only happen on the first iteration.
3744 if (found_key.offset + right_len < ekey->offset) {
3749 left_offset_fixed = left_offset;
3750 if (key.offset < ekey->offset) {
3751 /* Fix the right offset for 2a and 7. */
3752 right_offset += ekey->offset - key.offset;
3754 /* Fix the left offset for all behind 2a and 2b */
3755 left_offset_fixed += key.offset - ekey->offset;
3759 * Check if we have the same extent.
3761 if (left_disknr + left_offset_fixed !=
3762 right_disknr + right_offset) {
3768 * Go to the next extent.
3770 ret = btrfs_next_item(sctx->parent_root, path);
3774 eb = path->nodes[0];
3775 slot = path->slots[0];
3776 btrfs_item_key_to_cpu(eb, &found_key, slot);
3778 if (ret || found_key.objectid != key.objectid ||
3779 found_key.type != key.type) {
3780 key.offset += right_len;
3783 if (found_key.offset != key.offset + right_len) {
3784 /* Should really not happen */
3793 * We're now behind the left extent (treat as unchanged) or at the end
3794 * of the right side (treat as changed).
3796 if (key.offset >= ekey->offset + left_len)
3803 btrfs_free_path(path);
3807 static int process_extent(struct send_ctx *sctx,
3808 struct btrfs_path *path,
3809 struct btrfs_key *key)
3812 struct clone_root *found_clone = NULL;
3814 if (S_ISLNK(sctx->cur_inode_mode))
3817 if (sctx->parent_root && !sctx->cur_inode_new) {
3818 ret = is_extent_unchanged(sctx, path, key);
3827 ret = find_extent_clone(sctx, path, key->objectid, key->offset,
3828 sctx->cur_inode_size, &found_clone);
3829 if (ret != -ENOENT && ret < 0)
3832 ret = send_write_or_clone(sctx, path, key, found_clone);
3838 static int process_all_extents(struct send_ctx *sctx)
3841 struct btrfs_root *root;
3842 struct btrfs_path *path;
3843 struct btrfs_key key;
3844 struct btrfs_key found_key;
3845 struct extent_buffer *eb;
3848 root = sctx->send_root;
3849 path = alloc_path_for_send();
3853 key.objectid = sctx->cmp_key->objectid;
3854 key.type = BTRFS_EXTENT_DATA_KEY;
3857 ret = btrfs_search_slot_for_read(root, &key, path, 1, 0);
3865 eb = path->nodes[0];
3866 slot = path->slots[0];
3867 btrfs_item_key_to_cpu(eb, &found_key, slot);
3869 if (found_key.objectid != key.objectid ||
3870 found_key.type != key.type) {
3875 ret = process_extent(sctx, path, &found_key);
3879 btrfs_release_path(path);
3880 key.offset = found_key.offset + 1;
3884 btrfs_free_path(path);
3888 static int process_recorded_refs_if_needed(struct send_ctx *sctx, int at_end)
3892 if (sctx->cur_ino == 0)
3894 if (!at_end && sctx->cur_ino == sctx->cmp_key->objectid &&
3895 sctx->cmp_key->type <= BTRFS_INODE_REF_KEY)
3897 if (list_empty(&sctx->new_refs) && list_empty(&sctx->deleted_refs))
3900 ret = process_recorded_refs(sctx);
3906 static int finish_inode_if_needed(struct send_ctx *sctx, int at_end)
3918 ret = process_recorded_refs_if_needed(sctx, at_end);
3922 if (sctx->cur_ino == 0 || sctx->cur_inode_deleted)
3924 if (!at_end && sctx->cmp_key->objectid == sctx->cur_ino)
3927 ret = get_inode_info(sctx->send_root, sctx->cur_ino, NULL, NULL,
3928 &left_mode, &left_uid, &left_gid, NULL);
3932 if (!S_ISLNK(sctx->cur_inode_mode)) {
3933 if (!sctx->parent_root || sctx->cur_inode_new) {
3937 ret = get_inode_info(sctx->parent_root, sctx->cur_ino,
3938 NULL, NULL, &right_mode, &right_uid,
3943 if (left_uid != right_uid || left_gid != right_gid)
3945 if (left_mode != right_mode)
3950 if (S_ISREG(sctx->cur_inode_mode)) {
3951 ret = send_truncate(sctx, sctx->cur_ino, sctx->cur_inode_gen,
3952 sctx->cur_inode_size);
3958 ret = send_chown(sctx, sctx->cur_ino, sctx->cur_inode_gen,
3959 left_uid, left_gid);
3964 ret = send_chmod(sctx, sctx->cur_ino, sctx->cur_inode_gen,
3971 * Need to send that every time, no matter if it actually changed
3972 * between the two trees as we have done changes to the inode before.
3974 ret = send_utimes(sctx, sctx->cur_ino, sctx->cur_inode_gen);
3982 static int changed_inode(struct send_ctx *sctx,
3983 enum btrfs_compare_tree_result result)
3986 struct btrfs_key *key = sctx->cmp_key;
3987 struct btrfs_inode_item *left_ii = NULL;
3988 struct btrfs_inode_item *right_ii = NULL;
3992 ret = close_cur_inode_file(sctx);
3996 sctx->cur_ino = key->objectid;
3997 sctx->cur_inode_new_gen = 0;
3998 sctx->send_progress = sctx->cur_ino;
4000 if (result == BTRFS_COMPARE_TREE_NEW ||
4001 result == BTRFS_COMPARE_TREE_CHANGED) {
4002 left_ii = btrfs_item_ptr(sctx->left_path->nodes[0],
4003 sctx->left_path->slots[0],
4004 struct btrfs_inode_item);
4005 left_gen = btrfs_inode_generation(sctx->left_path->nodes[0],
4008 right_ii = btrfs_item_ptr(sctx->right_path->nodes[0],
4009 sctx->right_path->slots[0],
4010 struct btrfs_inode_item);
4011 right_gen = btrfs_inode_generation(sctx->right_path->nodes[0],
4014 if (result == BTRFS_COMPARE_TREE_CHANGED) {
4015 right_ii = btrfs_item_ptr(sctx->right_path->nodes[0],
4016 sctx->right_path->slots[0],
4017 struct btrfs_inode_item);
4019 right_gen = btrfs_inode_generation(sctx->right_path->nodes[0],
4021 if (left_gen != right_gen)
4022 sctx->cur_inode_new_gen = 1;
4025 if (result == BTRFS_COMPARE_TREE_NEW) {
4026 sctx->cur_inode_gen = left_gen;
4027 sctx->cur_inode_new = 1;
4028 sctx->cur_inode_deleted = 0;
4029 sctx->cur_inode_size = btrfs_inode_size(
4030 sctx->left_path->nodes[0], left_ii);
4031 sctx->cur_inode_mode = btrfs_inode_mode(
4032 sctx->left_path->nodes[0], left_ii);
4033 if (sctx->cur_ino != BTRFS_FIRST_FREE_OBJECTID)
4034 ret = send_create_inode_if_needed(sctx);
4035 } else if (result == BTRFS_COMPARE_TREE_DELETED) {
4036 sctx->cur_inode_gen = right_gen;
4037 sctx->cur_inode_new = 0;
4038 sctx->cur_inode_deleted = 1;
4039 sctx->cur_inode_size = btrfs_inode_size(
4040 sctx->right_path->nodes[0], right_ii);
4041 sctx->cur_inode_mode = btrfs_inode_mode(
4042 sctx->right_path->nodes[0], right_ii);
4043 } else if (result == BTRFS_COMPARE_TREE_CHANGED) {
4044 if (sctx->cur_inode_new_gen) {
4045 sctx->cur_inode_gen = right_gen;
4046 sctx->cur_inode_new = 0;
4047 sctx->cur_inode_deleted = 1;
4048 sctx->cur_inode_size = btrfs_inode_size(
4049 sctx->right_path->nodes[0], right_ii);
4050 sctx->cur_inode_mode = btrfs_inode_mode(
4051 sctx->right_path->nodes[0], right_ii);
4052 ret = process_all_refs(sctx,
4053 BTRFS_COMPARE_TREE_DELETED);
4057 sctx->cur_inode_gen = left_gen;
4058 sctx->cur_inode_new = 1;
4059 sctx->cur_inode_deleted = 0;
4060 sctx->cur_inode_size = btrfs_inode_size(
4061 sctx->left_path->nodes[0], left_ii);
4062 sctx->cur_inode_mode = btrfs_inode_mode(
4063 sctx->left_path->nodes[0], left_ii);
4064 ret = send_create_inode_if_needed(sctx);
4068 ret = process_all_refs(sctx, BTRFS_COMPARE_TREE_NEW);
4071 ret = process_all_extents(sctx);
4074 ret = process_all_new_xattrs(sctx);
4078 sctx->cur_inode_gen = left_gen;
4079 sctx->cur_inode_new = 0;
4080 sctx->cur_inode_new_gen = 0;
4081 sctx->cur_inode_deleted = 0;
4082 sctx->cur_inode_size = btrfs_inode_size(
4083 sctx->left_path->nodes[0], left_ii);
4084 sctx->cur_inode_mode = btrfs_inode_mode(
4085 sctx->left_path->nodes[0], left_ii);
4093 static int changed_ref(struct send_ctx *sctx,
4094 enum btrfs_compare_tree_result result)
4098 BUG_ON(sctx->cur_ino != sctx->cmp_key->objectid);
4100 if (!sctx->cur_inode_new_gen &&
4101 sctx->cur_ino != BTRFS_FIRST_FREE_OBJECTID) {
4102 if (result == BTRFS_COMPARE_TREE_NEW)
4103 ret = record_new_ref(sctx);
4104 else if (result == BTRFS_COMPARE_TREE_DELETED)
4105 ret = record_deleted_ref(sctx);
4106 else if (result == BTRFS_COMPARE_TREE_CHANGED)
4107 ret = record_changed_ref(sctx);
4113 static int changed_xattr(struct send_ctx *sctx,
4114 enum btrfs_compare_tree_result result)
4118 BUG_ON(sctx->cur_ino != sctx->cmp_key->objectid);
4120 if (!sctx->cur_inode_new_gen && !sctx->cur_inode_deleted) {
4121 if (result == BTRFS_COMPARE_TREE_NEW)
4122 ret = process_new_xattr(sctx);
4123 else if (result == BTRFS_COMPARE_TREE_DELETED)
4124 ret = process_deleted_xattr(sctx);
4125 else if (result == BTRFS_COMPARE_TREE_CHANGED)
4126 ret = process_changed_xattr(sctx);
4132 static int changed_extent(struct send_ctx *sctx,
4133 enum btrfs_compare_tree_result result)
4137 BUG_ON(sctx->cur_ino != sctx->cmp_key->objectid);
4139 if (!sctx->cur_inode_new_gen && !sctx->cur_inode_deleted) {
4140 if (result != BTRFS_COMPARE_TREE_DELETED)
4141 ret = process_extent(sctx, sctx->left_path,
4149 static int changed_cb(struct btrfs_root *left_root,
4150 struct btrfs_root *right_root,
4151 struct btrfs_path *left_path,
4152 struct btrfs_path *right_path,
4153 struct btrfs_key *key,
4154 enum btrfs_compare_tree_result result,
4158 struct send_ctx *sctx = ctx;
4160 sctx->left_path = left_path;
4161 sctx->right_path = right_path;
4162 sctx->cmp_key = key;
4164 ret = finish_inode_if_needed(sctx, 0);
4168 if (key->type == BTRFS_INODE_ITEM_KEY)
4169 ret = changed_inode(sctx, result);
4170 else if (key->type == BTRFS_INODE_REF_KEY)
4171 ret = changed_ref(sctx, result);
4172 else if (key->type == BTRFS_XATTR_ITEM_KEY)
4173 ret = changed_xattr(sctx, result);
4174 else if (key->type == BTRFS_EXTENT_DATA_KEY)
4175 ret = changed_extent(sctx, result);
4181 static int full_send_tree(struct send_ctx *sctx)
4184 struct btrfs_trans_handle *trans = NULL;
4185 struct btrfs_root *send_root = sctx->send_root;
4186 struct btrfs_key key;
4187 struct btrfs_key found_key;
4188 struct btrfs_path *path;
4189 struct extent_buffer *eb;
4194 path = alloc_path_for_send();
4198 spin_lock(&send_root->root_times_lock);
4199 start_ctransid = btrfs_root_ctransid(&send_root->root_item);
4200 spin_unlock(&send_root->root_times_lock);
4202 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
4203 key.type = BTRFS_INODE_ITEM_KEY;
4208 * We need to make sure the transaction does not get committed
4209 * while we do anything on commit roots. Join a transaction to prevent
4212 trans = btrfs_join_transaction(send_root);
4213 if (IS_ERR(trans)) {
4214 ret = PTR_ERR(trans);
4220 * Make sure the tree has not changed
4222 spin_lock(&send_root->root_times_lock);
4223 ctransid = btrfs_root_ctransid(&send_root->root_item);
4224 spin_unlock(&send_root->root_times_lock);
4226 if (ctransid != start_ctransid) {
4227 WARN(1, KERN_WARNING "btrfs: the root that you're trying to "
4228 "send was modified in between. This is "
4229 "probably a bug.\n");
4234 ret = btrfs_search_slot_for_read(send_root, &key, path, 1, 0);
4242 * When someone want to commit while we iterate, end the
4243 * joined transaction and rejoin.
4245 if (btrfs_should_end_transaction(trans, send_root)) {
4246 ret = btrfs_end_transaction(trans, send_root);
4250 btrfs_release_path(path);
4254 eb = path->nodes[0];
4255 slot = path->slots[0];
4256 btrfs_item_key_to_cpu(eb, &found_key, slot);
4258 ret = changed_cb(send_root, NULL, path, NULL,
4259 &found_key, BTRFS_COMPARE_TREE_NEW, sctx);
4263 key.objectid = found_key.objectid;
4264 key.type = found_key.type;
4265 key.offset = found_key.offset + 1;
4267 ret = btrfs_next_item(send_root, path);
4277 ret = finish_inode_if_needed(sctx, 1);
4280 btrfs_free_path(path);
4283 ret = btrfs_end_transaction(trans, send_root);
4285 btrfs_end_transaction(trans, send_root);
4290 static int send_subvol(struct send_ctx *sctx)
4294 ret = send_header(sctx);
4298 ret = send_subvol_begin(sctx);
4302 if (sctx->parent_root) {
4303 ret = btrfs_compare_trees(sctx->send_root, sctx->parent_root,
4307 ret = finish_inode_if_needed(sctx, 1);
4311 ret = full_send_tree(sctx);
4318 ret = close_cur_inode_file(sctx);
4320 close_cur_inode_file(sctx);
4322 free_recorded_refs(sctx);
4326 long btrfs_ioctl_send(struct file *mnt_file, void __user *arg_)
4329 struct btrfs_root *send_root;
4330 struct btrfs_root *clone_root;
4331 struct btrfs_fs_info *fs_info;
4332 struct btrfs_ioctl_send_args *arg = NULL;
4333 struct btrfs_key key;
4334 struct file *filp = NULL;
4335 struct send_ctx *sctx = NULL;
4337 u64 *clone_sources_tmp = NULL;
4339 if (!capable(CAP_SYS_ADMIN))
4342 send_root = BTRFS_I(fdentry(mnt_file)->d_inode)->root;
4343 fs_info = send_root->fs_info;
4345 arg = memdup_user(arg_, sizeof(*arg));
4352 if (!access_ok(VERIFY_READ, arg->clone_sources,
4353 sizeof(*arg->clone_sources *
4354 arg->clone_sources_count))) {
4359 sctx = kzalloc(sizeof(struct send_ctx), GFP_NOFS);
4365 INIT_LIST_HEAD(&sctx->new_refs);
4366 INIT_LIST_HEAD(&sctx->deleted_refs);
4367 INIT_RADIX_TREE(&sctx->name_cache, GFP_NOFS);
4368 INIT_LIST_HEAD(&sctx->name_cache_list);
4370 sctx->send_filp = fget(arg->send_fd);
4371 if (IS_ERR(sctx->send_filp)) {
4372 ret = PTR_ERR(sctx->send_filp);
4376 sctx->mnt = mnt_file->f_path.mnt;
4378 sctx->send_root = send_root;
4379 sctx->clone_roots_cnt = arg->clone_sources_count;
4381 sctx->send_max_size = BTRFS_SEND_BUF_SIZE;
4382 sctx->send_buf = vmalloc(sctx->send_max_size);
4383 if (!sctx->send_buf) {
4388 sctx->read_buf = vmalloc(BTRFS_SEND_READ_SIZE);
4389 if (!sctx->read_buf) {
4394 sctx->clone_roots = vzalloc(sizeof(struct clone_root) *
4395 (arg->clone_sources_count + 1));
4396 if (!sctx->clone_roots) {
4401 if (arg->clone_sources_count) {
4402 clone_sources_tmp = vmalloc(arg->clone_sources_count *
4403 sizeof(*arg->clone_sources));
4404 if (!clone_sources_tmp) {
4409 ret = copy_from_user(clone_sources_tmp, arg->clone_sources,
4410 arg->clone_sources_count *
4411 sizeof(*arg->clone_sources));
4417 for (i = 0; i < arg->clone_sources_count; i++) {
4418 key.objectid = clone_sources_tmp[i];
4419 key.type = BTRFS_ROOT_ITEM_KEY;
4420 key.offset = (u64)-1;
4421 clone_root = btrfs_read_fs_root_no_name(fs_info, &key);
4426 if (IS_ERR(clone_root)) {
4427 ret = PTR_ERR(clone_root);
4430 sctx->clone_roots[i].root = clone_root;
4432 vfree(clone_sources_tmp);
4433 clone_sources_tmp = NULL;
4436 if (arg->parent_root) {
4437 key.objectid = arg->parent_root;
4438 key.type = BTRFS_ROOT_ITEM_KEY;
4439 key.offset = (u64)-1;
4440 sctx->parent_root = btrfs_read_fs_root_no_name(fs_info, &key);
4441 if (!sctx->parent_root) {
4448 * Clones from send_root are allowed, but only if the clone source
4449 * is behind the current send position. This is checked while searching
4450 * for possible clone sources.
4452 sctx->clone_roots[sctx->clone_roots_cnt++].root = sctx->send_root;
4454 /* We do a bsearch later */
4455 sort(sctx->clone_roots, sctx->clone_roots_cnt,
4456 sizeof(*sctx->clone_roots), __clone_root_cmp_sort,
4459 ret = send_subvol(sctx);
4463 ret = begin_cmd(sctx, BTRFS_SEND_C_END);
4466 ret = send_cmd(sctx);
4474 vfree(clone_sources_tmp);
4477 if (sctx->send_filp)
4478 fput(sctx->send_filp);
4480 vfree(sctx->clone_roots);
4481 vfree(sctx->send_buf);
4482 vfree(sctx->read_buf);
4484 name_cache_free(sctx);