Btrfs: very minimal locking
[linux-2.6-block.git] / fs / btrfs / disk-io.c
1 #include <linux/module.h>
2 #include <linux/fs.h>
3 #include "ctree.h"
4 #include "disk-io.h"
5 #include "transaction.h"
6
7 static int check_tree_block(struct btrfs_root *root, struct buffer_head *buf)
8 {
9         struct btrfs_node *node = btrfs_buffer_node(buf);
10         if (buf->b_blocknr != btrfs_header_blocknr(&node->header))
11                 BUG();
12         if (root->node && btrfs_header_parentid(&node->header) !=
13             btrfs_header_parentid(btrfs_buffer_header(root->node))) {
14                 BUG();
15         }
16         return 0;
17 }
18
19 struct buffer_head *alloc_tree_block(struct btrfs_root *root, u64 blocknr)
20 {
21         return sb_getblk(root->fs_info->sb, blocknr);
22 }
23
24 struct buffer_head *find_tree_block(struct btrfs_root *root, u64 blocknr)
25 {
26         return sb_getblk(root->fs_info->sb, blocknr);
27 }
28
29 struct buffer_head *read_tree_block(struct btrfs_root *root, u64 blocknr)
30 {
31         struct buffer_head *buf = sb_bread(root->fs_info->sb, blocknr);
32
33         if (!buf)
34                 return buf;
35         if (check_tree_block(root, buf))
36                 BUG();
37         return buf;
38 }
39
40 int dirty_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
41                      struct buffer_head *buf)
42 {
43         mark_buffer_dirty(buf);
44         return 0;
45 }
46
47 int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
48                      struct buffer_head *buf)
49 {
50         clear_buffer_dirty(buf);
51         return 0;
52 }
53
54 static int __setup_root(struct btrfs_super_block *super,
55                         struct btrfs_root *root,
56                         struct btrfs_fs_info *fs_info,
57                         u64 objectid)
58 {
59         root->node = NULL;
60         root->commit_root = NULL;
61         root->blocksize = btrfs_super_blocksize(super);
62         root->ref_cows = 0;
63         root->fs_info = fs_info;
64         memset(&root->root_key, 0, sizeof(root->root_key));
65         memset(&root->root_item, 0, sizeof(root->root_item));
66         return 0;
67 }
68
69 static int find_and_setup_root(struct btrfs_super_block *super,
70                                struct btrfs_root *tree_root,
71                                struct btrfs_fs_info *fs_info,
72                                u64 objectid,
73                                struct btrfs_root *root)
74 {
75         int ret;
76
77         __setup_root(super, root, fs_info, objectid);
78         ret = btrfs_find_last_root(tree_root, objectid,
79                                    &root->root_item, &root->root_key);
80         BUG_ON(ret);
81
82         root->node = read_tree_block(root,
83                                      btrfs_root_blocknr(&root->root_item));
84         BUG_ON(!root->node);
85         return 0;
86 }
87
88 struct btrfs_root *open_ctree(struct super_block *sb,
89                               struct buffer_head *sb_buffer,
90                               struct btrfs_super_block *disk_super)
91 {
92         struct btrfs_root *root = kmalloc(sizeof(struct btrfs_root),
93                                           GFP_NOFS);
94         struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root),
95                                                  GFP_NOFS);
96         struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root),
97                                                GFP_NOFS);
98         struct btrfs_root *inode_root = kmalloc(sizeof(struct btrfs_root),
99                                                 GFP_NOFS);
100         struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info),
101                                                 GFP_NOFS);
102         int ret;
103
104         /* FIXME: don't be stupid */
105         if (!btrfs_super_root(disk_super))
106                 return NULL;
107         INIT_RADIX_TREE(&fs_info->pinned_radix, GFP_KERNEL);
108         fs_info->running_transaction = NULL;
109         fs_info->fs_root = root;
110         fs_info->tree_root = tree_root;
111         fs_info->extent_root = extent_root;
112         fs_info->inode_root = inode_root;
113         fs_info->last_inode_alloc = 0;
114         fs_info->last_inode_alloc_dirid = 0;
115         fs_info->disk_super = disk_super;
116         fs_info->sb_buffer = sb_buffer;
117         fs_info->sb = sb;
118         mutex_init(&fs_info->trans_mutex);
119         mutex_init(&fs_info->fs_mutex);
120         memset(&fs_info->current_insert, 0, sizeof(fs_info->current_insert));
121         memset(&fs_info->last_insert, 0, sizeof(fs_info->last_insert));
122
123         __setup_root(disk_super, tree_root, fs_info, BTRFS_ROOT_TREE_OBJECTID);
124         tree_root->node = read_tree_block(tree_root,
125                                           btrfs_super_root(disk_super));
126         BUG_ON(!tree_root->node);
127
128         ret = find_and_setup_root(disk_super, tree_root, fs_info,
129                                   BTRFS_EXTENT_TREE_OBJECTID, extent_root);
130         BUG_ON(ret);
131
132         ret = find_and_setup_root(disk_super, tree_root, fs_info,
133                                   BTRFS_INODE_MAP_OBJECTID, inode_root);
134         BUG_ON(ret);
135
136         ret = find_and_setup_root(disk_super, tree_root, fs_info,
137                                   BTRFS_FS_TREE_OBJECTID, root);
138         BUG_ON(ret);
139
140         root->commit_root = root->node;
141         get_bh(root->node);
142         root->ref_cows = 1;
143         root->fs_info->generation = root->root_key.offset + 1;
144         return root;
145 }
146
147 int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
148                       *root)
149 {
150         struct buffer_head *bh = root->fs_info->sb_buffer;
151         btrfs_set_super_root(root->fs_info->disk_super,
152                              root->fs_info->tree_root->node->b_blocknr);
153         lock_buffer(bh);
154         clear_buffer_dirty(bh);
155         bh->b_end_io = end_buffer_write_sync;
156         get_bh(bh);
157         submit_bh(WRITE, bh);
158         wait_on_buffer(bh);
159         if (!buffer_uptodate(bh)) {
160                 WARN_ON(1);
161                 return -EIO;
162         }
163         return 0;
164 }
165
166 int close_ctree(struct btrfs_root *root)
167 {
168         int ret;
169         struct btrfs_trans_handle *trans;
170
171         trans = btrfs_start_transaction(root, 1);
172         btrfs_commit_transaction(trans, root);
173         /* run commit again to  drop the original snapshot */
174         trans = btrfs_start_transaction(root, 1);
175         btrfs_commit_transaction(trans, root);
176         ret = btrfs_write_and_wait_transaction(NULL, root);
177         BUG_ON(ret);
178         write_ctree_super(NULL, root);
179
180         if (root->node)
181                 btrfs_block_release(root, root->node);
182         if (root->fs_info->extent_root->node)
183                 btrfs_block_release(root->fs_info->extent_root,
184                                     root->fs_info->extent_root->node);
185         if (root->fs_info->inode_root->node)
186                 btrfs_block_release(root->fs_info->inode_root,
187                                     root->fs_info->inode_root->node);
188         if (root->fs_info->tree_root->node)
189                 btrfs_block_release(root->fs_info->tree_root,
190                                     root->fs_info->tree_root->node);
191         btrfs_block_release(root, root->commit_root);
192         btrfs_block_release(root, root->fs_info->sb_buffer);
193         kfree(root->fs_info->extent_root);
194         kfree(root->fs_info->inode_root);
195         kfree(root->fs_info->tree_root);
196         kfree(root->fs_info);
197         kfree(root);
198         return 0;
199 }
200
201 void btrfs_block_release(struct btrfs_root *root, struct buffer_head *buf)
202 {
203         brelse(buf);
204 }
205