send-utils.h

   1 /*
   2  * Copyright (C) 2012 Alexander Block.  All rights reserved.
   3  *
   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.
   7  *
   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.
  12  *
  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.
  17  */
  18
  19 #ifndef __BTRFS_SEND_UTILS_H__
  20 #define __BTRFS_SEND_UTILS_H__
  21
  22 #if BTRFS_FLAT_INCLUDES
  23 #include "ctree.h"
  24 #include "rbtree.h"
  25 #else
  26 #include <btrfs/ctree.h>
  27 #include <btrfs/rbtree.h>
  28 #endif /* BTRFS_FLAT_INCLUDES */
  29
  30 #ifdef __cplusplus
  31 extern "C" {
  32 #endif
  33
  34 /*
  35  * Compatibility code for kernels < 3.12; the UUID tree is not available there
  36  * and we have to do the slow search. This should be deprecated someday.
  37  */
  38 #define BTRFS_COMPAT_SEND_NO_UUID_TREE 1
  39
  40 enum subvol_search_type {
  41         subvol_search_by_root_id,
  42         subvol_search_by_uuid,
  43         subvol_search_by_received_uuid,
  44         subvol_search_by_path,
  45 };
  46
  47 struct subvol_info {
  48 #ifdef BTRFS_COMPAT_SEND_NO_UUID_TREE
  49         struct rb_node rb_root_id_node;
  50         struct rb_node rb_local_node;
  51         struct rb_node rb_received_node;
  52         struct rb_node rb_path_node;
  53 #endif
  54
  55         u64 root_id;
  56         u8 uuid[BTRFS_UUID_SIZE];
  57         u8 parent_uuid[BTRFS_UUID_SIZE];
  58         u8 received_uuid[BTRFS_UUID_SIZE];
  59         u64 ctransid;
  60         u64 otransid;
  61         u64 stransid;
  62         u64 rtransid;
  63
  64         char *path;
  65 };
  66
  67 struct subvol_uuid_search {
  68         int mnt_fd;
  69 #ifdef BTRFS_COMPAT_SEND_NO_UUID_TREE
  70         int uuid_tree_existed;
  71
  72         struct rb_root root_id_subvols;
  73         struct rb_root local_subvols;
  74         struct rb_root received_subvols;
  75         struct rb_root path_subvols;
  76 #endif
  77 };
  78
  79 int subvol_uuid_search_init(int mnt_fd, struct subvol_uuid_search *s);
  80 void subvol_uuid_search_finit(struct subvol_uuid_search *s);
  81 struct subvol_info *subvol_uuid_search(struct subvol_uuid_search *s,
  82                                        u64 root_id, const u8 *uuid, u64 transid,
  83                                        const char *path,
  84                                        enum subvol_search_type type);
  85 void subvol_uuid_search_add(struct subvol_uuid_search *s,
  86                             struct subvol_info *si);
  87
  88 int btrfs_subvolid_resolve(int fd, char *path, size_t path_len, u64 subvol_id);
  89
  90 char *path_cat(const char *p1, const char *p2);
  91 char *path_cat3(const char *p1, const char *p2, const char *p3);
  92
  93 #ifdef __cplusplus
  94 }
  95 #endif
  96
  97 #endif