| rjw | 1f88458 | 2022-01-06 17:20:42 +0800 | [diff] [blame] | 1 | /* | 
|  | 2 | * Copyright (C) 2013 Fusion IO.  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 | #include <linux/fs.h> | 
|  | 20 | #include <linux/mount.h> | 
|  | 21 | #include <linux/magic.h> | 
|  | 22 | #include "btrfs-tests.h" | 
|  | 23 | #include "../ctree.h" | 
|  | 24 | #include "../free-space-cache.h" | 
|  | 25 | #include "../free-space-tree.h" | 
|  | 26 | #include "../transaction.h" | 
|  | 27 | #include "../volumes.h" | 
|  | 28 | #include "../disk-io.h" | 
|  | 29 | #include "../qgroup.h" | 
|  | 30 |  | 
|  | 31 | static struct vfsmount *test_mnt = NULL; | 
|  | 32 |  | 
|  | 33 | static const struct super_operations btrfs_test_super_ops = { | 
|  | 34 | .alloc_inode	= btrfs_alloc_inode, | 
|  | 35 | .destroy_inode	= btrfs_test_destroy_inode, | 
|  | 36 | }; | 
|  | 37 |  | 
|  | 38 | static struct dentry *btrfs_test_mount(struct file_system_type *fs_type, | 
|  | 39 | int flags, const char *dev_name, | 
|  | 40 | void *data) | 
|  | 41 | { | 
|  | 42 | return mount_pseudo(fs_type, "btrfs_test:", &btrfs_test_super_ops, | 
|  | 43 | NULL, BTRFS_TEST_MAGIC); | 
|  | 44 | } | 
|  | 45 |  | 
|  | 46 | static struct file_system_type test_type = { | 
|  | 47 | .name		= "btrfs_test_fs", | 
|  | 48 | .mount		= btrfs_test_mount, | 
|  | 49 | .kill_sb	= kill_anon_super, | 
|  | 50 | }; | 
|  | 51 |  | 
|  | 52 | struct inode *btrfs_new_test_inode(void) | 
|  | 53 | { | 
|  | 54 | return new_inode(test_mnt->mnt_sb); | 
|  | 55 | } | 
|  | 56 |  | 
|  | 57 | static int btrfs_init_test_fs(void) | 
|  | 58 | { | 
|  | 59 | int ret; | 
|  | 60 |  | 
|  | 61 | ret = register_filesystem(&test_type); | 
|  | 62 | if (ret) { | 
|  | 63 | printk(KERN_ERR "btrfs: cannot register test file system\n"); | 
|  | 64 | return ret; | 
|  | 65 | } | 
|  | 66 |  | 
|  | 67 | test_mnt = kern_mount(&test_type); | 
|  | 68 | if (IS_ERR(test_mnt)) { | 
|  | 69 | printk(KERN_ERR "btrfs: cannot mount test file system\n"); | 
|  | 70 | unregister_filesystem(&test_type); | 
|  | 71 | return PTR_ERR(test_mnt); | 
|  | 72 | } | 
|  | 73 | return 0; | 
|  | 74 | } | 
|  | 75 |  | 
|  | 76 | static void btrfs_destroy_test_fs(void) | 
|  | 77 | { | 
|  | 78 | kern_unmount(test_mnt); | 
|  | 79 | unregister_filesystem(&test_type); | 
|  | 80 | } | 
|  | 81 |  | 
|  | 82 | struct btrfs_fs_info *btrfs_alloc_dummy_fs_info(u32 nodesize, u32 sectorsize) | 
|  | 83 | { | 
|  | 84 | struct btrfs_fs_info *fs_info = kzalloc(sizeof(struct btrfs_fs_info), | 
|  | 85 | GFP_KERNEL); | 
|  | 86 |  | 
|  | 87 | if (!fs_info) | 
|  | 88 | return fs_info; | 
|  | 89 | fs_info->fs_devices = kzalloc(sizeof(struct btrfs_fs_devices), | 
|  | 90 | GFP_KERNEL); | 
|  | 91 | if (!fs_info->fs_devices) { | 
|  | 92 | kfree(fs_info); | 
|  | 93 | return NULL; | 
|  | 94 | } | 
|  | 95 | fs_info->super_copy = kzalloc(sizeof(struct btrfs_super_block), | 
|  | 96 | GFP_KERNEL); | 
|  | 97 | if (!fs_info->super_copy) { | 
|  | 98 | kfree(fs_info->fs_devices); | 
|  | 99 | kfree(fs_info); | 
|  | 100 | return NULL; | 
|  | 101 | } | 
|  | 102 |  | 
|  | 103 | fs_info->nodesize = nodesize; | 
|  | 104 | fs_info->sectorsize = sectorsize; | 
|  | 105 |  | 
|  | 106 | if (init_srcu_struct(&fs_info->subvol_srcu)) { | 
|  | 107 | kfree(fs_info->fs_devices); | 
|  | 108 | kfree(fs_info->super_copy); | 
|  | 109 | kfree(fs_info); | 
|  | 110 | return NULL; | 
|  | 111 | } | 
|  | 112 |  | 
|  | 113 | spin_lock_init(&fs_info->buffer_lock); | 
|  | 114 | spin_lock_init(&fs_info->qgroup_lock); | 
|  | 115 | spin_lock_init(&fs_info->qgroup_op_lock); | 
|  | 116 | spin_lock_init(&fs_info->super_lock); | 
|  | 117 | spin_lock_init(&fs_info->fs_roots_radix_lock); | 
|  | 118 | mutex_init(&fs_info->qgroup_ioctl_lock); | 
|  | 119 | mutex_init(&fs_info->qgroup_rescan_lock); | 
|  | 120 | rwlock_init(&fs_info->tree_mod_log_lock); | 
|  | 121 | fs_info->running_transaction = NULL; | 
|  | 122 | fs_info->qgroup_tree = RB_ROOT; | 
|  | 123 | fs_info->qgroup_ulist = NULL; | 
|  | 124 | atomic64_set(&fs_info->tree_mod_seq, 0); | 
|  | 125 | INIT_LIST_HEAD(&fs_info->dirty_qgroups); | 
|  | 126 | INIT_LIST_HEAD(&fs_info->dead_roots); | 
|  | 127 | INIT_LIST_HEAD(&fs_info->tree_mod_seq_list); | 
|  | 128 | INIT_RADIX_TREE(&fs_info->buffer_radix, GFP_ATOMIC); | 
|  | 129 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC); | 
|  | 130 | extent_io_tree_init(&fs_info->freed_extents[0], NULL); | 
|  | 131 | extent_io_tree_init(&fs_info->freed_extents[1], NULL); | 
|  | 132 | fs_info->pinned_extents = &fs_info->freed_extents[0]; | 
|  | 133 | set_bit(BTRFS_FS_STATE_DUMMY_FS_INFO, &fs_info->fs_state); | 
|  | 134 |  | 
|  | 135 | test_mnt->mnt_sb->s_fs_info = fs_info; | 
|  | 136 |  | 
|  | 137 | return fs_info; | 
|  | 138 | } | 
|  | 139 |  | 
|  | 140 | void btrfs_free_dummy_fs_info(struct btrfs_fs_info *fs_info) | 
|  | 141 | { | 
|  | 142 | struct radix_tree_iter iter; | 
|  | 143 | void **slot; | 
|  | 144 |  | 
|  | 145 | if (!fs_info) | 
|  | 146 | return; | 
|  | 147 |  | 
|  | 148 | if (WARN_ON(!test_bit(BTRFS_FS_STATE_DUMMY_FS_INFO, | 
|  | 149 | &fs_info->fs_state))) | 
|  | 150 | return; | 
|  | 151 |  | 
|  | 152 | test_mnt->mnt_sb->s_fs_info = NULL; | 
|  | 153 |  | 
|  | 154 | spin_lock(&fs_info->buffer_lock); | 
|  | 155 | radix_tree_for_each_slot(slot, &fs_info->buffer_radix, &iter, 0) { | 
|  | 156 | struct extent_buffer *eb; | 
|  | 157 |  | 
|  | 158 | eb = radix_tree_deref_slot_protected(slot, &fs_info->buffer_lock); | 
|  | 159 | if (!eb) | 
|  | 160 | continue; | 
|  | 161 | /* Shouldn't happen but that kind of thinking creates CVE's */ | 
|  | 162 | if (radix_tree_exception(eb)) { | 
|  | 163 | if (radix_tree_deref_retry(eb)) | 
|  | 164 | slot = radix_tree_iter_retry(&iter); | 
|  | 165 | continue; | 
|  | 166 | } | 
|  | 167 | slot = radix_tree_iter_resume(slot, &iter); | 
|  | 168 | spin_unlock(&fs_info->buffer_lock); | 
|  | 169 | free_extent_buffer_stale(eb); | 
|  | 170 | spin_lock(&fs_info->buffer_lock); | 
|  | 171 | } | 
|  | 172 | spin_unlock(&fs_info->buffer_lock); | 
|  | 173 |  | 
|  | 174 | btrfs_free_qgroup_config(fs_info); | 
|  | 175 | btrfs_free_fs_roots(fs_info); | 
|  | 176 | cleanup_srcu_struct(&fs_info->subvol_srcu); | 
|  | 177 | kfree(fs_info->super_copy); | 
|  | 178 | kfree(fs_info->fs_devices); | 
|  | 179 | kfree(fs_info); | 
|  | 180 | } | 
|  | 181 |  | 
|  | 182 | void btrfs_free_dummy_root(struct btrfs_root *root) | 
|  | 183 | { | 
|  | 184 | if (!root) | 
|  | 185 | return; | 
|  | 186 | /* Will be freed by btrfs_free_fs_roots */ | 
|  | 187 | if (WARN_ON(test_bit(BTRFS_ROOT_IN_RADIX, &root->state))) | 
|  | 188 | return; | 
|  | 189 | if (root->node) | 
|  | 190 | free_extent_buffer(root->node); | 
|  | 191 | kfree(root); | 
|  | 192 | } | 
|  | 193 |  | 
|  | 194 | struct btrfs_block_group_cache * | 
|  | 195 | btrfs_alloc_dummy_block_group(struct btrfs_fs_info *fs_info, | 
|  | 196 | unsigned long length) | 
|  | 197 | { | 
|  | 198 | struct btrfs_block_group_cache *cache; | 
|  | 199 |  | 
|  | 200 | cache = kzalloc(sizeof(*cache), GFP_KERNEL); | 
|  | 201 | if (!cache) | 
|  | 202 | return NULL; | 
|  | 203 | cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl), | 
|  | 204 | GFP_KERNEL); | 
|  | 205 | if (!cache->free_space_ctl) { | 
|  | 206 | kfree(cache); | 
|  | 207 | return NULL; | 
|  | 208 | } | 
|  | 209 |  | 
|  | 210 | cache->key.objectid = 0; | 
|  | 211 | cache->key.offset = length; | 
|  | 212 | cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY; | 
|  | 213 | cache->full_stripe_len = fs_info->sectorsize; | 
|  | 214 | cache->fs_info = fs_info; | 
|  | 215 |  | 
|  | 216 | INIT_LIST_HEAD(&cache->list); | 
|  | 217 | INIT_LIST_HEAD(&cache->cluster_list); | 
|  | 218 | INIT_LIST_HEAD(&cache->bg_list); | 
|  | 219 | btrfs_init_free_space_ctl(cache); | 
|  | 220 | mutex_init(&cache->free_space_lock); | 
|  | 221 |  | 
|  | 222 | return cache; | 
|  | 223 | } | 
|  | 224 |  | 
|  | 225 | void btrfs_free_dummy_block_group(struct btrfs_block_group_cache *cache) | 
|  | 226 | { | 
|  | 227 | if (!cache) | 
|  | 228 | return; | 
|  | 229 | __btrfs_remove_free_space_cache(cache->free_space_ctl); | 
|  | 230 | kfree(cache->free_space_ctl); | 
|  | 231 | kfree(cache); | 
|  | 232 | } | 
|  | 233 |  | 
|  | 234 | void btrfs_init_dummy_trans(struct btrfs_trans_handle *trans) | 
|  | 235 | { | 
|  | 236 | memset(trans, 0, sizeof(*trans)); | 
|  | 237 | trans->transid = 1; | 
|  | 238 | trans->type = __TRANS_DUMMY; | 
|  | 239 | } | 
|  | 240 |  | 
|  | 241 | int btrfs_run_sanity_tests(void) | 
|  | 242 | { | 
|  | 243 | int ret, i; | 
|  | 244 | u32 sectorsize, nodesize; | 
|  | 245 | u32 test_sectorsize[] = { | 
|  | 246 | PAGE_SIZE, | 
|  | 247 | }; | 
|  | 248 | ret = btrfs_init_test_fs(); | 
|  | 249 | if (ret) | 
|  | 250 | return ret; | 
|  | 251 | for (i = 0; i < ARRAY_SIZE(test_sectorsize); i++) { | 
|  | 252 | sectorsize = test_sectorsize[i]; | 
|  | 253 | for (nodesize = sectorsize; | 
|  | 254 | nodesize <= BTRFS_MAX_METADATA_BLOCKSIZE; | 
|  | 255 | nodesize <<= 1) { | 
|  | 256 | pr_info("BTRFS: selftest: sectorsize: %u  nodesize: %u\n", | 
|  | 257 | sectorsize, nodesize); | 
|  | 258 | ret = btrfs_test_free_space_cache(sectorsize, nodesize); | 
|  | 259 | if (ret) | 
|  | 260 | goto out; | 
|  | 261 | ret = btrfs_test_extent_buffer_operations(sectorsize, | 
|  | 262 | nodesize); | 
|  | 263 | if (ret) | 
|  | 264 | goto out; | 
|  | 265 | ret = btrfs_test_extent_io(sectorsize, nodesize); | 
|  | 266 | if (ret) | 
|  | 267 | goto out; | 
|  | 268 | ret = btrfs_test_inodes(sectorsize, nodesize); | 
|  | 269 | if (ret) | 
|  | 270 | goto out; | 
|  | 271 | ret = btrfs_test_qgroups(sectorsize, nodesize); | 
|  | 272 | if (ret) | 
|  | 273 | goto out; | 
|  | 274 | ret = btrfs_test_free_space_tree(sectorsize, nodesize); | 
|  | 275 | if (ret) | 
|  | 276 | goto out; | 
|  | 277 | } | 
|  | 278 | } | 
|  | 279 | out: | 
|  | 280 | btrfs_destroy_test_fs(); | 
|  | 281 | return ret; | 
|  | 282 | } |