]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/btrfs/tests/btrfs-tests.c
UBUNTU: [Config] arm64: snapdragon: SND*=m
[mirror_ubuntu-bionic-kernel.git] / fs / btrfs / tests / btrfs-tests.c
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 spin_lock_init(&fs_info->tree_mod_seq_lock);
119 mutex_init(&fs_info->qgroup_ioctl_lock);
120 mutex_init(&fs_info->qgroup_rescan_lock);
121 rwlock_init(&fs_info->tree_mod_log_lock);
122 fs_info->running_transaction = NULL;
123 fs_info->qgroup_tree = RB_ROOT;
124 fs_info->qgroup_ulist = NULL;
125 atomic64_set(&fs_info->tree_mod_seq, 0);
126 INIT_LIST_HEAD(&fs_info->dirty_qgroups);
127 INIT_LIST_HEAD(&fs_info->dead_roots);
128 INIT_LIST_HEAD(&fs_info->tree_mod_seq_list);
129 INIT_RADIX_TREE(&fs_info->buffer_radix, GFP_ATOMIC);
130 INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC);
131 extent_io_tree_init(&fs_info->freed_extents[0], NULL);
132 extent_io_tree_init(&fs_info->freed_extents[1], NULL);
133 fs_info->pinned_extents = &fs_info->freed_extents[0];
134 set_bit(BTRFS_FS_STATE_DUMMY_FS_INFO, &fs_info->fs_state);
135
136 test_mnt->mnt_sb->s_fs_info = fs_info;
137
138 return fs_info;
139 }
140
141 void btrfs_free_dummy_fs_info(struct btrfs_fs_info *fs_info)
142 {
143 struct radix_tree_iter iter;
144 void **slot;
145
146 if (!fs_info)
147 return;
148
149 if (WARN_ON(!test_bit(BTRFS_FS_STATE_DUMMY_FS_INFO,
150 &fs_info->fs_state)))
151 return;
152
153 test_mnt->mnt_sb->s_fs_info = NULL;
154
155 spin_lock(&fs_info->buffer_lock);
156 radix_tree_for_each_slot(slot, &fs_info->buffer_radix, &iter, 0) {
157 struct extent_buffer *eb;
158
159 eb = radix_tree_deref_slot_protected(slot, &fs_info->buffer_lock);
160 if (!eb)
161 continue;
162 /* Shouldn't happen but that kind of thinking creates CVE's */
163 if (radix_tree_exception(eb)) {
164 if (radix_tree_deref_retry(eb))
165 slot = radix_tree_iter_retry(&iter);
166 continue;
167 }
168 slot = radix_tree_iter_resume(slot, &iter);
169 spin_unlock(&fs_info->buffer_lock);
170 free_extent_buffer_stale(eb);
171 spin_lock(&fs_info->buffer_lock);
172 }
173 spin_unlock(&fs_info->buffer_lock);
174
175 btrfs_free_qgroup_config(fs_info);
176 btrfs_free_fs_roots(fs_info);
177 cleanup_srcu_struct(&fs_info->subvol_srcu);
178 kfree(fs_info->super_copy);
179 kfree(fs_info->fs_devices);
180 kfree(fs_info);
181 }
182
183 void btrfs_free_dummy_root(struct btrfs_root *root)
184 {
185 if (!root)
186 return;
187 /* Will be freed by btrfs_free_fs_roots */
188 if (WARN_ON(test_bit(BTRFS_ROOT_IN_RADIX, &root->state)))
189 return;
190 if (root->node)
191 free_extent_buffer(root->node);
192 kfree(root);
193 }
194
195 struct btrfs_block_group_cache *
196 btrfs_alloc_dummy_block_group(struct btrfs_fs_info *fs_info,
197 unsigned long length)
198 {
199 struct btrfs_block_group_cache *cache;
200
201 cache = kzalloc(sizeof(*cache), GFP_KERNEL);
202 if (!cache)
203 return NULL;
204 cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl),
205 GFP_KERNEL);
206 if (!cache->free_space_ctl) {
207 kfree(cache);
208 return NULL;
209 }
210
211 cache->key.objectid = 0;
212 cache->key.offset = length;
213 cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
214 cache->full_stripe_len = fs_info->sectorsize;
215 cache->fs_info = fs_info;
216
217 INIT_LIST_HEAD(&cache->list);
218 INIT_LIST_HEAD(&cache->cluster_list);
219 INIT_LIST_HEAD(&cache->bg_list);
220 btrfs_init_free_space_ctl(cache);
221 mutex_init(&cache->free_space_lock);
222
223 return cache;
224 }
225
226 void btrfs_free_dummy_block_group(struct btrfs_block_group_cache *cache)
227 {
228 if (!cache)
229 return;
230 __btrfs_remove_free_space_cache(cache->free_space_ctl);
231 kfree(cache->free_space_ctl);
232 kfree(cache);
233 }
234
235 void btrfs_init_dummy_trans(struct btrfs_trans_handle *trans)
236 {
237 memset(trans, 0, sizeof(*trans));
238 trans->transid = 1;
239 trans->type = __TRANS_DUMMY;
240 }
241
242 int btrfs_run_sanity_tests(void)
243 {
244 int ret, i;
245 u32 sectorsize, nodesize;
246 u32 test_sectorsize[] = {
247 PAGE_SIZE,
248 };
249 ret = btrfs_init_test_fs();
250 if (ret)
251 return ret;
252 for (i = 0; i < ARRAY_SIZE(test_sectorsize); i++) {
253 sectorsize = test_sectorsize[i];
254 for (nodesize = sectorsize;
255 nodesize <= BTRFS_MAX_METADATA_BLOCKSIZE;
256 nodesize <<= 1) {
257 pr_info("BTRFS: selftest: sectorsize: %u nodesize: %u\n",
258 sectorsize, nodesize);
259 ret = btrfs_test_free_space_cache(sectorsize, nodesize);
260 if (ret)
261 goto out;
262 ret = btrfs_test_extent_buffer_operations(sectorsize,
263 nodesize);
264 if (ret)
265 goto out;
266 ret = btrfs_test_extent_io(sectorsize, nodesize);
267 if (ret)
268 goto out;
269 ret = btrfs_test_inodes(sectorsize, nodesize);
270 if (ret)
271 goto out;
272 ret = btrfs_test_qgroups(sectorsize, nodesize);
273 if (ret)
274 goto out;
275 ret = btrfs_test_free_space_tree(sectorsize, nodesize);
276 if (ret)
277 goto out;
278 }
279 }
280 out:
281 btrfs_destroy_test_fs();
282 return ret;
283 }