Add btrfs-list for listing subvolumes
[btrfs-progs-unstable/devel.git] / ioctl.h
blobb0e5c0db374ad3652698496ee8b9af78d34d4e48
1 /*
2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #ifndef __IOCTL_
20 #define __IOCTL_
21 #include <asm/types.h>
22 #include <linux/ioctl.h>
24 #define BTRFS_IOCTL_MAGIC 0x94
25 #define BTRFS_VOL_NAME_MAX 255
26 #define BTRFS_PATH_NAME_MAX 4087
28 struct btrfs_ioctl_vol_args {
29 __s64 fd;
30 char name[BTRFS_PATH_NAME_MAX + 1];
33 struct btrfs_ioctl_search_key {
34 /* which root are we searching. 0 is the tree of tree roots */
35 __u64 tree_id;
37 /* keys returned will be >= min and <= max */
38 __u64 min_objectid;
39 __u64 max_objectid;
41 /* keys returned will be >= min and <= max */
42 __u64 min_offset;
43 __u64 max_offset;
45 /* max and min transids to search for */
46 __u64 min_transid;
47 __u64 max_transid;
49 /* keys returned will be >= min and <= max */
50 __u32 min_type;
51 __u32 max_type;
54 * how many items did userland ask for, and how many are we
55 * returning
57 __u32 nr_items;
59 /* align to 64 bits */
60 __u32 unused;
62 /* some extra for later */
63 __u64 unused1;
64 __u64 unused2;
65 __u64 unused3;
66 __u64 unused4;
69 struct btrfs_ioctl_search_header {
70 __u64 transid;
71 __u64 objectid;
72 __u64 offset;
73 __u32 type;
74 __u32 len;
77 #define BTRFS_SEARCH_ARGS_BUFSIZE (4096 - sizeof(struct btrfs_ioctl_search_key))
79 * the buf is an array of search headers where
80 * each header is followed by the actual item
81 * the type field is expanded to 32 bits for alignment
83 struct btrfs_ioctl_search_args {
84 struct btrfs_ioctl_search_key key;
85 char buf[BTRFS_SEARCH_ARGS_BUFSIZE];
88 #define BTRFS_INO_LOOKUP_PATH_MAX 4080
89 struct btrfs_ioctl_ino_lookup_args {
90 __u64 treeid;
91 __u64 objectid;
92 char name[BTRFS_INO_LOOKUP_PATH_MAX];
95 #define BTRFS_IOC_SNAP_CREATE _IOW(BTRFS_IOCTL_MAGIC, 1, \
96 struct btrfs_ioctl_vol_args)
97 #define BTRFS_IOC_DEFRAG _IOW(BTRFS_IOCTL_MAGIC, 2, \
98 struct btrfs_ioctl_vol_args)
99 #define BTRFS_IOC_RESIZE _IOW(BTRFS_IOCTL_MAGIC, 3, \
100 struct btrfs_ioctl_vol_args)
101 #define BTRFS_IOC_SCAN_DEV _IOW(BTRFS_IOCTL_MAGIC, 4, \
102 struct btrfs_ioctl_vol_args)
103 /* trans start and trans end are dangerous, and only for
104 * use by applications that know how to avoid the
105 * resulting deadlocks
107 #define BTRFS_IOC_TRANS_START _IO(BTRFS_IOCTL_MAGIC, 6)
108 #define BTRFS_IOC_TRANS_END _IO(BTRFS_IOCTL_MAGIC, 7)
109 #define BTRFS_IOC_SYNC _IO(BTRFS_IOCTL_MAGIC, 8)
111 #define BTRFS_IOC_CLONE _IOW(BTRFS_IOCTL_MAGIC, 9, int)
112 #define BTRFS_IOC_ADD_DEV _IOW(BTRFS_IOCTL_MAGIC, 10, \
113 struct btrfs_ioctl_vol_args)
114 #define BTRFS_IOC_RM_DEV _IOW(BTRFS_IOCTL_MAGIC, 11, \
115 struct btrfs_ioctl_vol_args)
116 #define BTRFS_IOC_BALANCE _IOW(BTRFS_IOCTL_MAGIC, 12, \
117 struct btrfs_ioctl_vol_args)
118 /* 13 is for CLONE_RANGE */
119 #define BTRFS_IOC_SUBVOL_CREATE _IOW(BTRFS_IOCTL_MAGIC, 14, \
120 struct btrfs_ioctl_vol_args)
122 #define BTRFS_IOC_SNAP_DESTROY _IOW(BTRFS_IOCTL_MAGIC, 15, \
123 struct btrfs_ioctl_vol_args)
125 #define BTRFS_IOC_TREE_SEARCH _IOWR(BTRFS_IOCTL_MAGIC, 17, \
126 struct btrfs_ioctl_search_args)
127 #define BTRFS_IOC_INO_LOOKUP _IOWR(BTRFS_IOCTL_MAGIC, 18, \
128 struct btrfs_ioctl_ino_lookup_args)
129 #endif