| /* |
| * Copyright (C) 2007 Oracle. All rights reserved. |
| * |
| * This program is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU General Public |
| * License v2 as published by the Free Software Foundation. |
| * |
| * This program is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * General Public License for more details. |
| * |
| * You should have received a copy of the GNU General Public |
| * License along with this program; if not, write to the |
| * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| * Boston, MA 021110-1307, USA. |
| */ |
| |
| #ifndef __IOCTL_ |
| #define __IOCTL_ |
| #include <linux/ioctl.h> |
| |
| #define BTRFS_IOCTL_MAGIC 0x94 |
| #define BTRFS_VOL_NAME_MAX 255 |
| |
| /* this should be 4k */ |
| #define BTRFS_PATH_NAME_MAX 4087 |
| struct btrfs_ioctl_vol_args { |
| __s64 fd; |
| char name[BTRFS_PATH_NAME_MAX + 1]; |
| }; |
| |
| #define BTRFS_SUBVOL_CREATE_ASYNC (1ULL << 0) |
| #define BTRFS_SUBVOL_RDONLY (1ULL << 1) |
| |
| #define BTRFS_SUBVOL_NAME_MAX 4039 |
| struct btrfs_ioctl_vol_args_v2 { |
| __s64 fd; |
| __u64 transid; |
| __u64 flags; |
| __u64 unused[4]; |
| char name[BTRFS_SUBVOL_NAME_MAX + 1]; |
| }; |
| |
| /* |
| * structure to report errors and progress to userspace, either as a |
| * result of a finished scrub, a canceled scrub or a progress inquiry |
| */ |
| struct btrfs_scrub_progress { |
| __u64 data_extents_scrubbed; /* # of data extents scrubbed */ |
| __u64 tree_extents_scrubbed; /* # of tree extents scrubbed */ |
| __u64 data_bytes_scrubbed; /* # of data bytes scrubbed */ |
| __u64 tree_bytes_scrubbed; /* # of tree bytes scrubbed */ |
| __u64 read_errors; /* # of read errors encountered (EIO) */ |
| __u64 csum_errors; /* # of failed csum checks */ |
| __u64 verify_errors; /* # of occurences, where the metadata |
| * of a tree block did not match the |
| * expected values, like generation or |
| * logical */ |
| __u64 no_csum; /* # of 4k data block for which no csum |
| * is present, probably the result of |
| * data written with nodatasum */ |
| __u64 csum_discards; /* # of csum for which no data was found |
| * in the extent tree. */ |
| __u64 super_errors; /* # of bad super blocks encountered */ |
| __u64 malloc_errors; /* # of internal kmalloc errors. These |
| * will likely cause an incomplete |
| * scrub */ |
| __u64 uncorrectable_errors; /* # of errors where either no intact |
| * copy was found or the writeback |
| * failed */ |
| __u64 corrected_errors; /* # of errors corrected */ |
| __u64 last_physical; /* last physical address scrubbed. In |
| * case a scrub was aborted, this can |
| * be used to restart the scrub */ |
| __u64 unverified_errors; /* # of occurences where a read for a |
| * full (64k) bio failed, but the re- |
| * check succeeded for each 4k piece. |
| * Intermittent error. */ |
| }; |
| |
| #define BTRFS_INO_LOOKUP_PATH_MAX 4080 |
| struct btrfs_ioctl_ino_lookup_args { |
| __u64 treeid; |
| __u64 objectid; |
| char name[BTRFS_INO_LOOKUP_PATH_MAX]; |
| }; |
| |
| struct btrfs_ioctl_search_key { |
| /* which root are we searching. 0 is the tree of tree roots */ |
| __u64 tree_id; |
| |
| /* keys returned will be >= min and <= max */ |
| __u64 min_objectid; |
| __u64 max_objectid; |
| |
| /* keys returned will be >= min and <= max */ |
| __u64 min_offset; |
| __u64 max_offset; |
| |
| /* max and min transids to search for */ |
| __u64 min_transid; |
| __u64 max_transid; |
| |
| /* keys returned will be >= min and <= max */ |
| __u32 min_type; |
| __u32 max_type; |
| |
| /* |
| * how many items did userland ask for, and how many are we |
| * returning |
| */ |
| __u32 nr_items; |
| |
| /* align to 64 bits */ |
| __u32 unused; |
| |
| /* some extra for later */ |
| __u64 unused1; |
| __u64 unused2; |
| __u64 unused3; |
| __u64 unused4; |
| }; |
| |
| struct btrfs_ioctl_search_header { |
| __u64 transid; |
| __u64 objectid; |
| __u64 offset; |
| __u32 type; |
| __u32 len; |
| }; |
| |
| #define BTRFS_SEARCH_ARGS_BUFSIZE (4096 - sizeof(struct btrfs_ioctl_search_key)) |
| /* |
| * the buf is an array of search headers where |
| * each header is followed by the actual item |
| * the type field is expanded to 32 bits for alignment |
| */ |
| struct btrfs_ioctl_search_args { |
| struct btrfs_ioctl_search_key key; |
| char buf[BTRFS_SEARCH_ARGS_BUFSIZE]; |
| }; |
| |
| struct btrfs_ioctl_clone_range_args { |
| __s64 src_fd; |
| __u64 src_offset, src_length; |
| __u64 dest_offset; |
| }; |
| |
| /* flags for the defrag range ioctl */ |
| #define BTRFS_DEFRAG_RANGE_COMPRESS 1 |
| #define BTRFS_DEFRAG_RANGE_START_IO 2 |
| |
| struct btrfs_ioctl_defrag_range_args { |
| /* start of the defrag operation */ |
| __u64 start; |
| |
| /* number of bytes to defrag, use (u64)-1 to say all */ |
| __u64 len; |
| |
| /* |
| * flags for the operation, which can include turning |
| * on compression for this one defrag |
| */ |
| __u64 flags; |
| |
| /* |
| * any extent bigger than this will be considered |
| * already defragged. Use 0 to take the kernel default |
| * Use 1 to say every single extent must be rewritten |
| */ |
| __u32 extent_thresh; |
| |
| /* |
| * which compression method to use if turning on compression |
| * for this defrag operation. If unspecified, zlib will |
| * be used |
| */ |
| __u32 compress_type; |
| |
| /* spare for later */ |
| __u32 unused[4]; |
| }; |
| |
| struct btrfs_ioctl_space_info { |
| __u64 flags; |
| __u64 total_bytes; |
| __u64 used_bytes; |
| }; |
| |
| struct btrfs_ioctl_space_args { |
| __u64 space_slots; |
| __u64 total_spaces; |
| struct btrfs_ioctl_space_info spaces[0]; |
| }; |
| |
| #define BTRFS_IOC_SNAP_CREATE _IOW(BTRFS_IOCTL_MAGIC, 1, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_DEFRAG _IOW(BTRFS_IOCTL_MAGIC, 2, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_RESIZE _IOW(BTRFS_IOCTL_MAGIC, 3, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_SCAN_DEV _IOW(BTRFS_IOCTL_MAGIC, 4, \ |
| struct btrfs_ioctl_vol_args) |
| /* trans start and trans end are dangerous, and only for |
| * use by applications that know how to avoid the |
| * resulting deadlocks |
| */ |
| #define BTRFS_IOC_TRANS_START _IO(BTRFS_IOCTL_MAGIC, 6) |
| #define BTRFS_IOC_TRANS_END _IO(BTRFS_IOCTL_MAGIC, 7) |
| #define BTRFS_IOC_SYNC _IO(BTRFS_IOCTL_MAGIC, 8) |
| |
| #define BTRFS_IOC_CLONE _IOW(BTRFS_IOCTL_MAGIC, 9, int) |
| #define BTRFS_IOC_ADD_DEV _IOW(BTRFS_IOCTL_MAGIC, 10, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_RM_DEV _IOW(BTRFS_IOCTL_MAGIC, 11, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_BALANCE _IOW(BTRFS_IOCTL_MAGIC, 12, \ |
| struct btrfs_ioctl_vol_args) |
| |
| #define BTRFS_IOC_CLONE_RANGE _IOW(BTRFS_IOCTL_MAGIC, 13, \ |
| struct btrfs_ioctl_clone_range_args) |
| |
| #define BTRFS_IOC_SUBVOL_CREATE _IOW(BTRFS_IOCTL_MAGIC, 14, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_SNAP_DESTROY _IOW(BTRFS_IOCTL_MAGIC, 15, \ |
| struct btrfs_ioctl_vol_args) |
| #define BTRFS_IOC_DEFRAG_RANGE _IOW(BTRFS_IOCTL_MAGIC, 16, \ |
| struct btrfs_ioctl_defrag_range_args) |
| #define BTRFS_IOC_TREE_SEARCH _IOWR(BTRFS_IOCTL_MAGIC, 17, \ |
| struct btrfs_ioctl_search_args) |
| #define BTRFS_IOC_INO_LOOKUP _IOWR(BTRFS_IOCTL_MAGIC, 18, \ |
| struct btrfs_ioctl_ino_lookup_args) |
| #define BTRFS_IOC_DEFAULT_SUBVOL _IOW(BTRFS_IOCTL_MAGIC, 19, u64) |
| #define BTRFS_IOC_SPACE_INFO _IOWR(BTRFS_IOCTL_MAGIC, 20, \ |
| struct btrfs_ioctl_space_args) |
| #define BTRFS_IOC_START_SYNC _IOR(BTRFS_IOCTL_MAGIC, 24, __u64) |
| #define BTRFS_IOC_WAIT_SYNC _IOW(BTRFS_IOCTL_MAGIC, 22, __u64) |
| #define BTRFS_IOC_SNAP_CREATE_V2 _IOW(BTRFS_IOCTL_MAGIC, 23, \ |
| struct btrfs_ioctl_vol_args_v2) |
| #define BTRFS_IOC_SUBVOL_GETFLAGS _IOW(BTRFS_IOCTL_MAGIC, 25, __u64) |
| #define BTRFS_IOC_SUBVOL_SETFLAGS _IOW(BTRFS_IOCTL_MAGIC, 26, __u64) |
| #endif |