Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. 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 | ||
39279cc3 CM |
19 | #include <linux/fs.h> |
20 | #include <linux/pagemap.h> | |
21 | #include <linux/highmem.h> | |
22 | #include <linux/time.h> | |
23 | #include <linux/init.h> | |
24 | #include <linux/string.h> | |
25 | #include <linux/smp_lock.h> | |
26 | #include <linux/backing-dev.h> | |
27 | #include <linux/mpage.h> | |
28 | #include <linux/swap.h> | |
29 | #include <linux/writeback.h> | |
30 | #include <linux/statfs.h> | |
31 | #include <linux/compat.h> | |
92fee66d | 32 | #include <linux/version.h> |
39279cc3 CM |
33 | #include "ctree.h" |
34 | #include "disk-io.h" | |
35 | #include "transaction.h" | |
36 | #include "btrfs_inode.h" | |
37 | #include "ioctl.h" | |
38 | #include "print-tree.h" | |
e02119d5 CM |
39 | #include "tree-log.h" |
40 | #include "locking.h" | |
12fa8ec6 | 41 | #include "compat.h" |
39279cc3 CM |
42 | |
43 | ||
d352ac68 CM |
44 | /* simple helper to fault in pages and copy. This should go away |
45 | * and be replaced with calls into generic code. | |
46 | */ | |
a1b32a59 CM |
47 | static int noinline btrfs_copy_from_user(loff_t pos, int num_pages, |
48 | int write_bytes, | |
49 | struct page **prepared_pages, | |
50 | const char __user * buf) | |
39279cc3 CM |
51 | { |
52 | long page_fault = 0; | |
53 | int i; | |
54 | int offset = pos & (PAGE_CACHE_SIZE - 1); | |
55 | ||
56 | for (i = 0; i < num_pages && write_bytes > 0; i++, offset = 0) { | |
57 | size_t count = min_t(size_t, | |
58 | PAGE_CACHE_SIZE - offset, write_bytes); | |
59 | struct page *page = prepared_pages[i]; | |
60 | fault_in_pages_readable(buf, count); | |
61 | ||
62 | /* Copy data from userspace to the current page */ | |
63 | kmap(page); | |
64 | page_fault = __copy_from_user(page_address(page) + offset, | |
65 | buf, count); | |
66 | /* Flush processor's dcache for this page */ | |
67 | flush_dcache_page(page); | |
68 | kunmap(page); | |
69 | buf += count; | |
70 | write_bytes -= count; | |
71 | ||
72 | if (page_fault) | |
73 | break; | |
74 | } | |
75 | return page_fault ? -EFAULT : 0; | |
76 | } | |
77 | ||
d352ac68 CM |
78 | /* |
79 | * unlocks pages after btrfs_file_write is done with them | |
80 | */ | |
a1b32a59 | 81 | static void noinline btrfs_drop_pages(struct page **pages, size_t num_pages) |
39279cc3 CM |
82 | { |
83 | size_t i; | |
84 | for (i = 0; i < num_pages; i++) { | |
85 | if (!pages[i]) | |
86 | break; | |
d352ac68 CM |
87 | /* page checked is some magic around finding pages that |
88 | * have been modified without going through btrfs_set_page_dirty | |
89 | * clear it here | |
90 | */ | |
4a096752 | 91 | ClearPageChecked(pages[i]); |
39279cc3 CM |
92 | unlock_page(pages[i]); |
93 | mark_page_accessed(pages[i]); | |
94 | page_cache_release(pages[i]); | |
95 | } | |
96 | } | |
97 | ||
d352ac68 CM |
98 | /* |
99 | * after copy_from_user, pages need to be dirtied and we need to make | |
100 | * sure holes are created between the current EOF and the start of | |
101 | * any next extents (if required). | |
102 | * | |
103 | * this also makes the decision about creating an inline extent vs | |
104 | * doing real data extents, marking pages dirty and delalloc as required. | |
105 | */ | |
98ed5174 | 106 | static int noinline dirty_and_release_pages(struct btrfs_trans_handle *trans, |
39279cc3 CM |
107 | struct btrfs_root *root, |
108 | struct file *file, | |
109 | struct page **pages, | |
110 | size_t num_pages, | |
111 | loff_t pos, | |
112 | size_t write_bytes) | |
113 | { | |
39279cc3 | 114 | int err = 0; |
a52d9a80 | 115 | int i; |
6da6abae | 116 | struct inode *inode = fdentry(file)->d_inode; |
d1310b2e | 117 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
db94535d CM |
118 | u64 hint_byte; |
119 | u64 num_bytes; | |
a52d9a80 CM |
120 | u64 start_pos; |
121 | u64 end_of_last_block; | |
122 | u64 end_pos = pos + write_bytes; | |
123 | loff_t isize = i_size_read(inode); | |
39279cc3 | 124 | |
5f39d397 | 125 | start_pos = pos & ~((u64)root->sectorsize - 1); |
db94535d CM |
126 | num_bytes = (write_bytes + pos - start_pos + |
127 | root->sectorsize - 1) & ~((u64)root->sectorsize - 1); | |
39279cc3 | 128 | |
db94535d CM |
129 | end_of_last_block = start_pos + num_bytes - 1; |
130 | ||
d1310b2e | 131 | lock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
37d1aeee | 132 | trans = btrfs_join_transaction(root, 1); |
a52d9a80 CM |
133 | if (!trans) { |
134 | err = -ENOMEM; | |
135 | goto out_unlock; | |
136 | } | |
137 | btrfs_set_trans_block_group(trans, inode); | |
db94535d | 138 | hint_byte = 0; |
a52d9a80 CM |
139 | |
140 | if ((end_of_last_block & 4095) == 0) { | |
9433063b | 141 | printk("strange end of last %Lu %zu %Lu\n", start_pos, write_bytes, end_of_last_block); |
a52d9a80 | 142 | } |
d1310b2e | 143 | set_extent_uptodate(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
a52d9a80 | 144 | |
c8b97818 CM |
145 | /* check for reserved extents on each page, we don't want |
146 | * to reset the delalloc bit on things that already have | |
147 | * extents reserved. | |
a52d9a80 | 148 | */ |
c8b97818 CM |
149 | btrfs_set_extent_delalloc(inode, start_pos, end_of_last_block); |
150 | for (i = 0; i < num_pages; i++) { | |
151 | struct page *p = pages[i]; | |
152 | SetPageUptodate(p); | |
153 | ClearPageChecked(p); | |
154 | set_page_dirty(p); | |
a52d9a80 CM |
155 | } |
156 | if (end_pos > isize) { | |
157 | i_size_write(inode, end_pos); | |
158 | btrfs_update_inode(trans, root, inode); | |
39279cc3 | 159 | } |
017e5369 | 160 | err = btrfs_end_transaction(trans, root); |
a52d9a80 | 161 | out_unlock: |
d1310b2e | 162 | unlock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
39279cc3 CM |
163 | return err; |
164 | } | |
165 | ||
d352ac68 CM |
166 | /* |
167 | * this drops all the extents in the cache that intersect the range | |
168 | * [start, end]. Existing extents are split as required. | |
169 | */ | |
5b21f2ed ZY |
170 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end, |
171 | int skip_pinned) | |
a52d9a80 CM |
172 | { |
173 | struct extent_map *em; | |
3b951516 CM |
174 | struct extent_map *split = NULL; |
175 | struct extent_map *split2 = NULL; | |
a52d9a80 | 176 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
39b5637f | 177 | u64 len = end - start + 1; |
3b951516 CM |
178 | int ret; |
179 | int testend = 1; | |
5b21f2ed | 180 | unsigned long flags; |
c8b97818 | 181 | int compressed = 0; |
a52d9a80 | 182 | |
e6dcd2dc | 183 | WARN_ON(end < start); |
3b951516 | 184 | if (end == (u64)-1) { |
39b5637f | 185 | len = (u64)-1; |
3b951516 CM |
186 | testend = 0; |
187 | } | |
a52d9a80 | 188 | while(1) { |
3b951516 CM |
189 | if (!split) |
190 | split = alloc_extent_map(GFP_NOFS); | |
191 | if (!split2) | |
192 | split2 = alloc_extent_map(GFP_NOFS); | |
193 | ||
d1310b2e | 194 | spin_lock(&em_tree->lock); |
39b5637f | 195 | em = lookup_extent_mapping(em_tree, start, len); |
d1310b2e CM |
196 | if (!em) { |
197 | spin_unlock(&em_tree->lock); | |
a52d9a80 | 198 | break; |
d1310b2e | 199 | } |
5b21f2ed ZY |
200 | flags = em->flags; |
201 | if (skip_pinned && test_bit(EXTENT_FLAG_PINNED, &em->flags)) { | |
202 | spin_unlock(&em_tree->lock); | |
203 | if (em->start <= start && | |
204 | (!testend || em->start + em->len >= start + len)) { | |
205 | free_extent_map(em); | |
206 | break; | |
207 | } | |
208 | if (start < em->start) { | |
209 | len = em->start - start; | |
210 | } else { | |
211 | len = start + len - (em->start + em->len); | |
212 | start = em->start + em->len; | |
213 | } | |
214 | free_extent_map(em); | |
215 | continue; | |
216 | } | |
c8b97818 | 217 | compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
3ce7e67a | 218 | clear_bit(EXTENT_FLAG_PINNED, &em->flags); |
a52d9a80 | 219 | remove_extent_mapping(em_tree, em); |
3b951516 CM |
220 | |
221 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
222 | em->start < start) { | |
223 | split->start = em->start; | |
224 | split->len = start - em->start; | |
225 | split->block_start = em->block_start; | |
c8b97818 CM |
226 | |
227 | if (compressed) | |
228 | split->block_len = em->block_len; | |
229 | else | |
230 | split->block_len = split->len; | |
231 | ||
3b951516 | 232 | split->bdev = em->bdev; |
5b21f2ed | 233 | split->flags = flags; |
3b951516 CM |
234 | ret = add_extent_mapping(em_tree, split); |
235 | BUG_ON(ret); | |
236 | free_extent_map(split); | |
237 | split = split2; | |
238 | split2 = NULL; | |
239 | } | |
240 | if (em->block_start < EXTENT_MAP_LAST_BYTE && | |
241 | testend && em->start + em->len > start + len) { | |
242 | u64 diff = start + len - em->start; | |
243 | ||
244 | split->start = start + len; | |
245 | split->len = em->start + em->len - (start + len); | |
246 | split->bdev = em->bdev; | |
5b21f2ed | 247 | split->flags = flags; |
3b951516 | 248 | |
c8b97818 CM |
249 | if (compressed) { |
250 | split->block_len = em->block_len; | |
251 | split->block_start = em->block_start; | |
252 | } else { | |
253 | split->block_len = split->len; | |
254 | split->block_start = em->block_start + diff; | |
255 | } | |
3b951516 CM |
256 | |
257 | ret = add_extent_mapping(em_tree, split); | |
258 | BUG_ON(ret); | |
259 | free_extent_map(split); | |
260 | split = NULL; | |
261 | } | |
d1310b2e CM |
262 | spin_unlock(&em_tree->lock); |
263 | ||
a52d9a80 CM |
264 | /* once for us */ |
265 | free_extent_map(em); | |
266 | /* once for the tree*/ | |
267 | free_extent_map(em); | |
268 | } | |
3b951516 CM |
269 | if (split) |
270 | free_extent_map(split); | |
271 | if (split2) | |
272 | free_extent_map(split2); | |
a52d9a80 CM |
273 | return 0; |
274 | } | |
275 | ||
5f56406a CM |
276 | int btrfs_check_file(struct btrfs_root *root, struct inode *inode) |
277 | { | |
278 | return 0; | |
279 | #if 0 | |
280 | struct btrfs_path *path; | |
281 | struct btrfs_key found_key; | |
282 | struct extent_buffer *leaf; | |
283 | struct btrfs_file_extent_item *extent; | |
284 | u64 last_offset = 0; | |
285 | int nritems; | |
286 | int slot; | |
287 | int found_type; | |
288 | int ret; | |
289 | int err = 0; | |
290 | u64 extent_end = 0; | |
291 | ||
292 | path = btrfs_alloc_path(); | |
293 | ret = btrfs_lookup_file_extent(NULL, root, path, inode->i_ino, | |
294 | last_offset, 0); | |
295 | while(1) { | |
296 | nritems = btrfs_header_nritems(path->nodes[0]); | |
297 | if (path->slots[0] >= nritems) { | |
298 | ret = btrfs_next_leaf(root, path); | |
299 | if (ret) | |
300 | goto out; | |
301 | nritems = btrfs_header_nritems(path->nodes[0]); | |
302 | } | |
303 | slot = path->slots[0]; | |
304 | leaf = path->nodes[0]; | |
305 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
306 | if (found_key.objectid != inode->i_ino) | |
307 | break; | |
308 | if (found_key.type != BTRFS_EXTENT_DATA_KEY) | |
309 | goto out; | |
310 | ||
9069218d | 311 | if (found_key.offset < last_offset) { |
5f56406a CM |
312 | WARN_ON(1); |
313 | btrfs_print_leaf(root, leaf); | |
314 | printk("inode %lu found offset %Lu expected %Lu\n", | |
315 | inode->i_ino, found_key.offset, last_offset); | |
316 | err = 1; | |
317 | goto out; | |
318 | } | |
319 | extent = btrfs_item_ptr(leaf, slot, | |
320 | struct btrfs_file_extent_item); | |
321 | found_type = btrfs_file_extent_type(leaf, extent); | |
322 | if (found_type == BTRFS_FILE_EXTENT_REG) { | |
323 | extent_end = found_key.offset + | |
324 | btrfs_file_extent_num_bytes(leaf, extent); | |
325 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
326 | struct btrfs_item *item; | |
327 | item = btrfs_item_nr(leaf, slot); | |
328 | extent_end = found_key.offset + | |
c8b97818 | 329 | btrfs_file_extent_inline_len(leaf, extent); |
5f56406a CM |
330 | extent_end = (extent_end + root->sectorsize - 1) & |
331 | ~((u64)root->sectorsize -1 ); | |
332 | } | |
333 | last_offset = extent_end; | |
334 | path->slots[0]++; | |
335 | } | |
9069218d | 336 | if (0 && last_offset < inode->i_size) { |
5f56406a CM |
337 | WARN_ON(1); |
338 | btrfs_print_leaf(root, leaf); | |
339 | printk("inode %lu found offset %Lu size %Lu\n", inode->i_ino, | |
340 | last_offset, inode->i_size); | |
341 | err = 1; | |
342 | ||
343 | } | |
344 | out: | |
345 | btrfs_free_path(path); | |
346 | return err; | |
347 | #endif | |
348 | } | |
349 | ||
39279cc3 CM |
350 | /* |
351 | * this is very complex, but the basic idea is to drop all extents | |
352 | * in the range start - end. hint_block is filled in with a block number | |
353 | * that would be a good hint to the block allocator for this file. | |
354 | * | |
355 | * If an extent intersects the range but is not entirely inside the range | |
356 | * it is either truncated or split. Anything entirely inside the range | |
357 | * is deleted from the tree. | |
d352ac68 CM |
358 | * |
359 | * inline_limit is used to tell this code which offsets in the file to keep | |
360 | * if they contain inline extents. | |
39279cc3 | 361 | */ |
a1b32a59 | 362 | int noinline btrfs_drop_extents(struct btrfs_trans_handle *trans, |
39279cc3 | 363 | struct btrfs_root *root, struct inode *inode, |
00f5c795 | 364 | u64 start, u64 end, u64 inline_limit, u64 *hint_byte) |
39279cc3 | 365 | { |
00f5c795 | 366 | u64 extent_end = 0; |
6643558d | 367 | u64 locked_end = end; |
00f5c795 | 368 | u64 search_start = start; |
31840ae1 | 369 | u64 leaf_start; |
c8b97818 CM |
370 | u64 ram_bytes = 0; |
371 | u8 compression = 0; | |
372 | u8 encryption = 0; | |
373 | u16 other_encoding = 0; | |
31840ae1 ZY |
374 | u64 root_gen; |
375 | u64 root_owner; | |
5f39d397 | 376 | struct extent_buffer *leaf; |
39279cc3 | 377 | struct btrfs_file_extent_item *extent; |
39279cc3 | 378 | struct btrfs_path *path; |
00f5c795 CM |
379 | struct btrfs_key key; |
380 | struct btrfs_file_extent_item old; | |
381 | int keep; | |
382 | int slot; | |
39279cc3 CM |
383 | int bookend; |
384 | int found_type; | |
385 | int found_extent; | |
386 | int found_inline; | |
ccd467d6 | 387 | int recow; |
00f5c795 | 388 | int ret; |
39279cc3 | 389 | |
c8b97818 | 390 | inline_limit = 0; |
5b21f2ed | 391 | btrfs_drop_extent_cache(inode, start, end - 1, 0); |
a52d9a80 | 392 | |
39279cc3 CM |
393 | path = btrfs_alloc_path(); |
394 | if (!path) | |
395 | return -ENOMEM; | |
396 | while(1) { | |
ccd467d6 | 397 | recow = 0; |
39279cc3 CM |
398 | btrfs_release_path(root, path); |
399 | ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino, | |
400 | search_start, -1); | |
401 | if (ret < 0) | |
402 | goto out; | |
403 | if (ret > 0) { | |
404 | if (path->slots[0] == 0) { | |
405 | ret = 0; | |
406 | goto out; | |
407 | } | |
408 | path->slots[0]--; | |
409 | } | |
8c2383c3 | 410 | next_slot: |
39279cc3 CM |
411 | keep = 0; |
412 | bookend = 0; | |
413 | found_extent = 0; | |
414 | found_inline = 0; | |
31840ae1 ZY |
415 | leaf_start = 0; |
416 | root_gen = 0; | |
417 | root_owner = 0; | |
39279cc3 | 418 | extent = NULL; |
5f39d397 | 419 | leaf = path->nodes[0]; |
39279cc3 | 420 | slot = path->slots[0]; |
8c2383c3 | 421 | ret = 0; |
5f39d397 | 422 | btrfs_item_key_to_cpu(leaf, &key, slot); |
7261009c Y |
423 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY && |
424 | key.offset >= end) { | |
39279cc3 CM |
425 | goto out; |
426 | } | |
7261009c Y |
427 | if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY || |
428 | key.objectid != inode->i_ino) { | |
39279cc3 CM |
429 | goto out; |
430 | } | |
ccd467d6 CM |
431 | if (recow) { |
432 | search_start = key.offset; | |
433 | continue; | |
434 | } | |
8c2383c3 CM |
435 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) { |
436 | extent = btrfs_item_ptr(leaf, slot, | |
437 | struct btrfs_file_extent_item); | |
5f39d397 | 438 | found_type = btrfs_file_extent_type(leaf, extent); |
c8b97818 CM |
439 | compression = btrfs_file_extent_compression(leaf, |
440 | extent); | |
441 | encryption = btrfs_file_extent_encryption(leaf, | |
442 | extent); | |
443 | other_encoding = btrfs_file_extent_other_encoding(leaf, | |
444 | extent); | |
8c2383c3 | 445 | if (found_type == BTRFS_FILE_EXTENT_REG) { |
257d0ce3 CM |
446 | extent_end = |
447 | btrfs_file_extent_disk_bytenr(leaf, | |
448 | extent); | |
449 | if (extent_end) | |
450 | *hint_byte = extent_end; | |
451 | ||
8c2383c3 | 452 | extent_end = key.offset + |
db94535d | 453 | btrfs_file_extent_num_bytes(leaf, extent); |
c8b97818 CM |
454 | ram_bytes = btrfs_file_extent_ram_bytes(leaf, |
455 | extent); | |
8c2383c3 CM |
456 | found_extent = 1; |
457 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
458 | found_inline = 1; | |
459 | extent_end = key.offset + | |
c8b97818 | 460 | btrfs_file_extent_inline_len(leaf, extent); |
8c2383c3 CM |
461 | } |
462 | } else { | |
463 | extent_end = search_start; | |
39279cc3 CM |
464 | } |
465 | ||
466 | /* we found nothing we can drop */ | |
8c2383c3 CM |
467 | if ((!found_extent && !found_inline) || |
468 | search_start >= extent_end) { | |
469 | int nextret; | |
470 | u32 nritems; | |
5f39d397 | 471 | nritems = btrfs_header_nritems(leaf); |
8c2383c3 CM |
472 | if (slot >= nritems - 1) { |
473 | nextret = btrfs_next_leaf(root, path); | |
474 | if (nextret) | |
475 | goto out; | |
ccd467d6 | 476 | recow = 1; |
8c2383c3 CM |
477 | } else { |
478 | path->slots[0]++; | |
479 | } | |
480 | goto next_slot; | |
39279cc3 CM |
481 | } |
482 | ||
c8b97818 | 483 | if (end <= extent_end && start >= key.offset && found_inline) |
179e29e4 | 484 | *hint_byte = EXTENT_MAP_INLINE; |
31840ae1 ZY |
485 | |
486 | if (found_extent) { | |
487 | read_extent_buffer(leaf, &old, (unsigned long)extent, | |
488 | sizeof(old)); | |
489 | root_gen = btrfs_header_generation(leaf); | |
490 | root_owner = btrfs_header_owner(leaf); | |
491 | leaf_start = leaf->start; | |
179e29e4 | 492 | } |
31840ae1 | 493 | |
39279cc3 | 494 | if (end < extent_end && end >= key.offset) { |
179e29e4 | 495 | bookend = 1; |
0181e58f | 496 | if (found_inline && start <= key.offset) |
179e29e4 | 497 | keep = 1; |
39279cc3 | 498 | } |
6643558d YZ |
499 | |
500 | if (bookend && found_extent && locked_end < extent_end) { | |
501 | ret = try_lock_extent(&BTRFS_I(inode)->io_tree, | |
502 | locked_end, extent_end - 1, GFP_NOFS); | |
503 | if (!ret) { | |
504 | btrfs_release_path(root, path); | |
505 | lock_extent(&BTRFS_I(inode)->io_tree, | |
506 | locked_end, extent_end - 1, GFP_NOFS); | |
507 | locked_end = extent_end; | |
508 | continue; | |
509 | } | |
510 | locked_end = extent_end; | |
511 | } | |
512 | ||
513 | if (found_inline) { | |
514 | u64 mask = root->sectorsize - 1; | |
515 | search_start = (extent_end + mask) & ~mask; | |
516 | } else | |
517 | search_start = extent_end; | |
518 | ||
39279cc3 CM |
519 | /* truncate existing extent */ |
520 | if (start > key.offset) { | |
521 | u64 new_num; | |
522 | u64 old_num; | |
523 | keep = 1; | |
5f39d397 | 524 | WARN_ON(start & (root->sectorsize - 1)); |
39279cc3 | 525 | if (found_extent) { |
db94535d CM |
526 | new_num = start - key.offset; |
527 | old_num = btrfs_file_extent_num_bytes(leaf, | |
528 | extent); | |
529 | *hint_byte = | |
530 | btrfs_file_extent_disk_bytenr(leaf, | |
531 | extent); | |
532 | if (btrfs_file_extent_disk_bytenr(leaf, | |
533 | extent)) { | |
a76a3cd4 YZ |
534 | inode_sub_bytes(inode, old_num - |
535 | new_num); | |
39279cc3 | 536 | } |
db94535d CM |
537 | btrfs_set_file_extent_num_bytes(leaf, extent, |
538 | new_num); | |
5f39d397 | 539 | btrfs_mark_buffer_dirty(leaf); |
00f5c795 CM |
540 | } else if (key.offset < inline_limit && |
541 | (end > extent_end) && | |
542 | (inline_limit < extent_end)) { | |
3326d1b0 CM |
543 | u32 new_size; |
544 | new_size = btrfs_file_extent_calc_inline_size( | |
00f5c795 | 545 | inline_limit - key.offset); |
a76a3cd4 YZ |
546 | inode_sub_bytes(inode, extent_end - |
547 | inline_limit); | |
3326d1b0 | 548 | btrfs_truncate_item(trans, root, path, |
179e29e4 | 549 | new_size, 1); |
39279cc3 CM |
550 | } |
551 | } | |
552 | /* delete the entire extent */ | |
553 | if (!keep) { | |
a76a3cd4 YZ |
554 | if (found_inline) |
555 | inode_sub_bytes(inode, extent_end - | |
556 | key.offset); | |
39279cc3 | 557 | ret = btrfs_del_item(trans, root, path); |
54aa1f4d | 558 | /* TODO update progress marker and return */ |
39279cc3 | 559 | BUG_ON(ret); |
39279cc3 | 560 | extent = NULL; |
31840ae1 ZY |
561 | btrfs_release_path(root, path); |
562 | /* the extent will be freed later */ | |
39279cc3 | 563 | } |
0181e58f | 564 | if (bookend && found_inline && start <= key.offset) { |
179e29e4 CM |
565 | u32 new_size; |
566 | new_size = btrfs_file_extent_calc_inline_size( | |
0181e58f | 567 | extent_end - end); |
a76a3cd4 | 568 | inode_sub_bytes(inode, end - key.offset); |
31840ae1 ZY |
569 | ret = btrfs_truncate_item(trans, root, path, |
570 | new_size, 0); | |
571 | BUG_ON(ret); | |
179e29e4 | 572 | } |
39279cc3 CM |
573 | /* create bookend, splitting the extent in two */ |
574 | if (bookend && found_extent) { | |
31840ae1 | 575 | u64 disk_bytenr; |
39279cc3 CM |
576 | struct btrfs_key ins; |
577 | ins.objectid = inode->i_ino; | |
578 | ins.offset = end; | |
39279cc3 | 579 | btrfs_set_key_type(&ins, BTRFS_EXTENT_DATA_KEY); |
39279cc3 CM |
580 | btrfs_release_path(root, path); |
581 | ret = btrfs_insert_empty_item(trans, root, path, &ins, | |
582 | sizeof(*extent)); | |
31840ae1 | 583 | BUG_ON(ret); |
8c2383c3 | 584 | |
5f39d397 | 585 | leaf = path->nodes[0]; |
5f39d397 CM |
586 | extent = btrfs_item_ptr(leaf, path->slots[0], |
587 | struct btrfs_file_extent_item); | |
588 | write_extent_buffer(leaf, &old, | |
589 | (unsigned long)extent, sizeof(old)); | |
590 | ||
c8b97818 CM |
591 | btrfs_set_file_extent_compression(leaf, extent, |
592 | compression); | |
593 | btrfs_set_file_extent_encryption(leaf, extent, | |
594 | encryption); | |
595 | btrfs_set_file_extent_other_encoding(leaf, extent, | |
596 | other_encoding); | |
5f39d397 | 597 | btrfs_set_file_extent_offset(leaf, extent, |
db94535d CM |
598 | le64_to_cpu(old.offset) + end - key.offset); |
599 | WARN_ON(le64_to_cpu(old.num_bytes) < | |
600 | (extent_end - end)); | |
601 | btrfs_set_file_extent_num_bytes(leaf, extent, | |
602 | extent_end - end); | |
c8b97818 CM |
603 | |
604 | /* | |
605 | * set the ram bytes to the size of the full extent | |
606 | * before splitting. This is a worst case flag, | |
607 | * but its the best we can do because we don't know | |
608 | * how splitting affects compression | |
609 | */ | |
610 | btrfs_set_file_extent_ram_bytes(leaf, extent, | |
611 | ram_bytes); | |
5f39d397 | 612 | btrfs_set_file_extent_type(leaf, extent, |
39279cc3 | 613 | BTRFS_FILE_EXTENT_REG); |
db94535d | 614 | |
39279cc3 | 615 | btrfs_mark_buffer_dirty(path->nodes[0]); |
31840ae1 ZY |
616 | |
617 | disk_bytenr = le64_to_cpu(old.disk_bytenr); | |
618 | if (disk_bytenr != 0) { | |
619 | ret = btrfs_inc_extent_ref(trans, root, | |
620 | disk_bytenr, | |
621 | le64_to_cpu(old.disk_num_bytes), | |
622 | leaf->start, | |
623 | root->root_key.objectid, | |
3bb1a1bc | 624 | trans->transid, ins.objectid); |
31840ae1 ZY |
625 | BUG_ON(ret); |
626 | } | |
627 | btrfs_release_path(root, path); | |
628 | if (disk_bytenr != 0) { | |
a76a3cd4 | 629 | inode_add_bytes(inode, extent_end - end); |
39279cc3 | 630 | } |
31840ae1 ZY |
631 | } |
632 | ||
633 | if (found_extent && !keep) { | |
634 | u64 disk_bytenr = le64_to_cpu(old.disk_bytenr); | |
635 | ||
636 | if (disk_bytenr != 0) { | |
a76a3cd4 YZ |
637 | inode_sub_bytes(inode, |
638 | le64_to_cpu(old.num_bytes)); | |
31840ae1 ZY |
639 | ret = btrfs_free_extent(trans, root, |
640 | disk_bytenr, | |
641 | le64_to_cpu(old.disk_num_bytes), | |
642 | leaf_start, root_owner, | |
3bb1a1bc | 643 | root_gen, key.objectid, 0); |
31840ae1 ZY |
644 | BUG_ON(ret); |
645 | *hint_byte = disk_bytenr; | |
646 | } | |
647 | } | |
648 | ||
649 | if (search_start >= end) { | |
39279cc3 CM |
650 | ret = 0; |
651 | goto out; | |
652 | } | |
653 | } | |
654 | out: | |
655 | btrfs_free_path(path); | |
6643558d YZ |
656 | if (locked_end > end) { |
657 | unlock_extent(&BTRFS_I(inode)->io_tree, end, locked_end - 1, | |
658 | GFP_NOFS); | |
659 | } | |
9069218d | 660 | btrfs_check_file(root, inode); |
39279cc3 CM |
661 | return ret; |
662 | } | |
663 | ||
664 | /* | |
d352ac68 CM |
665 | * this gets pages into the page cache and locks them down, it also properly |
666 | * waits for data=ordered extents to finish before allowing the pages to be | |
667 | * modified. | |
39279cc3 | 668 | */ |
a1b32a59 | 669 | static int noinline prepare_pages(struct btrfs_root *root, struct file *file, |
98ed5174 CM |
670 | struct page **pages, size_t num_pages, |
671 | loff_t pos, unsigned long first_index, | |
672 | unsigned long last_index, size_t write_bytes) | |
39279cc3 CM |
673 | { |
674 | int i; | |
675 | unsigned long index = pos >> PAGE_CACHE_SHIFT; | |
6da6abae | 676 | struct inode *inode = fdentry(file)->d_inode; |
39279cc3 | 677 | int err = 0; |
8c2383c3 | 678 | u64 start_pos; |
e6dcd2dc | 679 | u64 last_pos; |
8c2383c3 | 680 | |
5f39d397 | 681 | start_pos = pos & ~((u64)root->sectorsize - 1); |
e6dcd2dc | 682 | last_pos = ((u64)index + num_pages) << PAGE_CACHE_SHIFT; |
39279cc3 | 683 | |
9036c102 YZ |
684 | if (start_pos > inode->i_size) { |
685 | err = btrfs_cont_expand(inode, start_pos); | |
686 | if (err) | |
687 | return err; | |
688 | } | |
689 | ||
39279cc3 | 690 | memset(pages, 0, num_pages * sizeof(struct page *)); |
e6dcd2dc | 691 | again: |
39279cc3 CM |
692 | for (i = 0; i < num_pages; i++) { |
693 | pages[i] = grab_cache_page(inode->i_mapping, index + i); | |
694 | if (!pages[i]) { | |
695 | err = -ENOMEM; | |
a52d9a80 | 696 | BUG_ON(1); |
39279cc3 | 697 | } |
ccd467d6 | 698 | wait_on_page_writeback(pages[i]); |
39279cc3 | 699 | } |
0762704b | 700 | if (start_pos < inode->i_size) { |
e6dcd2dc | 701 | struct btrfs_ordered_extent *ordered; |
d99cb30a CM |
702 | lock_extent(&BTRFS_I(inode)->io_tree, |
703 | start_pos, last_pos - 1, GFP_NOFS); | |
e6dcd2dc CM |
704 | ordered = btrfs_lookup_first_ordered_extent(inode, last_pos -1); |
705 | if (ordered && | |
706 | ordered->file_offset + ordered->len > start_pos && | |
707 | ordered->file_offset < last_pos) { | |
708 | btrfs_put_ordered_extent(ordered); | |
709 | unlock_extent(&BTRFS_I(inode)->io_tree, | |
710 | start_pos, last_pos - 1, GFP_NOFS); | |
711 | for (i = 0; i < num_pages; i++) { | |
712 | unlock_page(pages[i]); | |
713 | page_cache_release(pages[i]); | |
714 | } | |
715 | btrfs_wait_ordered_range(inode, start_pos, | |
716 | last_pos - start_pos); | |
717 | goto again; | |
718 | } | |
719 | if (ordered) | |
720 | btrfs_put_ordered_extent(ordered); | |
721 | ||
0762704b CM |
722 | clear_extent_bits(&BTRFS_I(inode)->io_tree, start_pos, |
723 | last_pos - 1, EXTENT_DIRTY | EXTENT_DELALLOC, | |
724 | GFP_NOFS); | |
d99cb30a CM |
725 | unlock_extent(&BTRFS_I(inode)->io_tree, |
726 | start_pos, last_pos - 1, GFP_NOFS); | |
0762704b | 727 | } |
e6dcd2dc | 728 | for (i = 0; i < num_pages; i++) { |
f87f057b | 729 | clear_page_dirty_for_io(pages[i]); |
e6dcd2dc CM |
730 | set_page_extent_mapped(pages[i]); |
731 | WARN_ON(!PageLocked(pages[i])); | |
732 | } | |
39279cc3 | 733 | return 0; |
39279cc3 CM |
734 | } |
735 | ||
736 | static ssize_t btrfs_file_write(struct file *file, const char __user *buf, | |
737 | size_t count, loff_t *ppos) | |
738 | { | |
739 | loff_t pos; | |
2ff3e9b6 CM |
740 | loff_t start_pos; |
741 | ssize_t num_written = 0; | |
742 | ssize_t err = 0; | |
39279cc3 | 743 | int ret = 0; |
6da6abae | 744 | struct inode *inode = fdentry(file)->d_inode; |
39279cc3 | 745 | struct btrfs_root *root = BTRFS_I(inode)->root; |
8c2383c3 CM |
746 | struct page **pages = NULL; |
747 | int nrptrs; | |
39279cc3 CM |
748 | struct page *pinned[2]; |
749 | unsigned long first_index; | |
750 | unsigned long last_index; | |
cb843a6f CM |
751 | int will_write; |
752 | ||
753 | will_write = ((file->f_flags & O_SYNC) || IS_SYNC(inode) || | |
754 | (file->f_flags & O_DIRECT)); | |
8c2383c3 CM |
755 | |
756 | nrptrs = min((count + PAGE_CACHE_SIZE - 1) / PAGE_CACHE_SIZE, | |
757 | PAGE_CACHE_SIZE / (sizeof(struct page *))); | |
39279cc3 CM |
758 | pinned[0] = NULL; |
759 | pinned[1] = NULL; | |
2ff3e9b6 | 760 | |
39279cc3 | 761 | pos = *ppos; |
2ff3e9b6 CM |
762 | start_pos = pos; |
763 | ||
39279cc3 CM |
764 | vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE); |
765 | current->backing_dev_info = inode->i_mapping->backing_dev_info; | |
766 | err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode)); | |
767 | if (err) | |
1832a6d5 | 768 | goto out_nolock; |
39279cc3 | 769 | if (count == 0) |
1832a6d5 | 770 | goto out_nolock; |
2b1f55b0 | 771 | |
0ee0fda0 | 772 | err = file_remove_suid(file); |
39279cc3 | 773 | if (err) |
1832a6d5 | 774 | goto out_nolock; |
39279cc3 CM |
775 | file_update_time(file); |
776 | ||
8c2383c3 | 777 | pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL); |
39279cc3 CM |
778 | |
779 | mutex_lock(&inode->i_mutex); | |
780 | first_index = pos >> PAGE_CACHE_SHIFT; | |
781 | last_index = (pos + count) >> PAGE_CACHE_SHIFT; | |
782 | ||
409c6118 CM |
783 | /* |
784 | * if this is a nodatasum mount, force summing off for the inode | |
785 | * all the time. That way a later mount with summing on won't | |
786 | * get confused | |
787 | */ | |
788 | if (btrfs_test_opt(root, NODATASUM)) | |
789 | btrfs_set_flag(inode, NODATASUM); | |
790 | ||
39279cc3 CM |
791 | /* |
792 | * there are lots of better ways to do this, but this code | |
793 | * makes sure the first and last page in the file range are | |
794 | * up to date and ready for cow | |
795 | */ | |
796 | if ((pos & (PAGE_CACHE_SIZE - 1))) { | |
797 | pinned[0] = grab_cache_page(inode->i_mapping, first_index); | |
798 | if (!PageUptodate(pinned[0])) { | |
9ebefb18 | 799 | ret = btrfs_readpage(NULL, pinned[0]); |
39279cc3 CM |
800 | BUG_ON(ret); |
801 | wait_on_page_locked(pinned[0]); | |
802 | } else { | |
803 | unlock_page(pinned[0]); | |
804 | } | |
805 | } | |
806 | if ((pos + count) & (PAGE_CACHE_SIZE - 1)) { | |
807 | pinned[1] = grab_cache_page(inode->i_mapping, last_index); | |
808 | if (!PageUptodate(pinned[1])) { | |
9ebefb18 | 809 | ret = btrfs_readpage(NULL, pinned[1]); |
39279cc3 CM |
810 | BUG_ON(ret); |
811 | wait_on_page_locked(pinned[1]); | |
812 | } else { | |
813 | unlock_page(pinned[1]); | |
814 | } | |
815 | } | |
816 | ||
39279cc3 CM |
817 | while(count > 0) { |
818 | size_t offset = pos & (PAGE_CACHE_SIZE - 1); | |
11bd143f CM |
819 | size_t write_bytes = min(count, nrptrs * |
820 | (size_t)PAGE_CACHE_SIZE - | |
8c2383c3 | 821 | offset); |
39279cc3 CM |
822 | size_t num_pages = (write_bytes + PAGE_CACHE_SIZE - 1) >> |
823 | PAGE_CACHE_SHIFT; | |
824 | ||
8c2383c3 | 825 | WARN_ON(num_pages > nrptrs); |
39279cc3 | 826 | memset(pages, 0, sizeof(pages)); |
1832a6d5 | 827 | |
1832a6d5 | 828 | ret = btrfs_check_free_space(root, write_bytes, 0); |
1832a6d5 CM |
829 | if (ret) |
830 | goto out; | |
831 | ||
39279cc3 CM |
832 | ret = prepare_pages(root, file, pages, num_pages, |
833 | pos, first_index, last_index, | |
8c2383c3 | 834 | write_bytes); |
54aa1f4d CM |
835 | if (ret) |
836 | goto out; | |
39279cc3 | 837 | |
39279cc3 CM |
838 | ret = btrfs_copy_from_user(pos, num_pages, |
839 | write_bytes, pages, buf); | |
54aa1f4d CM |
840 | if (ret) { |
841 | btrfs_drop_pages(pages, num_pages); | |
842 | goto out; | |
843 | } | |
39279cc3 CM |
844 | |
845 | ret = dirty_and_release_pages(NULL, root, file, pages, | |
846 | num_pages, pos, write_bytes); | |
39279cc3 | 847 | btrfs_drop_pages(pages, num_pages); |
54aa1f4d CM |
848 | if (ret) |
849 | goto out; | |
39279cc3 | 850 | |
cb843a6f CM |
851 | if (will_write) { |
852 | btrfs_fdatawrite_range(inode->i_mapping, pos, | |
853 | pos + write_bytes - 1, | |
854 | WB_SYNC_NONE); | |
855 | } else { | |
856 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, | |
857 | num_pages); | |
858 | if (num_pages < | |
859 | (root->leafsize >> PAGE_CACHE_SHIFT) + 1) | |
860 | btrfs_btree_balance_dirty(root, 1); | |
861 | btrfs_throttle(root); | |
862 | } | |
863 | ||
39279cc3 CM |
864 | buf += write_bytes; |
865 | count -= write_bytes; | |
866 | pos += write_bytes; | |
867 | num_written += write_bytes; | |
868 | ||
39279cc3 CM |
869 | cond_resched(); |
870 | } | |
39279cc3 | 871 | out: |
1832a6d5 | 872 | mutex_unlock(&inode->i_mutex); |
5b92ee72 | 873 | |
1832a6d5 | 874 | out_nolock: |
8c2383c3 | 875 | kfree(pages); |
39279cc3 CM |
876 | if (pinned[0]) |
877 | page_cache_release(pinned[0]); | |
878 | if (pinned[1]) | |
879 | page_cache_release(pinned[1]); | |
880 | *ppos = pos; | |
2ff3e9b6 | 881 | |
cb843a6f | 882 | if (num_written > 0 && will_write) { |
e02119d5 CM |
883 | struct btrfs_trans_handle *trans; |
884 | ||
cb843a6f CM |
885 | err = btrfs_wait_ordered_range(inode, start_pos, num_written); |
886 | if (err) | |
2ff3e9b6 | 887 | num_written = err; |
e02119d5 | 888 | |
cb843a6f CM |
889 | if ((file->f_flags & O_SYNC) || IS_SYNC(inode)) { |
890 | trans = btrfs_start_transaction(root, 1); | |
891 | ret = btrfs_log_dentry_safe(trans, root, | |
892 | file->f_dentry); | |
893 | if (ret == 0) { | |
894 | btrfs_sync_log(trans, root); | |
895 | btrfs_end_transaction(trans, root); | |
896 | } else { | |
897 | btrfs_commit_transaction(trans, root); | |
898 | } | |
899 | } | |
900 | if (file->f_flags & O_DIRECT) { | |
901 | invalidate_mapping_pages(inode->i_mapping, | |
902 | start_pos >> PAGE_CACHE_SHIFT, | |
903 | (start_pos + num_written - 1) >> PAGE_CACHE_SHIFT); | |
e02119d5 | 904 | } |
2ff3e9b6 | 905 | } |
39279cc3 | 906 | current->backing_dev_info = NULL; |
39279cc3 CM |
907 | return num_written ? num_written : err; |
908 | } | |
909 | ||
6bf13c0c | 910 | int btrfs_release_file(struct inode * inode, struct file * filp) |
e1b81e67 | 911 | { |
6bf13c0c SW |
912 | if (filp->private_data) |
913 | btrfs_ioctl_trans_end(filp); | |
e1b81e67 M |
914 | return 0; |
915 | } | |
916 | ||
d352ac68 CM |
917 | /* |
918 | * fsync call for both files and directories. This logs the inode into | |
919 | * the tree log instead of forcing full commits whenever possible. | |
920 | * | |
921 | * It needs to call filemap_fdatawait so that all ordered extent updates are | |
922 | * in the metadata btree are up to date for copying to the log. | |
923 | * | |
924 | * It drops the inode mutex before doing the tree log commit. This is an | |
925 | * important optimization for directories because holding the mutex prevents | |
926 | * new operations on the dir while we write to disk. | |
927 | */ | |
e02119d5 | 928 | int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync) |
39279cc3 CM |
929 | { |
930 | struct inode *inode = dentry->d_inode; | |
931 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
15ee9bc7 | 932 | int ret = 0; |
39279cc3 CM |
933 | struct btrfs_trans_handle *trans; |
934 | ||
935 | /* | |
15ee9bc7 JB |
936 | * check the transaction that last modified this inode |
937 | * and see if its already been committed | |
39279cc3 | 938 | */ |
15ee9bc7 JB |
939 | if (!BTRFS_I(inode)->last_trans) |
940 | goto out; | |
a2135011 | 941 | |
15ee9bc7 JB |
942 | mutex_lock(&root->fs_info->trans_mutex); |
943 | if (BTRFS_I(inode)->last_trans <= | |
944 | root->fs_info->last_trans_committed) { | |
945 | BTRFS_I(inode)->last_trans = 0; | |
946 | mutex_unlock(&root->fs_info->trans_mutex); | |
947 | goto out; | |
948 | } | |
949 | mutex_unlock(&root->fs_info->trans_mutex); | |
950 | ||
49eb7e46 | 951 | root->fs_info->tree_log_batch++; |
e02119d5 | 952 | filemap_fdatawait(inode->i_mapping); |
49eb7e46 | 953 | root->fs_info->tree_log_batch++; |
e02119d5 | 954 | |
15ee9bc7 | 955 | /* |
a52d9a80 CM |
956 | * ok we haven't committed the transaction yet, lets do a commit |
957 | */ | |
6bf13c0c SW |
958 | if (file->private_data) |
959 | btrfs_ioctl_trans_end(file); | |
960 | ||
39279cc3 CM |
961 | trans = btrfs_start_transaction(root, 1); |
962 | if (!trans) { | |
963 | ret = -ENOMEM; | |
964 | goto out; | |
965 | } | |
e02119d5 CM |
966 | |
967 | ret = btrfs_log_dentry_safe(trans, root, file->f_dentry); | |
49eb7e46 | 968 | if (ret < 0) { |
e02119d5 | 969 | goto out; |
49eb7e46 CM |
970 | } |
971 | ||
972 | /* we've logged all the items and now have a consistent | |
973 | * version of the file in the log. It is possible that | |
974 | * someone will come in and modify the file, but that's | |
975 | * fine because the log is consistent on disk, and we | |
976 | * have references to all of the file's extents | |
977 | * | |
978 | * It is possible that someone will come in and log the | |
979 | * file again, but that will end up using the synchronization | |
980 | * inside btrfs_sync_log to keep things safe. | |
981 | */ | |
982 | mutex_unlock(&file->f_dentry->d_inode->i_mutex); | |
983 | ||
e02119d5 CM |
984 | if (ret > 0) { |
985 | ret = btrfs_commit_transaction(trans, root); | |
986 | } else { | |
987 | btrfs_sync_log(trans, root); | |
988 | ret = btrfs_end_transaction(trans, root); | |
989 | } | |
49eb7e46 | 990 | mutex_lock(&file->f_dentry->d_inode->i_mutex); |
39279cc3 CM |
991 | out: |
992 | return ret > 0 ? EIO : ret; | |
993 | } | |
994 | ||
9ebefb18 | 995 | static struct vm_operations_struct btrfs_file_vm_ops = { |
92fee66d | 996 | .fault = filemap_fault, |
9ebefb18 CM |
997 | .page_mkwrite = btrfs_page_mkwrite, |
998 | }; | |
999 | ||
1000 | static int btrfs_file_mmap(struct file *filp, struct vm_area_struct *vma) | |
1001 | { | |
1002 | vma->vm_ops = &btrfs_file_vm_ops; | |
1003 | file_accessed(filp); | |
1004 | return 0; | |
1005 | } | |
1006 | ||
39279cc3 CM |
1007 | struct file_operations btrfs_file_operations = { |
1008 | .llseek = generic_file_llseek, | |
1009 | .read = do_sync_read, | |
9ebefb18 | 1010 | .aio_read = generic_file_aio_read, |
e9906a98 | 1011 | .splice_read = generic_file_splice_read, |
39279cc3 | 1012 | .write = btrfs_file_write, |
9ebefb18 | 1013 | .mmap = btrfs_file_mmap, |
39279cc3 | 1014 | .open = generic_file_open, |
e1b81e67 | 1015 | .release = btrfs_release_file, |
39279cc3 | 1016 | .fsync = btrfs_sync_file, |
34287aa3 | 1017 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 1018 | #ifdef CONFIG_COMPAT |
34287aa3 | 1019 | .compat_ioctl = btrfs_ioctl, |
39279cc3 CM |
1020 | #endif |
1021 | }; |