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 <sys/ioctl.h>
22 #include "send-utils.h"
26 char *path_for_root(int fd, u64 root);
28 static struct rb_node *tree_insert(struct rb_root *root,
29 struct subvol_info *si,
30 enum subvol_search_type type)
32 struct rb_node ** p = &root->rb_node;
33 struct rb_node * parent = NULL;
34 struct subvol_info *entry;
39 if (type == subvol_search_by_received_uuid) {
40 entry = rb_entry(parent, struct subvol_info,
43 comp = memcmp(entry->received_uuid, si->received_uuid,
46 if (entry->stransid < si->stransid)
48 else if (entry->stransid > si->stransid)
53 } else if (type == subvol_search_by_uuid) {
54 entry = rb_entry(parent, struct subvol_info,
56 comp = memcmp(entry->uuid, si->uuid, BTRFS_UUID_SIZE);
57 } else if (type == subvol_search_by_root_id) {
58 entry = rb_entry(parent, struct subvol_info,
60 comp = entry->root_id - si->root_id;
61 } else if (type == subvol_search_by_path) {
62 entry = rb_entry(parent, struct subvol_info,
64 comp = strcmp(entry->path, si->path);
77 if (type == subvol_search_by_received_uuid) {
78 rb_link_node(&si->rb_received_node, parent, p);
79 rb_insert_color(&si->rb_received_node, root);
80 } else if (type == subvol_search_by_uuid) {
81 rb_link_node(&si->rb_local_node, parent, p);
82 rb_insert_color(&si->rb_local_node, root);
83 } else if (type == subvol_search_by_root_id) {
84 rb_link_node(&si->rb_root_id_node, parent, p);
85 rb_insert_color(&si->rb_root_id_node, root);
86 } else if (type == subvol_search_by_path) {
87 rb_link_node(&si->rb_path_node, parent, p);
88 rb_insert_color(&si->rb_path_node, root);
93 static struct subvol_info *tree_search(struct rb_root *root,
94 u64 root_id, const u8 *uuid,
95 u64 stransid, const char *path,
96 enum subvol_search_type type)
98 struct rb_node * n = root->rb_node;
99 struct subvol_info *entry;
103 if (type == subvol_search_by_received_uuid) {
104 entry = rb_entry(n, struct subvol_info,
106 comp = memcmp(entry->received_uuid, uuid,
109 if (entry->stransid < stransid)
111 else if (entry->stransid > stransid)
116 } else if (type == subvol_search_by_uuid) {
117 entry = rb_entry(n, struct subvol_info, rb_local_node);
118 comp = memcmp(entry->uuid, uuid, BTRFS_UUID_SIZE);
119 } else if (type == subvol_search_by_root_id) {
120 entry = rb_entry(n, struct subvol_info, rb_root_id_node);
121 comp = entry->root_id - root_id;
122 } else if (type == subvol_search_by_path) {
123 entry = rb_entry(n, struct subvol_info, rb_path_node);
124 comp = strcmp(entry->path, path);
138 static int count_bytes(void *buf, int len, char b)
142 for (i = 0; i < len; i++) {
143 if (((char*)buf)[i] == b)
149 void subvol_uuid_search_add(struct subvol_uuid_search *s,
150 struct subvol_info *si)
154 tree_insert(&s->root_id_subvols, si, subvol_search_by_root_id);
155 tree_insert(&s->path_subvols, si, subvol_search_by_path);
157 cnt = count_bytes(si->uuid, BTRFS_UUID_SIZE, 0);
158 if (cnt != BTRFS_UUID_SIZE)
159 tree_insert(&s->local_subvols, si, subvol_search_by_uuid);
160 cnt = count_bytes(si->received_uuid, BTRFS_UUID_SIZE, 0);
161 if (cnt != BTRFS_UUID_SIZE)
162 tree_insert(&s->received_subvols, si,
163 subvol_search_by_received_uuid);
166 struct subvol_info *subvol_uuid_search(struct subvol_uuid_search *s,
167 u64 root_id, const u8 *uuid, u64 transid,
169 enum subvol_search_type type)
171 struct rb_root *root;
172 if (type == subvol_search_by_received_uuid)
173 root = &s->received_subvols;
174 else if (type == subvol_search_by_uuid)
175 root = &s->local_subvols;
176 else if (type == subvol_search_by_root_id)
177 root = &s->root_id_subvols;
178 else if (type == subvol_search_by_path)
179 root = &s->path_subvols;
182 return tree_search(root, root_id, uuid, transid, path, type);
185 int subvol_uuid_search_init(int mnt_fd, struct subvol_uuid_search *s)
188 struct btrfs_ioctl_search_args args;
189 struct btrfs_ioctl_search_key *sk = &args.key;
190 struct btrfs_ioctl_search_header *sh;
191 struct btrfs_root_item *root_item_ptr;
192 struct btrfs_root_item root_item;
193 struct subvol_info *si = NULL;
194 int root_item_valid = 0;
195 unsigned long off = 0;
200 memset(&args, 0, sizeof(args));
202 sk->tree_id = BTRFS_ROOT_TREE_OBJECTID;
204 sk->max_objectid = (u64)-1;
205 sk->max_offset = (u64)-1;
206 sk->max_transid = (u64)-1;
207 sk->min_type = BTRFS_ROOT_ITEM_KEY;
208 sk->max_type = BTRFS_ROOT_BACKREF_KEY;
212 ret = ioctl(mnt_fd, BTRFS_IOC_TREE_SEARCH, &args);
215 fprintf(stderr, "ERROR: can't perform the search- %s\n",
219 if (sk->nr_items == 0)
224 for (i = 0; i < sk->nr_items; i++) {
225 sh = (struct btrfs_ioctl_search_header *)(args.buf +
229 if ((sh->objectid != 5 &&
230 sh->objectid < BTRFS_FIRST_FREE_OBJECTID) ||
231 sh->objectid == BTRFS_FREE_INO_OBJECTID)
234 if (sh->type == BTRFS_ROOT_ITEM_KEY) {
235 /* older kernels don't have uuids+times */
236 if (sh->len < sizeof(root_item)) {
240 root_item_ptr = (struct btrfs_root_item *)
242 memcpy(&root_item, root_item_ptr,
245 } else if (sh->type == BTRFS_ROOT_BACKREF_KEY) {
246 if (!root_item_valid)
249 path = path_for_root(mnt_fd, sh->objectid);
254 fprintf(stderr, "ERROR: unable to "
261 si = calloc(1, sizeof(*si));
262 si->root_id = sh->objectid;
263 memcpy(si->uuid, root_item.uuid,
265 memcpy(si->parent_uuid, root_item.parent_uuid,
267 memcpy(si->received_uuid,
268 root_item.received_uuid,
270 si->ctransid = btrfs_root_ctransid(&root_item);
271 si->otransid = btrfs_root_otransid(&root_item);
272 si->stransid = btrfs_root_stransid(&root_item);
273 si->rtransid = btrfs_root_rtransid(&root_item);
275 subvol_uuid_search_add(s, si);
286 * record the mins in sk so we can make sure the
287 * next search doesn't repeat this root
289 sk->min_objectid = sh->objectid;
290 sk->min_offset = sh->offset;
291 sk->min_type = sh->type;
294 if (sk->min_offset < (u64)-1)
296 else if (sk->min_objectid < (u64)-1) {
309 char *path_cat(const char *p1, const char *p2)
311 int p1_len = strlen(p1);
312 int p2_len = strlen(p2);
313 char *new = malloc(p1_len + p2_len + 3);
315 if (p1_len && p1[p1_len - 1] == '/')
317 if (p2_len && p2[p2_len - 1] == '/')
319 sprintf(new, "%.*s/%.*s", p1_len, p1, p2_len, p2);
324 char *path_cat3(const char *p1, const char *p2, const char *p3)
326 int p1_len = strlen(p1);
327 int p2_len = strlen(p2);
328 int p3_len = strlen(p3);
329 char *new = malloc(p1_len + p2_len + p3_len + 4);
331 if (p1_len && p1[p1_len - 1] == '/')
333 if (p2_len && p2[p2_len - 1] == '/')
335 if (p3_len && p3[p3_len - 1] == '/')
337 sprintf(new, "%.*s/%.*s/%.*s", p1_len, p1, p2_len, p2, p3_len, p3);