xref: /linux/fs/btrfs/ioctl.h (revision d39d0ed196aa1685bb24771e92f78633c66ac9cb)
1 /*
2  * Copyright (C) 2007 Oracle.  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 __IOCTL_
20 #define __IOCTL_
21 #include <linux/ioctl.h>
22 
23 #define BTRFS_IOCTL_MAGIC 0x94
24 #define BTRFS_VOL_NAME_MAX 255
25 #define BTRFS_PATH_NAME_MAX 4087
26 
27 /* this should be 4k */
28 struct btrfs_ioctl_vol_args {
29 	__s64 fd;
30 	char name[BTRFS_PATH_NAME_MAX + 1];
31 };
32 
33 #define BTRFS_INO_LOOKUP_PATH_MAX 4080
34 struct btrfs_ioctl_ino_lookup_args {
35 	__u64 treeid;
36 	__u64 objectid;
37 	char name[BTRFS_INO_LOOKUP_PATH_MAX];
38 };
39 
40 struct btrfs_ioctl_search_key {
41 	/* which root are we searching.  0 is the tree of tree roots */
42 	__u64 tree_id;
43 
44 	/* keys returned will be >= min and <= max */
45 	__u64 min_objectid;
46 	__u64 max_objectid;
47 
48 	/* keys returned will be >= min and <= max */
49 	__u64 min_offset;
50 	__u64 max_offset;
51 
52 	/* max and min transids to search for */
53 	__u64 min_transid;
54 	__u64 max_transid;
55 
56 	/* keys returned will be >= min and <= max */
57 	__u32 min_type;
58 	__u32 max_type;
59 
60 	/*
61 	 * how many items did userland ask for, and how many are we
62 	 * returning
63 	 */
64 	__u32 nr_items;
65 
66 	/* align to 64 bits */
67 	__u32 unused;
68 
69 	/* some extra for later */
70 	__u64 unused1;
71 	__u64 unused2;
72 	__u64 unused3;
73 	__u64 unused4;
74 };
75 
76 struct btrfs_ioctl_search_header {
77 	__u64 transid;
78 	__u64 objectid;
79 	__u64 offset;
80 	__u32 type;
81 	__u32 len;
82 };
83 
84 #define BTRFS_SEARCH_ARGS_BUFSIZE (4096 - sizeof(struct btrfs_ioctl_search_key))
85 /*
86  * the buf is an array of search headers where
87  * each header is followed by the actual item
88  * the type field is expanded to 32 bits for alignment
89  */
90 struct btrfs_ioctl_search_args {
91 	struct btrfs_ioctl_search_key key;
92 	char buf[BTRFS_SEARCH_ARGS_BUFSIZE];
93 };
94 
95 struct btrfs_ioctl_clone_range_args {
96   __s64 src_fd;
97   __u64 src_offset, src_length;
98   __u64 dest_offset;
99 };
100 
101 /* flags for the defrag range ioctl */
102 #define BTRFS_DEFRAG_RANGE_COMPRESS 1
103 #define BTRFS_DEFRAG_RANGE_START_IO 2
104 
105 struct btrfs_ioctl_defrag_range_args {
106 	/* start of the defrag operation */
107 	__u64 start;
108 
109 	/* number of bytes to defrag, use (u64)-1 to say all */
110 	__u64 len;
111 
112 	/*
113 	 * flags for the operation, which can include turning
114 	 * on compression for this one defrag
115 	 */
116 	__u64 flags;
117 
118 	/*
119 	 * any extent bigger than this will be considered
120 	 * already defragged.  Use 0 to take the kernel default
121 	 * Use 1 to say every single extent must be rewritten
122 	 */
123 	__u32 extent_thresh;
124 
125 	/* spare for later */
126 	__u32 unused[5];
127 };
128 
129 struct btrfs_ioctl_space_info {
130 	__u64 flags;
131 	__u64 total_bytes;
132 	__u64 used_bytes;
133 };
134 
135 struct btrfs_ioctl_space_args {
136 	__u64 space_slots;
137 	__u64 total_spaces;
138 	struct btrfs_ioctl_space_info spaces[0];
139 };
140 
141 #define BTRFS_IOC_SNAP_CREATE _IOW(BTRFS_IOCTL_MAGIC, 1, \
142 				   struct btrfs_ioctl_vol_args)
143 #define BTRFS_IOC_DEFRAG _IOW(BTRFS_IOCTL_MAGIC, 2, \
144 				   struct btrfs_ioctl_vol_args)
145 #define BTRFS_IOC_RESIZE _IOW(BTRFS_IOCTL_MAGIC, 3, \
146 				   struct btrfs_ioctl_vol_args)
147 #define BTRFS_IOC_SCAN_DEV _IOW(BTRFS_IOCTL_MAGIC, 4, \
148 				   struct btrfs_ioctl_vol_args)
149 /* trans start and trans end are dangerous, and only for
150  * use by applications that know how to avoid the
151  * resulting deadlocks
152  */
153 #define BTRFS_IOC_TRANS_START  _IO(BTRFS_IOCTL_MAGIC, 6)
154 #define BTRFS_IOC_TRANS_END    _IO(BTRFS_IOCTL_MAGIC, 7)
155 #define BTRFS_IOC_SYNC         _IO(BTRFS_IOCTL_MAGIC, 8)
156 
157 #define BTRFS_IOC_CLONE        _IOW(BTRFS_IOCTL_MAGIC, 9, int)
158 #define BTRFS_IOC_ADD_DEV _IOW(BTRFS_IOCTL_MAGIC, 10, \
159 				   struct btrfs_ioctl_vol_args)
160 #define BTRFS_IOC_RM_DEV _IOW(BTRFS_IOCTL_MAGIC, 11, \
161 				   struct btrfs_ioctl_vol_args)
162 #define BTRFS_IOC_BALANCE _IOW(BTRFS_IOCTL_MAGIC, 12, \
163 				   struct btrfs_ioctl_vol_args)
164 
165 #define BTRFS_IOC_CLONE_RANGE _IOW(BTRFS_IOCTL_MAGIC, 13, \
166 				  struct btrfs_ioctl_clone_range_args)
167 
168 #define BTRFS_IOC_SUBVOL_CREATE _IOW(BTRFS_IOCTL_MAGIC, 14, \
169 				   struct btrfs_ioctl_vol_args)
170 #define BTRFS_IOC_SNAP_DESTROY _IOW(BTRFS_IOCTL_MAGIC, 15, \
171 				struct btrfs_ioctl_vol_args)
172 #define BTRFS_IOC_DEFRAG_RANGE _IOW(BTRFS_IOCTL_MAGIC, 16, \
173 				struct btrfs_ioctl_defrag_range_args)
174 #define BTRFS_IOC_TREE_SEARCH _IOWR(BTRFS_IOCTL_MAGIC, 17, \
175 				   struct btrfs_ioctl_search_args)
176 #define BTRFS_IOC_INO_LOOKUP _IOWR(BTRFS_IOCTL_MAGIC, 18, \
177 				   struct btrfs_ioctl_ino_lookup_args)
178 #define BTRFS_IOC_DEFAULT_SUBVOL _IOW(BTRFS_IOCTL_MAGIC, 19, u64)
179 #define BTRFS_IOC_SPACE_INFO _IOWR(BTRFS_IOCTL_MAGIC, 20, \
180 				    struct btrfs_ioctl_space_args)
181 #endif
182