~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

TOMOYO Linux Cross Reference
Linux/fs/btrfs/tests/btrfs-tests.c

Version: ~ [ linux-5.13-rc5 ] ~ [ linux-5.12.9 ] ~ [ linux-5.11.22 ] ~ [ linux-5.10.42 ] ~ [ linux-5.9.16 ] ~ [ linux-5.8.18 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.124 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.193 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.235 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.271 ] ~ [ linux-4.8.17 ] ~ [ linux-4.7.10 ] ~ [ linux-4.6.7 ] ~ [ linux-4.5.7 ] ~ [ linux-4.4.271 ] ~ [ linux-4.3.6 ] ~ [ linux-4.2.8 ] ~ [ linux-4.1.52 ] ~ [ linux-4.0.9 ] ~ [ linux-3.18.140 ] ~ [ linux-3.16.85 ] ~ [ linux-3.14.79 ] ~ [ linux-3.12.74 ] ~ [ linux-3.10.108 ] ~ [ linux-2.6.32.71 ] ~ [ linux-2.6.0 ] ~ [ linux-2.4.37.11 ] ~ [ unix-v6-master ] ~ [ ccs-tools-1.8.5 ] ~ [ policy-sample ] ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

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

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

kernel.org | git.kernel.org | LWN.net | Project Home | Wiki (Japanese) | Wiki (English) | SVN repository | Mail admin

Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.

osdn.jp