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" | |
dc17ff8f | 37 | #include "ordered-data.h" |
39279cc3 CM |
38 | #include "ioctl.h" |
39 | #include "print-tree.h" | |
40 | ||
41 | ||
42 | static int btrfs_copy_from_user(loff_t pos, int num_pages, int write_bytes, | |
43 | struct page **prepared_pages, | |
44 | const char __user * buf) | |
45 | { | |
46 | long page_fault = 0; | |
47 | int i; | |
48 | int offset = pos & (PAGE_CACHE_SIZE - 1); | |
49 | ||
50 | for (i = 0; i < num_pages && write_bytes > 0; i++, offset = 0) { | |
51 | size_t count = min_t(size_t, | |
52 | PAGE_CACHE_SIZE - offset, write_bytes); | |
53 | struct page *page = prepared_pages[i]; | |
54 | fault_in_pages_readable(buf, count); | |
55 | ||
56 | /* Copy data from userspace to the current page */ | |
57 | kmap(page); | |
58 | page_fault = __copy_from_user(page_address(page) + offset, | |
59 | buf, count); | |
60 | /* Flush processor's dcache for this page */ | |
61 | flush_dcache_page(page); | |
62 | kunmap(page); | |
63 | buf += count; | |
64 | write_bytes -= count; | |
65 | ||
66 | if (page_fault) | |
67 | break; | |
68 | } | |
69 | return page_fault ? -EFAULT : 0; | |
70 | } | |
71 | ||
72 | static void btrfs_drop_pages(struct page **pages, size_t num_pages) | |
73 | { | |
74 | size_t i; | |
75 | for (i = 0; i < num_pages; i++) { | |
76 | if (!pages[i]) | |
77 | break; | |
78 | unlock_page(pages[i]); | |
79 | mark_page_accessed(pages[i]); | |
80 | page_cache_release(pages[i]); | |
81 | } | |
82 | } | |
83 | ||
98ed5174 | 84 | static int noinline insert_inline_extent(struct btrfs_trans_handle *trans, |
a52d9a80 | 85 | struct btrfs_root *root, struct inode *inode, |
3326d1b0 CM |
86 | u64 offset, size_t size, |
87 | struct page **pages, size_t page_offset, | |
88 | int num_pages) | |
54aa1f4d CM |
89 | { |
90 | struct btrfs_key key; | |
91 | struct btrfs_path *path; | |
5f39d397 CM |
92 | struct extent_buffer *leaf; |
93 | char *kaddr; | |
94 | unsigned long ptr; | |
54aa1f4d | 95 | struct btrfs_file_extent_item *ei; |
3326d1b0 | 96 | struct page *page; |
54aa1f4d CM |
97 | u32 datasize; |
98 | int err = 0; | |
99 | int ret; | |
3326d1b0 CM |
100 | int i; |
101 | ssize_t cur_size; | |
54aa1f4d CM |
102 | |
103 | path = btrfs_alloc_path(); | |
104 | if (!path) | |
105 | return -ENOMEM; | |
106 | ||
54aa1f4d CM |
107 | btrfs_set_trans_block_group(trans, inode); |
108 | ||
109 | key.objectid = inode->i_ino; | |
110 | key.offset = offset; | |
54aa1f4d | 111 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); |
54aa1f4d | 112 | |
3326d1b0 CM |
113 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
114 | if (ret < 0) { | |
54aa1f4d CM |
115 | err = ret; |
116 | goto fail; | |
117 | } | |
3326d1b0 | 118 | if (ret == 1) { |
179e29e4 CM |
119 | struct btrfs_key found_key; |
120 | ||
121 | if (path->slots[0] == 0) | |
122 | goto insert; | |
123 | ||
3326d1b0 CM |
124 | path->slots[0]--; |
125 | leaf = path->nodes[0]; | |
179e29e4 CM |
126 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
127 | ||
128 | if (found_key.objectid != inode->i_ino) | |
129 | goto insert; | |
130 | ||
131 | if (found_key.type != BTRFS_EXTENT_DATA_KEY) | |
132 | goto insert; | |
3326d1b0 CM |
133 | ei = btrfs_item_ptr(leaf, path->slots[0], |
134 | struct btrfs_file_extent_item); | |
135 | ||
136 | if (btrfs_file_extent_type(leaf, ei) != | |
137 | BTRFS_FILE_EXTENT_INLINE) { | |
138 | goto insert; | |
139 | } | |
140 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
141 | ret = 0; | |
142 | } | |
143 | if (ret == 0) { | |
144 | u32 found_size; | |
18f16f7b | 145 | u64 found_end; |
3326d1b0 CM |
146 | |
147 | leaf = path->nodes[0]; | |
148 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
149 | struct btrfs_file_extent_item); | |
150 | ||
151 | if (btrfs_file_extent_type(leaf, ei) != | |
152 | BTRFS_FILE_EXTENT_INLINE) { | |
153 | err = ret; | |
154 | btrfs_print_leaf(root, leaf); | |
155 | printk("found wasn't inline offset %Lu inode %lu\n", | |
156 | offset, inode->i_ino); | |
157 | goto fail; | |
158 | } | |
3326d1b0 CM |
159 | found_size = btrfs_file_extent_inline_len(leaf, |
160 | btrfs_item_nr(leaf, path->slots[0])); | |
18f16f7b | 161 | found_end = key.offset + found_size; |
3326d1b0 | 162 | |
18f16f7b | 163 | if (found_end < offset + size) { |
3326d1b0 CM |
164 | btrfs_release_path(root, path); |
165 | ret = btrfs_search_slot(trans, root, &key, path, | |
18f16f7b | 166 | offset + size - found_end, 1); |
3326d1b0 | 167 | BUG_ON(ret != 0); |
179e29e4 | 168 | |
3326d1b0 | 169 | ret = btrfs_extend_item(trans, root, path, |
18f16f7b | 170 | offset + size - found_end); |
3326d1b0 CM |
171 | if (ret) { |
172 | err = ret; | |
173 | goto fail; | |
174 | } | |
175 | leaf = path->nodes[0]; | |
176 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
177 | struct btrfs_file_extent_item); | |
178 | } | |
18f16f7b Y |
179 | if (found_end < offset) { |
180 | ptr = btrfs_file_extent_inline_start(ei) + found_size; | |
181 | memset_extent_buffer(leaf, 0, ptr, offset - found_end); | |
182 | } | |
3326d1b0 CM |
183 | } else { |
184 | insert: | |
185 | btrfs_release_path(root, path); | |
18f16f7b Y |
186 | datasize = offset + size - key.offset; |
187 | datasize = btrfs_file_extent_calc_inline_size(datasize); | |
3326d1b0 CM |
188 | ret = btrfs_insert_empty_item(trans, root, path, &key, |
189 | datasize); | |
190 | if (ret) { | |
191 | err = ret; | |
192 | printk("got bad ret %d\n", ret); | |
193 | goto fail; | |
194 | } | |
195 | leaf = path->nodes[0]; | |
196 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
197 | struct btrfs_file_extent_item); | |
198 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
199 | btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE); | |
200 | } | |
18f16f7b | 201 | ptr = btrfs_file_extent_inline_start(ei) + offset - key.offset; |
3326d1b0 CM |
202 | |
203 | cur_size = size; | |
204 | i = 0; | |
205 | while (size > 0) { | |
206 | page = pages[i]; | |
207 | kaddr = kmap_atomic(page, KM_USER0); | |
ae2f5411 | 208 | cur_size = min_t(size_t, PAGE_CACHE_SIZE - page_offset, size); |
3326d1b0 CM |
209 | write_extent_buffer(leaf, kaddr + page_offset, ptr, cur_size); |
210 | kunmap_atomic(kaddr, KM_USER0); | |
211 | page_offset = 0; | |
212 | ptr += cur_size; | |
213 | size -= cur_size; | |
214 | if (i >= num_pages) { | |
215 | printk("i %d num_pages %d\n", i, num_pages); | |
216 | } | |
217 | i++; | |
218 | } | |
5f39d397 | 219 | btrfs_mark_buffer_dirty(leaf); |
54aa1f4d CM |
220 | fail: |
221 | btrfs_free_path(path); | |
54aa1f4d CM |
222 | return err; |
223 | } | |
224 | ||
98ed5174 | 225 | static int noinline dirty_and_release_pages(struct btrfs_trans_handle *trans, |
39279cc3 CM |
226 | struct btrfs_root *root, |
227 | struct file *file, | |
228 | struct page **pages, | |
229 | size_t num_pages, | |
230 | loff_t pos, | |
231 | size_t write_bytes) | |
232 | { | |
39279cc3 | 233 | int err = 0; |
a52d9a80 | 234 | int i; |
6da6abae | 235 | struct inode *inode = fdentry(file)->d_inode; |
d1310b2e | 236 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
db94535d CM |
237 | u64 hint_byte; |
238 | u64 num_bytes; | |
a52d9a80 CM |
239 | u64 start_pos; |
240 | u64 end_of_last_block; | |
241 | u64 end_pos = pos + write_bytes; | |
dcfec0dc | 242 | u64 inline_size; |
a52d9a80 | 243 | loff_t isize = i_size_read(inode); |
39279cc3 | 244 | |
5f39d397 | 245 | start_pos = pos & ~((u64)root->sectorsize - 1); |
db94535d CM |
246 | num_bytes = (write_bytes + pos - start_pos + |
247 | root->sectorsize - 1) & ~((u64)root->sectorsize - 1); | |
39279cc3 | 248 | |
db94535d CM |
249 | end_of_last_block = start_pos + num_bytes - 1; |
250 | ||
d1310b2e | 251 | lock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
a52d9a80 CM |
252 | mutex_lock(&root->fs_info->fs_mutex); |
253 | trans = btrfs_start_transaction(root, 1); | |
254 | if (!trans) { | |
255 | err = -ENOMEM; | |
256 | goto out_unlock; | |
257 | } | |
258 | btrfs_set_trans_block_group(trans, inode); | |
db94535d CM |
259 | inode->i_blocks += num_bytes >> 9; |
260 | hint_byte = 0; | |
a52d9a80 CM |
261 | |
262 | if ((end_of_last_block & 4095) == 0) { | |
9433063b | 263 | printk("strange end of last %Lu %zu %Lu\n", start_pos, write_bytes, end_of_last_block); |
a52d9a80 | 264 | } |
d1310b2e | 265 | set_extent_uptodate(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
a52d9a80 CM |
266 | |
267 | /* FIXME...EIEIO, ENOSPC and more */ | |
268 | ||
a52d9a80 CM |
269 | /* insert any holes we need to create */ |
270 | if (inode->i_size < start_pos) { | |
271 | u64 last_pos_in_file; | |
272 | u64 hole_size; | |
5f39d397 | 273 | u64 mask = root->sectorsize - 1; |
a52d9a80 | 274 | last_pos_in_file = (isize + mask) & ~mask; |
5f56406a | 275 | hole_size = (end_pos - last_pos_in_file + mask) & ~mask; |
2bf5a725 | 276 | |
a52d9a80 | 277 | if (last_pos_in_file < start_pos) { |
2bf5a725 CM |
278 | err = btrfs_drop_extents(trans, root, inode, |
279 | last_pos_in_file, | |
280 | last_pos_in_file + hole_size, | |
3326d1b0 | 281 | last_pos_in_file, |
db94535d | 282 | &hint_byte); |
2bf5a725 CM |
283 | if (err) |
284 | goto failed; | |
285 | ||
a52d9a80 CM |
286 | err = btrfs_insert_file_extent(trans, root, |
287 | inode->i_ino, | |
288 | last_pos_in_file, | |
289 | 0, 0, hole_size); | |
d1310b2e CM |
290 | btrfs_drop_extent_cache(inode, last_pos_in_file, |
291 | last_pos_in_file + hole_size -1); | |
5f56406a | 292 | btrfs_check_file(root, inode); |
a52d9a80 CM |
293 | } |
294 | if (err) | |
39279cc3 | 295 | goto failed; |
a52d9a80 CM |
296 | } |
297 | ||
298 | /* | |
299 | * either allocate an extent for the new bytes or setup the key | |
300 | * to show we are doing inline data in the extent | |
301 | */ | |
3326d1b0 CM |
302 | inline_size = end_pos; |
303 | if (isize >= BTRFS_MAX_INLINE_DATA_SIZE(root) || | |
6f568d35 CM |
304 | inline_size > root->fs_info->max_inline || |
305 | (inline_size & (root->sectorsize -1)) == 0 || | |
3326d1b0 | 306 | inline_size >= BTRFS_MAX_INLINE_DATA_SIZE(root)) { |
b888db2b | 307 | u64 last_end; |
1832a6d5 | 308 | u64 existing_delalloc = 0; |
3326d1b0 | 309 | |
a52d9a80 CM |
310 | for (i = 0; i < num_pages; i++) { |
311 | struct page *p = pages[i]; | |
312 | SetPageUptodate(p); | |
b888db2b | 313 | set_page_dirty(p); |
39279cc3 | 314 | } |
35ebb934 CM |
315 | last_end = (u64)(pages[num_pages -1]->index) << |
316 | PAGE_CACHE_SHIFT; | |
b888db2b | 317 | last_end += PAGE_CACHE_SIZE - 1; |
1832a6d5 CM |
318 | if (start_pos < isize) { |
319 | u64 delalloc_start = start_pos; | |
d1310b2e | 320 | existing_delalloc = count_range_bits(io_tree, |
1832a6d5 CM |
321 | &delalloc_start, |
322 | end_of_last_block, (u64)-1, | |
323 | EXTENT_DELALLOC); | |
324 | } | |
d1310b2e | 325 | set_extent_delalloc(io_tree, start_pos, end_of_last_block, |
b888db2b | 326 | GFP_NOFS); |
dc17ff8f | 327 | btrfs_add_ordered_inode(inode); |
a52d9a80 | 328 | } else { |
3326d1b0 | 329 | u64 aligned_end; |
b888db2b | 330 | /* step one, delete the existing extents in this range */ |
3326d1b0 CM |
331 | aligned_end = (pos + write_bytes + root->sectorsize - 1) & |
332 | ~((u64)root->sectorsize - 1); | |
2bf5a725 | 333 | err = btrfs_drop_extents(trans, root, inode, start_pos, |
179e29e4 | 334 | aligned_end, aligned_end, &hint_byte); |
2bf5a725 CM |
335 | if (err) |
336 | goto failed; | |
dcfec0dc Y |
337 | if (isize > inline_size) |
338 | inline_size = min_t(u64, isize, aligned_end); | |
339 | inline_size -= start_pos; | |
a52d9a80 | 340 | err = insert_inline_extent(trans, root, inode, start_pos, |
dcfec0dc | 341 | inline_size, pages, 0, num_pages); |
d1310b2e | 342 | btrfs_drop_extent_cache(inode, start_pos, aligned_end - 1); |
a52d9a80 | 343 | BUG_ON(err); |
a52d9a80 CM |
344 | } |
345 | if (end_pos > isize) { | |
346 | i_size_write(inode, end_pos); | |
347 | btrfs_update_inode(trans, root, inode); | |
39279cc3 CM |
348 | } |
349 | failed: | |
a52d9a80 CM |
350 | err = btrfs_end_transaction(trans, root); |
351 | out_unlock: | |
352 | mutex_unlock(&root->fs_info->fs_mutex); | |
d1310b2e | 353 | unlock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS); |
39279cc3 CM |
354 | return err; |
355 | } | |
356 | ||
a52d9a80 CM |
357 | int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end) |
358 | { | |
359 | struct extent_map *em; | |
360 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
361 | ||
362 | while(1) { | |
d1310b2e | 363 | spin_lock(&em_tree->lock); |
a52d9a80 | 364 | em = lookup_extent_mapping(em_tree, start, end); |
d1310b2e CM |
365 | if (!em) { |
366 | spin_unlock(&em_tree->lock); | |
a52d9a80 | 367 | break; |
d1310b2e | 368 | } |
a52d9a80 | 369 | remove_extent_mapping(em_tree, em); |
d1310b2e CM |
370 | spin_unlock(&em_tree->lock); |
371 | ||
a52d9a80 CM |
372 | /* once for us */ |
373 | free_extent_map(em); | |
374 | /* once for the tree*/ | |
375 | free_extent_map(em); | |
376 | } | |
377 | return 0; | |
378 | } | |
379 | ||
5f56406a CM |
380 | int btrfs_check_file(struct btrfs_root *root, struct inode *inode) |
381 | { | |
382 | return 0; | |
383 | #if 0 | |
384 | struct btrfs_path *path; | |
385 | struct btrfs_key found_key; | |
386 | struct extent_buffer *leaf; | |
387 | struct btrfs_file_extent_item *extent; | |
388 | u64 last_offset = 0; | |
389 | int nritems; | |
390 | int slot; | |
391 | int found_type; | |
392 | int ret; | |
393 | int err = 0; | |
394 | u64 extent_end = 0; | |
395 | ||
396 | path = btrfs_alloc_path(); | |
397 | ret = btrfs_lookup_file_extent(NULL, root, path, inode->i_ino, | |
398 | last_offset, 0); | |
399 | while(1) { | |
400 | nritems = btrfs_header_nritems(path->nodes[0]); | |
401 | if (path->slots[0] >= nritems) { | |
402 | ret = btrfs_next_leaf(root, path); | |
403 | if (ret) | |
404 | goto out; | |
405 | nritems = btrfs_header_nritems(path->nodes[0]); | |
406 | } | |
407 | slot = path->slots[0]; | |
408 | leaf = path->nodes[0]; | |
409 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
410 | if (found_key.objectid != inode->i_ino) | |
411 | break; | |
412 | if (found_key.type != BTRFS_EXTENT_DATA_KEY) | |
413 | goto out; | |
414 | ||
415 | if (found_key.offset != last_offset) { | |
416 | WARN_ON(1); | |
417 | btrfs_print_leaf(root, leaf); | |
418 | printk("inode %lu found offset %Lu expected %Lu\n", | |
419 | inode->i_ino, found_key.offset, last_offset); | |
420 | err = 1; | |
421 | goto out; | |
422 | } | |
423 | extent = btrfs_item_ptr(leaf, slot, | |
424 | struct btrfs_file_extent_item); | |
425 | found_type = btrfs_file_extent_type(leaf, extent); | |
426 | if (found_type == BTRFS_FILE_EXTENT_REG) { | |
427 | extent_end = found_key.offset + | |
428 | btrfs_file_extent_num_bytes(leaf, extent); | |
429 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
430 | struct btrfs_item *item; | |
431 | item = btrfs_item_nr(leaf, slot); | |
432 | extent_end = found_key.offset + | |
433 | btrfs_file_extent_inline_len(leaf, item); | |
434 | extent_end = (extent_end + root->sectorsize - 1) & | |
435 | ~((u64)root->sectorsize -1 ); | |
436 | } | |
437 | last_offset = extent_end; | |
438 | path->slots[0]++; | |
439 | } | |
440 | if (last_offset < inode->i_size) { | |
441 | WARN_ON(1); | |
442 | btrfs_print_leaf(root, leaf); | |
443 | printk("inode %lu found offset %Lu size %Lu\n", inode->i_ino, | |
444 | last_offset, inode->i_size); | |
445 | err = 1; | |
446 | ||
447 | } | |
448 | out: | |
449 | btrfs_free_path(path); | |
450 | return err; | |
451 | #endif | |
452 | } | |
453 | ||
39279cc3 CM |
454 | /* |
455 | * this is very complex, but the basic idea is to drop all extents | |
456 | * in the range start - end. hint_block is filled in with a block number | |
457 | * that would be a good hint to the block allocator for this file. | |
458 | * | |
459 | * If an extent intersects the range but is not entirely inside the range | |
460 | * it is either truncated or split. Anything entirely inside the range | |
461 | * is deleted from the tree. | |
462 | */ | |
463 | int btrfs_drop_extents(struct btrfs_trans_handle *trans, | |
464 | struct btrfs_root *root, struct inode *inode, | |
00f5c795 | 465 | u64 start, u64 end, u64 inline_limit, u64 *hint_byte) |
39279cc3 | 466 | { |
00f5c795 CM |
467 | u64 extent_end = 0; |
468 | u64 search_start = start; | |
5f39d397 | 469 | struct extent_buffer *leaf; |
39279cc3 | 470 | struct btrfs_file_extent_item *extent; |
39279cc3 | 471 | struct btrfs_path *path; |
00f5c795 CM |
472 | struct btrfs_key key; |
473 | struct btrfs_file_extent_item old; | |
474 | int keep; | |
475 | int slot; | |
39279cc3 CM |
476 | int bookend; |
477 | int found_type; | |
478 | int found_extent; | |
479 | int found_inline; | |
ccd467d6 | 480 | int recow; |
00f5c795 | 481 | int ret; |
39279cc3 | 482 | |
a52d9a80 CM |
483 | btrfs_drop_extent_cache(inode, start, end - 1); |
484 | ||
39279cc3 CM |
485 | path = btrfs_alloc_path(); |
486 | if (!path) | |
487 | return -ENOMEM; | |
488 | while(1) { | |
ccd467d6 | 489 | recow = 0; |
39279cc3 CM |
490 | btrfs_release_path(root, path); |
491 | ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino, | |
492 | search_start, -1); | |
493 | if (ret < 0) | |
494 | goto out; | |
495 | if (ret > 0) { | |
496 | if (path->slots[0] == 0) { | |
497 | ret = 0; | |
498 | goto out; | |
499 | } | |
500 | path->slots[0]--; | |
501 | } | |
8c2383c3 | 502 | next_slot: |
39279cc3 CM |
503 | keep = 0; |
504 | bookend = 0; | |
505 | found_extent = 0; | |
506 | found_inline = 0; | |
507 | extent = NULL; | |
5f39d397 | 508 | leaf = path->nodes[0]; |
39279cc3 | 509 | slot = path->slots[0]; |
8c2383c3 | 510 | ret = 0; |
5f39d397 | 511 | btrfs_item_key_to_cpu(leaf, &key, slot); |
5f56406a | 512 | |
39279cc3 | 513 | if (key.offset >= end || key.objectid != inode->i_ino) { |
39279cc3 CM |
514 | goto out; |
515 | } | |
8c2383c3 | 516 | if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY) { |
39279cc3 CM |
517 | goto out; |
518 | } | |
ccd467d6 CM |
519 | if (recow) { |
520 | search_start = key.offset; | |
521 | continue; | |
522 | } | |
8c2383c3 CM |
523 | if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) { |
524 | extent = btrfs_item_ptr(leaf, slot, | |
525 | struct btrfs_file_extent_item); | |
5f39d397 | 526 | found_type = btrfs_file_extent_type(leaf, extent); |
8c2383c3 | 527 | if (found_type == BTRFS_FILE_EXTENT_REG) { |
257d0ce3 CM |
528 | extent_end = |
529 | btrfs_file_extent_disk_bytenr(leaf, | |
530 | extent); | |
531 | if (extent_end) | |
532 | *hint_byte = extent_end; | |
533 | ||
8c2383c3 | 534 | extent_end = key.offset + |
db94535d | 535 | btrfs_file_extent_num_bytes(leaf, extent); |
8c2383c3 CM |
536 | found_extent = 1; |
537 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
5f39d397 CM |
538 | struct btrfs_item *item; |
539 | item = btrfs_item_nr(leaf, slot); | |
8c2383c3 CM |
540 | found_inline = 1; |
541 | extent_end = key.offset + | |
5f39d397 | 542 | btrfs_file_extent_inline_len(leaf, item); |
8c2383c3 CM |
543 | } |
544 | } else { | |
545 | extent_end = search_start; | |
39279cc3 CM |
546 | } |
547 | ||
548 | /* we found nothing we can drop */ | |
8c2383c3 CM |
549 | if ((!found_extent && !found_inline) || |
550 | search_start >= extent_end) { | |
551 | int nextret; | |
552 | u32 nritems; | |
5f39d397 | 553 | nritems = btrfs_header_nritems(leaf); |
8c2383c3 CM |
554 | if (slot >= nritems - 1) { |
555 | nextret = btrfs_next_leaf(root, path); | |
556 | if (nextret) | |
557 | goto out; | |
ccd467d6 | 558 | recow = 1; |
8c2383c3 CM |
559 | } else { |
560 | path->slots[0]++; | |
561 | } | |
562 | goto next_slot; | |
39279cc3 CM |
563 | } |
564 | ||
39279cc3 | 565 | if (found_inline) { |
5f39d397 | 566 | u64 mask = root->sectorsize - 1; |
39279cc3 CM |
567 | search_start = (extent_end + mask) & ~mask; |
568 | } else | |
569 | search_start = extent_end; | |
6e3b9666 | 570 | if (end <= extent_end && start >= key.offset && found_inline) { |
179e29e4 | 571 | *hint_byte = EXTENT_MAP_INLINE; |
6e3b9666 | 572 | continue; |
179e29e4 | 573 | } |
39279cc3 CM |
574 | if (end < extent_end && end >= key.offset) { |
575 | if (found_extent) { | |
db94535d CM |
576 | u64 disk_bytenr = |
577 | btrfs_file_extent_disk_bytenr(leaf, extent); | |
578 | u64 disk_num_bytes = | |
579 | btrfs_file_extent_disk_num_bytes(leaf, | |
5f39d397 CM |
580 | extent); |
581 | read_extent_buffer(leaf, &old, | |
582 | (unsigned long)extent, | |
583 | sizeof(old)); | |
db94535d | 584 | if (disk_bytenr != 0) { |
39279cc3 | 585 | ret = btrfs_inc_extent_ref(trans, root, |
7bb86316 CM |
586 | disk_bytenr, disk_num_bytes, |
587 | root->root_key.objectid, | |
588 | trans->transid, | |
589 | key.objectid, end); | |
39279cc3 CM |
590 | BUG_ON(ret); |
591 | } | |
592 | } | |
179e29e4 | 593 | bookend = 1; |
0181e58f | 594 | if (found_inline && start <= key.offset) |
179e29e4 | 595 | keep = 1; |
39279cc3 | 596 | } |
39279cc3 CM |
597 | /* truncate existing extent */ |
598 | if (start > key.offset) { | |
599 | u64 new_num; | |
600 | u64 old_num; | |
601 | keep = 1; | |
5f39d397 | 602 | WARN_ON(start & (root->sectorsize - 1)); |
39279cc3 | 603 | if (found_extent) { |
db94535d CM |
604 | new_num = start - key.offset; |
605 | old_num = btrfs_file_extent_num_bytes(leaf, | |
606 | extent); | |
607 | *hint_byte = | |
608 | btrfs_file_extent_disk_bytenr(leaf, | |
609 | extent); | |
610 | if (btrfs_file_extent_disk_bytenr(leaf, | |
611 | extent)) { | |
39279cc3 | 612 | inode->i_blocks -= |
db94535d | 613 | (old_num - new_num) >> 9; |
39279cc3 | 614 | } |
db94535d CM |
615 | btrfs_set_file_extent_num_bytes(leaf, extent, |
616 | new_num); | |
5f39d397 | 617 | btrfs_mark_buffer_dirty(leaf); |
00f5c795 CM |
618 | } else if (key.offset < inline_limit && |
619 | (end > extent_end) && | |
620 | (inline_limit < extent_end)) { | |
3326d1b0 CM |
621 | u32 new_size; |
622 | new_size = btrfs_file_extent_calc_inline_size( | |
00f5c795 | 623 | inline_limit - key.offset); |
3326d1b0 | 624 | btrfs_truncate_item(trans, root, path, |
179e29e4 | 625 | new_size, 1); |
39279cc3 CM |
626 | } |
627 | } | |
628 | /* delete the entire extent */ | |
629 | if (!keep) { | |
db94535d CM |
630 | u64 disk_bytenr = 0; |
631 | u64 disk_num_bytes = 0; | |
632 | u64 extent_num_bytes = 0; | |
7bb86316 | 633 | u64 root_gen; |
d8d5f3e1 | 634 | u64 root_owner; |
7bb86316 | 635 | |
d8d5f3e1 CM |
636 | root_gen = btrfs_header_generation(leaf); |
637 | root_owner = btrfs_header_owner(leaf); | |
39279cc3 | 638 | if (found_extent) { |
db94535d CM |
639 | disk_bytenr = |
640 | btrfs_file_extent_disk_bytenr(leaf, | |
5f39d397 | 641 | extent); |
db94535d CM |
642 | disk_num_bytes = |
643 | btrfs_file_extent_disk_num_bytes(leaf, | |
5f39d397 | 644 | extent); |
db94535d CM |
645 | extent_num_bytes = |
646 | btrfs_file_extent_num_bytes(leaf, extent); | |
647 | *hint_byte = | |
648 | btrfs_file_extent_disk_bytenr(leaf, | |
649 | extent); | |
39279cc3 CM |
650 | } |
651 | ret = btrfs_del_item(trans, root, path); | |
54aa1f4d | 652 | /* TODO update progress marker and return */ |
39279cc3 CM |
653 | BUG_ON(ret); |
654 | btrfs_release_path(root, path); | |
655 | extent = NULL; | |
db94535d CM |
656 | if (found_extent && disk_bytenr != 0) { |
657 | inode->i_blocks -= extent_num_bytes >> 9; | |
39279cc3 | 658 | ret = btrfs_free_extent(trans, root, |
7bb86316 CM |
659 | disk_bytenr, |
660 | disk_num_bytes, | |
d8d5f3e1 | 661 | root_owner, |
7bb86316 CM |
662 | root_gen, inode->i_ino, |
663 | key.offset, 0); | |
39279cc3 CM |
664 | } |
665 | ||
666 | BUG_ON(ret); | |
667 | if (!bookend && search_start >= end) { | |
668 | ret = 0; | |
669 | goto out; | |
670 | } | |
671 | if (!bookend) | |
672 | continue; | |
673 | } | |
0181e58f | 674 | if (bookend && found_inline && start <= key.offset) { |
179e29e4 CM |
675 | u32 new_size; |
676 | new_size = btrfs_file_extent_calc_inline_size( | |
0181e58f | 677 | extent_end - end); |
179e29e4 CM |
678 | btrfs_truncate_item(trans, root, path, new_size, 0); |
679 | } | |
39279cc3 CM |
680 | /* create bookend, splitting the extent in two */ |
681 | if (bookend && found_extent) { | |
682 | struct btrfs_key ins; | |
683 | ins.objectid = inode->i_ino; | |
684 | ins.offset = end; | |
39279cc3 | 685 | btrfs_set_key_type(&ins, BTRFS_EXTENT_DATA_KEY); |
39279cc3 CM |
686 | btrfs_release_path(root, path); |
687 | ret = btrfs_insert_empty_item(trans, root, path, &ins, | |
688 | sizeof(*extent)); | |
8c2383c3 | 689 | |
5f39d397 | 690 | leaf = path->nodes[0]; |
8c2383c3 | 691 | if (ret) { |
5f39d397 CM |
692 | btrfs_print_leaf(root, leaf); |
693 | printk("got %d on inserting %Lu %u %Lu start %Lu end %Lu found %Lu %Lu keep was %d\n", ret , ins.objectid, ins.type, ins.offset, start, end, key.offset, extent_end, keep); | |
8c2383c3 | 694 | } |
39279cc3 | 695 | BUG_ON(ret); |
5f39d397 CM |
696 | extent = btrfs_item_ptr(leaf, path->slots[0], |
697 | struct btrfs_file_extent_item); | |
698 | write_extent_buffer(leaf, &old, | |
699 | (unsigned long)extent, sizeof(old)); | |
700 | ||
701 | btrfs_set_file_extent_offset(leaf, extent, | |
db94535d CM |
702 | le64_to_cpu(old.offset) + end - key.offset); |
703 | WARN_ON(le64_to_cpu(old.num_bytes) < | |
704 | (extent_end - end)); | |
705 | btrfs_set_file_extent_num_bytes(leaf, extent, | |
706 | extent_end - end); | |
5f39d397 | 707 | btrfs_set_file_extent_type(leaf, extent, |
39279cc3 | 708 | BTRFS_FILE_EXTENT_REG); |
db94535d | 709 | |
39279cc3 | 710 | btrfs_mark_buffer_dirty(path->nodes[0]); |
db94535d | 711 | if (le64_to_cpu(old.disk_bytenr) != 0) { |
39279cc3 | 712 | inode->i_blocks += |
db94535d CM |
713 | btrfs_file_extent_num_bytes(leaf, |
714 | extent) >> 9; | |
39279cc3 CM |
715 | } |
716 | ret = 0; | |
717 | goto out; | |
718 | } | |
719 | } | |
720 | out: | |
721 | btrfs_free_path(path); | |
722 | return ret; | |
723 | } | |
724 | ||
725 | /* | |
726 | * this gets pages into the page cache and locks them down | |
727 | */ | |
98ed5174 CM |
728 | static int prepare_pages(struct btrfs_root *root, struct file *file, |
729 | struct page **pages, size_t num_pages, | |
730 | loff_t pos, unsigned long first_index, | |
731 | unsigned long last_index, size_t write_bytes) | |
39279cc3 CM |
732 | { |
733 | int i; | |
734 | unsigned long index = pos >> PAGE_CACHE_SHIFT; | |
6da6abae | 735 | struct inode *inode = fdentry(file)->d_inode; |
39279cc3 | 736 | int err = 0; |
8c2383c3 | 737 | u64 start_pos; |
8c2383c3 | 738 | |
5f39d397 | 739 | start_pos = pos & ~((u64)root->sectorsize - 1); |
39279cc3 CM |
740 | |
741 | memset(pages, 0, num_pages * sizeof(struct page *)); | |
742 | ||
743 | for (i = 0; i < num_pages; i++) { | |
744 | pages[i] = grab_cache_page(inode->i_mapping, index + i); | |
745 | if (!pages[i]) { | |
746 | err = -ENOMEM; | |
a52d9a80 | 747 | BUG_ON(1); |
39279cc3 | 748 | } |
6da6abae CM |
749 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18) |
750 | ClearPageDirty(pages[i]); | |
751 | #else | |
ccd467d6 | 752 | cancel_dirty_page(pages[i], PAGE_CACHE_SIZE); |
6da6abae | 753 | #endif |
ccd467d6 | 754 | wait_on_page_writeback(pages[i]); |
b3cfa35a | 755 | set_page_extent_mapped(pages[i]); |
b888db2b | 756 | WARN_ON(!PageLocked(pages[i])); |
39279cc3 CM |
757 | } |
758 | return 0; | |
39279cc3 CM |
759 | } |
760 | ||
761 | static ssize_t btrfs_file_write(struct file *file, const char __user *buf, | |
762 | size_t count, loff_t *ppos) | |
763 | { | |
764 | loff_t pos; | |
2ff3e9b6 CM |
765 | loff_t start_pos; |
766 | ssize_t num_written = 0; | |
767 | ssize_t err = 0; | |
39279cc3 | 768 | int ret = 0; |
6da6abae | 769 | struct inode *inode = fdentry(file)->d_inode; |
39279cc3 | 770 | struct btrfs_root *root = BTRFS_I(inode)->root; |
8c2383c3 CM |
771 | struct page **pages = NULL; |
772 | int nrptrs; | |
39279cc3 CM |
773 | struct page *pinned[2]; |
774 | unsigned long first_index; | |
775 | unsigned long last_index; | |
8c2383c3 CM |
776 | |
777 | nrptrs = min((count + PAGE_CACHE_SIZE - 1) / PAGE_CACHE_SIZE, | |
778 | PAGE_CACHE_SIZE / (sizeof(struct page *))); | |
39279cc3 CM |
779 | pinned[0] = NULL; |
780 | pinned[1] = NULL; | |
781 | if (file->f_flags & O_DIRECT) | |
782 | return -EINVAL; | |
2ff3e9b6 | 783 | |
39279cc3 | 784 | pos = *ppos; |
2ff3e9b6 CM |
785 | start_pos = pos; |
786 | ||
39279cc3 CM |
787 | vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE); |
788 | current->backing_dev_info = inode->i_mapping->backing_dev_info; | |
789 | err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode)); | |
790 | if (err) | |
1832a6d5 | 791 | goto out_nolock; |
39279cc3 | 792 | if (count == 0) |
1832a6d5 | 793 | goto out_nolock; |
6da6abae | 794 | err = remove_suid(fdentry(file)); |
39279cc3 | 795 | if (err) |
1832a6d5 | 796 | goto out_nolock; |
39279cc3 CM |
797 | file_update_time(file); |
798 | ||
8c2383c3 | 799 | pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL); |
39279cc3 CM |
800 | |
801 | mutex_lock(&inode->i_mutex); | |
802 | first_index = pos >> PAGE_CACHE_SHIFT; | |
803 | last_index = (pos + count) >> PAGE_CACHE_SHIFT; | |
804 | ||
805 | /* | |
806 | * there are lots of better ways to do this, but this code | |
807 | * makes sure the first and last page in the file range are | |
808 | * up to date and ready for cow | |
809 | */ | |
810 | if ((pos & (PAGE_CACHE_SIZE - 1))) { | |
811 | pinned[0] = grab_cache_page(inode->i_mapping, first_index); | |
812 | if (!PageUptodate(pinned[0])) { | |
9ebefb18 | 813 | ret = btrfs_readpage(NULL, pinned[0]); |
39279cc3 CM |
814 | BUG_ON(ret); |
815 | wait_on_page_locked(pinned[0]); | |
816 | } else { | |
817 | unlock_page(pinned[0]); | |
818 | } | |
819 | } | |
820 | if ((pos + count) & (PAGE_CACHE_SIZE - 1)) { | |
821 | pinned[1] = grab_cache_page(inode->i_mapping, last_index); | |
822 | if (!PageUptodate(pinned[1])) { | |
9ebefb18 | 823 | ret = btrfs_readpage(NULL, pinned[1]); |
39279cc3 CM |
824 | BUG_ON(ret); |
825 | wait_on_page_locked(pinned[1]); | |
826 | } else { | |
827 | unlock_page(pinned[1]); | |
828 | } | |
829 | } | |
830 | ||
39279cc3 CM |
831 | while(count > 0) { |
832 | size_t offset = pos & (PAGE_CACHE_SIZE - 1); | |
11bd143f CM |
833 | size_t write_bytes = min(count, nrptrs * |
834 | (size_t)PAGE_CACHE_SIZE - | |
8c2383c3 | 835 | offset); |
39279cc3 CM |
836 | size_t num_pages = (write_bytes + PAGE_CACHE_SIZE - 1) >> |
837 | PAGE_CACHE_SHIFT; | |
838 | ||
8c2383c3 | 839 | WARN_ON(num_pages > nrptrs); |
39279cc3 | 840 | memset(pages, 0, sizeof(pages)); |
1832a6d5 CM |
841 | |
842 | mutex_lock(&root->fs_info->fs_mutex); | |
843 | ret = btrfs_check_free_space(root, write_bytes, 0); | |
844 | mutex_unlock(&root->fs_info->fs_mutex); | |
845 | if (ret) | |
846 | goto out; | |
847 | ||
39279cc3 CM |
848 | ret = prepare_pages(root, file, pages, num_pages, |
849 | pos, first_index, last_index, | |
8c2383c3 | 850 | write_bytes); |
54aa1f4d CM |
851 | if (ret) |
852 | goto out; | |
39279cc3 | 853 | |
39279cc3 CM |
854 | ret = btrfs_copy_from_user(pos, num_pages, |
855 | write_bytes, pages, buf); | |
54aa1f4d CM |
856 | if (ret) { |
857 | btrfs_drop_pages(pages, num_pages); | |
858 | goto out; | |
859 | } | |
39279cc3 CM |
860 | |
861 | ret = dirty_and_release_pages(NULL, root, file, pages, | |
862 | num_pages, pos, write_bytes); | |
39279cc3 | 863 | btrfs_drop_pages(pages, num_pages); |
54aa1f4d CM |
864 | if (ret) |
865 | goto out; | |
39279cc3 CM |
866 | |
867 | buf += write_bytes; | |
868 | count -= write_bytes; | |
869 | pos += write_bytes; | |
870 | num_written += write_bytes; | |
871 | ||
8c2383c3 | 872 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, num_pages); |
448d640b CM |
873 | if (num_pages < (root->leafsize >> PAGE_CACHE_SHIFT) + 1) |
874 | btrfs_btree_balance_dirty(root, 1); | |
e2008b61 | 875 | btrfs_throttle(root); |
39279cc3 CM |
876 | cond_resched(); |
877 | } | |
39279cc3 | 878 | out: |
1832a6d5 | 879 | mutex_unlock(&inode->i_mutex); |
5b92ee72 | 880 | |
1832a6d5 | 881 | out_nolock: |
8c2383c3 | 882 | kfree(pages); |
39279cc3 CM |
883 | if (pinned[0]) |
884 | page_cache_release(pinned[0]); | |
885 | if (pinned[1]) | |
886 | page_cache_release(pinned[1]); | |
887 | *ppos = pos; | |
2ff3e9b6 CM |
888 | |
889 | if (num_written > 0 && ((file->f_flags & O_SYNC) || IS_SYNC(inode))) { | |
890 | err = sync_page_range(inode, inode->i_mapping, | |
891 | start_pos, num_written); | |
892 | if (err < 0) | |
893 | num_written = err; | |
894 | } | |
39279cc3 | 895 | current->backing_dev_info = NULL; |
39279cc3 CM |
896 | return num_written ? num_written : err; |
897 | } | |
898 | ||
39279cc3 CM |
899 | static int btrfs_sync_file(struct file *file, |
900 | struct dentry *dentry, int datasync) | |
901 | { | |
902 | struct inode *inode = dentry->d_inode; | |
903 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
15ee9bc7 | 904 | int ret = 0; |
39279cc3 CM |
905 | struct btrfs_trans_handle *trans; |
906 | ||
907 | /* | |
15ee9bc7 JB |
908 | * check the transaction that last modified this inode |
909 | * and see if its already been committed | |
39279cc3 CM |
910 | */ |
911 | mutex_lock(&root->fs_info->fs_mutex); | |
15ee9bc7 JB |
912 | if (!BTRFS_I(inode)->last_trans) |
913 | goto out; | |
914 | mutex_lock(&root->fs_info->trans_mutex); | |
915 | if (BTRFS_I(inode)->last_trans <= | |
916 | root->fs_info->last_trans_committed) { | |
917 | BTRFS_I(inode)->last_trans = 0; | |
918 | mutex_unlock(&root->fs_info->trans_mutex); | |
919 | goto out; | |
920 | } | |
921 | mutex_unlock(&root->fs_info->trans_mutex); | |
922 | ||
923 | /* | |
a52d9a80 CM |
924 | * ok we haven't committed the transaction yet, lets do a commit |
925 | */ | |
39279cc3 CM |
926 | trans = btrfs_start_transaction(root, 1); |
927 | if (!trans) { | |
928 | ret = -ENOMEM; | |
929 | goto out; | |
930 | } | |
931 | ret = btrfs_commit_transaction(trans, root); | |
39279cc3 | 932 | out: |
15ee9bc7 | 933 | mutex_unlock(&root->fs_info->fs_mutex); |
39279cc3 CM |
934 | return ret > 0 ? EIO : ret; |
935 | } | |
936 | ||
9ebefb18 | 937 | static struct vm_operations_struct btrfs_file_vm_ops = { |
92fee66d CM |
938 | #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23) |
939 | .nopage = filemap_nopage, | |
940 | .populate = filemap_populate, | |
941 | #else | |
942 | .fault = filemap_fault, | |
943 | #endif | |
9ebefb18 CM |
944 | .page_mkwrite = btrfs_page_mkwrite, |
945 | }; | |
946 | ||
947 | static int btrfs_file_mmap(struct file *filp, struct vm_area_struct *vma) | |
948 | { | |
949 | vma->vm_ops = &btrfs_file_vm_ops; | |
950 | file_accessed(filp); | |
951 | return 0; | |
952 | } | |
953 | ||
39279cc3 CM |
954 | struct file_operations btrfs_file_operations = { |
955 | .llseek = generic_file_llseek, | |
956 | .read = do_sync_read, | |
9ebefb18 | 957 | .aio_read = generic_file_aio_read, |
e9906a98 | 958 | .splice_read = generic_file_splice_read, |
6da6abae CM |
959 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18) |
960 | .sendfile = generic_file_sendfile, | |
961 | #endif | |
39279cc3 | 962 | .write = btrfs_file_write, |
9ebefb18 | 963 | .mmap = btrfs_file_mmap, |
39279cc3 | 964 | .open = generic_file_open, |
39279cc3 | 965 | .fsync = btrfs_sync_file, |
34287aa3 | 966 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 967 | #ifdef CONFIG_COMPAT |
34287aa3 | 968 | .compat_ioctl = btrfs_ioctl, |
39279cc3 CM |
969 | #endif |
970 | }; | |
971 |