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