Btrfs: Add a clear_cache mount option
[linux-2.6.git] / fs / btrfs / extent-tree.c
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 #include <linux/sched.h>
19 #include <linux/pagemap.h>
20 #include <linux/writeback.h>
21 #include <linux/blkdev.h>
22 #include <linux/sort.h>
23 #include <linux/rcupdate.h>
24 #include <linux/kthread.h>
25 #include <linux/slab.h>
26 #include "compat.h"
27 #include "hash.h"
28 #include "ctree.h"
29 #include "disk-io.h"
30 #include "print-tree.h"
31 #include "transaction.h"
32 #include "volumes.h"
33 #include "locking.h"
34 #include "free-space-cache.h"
35
36 static int update_block_group(struct btrfs_trans_handle *trans,
37                               struct btrfs_root *root,
38                               u64 bytenr, u64 num_bytes, int alloc);
39 static int update_reserved_bytes(struct btrfs_block_group_cache *cache,
40                                  u64 num_bytes, int reserve, int sinfo);
41 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
42                                 struct btrfs_root *root,
43                                 u64 bytenr, u64 num_bytes, u64 parent,
44                                 u64 root_objectid, u64 owner_objectid,
45                                 u64 owner_offset, int refs_to_drop,
46                                 struct btrfs_delayed_extent_op *extra_op);
47 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
48                                     struct extent_buffer *leaf,
49                                     struct btrfs_extent_item *ei);
50 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
51                                       struct btrfs_root *root,
52                                       u64 parent, u64 root_objectid,
53                                       u64 flags, u64 owner, u64 offset,
54                                       struct btrfs_key *ins, int ref_mod);
55 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
56                                      struct btrfs_root *root,
57                                      u64 parent, u64 root_objectid,
58                                      u64 flags, struct btrfs_disk_key *key,
59                                      int level, struct btrfs_key *ins);
60 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
61                           struct btrfs_root *extent_root, u64 alloc_bytes,
62                           u64 flags, int force);
63 static int find_next_key(struct btrfs_path *path, int level,
64                          struct btrfs_key *key);
65 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
66                             int dump_block_groups);
67
68 static noinline int
69 block_group_cache_done(struct btrfs_block_group_cache *cache)
70 {
71         smp_mb();
72         return cache->cached == BTRFS_CACHE_FINISHED;
73 }
74
75 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits)
76 {
77         return (cache->flags & bits) == bits;
78 }
79
80 void btrfs_get_block_group(struct btrfs_block_group_cache *cache)
81 {
82         atomic_inc(&cache->count);
83 }
84
85 void btrfs_put_block_group(struct btrfs_block_group_cache *cache)
86 {
87         if (atomic_dec_and_test(&cache->count)) {
88                 WARN_ON(cache->pinned > 0);
89                 WARN_ON(cache->reserved > 0);
90                 WARN_ON(cache->reserved_pinned > 0);
91                 kfree(cache);
92         }
93 }
94
95 /*
96  * this adds the block group to the fs_info rb tree for the block group
97  * cache
98  */
99 static int btrfs_add_block_group_cache(struct btrfs_fs_info *info,
100                                 struct btrfs_block_group_cache *block_group)
101 {
102         struct rb_node **p;
103         struct rb_node *parent = NULL;
104         struct btrfs_block_group_cache *cache;
105
106         spin_lock(&info->block_group_cache_lock);
107         p = &info->block_group_cache_tree.rb_node;
108
109         while (*p) {
110                 parent = *p;
111                 cache = rb_entry(parent, struct btrfs_block_group_cache,
112                                  cache_node);
113                 if (block_group->key.objectid < cache->key.objectid) {
114                         p = &(*p)->rb_left;
115                 } else if (block_group->key.objectid > cache->key.objectid) {
116                         p = &(*p)->rb_right;
117                 } else {
118                         spin_unlock(&info->block_group_cache_lock);
119                         return -EEXIST;
120                 }
121         }
122
123         rb_link_node(&block_group->cache_node, parent, p);
124         rb_insert_color(&block_group->cache_node,
125                         &info->block_group_cache_tree);
126         spin_unlock(&info->block_group_cache_lock);
127
128         return 0;
129 }
130
131 /*
132  * This will return the block group at or after bytenr if contains is 0, else
133  * it will return the block group that contains the bytenr
134  */
135 static struct btrfs_block_group_cache *
136 block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr,
137                               int contains)
138 {
139         struct btrfs_block_group_cache *cache, *ret = NULL;
140         struct rb_node *n;
141         u64 end, start;
142
143         spin_lock(&info->block_group_cache_lock);
144         n = info->block_group_cache_tree.rb_node;
145
146         while (n) {
147                 cache = rb_entry(n, struct btrfs_block_group_cache,
148                                  cache_node);
149                 end = cache->key.objectid + cache->key.offset - 1;
150                 start = cache->key.objectid;
151
152                 if (bytenr < start) {
153                         if (!contains && (!ret || start < ret->key.objectid))
154                                 ret = cache;
155                         n = n->rb_left;
156                 } else if (bytenr > start) {
157                         if (contains && bytenr <= end) {
158                                 ret = cache;
159                                 break;
160                         }
161                         n = n->rb_right;
162                 } else {
163                         ret = cache;
164                         break;
165                 }
166         }
167         if (ret)
168                 btrfs_get_block_group(ret);
169         spin_unlock(&info->block_group_cache_lock);
170
171         return ret;
172 }
173
174 static int add_excluded_extent(struct btrfs_root *root,
175                                u64 start, u64 num_bytes)
176 {
177         u64 end = start + num_bytes - 1;
178         set_extent_bits(&root->fs_info->freed_extents[0],
179                         start, end, EXTENT_UPTODATE, GFP_NOFS);
180         set_extent_bits(&root->fs_info->freed_extents[1],
181                         start, end, EXTENT_UPTODATE, GFP_NOFS);
182         return 0;
183 }
184
185 static void free_excluded_extents(struct btrfs_root *root,
186                                   struct btrfs_block_group_cache *cache)
187 {
188         u64 start, end;
189
190         start = cache->key.objectid;
191         end = start + cache->key.offset - 1;
192
193         clear_extent_bits(&root->fs_info->freed_extents[0],
194                           start, end, EXTENT_UPTODATE, GFP_NOFS);
195         clear_extent_bits(&root->fs_info->freed_extents[1],
196                           start, end, EXTENT_UPTODATE, GFP_NOFS);
197 }
198
199 static int exclude_super_stripes(struct btrfs_root *root,
200                                  struct btrfs_block_group_cache *cache)
201 {
202         u64 bytenr;
203         u64 *logical;
204         int stripe_len;
205         int i, nr, ret;
206
207         if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) {
208                 stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid;
209                 cache->bytes_super += stripe_len;
210                 ret = add_excluded_extent(root, cache->key.objectid,
211                                           stripe_len);
212                 BUG_ON(ret);
213         }
214
215         for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
216                 bytenr = btrfs_sb_offset(i);
217                 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
218                                        cache->key.objectid, bytenr,
219                                        0, &logical, &nr, &stripe_len);
220                 BUG_ON(ret);
221
222                 while (nr--) {
223                         cache->bytes_super += stripe_len;
224                         ret = add_excluded_extent(root, logical[nr],
225                                                   stripe_len);
226                         BUG_ON(ret);
227                 }
228
229                 kfree(logical);
230         }
231         return 0;
232 }
233
234 static struct btrfs_caching_control *
235 get_caching_control(struct btrfs_block_group_cache *cache)
236 {
237         struct btrfs_caching_control *ctl;
238
239         spin_lock(&cache->lock);
240         if (cache->cached != BTRFS_CACHE_STARTED) {
241                 spin_unlock(&cache->lock);
242                 return NULL;
243         }
244
245         /* We're loading it the fast way, so we don't have a caching_ctl. */
246         if (!cache->caching_ctl) {
247                 spin_unlock(&cache->lock);
248                 return NULL;
249         }
250
251         ctl = cache->caching_ctl;
252         atomic_inc(&ctl->count);
253         spin_unlock(&cache->lock);
254         return ctl;
255 }
256
257 static void put_caching_control(struct btrfs_caching_control *ctl)
258 {
259         if (atomic_dec_and_test(&ctl->count))
260                 kfree(ctl);
261 }
262
263 /*
264  * this is only called by cache_block_group, since we could have freed extents
265  * we need to check the pinned_extents for any extents that can't be used yet
266  * since their free space will be released as soon as the transaction commits.
267  */
268 static u64 add_new_free_space(struct btrfs_block_group_cache *block_group,
269                               struct btrfs_fs_info *info, u64 start, u64 end)
270 {
271         u64 extent_start, extent_end, size, total_added = 0;
272         int ret;
273
274         while (start < end) {
275                 ret = find_first_extent_bit(info->pinned_extents, start,
276                                             &extent_start, &extent_end,
277                                             EXTENT_DIRTY | EXTENT_UPTODATE);
278                 if (ret)
279                         break;
280
281                 if (extent_start <= start) {
282                         start = extent_end + 1;
283                 } else if (extent_start > start && extent_start < end) {
284                         size = extent_start - start;
285                         total_added += size;
286                         ret = btrfs_add_free_space(block_group, start,
287                                                    size);
288                         BUG_ON(ret);
289                         start = extent_end + 1;
290                 } else {
291                         break;
292                 }
293         }
294
295         if (start < end) {
296                 size = end - start;
297                 total_added += size;
298                 ret = btrfs_add_free_space(block_group, start, size);
299                 BUG_ON(ret);
300         }
301
302         return total_added;
303 }
304
305 static int caching_kthread(void *data)
306 {
307         struct btrfs_block_group_cache *block_group = data;
308         struct btrfs_fs_info *fs_info = block_group->fs_info;
309         struct btrfs_caching_control *caching_ctl = block_group->caching_ctl;
310         struct btrfs_root *extent_root = fs_info->extent_root;
311         struct btrfs_path *path;
312         struct extent_buffer *leaf;
313         struct btrfs_key key;
314         u64 total_found = 0;
315         u64 last = 0;
316         u32 nritems;
317         int ret = 0;
318
319         path = btrfs_alloc_path();
320         if (!path)
321                 return -ENOMEM;
322
323         exclude_super_stripes(extent_root, block_group);
324         spin_lock(&block_group->space_info->lock);
325         block_group->space_info->bytes_readonly += block_group->bytes_super;
326         spin_unlock(&block_group->space_info->lock);
327
328         last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET);
329
330         /*
331          * We don't want to deadlock with somebody trying to allocate a new
332          * extent for the extent root while also trying to search the extent
333          * root to add free space.  So we skip locking and search the commit
334          * root, since its read-only
335          */
336         path->skip_locking = 1;
337         path->search_commit_root = 1;
338         path->reada = 2;
339
340         key.objectid = last;
341         key.offset = 0;
342         key.type = BTRFS_EXTENT_ITEM_KEY;
343 again:
344         mutex_lock(&caching_ctl->mutex);
345         /* need to make sure the commit_root doesn't disappear */
346         down_read(&fs_info->extent_commit_sem);
347
348         ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
349         if (ret < 0)
350                 goto err;
351
352         leaf = path->nodes[0];
353         nritems = btrfs_header_nritems(leaf);
354
355         while (1) {
356                 smp_mb();
357                 if (fs_info->closing > 1) {
358                         last = (u64)-1;
359                         break;
360                 }
361
362                 if (path->slots[0] < nritems) {
363                         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
364                 } else {
365                         ret = find_next_key(path, 0, &key);
366                         if (ret)
367                                 break;
368
369                         caching_ctl->progress = last;
370                         btrfs_release_path(extent_root, path);
371                         up_read(&fs_info->extent_commit_sem);
372                         mutex_unlock(&caching_ctl->mutex);
373                         if (btrfs_transaction_in_commit(fs_info))
374                                 schedule_timeout(1);
375                         else
376                                 cond_resched();
377                         goto again;
378                 }
379
380                 if (key.objectid < block_group->key.objectid) {
381                         path->slots[0]++;
382                         continue;
383                 }
384
385                 if (key.objectid >= block_group->key.objectid +
386                     block_group->key.offset)
387                         break;
388
389                 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
390                         total_found += add_new_free_space(block_group,
391                                                           fs_info, last,
392                                                           key.objectid);
393                         last = key.objectid + key.offset;
394
395                         if (total_found > (1024 * 1024 * 2)) {
396                                 total_found = 0;
397                                 wake_up(&caching_ctl->wait);
398                         }
399                 }
400                 path->slots[0]++;
401         }
402         ret = 0;
403
404         total_found += add_new_free_space(block_group, fs_info, last,
405                                           block_group->key.objectid +
406                                           block_group->key.offset);
407         caching_ctl->progress = (u64)-1;
408
409         spin_lock(&block_group->lock);
410         block_group->caching_ctl = NULL;
411         block_group->cached = BTRFS_CACHE_FINISHED;
412         spin_unlock(&block_group->lock);
413
414 err:
415         btrfs_free_path(path);
416         up_read(&fs_info->extent_commit_sem);
417
418         free_excluded_extents(extent_root, block_group);
419
420         mutex_unlock(&caching_ctl->mutex);
421         wake_up(&caching_ctl->wait);
422
423         put_caching_control(caching_ctl);
424         atomic_dec(&block_group->space_info->caching_threads);
425         btrfs_put_block_group(block_group);
426
427         return 0;
428 }
429
430 static int cache_block_group(struct btrfs_block_group_cache *cache,
431                              struct btrfs_trans_handle *trans,
432                              int load_cache_only)
433 {
434         struct btrfs_fs_info *fs_info = cache->fs_info;
435         struct btrfs_caching_control *caching_ctl;
436         struct task_struct *tsk;
437         int ret = 0;
438
439         smp_mb();
440         if (cache->cached != BTRFS_CACHE_NO)
441                 return 0;
442
443         /*
444          * We can't do the read from on-disk cache during a commit since we need
445          * to have the normal tree locking.
446          */
447         if (!trans->transaction->in_commit) {
448                 spin_lock(&cache->lock);
449                 if (cache->cached != BTRFS_CACHE_NO) {
450                         spin_unlock(&cache->lock);
451                         return 0;
452                 }
453                 cache->cached = BTRFS_CACHE_STARTED;
454                 spin_unlock(&cache->lock);
455
456                 ret = load_free_space_cache(fs_info, cache);
457
458                 spin_lock(&cache->lock);
459                 if (ret == 1) {
460                         cache->cached = BTRFS_CACHE_FINISHED;
461                         cache->last_byte_to_unpin = (u64)-1;
462                 } else {
463                         cache->cached = BTRFS_CACHE_NO;
464                 }
465                 spin_unlock(&cache->lock);
466                 if (ret == 1)
467                         return 0;
468         }
469
470         if (load_cache_only)
471                 return 0;
472
473         caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_KERNEL);
474         BUG_ON(!caching_ctl);
475
476         INIT_LIST_HEAD(&caching_ctl->list);
477         mutex_init(&caching_ctl->mutex);
478         init_waitqueue_head(&caching_ctl->wait);
479         caching_ctl->block_group = cache;
480         caching_ctl->progress = cache->key.objectid;
481         /* one for caching kthread, one for caching block group list */
482         atomic_set(&caching_ctl->count, 2);
483
484         spin_lock(&cache->lock);
485         if (cache->cached != BTRFS_CACHE_NO) {
486                 spin_unlock(&cache->lock);
487                 kfree(caching_ctl);
488                 return 0;
489         }
490         cache->caching_ctl = caching_ctl;
491         cache->cached = BTRFS_CACHE_STARTED;
492         spin_unlock(&cache->lock);
493
494         down_write(&fs_info->extent_commit_sem);
495         list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups);
496         up_write(&fs_info->extent_commit_sem);
497
498         atomic_inc(&cache->space_info->caching_threads);
499         btrfs_get_block_group(cache);
500
501         tsk = kthread_run(caching_kthread, cache, "btrfs-cache-%llu\n",
502                           cache->key.objectid);
503         if (IS_ERR(tsk)) {
504                 ret = PTR_ERR(tsk);
505                 printk(KERN_ERR "error running thread %d\n", ret);
506                 BUG();
507         }
508
509         return ret;
510 }
511
512 /*
513  * return the block group that starts at or after bytenr
514  */
515 static struct btrfs_block_group_cache *
516 btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr)
517 {
518         struct btrfs_block_group_cache *cache;
519
520         cache = block_group_cache_tree_search(info, bytenr, 0);
521
522         return cache;
523 }
524
525 /*
526  * return the block group that contains the given bytenr
527  */
528 struct btrfs_block_group_cache *btrfs_lookup_block_group(
529                                                  struct btrfs_fs_info *info,
530                                                  u64 bytenr)
531 {
532         struct btrfs_block_group_cache *cache;
533
534         cache = block_group_cache_tree_search(info, bytenr, 1);
535
536         return cache;
537 }
538
539 static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info,
540                                                   u64 flags)
541 {
542         struct list_head *head = &info->space_info;
543         struct btrfs_space_info *found;
544
545         flags &= BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_SYSTEM |
546                  BTRFS_BLOCK_GROUP_METADATA;
547
548         rcu_read_lock();
549         list_for_each_entry_rcu(found, head, list) {
550                 if (found->flags & flags) {
551                         rcu_read_unlock();
552                         return found;
553                 }
554         }
555         rcu_read_unlock();
556         return NULL;
557 }
558
559 /*
560  * after adding space to the filesystem, we need to clear the full flags
561  * on all the space infos.
562  */
563 void btrfs_clear_space_info_full(struct btrfs_fs_info *info)
564 {
565         struct list_head *head = &info->space_info;
566         struct btrfs_space_info *found;
567
568         rcu_read_lock();
569         list_for_each_entry_rcu(found, head, list)
570                 found->full = 0;
571         rcu_read_unlock();
572 }
573
574 static u64 div_factor(u64 num, int factor)
575 {
576         if (factor == 10)
577                 return num;
578         num *= factor;
579         do_div(num, 10);
580         return num;
581 }
582
583 u64 btrfs_find_block_group(struct btrfs_root *root,
584                            u64 search_start, u64 search_hint, int owner)
585 {
586         struct btrfs_block_group_cache *cache;
587         u64 used;
588         u64 last = max(search_hint, search_start);
589         u64 group_start = 0;
590         int full_search = 0;
591         int factor = 9;
592         int wrapped = 0;
593 again:
594         while (1) {
595                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
596                 if (!cache)
597                         break;
598
599                 spin_lock(&cache->lock);
600                 last = cache->key.objectid + cache->key.offset;
601                 used = btrfs_block_group_used(&cache->item);
602
603                 if ((full_search || !cache->ro) &&
604                     block_group_bits(cache, BTRFS_BLOCK_GROUP_METADATA)) {
605                         if (used + cache->pinned + cache->reserved <
606                             div_factor(cache->key.offset, factor)) {
607                                 group_start = cache->key.objectid;
608                                 spin_unlock(&cache->lock);
609                                 btrfs_put_block_group(cache);
610                                 goto found;
611                         }
612                 }
613                 spin_unlock(&cache->lock);
614                 btrfs_put_block_group(cache);
615                 cond_resched();
616         }
617         if (!wrapped) {
618                 last = search_start;
619                 wrapped = 1;
620                 goto again;
621         }
622         if (!full_search && factor < 10) {
623                 last = search_start;
624                 full_search = 1;
625                 factor = 10;
626                 goto again;
627         }
628 found:
629         return group_start;
630 }
631
632 /* simple helper to search for an existing extent at a given offset */
633 int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len)
634 {
635         int ret;
636         struct btrfs_key key;
637         struct btrfs_path *path;
638
639         path = btrfs_alloc_path();
640         BUG_ON(!path);
641         key.objectid = start;
642         key.offset = len;
643         btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
644         ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path,
645                                 0, 0);
646         btrfs_free_path(path);
647         return ret;
648 }
649
650 /*
651  * helper function to lookup reference count and flags of extent.
652  *
653  * the head node for delayed ref is used to store the sum of all the
654  * reference count modifications queued up in the rbtree. the head
655  * node may also store the extent flags to set. This way you can check
656  * to see what the reference count and extent flags would be if all of
657  * the delayed refs are not processed.
658  */
659 int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans,
660                              struct btrfs_root *root, u64 bytenr,
661                              u64 num_bytes, u64 *refs, u64 *flags)
662 {
663         struct btrfs_delayed_ref_head *head;
664         struct btrfs_delayed_ref_root *delayed_refs;
665         struct btrfs_path *path;
666         struct btrfs_extent_item *ei;
667         struct extent_buffer *leaf;
668         struct btrfs_key key;
669         u32 item_size;
670         u64 num_refs;
671         u64 extent_flags;
672         int ret;
673
674         path = btrfs_alloc_path();
675         if (!path)
676                 return -ENOMEM;
677
678         key.objectid = bytenr;
679         key.type = BTRFS_EXTENT_ITEM_KEY;
680         key.offset = num_bytes;
681         if (!trans) {
682                 path->skip_locking = 1;
683                 path->search_commit_root = 1;
684         }
685 again:
686         ret = btrfs_search_slot(trans, root->fs_info->extent_root,
687                                 &key, path, 0, 0);
688         if (ret < 0)
689                 goto out_free;
690
691         if (ret == 0) {
692                 leaf = path->nodes[0];
693                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
694                 if (item_size >= sizeof(*ei)) {
695                         ei = btrfs_item_ptr(leaf, path->slots[0],
696                                             struct btrfs_extent_item);
697                         num_refs = btrfs_extent_refs(leaf, ei);
698                         extent_flags = btrfs_extent_flags(leaf, ei);
699                 } else {
700 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
701                         struct btrfs_extent_item_v0 *ei0;
702                         BUG_ON(item_size != sizeof(*ei0));
703                         ei0 = btrfs_item_ptr(leaf, path->slots[0],
704                                              struct btrfs_extent_item_v0);
705                         num_refs = btrfs_extent_refs_v0(leaf, ei0);
706                         /* FIXME: this isn't correct for data */
707                         extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
708 #else
709                         BUG();
710 #endif
711                 }
712                 BUG_ON(num_refs == 0);
713         } else {
714                 num_refs = 0;
715                 extent_flags = 0;
716                 ret = 0;
717         }
718
719         if (!trans)
720                 goto out;
721
722         delayed_refs = &trans->transaction->delayed_refs;
723         spin_lock(&delayed_refs->lock);
724         head = btrfs_find_delayed_ref_head(trans, bytenr);
725         if (head) {
726                 if (!mutex_trylock(&head->mutex)) {
727                         atomic_inc(&head->node.refs);
728                         spin_unlock(&delayed_refs->lock);
729
730                         btrfs_release_path(root->fs_info->extent_root, path);
731
732                         mutex_lock(&head->mutex);
733                         mutex_unlock(&head->mutex);
734                         btrfs_put_delayed_ref(&head->node);
735                         goto again;
736                 }
737                 if (head->extent_op && head->extent_op->update_flags)
738                         extent_flags |= head->extent_op->flags_to_set;
739                 else
740                         BUG_ON(num_refs == 0);
741
742                 num_refs += head->node.ref_mod;
743                 mutex_unlock(&head->mutex);
744         }
745         spin_unlock(&delayed_refs->lock);
746 out:
747         WARN_ON(num_refs == 0);
748         if (refs)
749                 *refs = num_refs;
750         if (flags)
751                 *flags = extent_flags;
752 out_free:
753         btrfs_free_path(path);
754         return ret;
755 }
756
757 /*
758  * Back reference rules.  Back refs have three main goals:
759  *
760  * 1) differentiate between all holders of references to an extent so that
761  *    when a reference is dropped we can make sure it was a valid reference
762  *    before freeing the extent.
763  *
764  * 2) Provide enough information to quickly find the holders of an extent
765  *    if we notice a given block is corrupted or bad.
766  *
767  * 3) Make it easy to migrate blocks for FS shrinking or storage pool
768  *    maintenance.  This is actually the same as #2, but with a slightly
769  *    different use case.
770  *
771  * There are two kinds of back refs. The implicit back refs is optimized
772  * for pointers in non-shared tree blocks. For a given pointer in a block,
773  * back refs of this kind provide information about the block's owner tree
774  * and the pointer's key. These information allow us to find the block by
775  * b-tree searching. The full back refs is for pointers in tree blocks not
776  * referenced by their owner trees. The location of tree block is recorded
777  * in the back refs. Actually the full back refs is generic, and can be
778  * used in all cases the implicit back refs is used. The major shortcoming
779  * of the full back refs is its overhead. Every time a tree block gets
780  * COWed, we have to update back refs entry for all pointers in it.
781  *
782  * For a newly allocated tree block, we use implicit back refs for
783  * pointers in it. This means most tree related operations only involve
784  * implicit back refs. For a tree block created in old transaction, the
785  * only way to drop a reference to it is COW it. So we can detect the
786  * event that tree block loses its owner tree's reference and do the
787  * back refs conversion.
788  *
789  * When a tree block is COW'd through a tree, there are four cases:
790  *
791  * The reference count of the block is one and the tree is the block's
792  * owner tree. Nothing to do in this case.
793  *
794  * The reference count of the block is one and the tree is not the
795  * block's owner tree. In this case, full back refs is used for pointers
796  * in the block. Remove these full back refs, add implicit back refs for
797  * every pointers in the new block.
798  *
799  * The reference count of the block is greater than one and the tree is
800  * the block's owner tree. In this case, implicit back refs is used for
801  * pointers in the block. Add full back refs for every pointers in the
802  * block, increase lower level extents' reference counts. The original
803  * implicit back refs are entailed to the new block.
804  *
805  * The reference count of the block is greater than one and the tree is
806  * not the block's owner tree. Add implicit back refs for every pointer in
807  * the new block, increase lower level extents' reference count.
808  *
809  * Back Reference Key composing:
810  *
811  * The key objectid corresponds to the first byte in the extent,
812  * The key type is used to differentiate between types of back refs.
813  * There are different meanings of the key offset for different types
814  * of back refs.
815  *
816  * File extents can be referenced by:
817  *
818  * - multiple snapshots, subvolumes, or different generations in one subvol
819  * - different files inside a single subvolume
820  * - different offsets inside a file (bookend extents in file.c)
821  *
822  * The extent ref structure for the implicit back refs has fields for:
823  *
824  * - Objectid of the subvolume root
825  * - objectid of the file holding the reference
826  * - original offset in the file
827  * - how many bookend extents
828  *
829  * The key offset for the implicit back refs is hash of the first
830  * three fields.
831  *
832  * The extent ref structure for the full back refs has field for:
833  *
834  * - number of pointers in the tree leaf
835  *
836  * The key offset for the implicit back refs is the first byte of
837  * the tree leaf
838  *
839  * When a file extent is allocated, The implicit back refs is used.
840  * the fields are filled in:
841  *
842  *     (root_key.objectid, inode objectid, offset in file, 1)
843  *
844  * When a file extent is removed file truncation, we find the
845  * corresponding implicit back refs and check the following fields:
846  *
847  *     (btrfs_header_owner(leaf), inode objectid, offset in file)
848  *
849  * Btree extents can be referenced by:
850  *
851  * - Different subvolumes
852  *
853  * Both the implicit back refs and the full back refs for tree blocks
854  * only consist of key. The key offset for the implicit back refs is
855  * objectid of block's owner tree. The key offset for the full back refs
856  * is the first byte of parent block.
857  *
858  * When implicit back refs is used, information about the lowest key and
859  * level of the tree block are required. These information are stored in
860  * tree block info structure.
861  */
862
863 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
864 static int convert_extent_item_v0(struct btrfs_trans_handle *trans,
865                                   struct btrfs_root *root,
866                                   struct btrfs_path *path,
867                                   u64 owner, u32 extra_size)
868 {
869         struct btrfs_extent_item *item;
870         struct btrfs_extent_item_v0 *ei0;
871         struct btrfs_extent_ref_v0 *ref0;
872         struct btrfs_tree_block_info *bi;
873         struct extent_buffer *leaf;
874         struct btrfs_key key;
875         struct btrfs_key found_key;
876         u32 new_size = sizeof(*item);
877         u64 refs;
878         int ret;
879
880         leaf = path->nodes[0];
881         BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0));
882
883         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
884         ei0 = btrfs_item_ptr(leaf, path->slots[0],
885                              struct btrfs_extent_item_v0);
886         refs = btrfs_extent_refs_v0(leaf, ei0);
887
888         if (owner == (u64)-1) {
889                 while (1) {
890                         if (path->slots[0] >= btrfs_header_nritems(leaf)) {
891                                 ret = btrfs_next_leaf(root, path);
892                                 if (ret < 0)
893                                         return ret;
894                                 BUG_ON(ret > 0);
895                                 leaf = path->nodes[0];
896                         }
897                         btrfs_item_key_to_cpu(leaf, &found_key,
898                                               path->slots[0]);
899                         BUG_ON(key.objectid != found_key.objectid);
900                         if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) {
901                                 path->slots[0]++;
902                                 continue;
903                         }
904                         ref0 = btrfs_item_ptr(leaf, path->slots[0],
905                                               struct btrfs_extent_ref_v0);
906                         owner = btrfs_ref_objectid_v0(leaf, ref0);
907                         break;
908                 }
909         }
910         btrfs_release_path(root, path);
911
912         if (owner < BTRFS_FIRST_FREE_OBJECTID)
913                 new_size += sizeof(*bi);
914
915         new_size -= sizeof(*ei0);
916         ret = btrfs_search_slot(trans, root, &key, path,
917                                 new_size + extra_size, 1);
918         if (ret < 0)
919                 return ret;
920         BUG_ON(ret);
921
922         ret = btrfs_extend_item(trans, root, path, new_size);
923         BUG_ON(ret);
924
925         leaf = path->nodes[0];
926         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
927         btrfs_set_extent_refs(leaf, item, refs);
928         /* FIXME: get real generation */
929         btrfs_set_extent_generation(leaf, item, 0);
930         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
931                 btrfs_set_extent_flags(leaf, item,
932                                        BTRFS_EXTENT_FLAG_TREE_BLOCK |
933                                        BTRFS_BLOCK_FLAG_FULL_BACKREF);
934                 bi = (struct btrfs_tree_block_info *)(item + 1);
935                 /* FIXME: get first key of the block */
936                 memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi));
937                 btrfs_set_tree_block_level(leaf, bi, (int)owner);
938         } else {
939                 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA);
940         }
941         btrfs_mark_buffer_dirty(leaf);
942         return 0;
943 }
944 #endif
945
946 static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset)
947 {
948         u32 high_crc = ~(u32)0;
949         u32 low_crc = ~(u32)0;
950         __le64 lenum;
951
952         lenum = cpu_to_le64(root_objectid);
953         high_crc = crc32c(high_crc, &lenum, sizeof(lenum));
954         lenum = cpu_to_le64(owner);
955         low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
956         lenum = cpu_to_le64(offset);
957         low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
958
959         return ((u64)high_crc << 31) ^ (u64)low_crc;
960 }
961
962 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf,
963                                      struct btrfs_extent_data_ref *ref)
964 {
965         return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref),
966                                     btrfs_extent_data_ref_objectid(leaf, ref),
967                                     btrfs_extent_data_ref_offset(leaf, ref));
968 }
969
970 static int match_extent_data_ref(struct extent_buffer *leaf,
971                                  struct btrfs_extent_data_ref *ref,
972                                  u64 root_objectid, u64 owner, u64 offset)
973 {
974         if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid ||
975             btrfs_extent_data_ref_objectid(leaf, ref) != owner ||
976             btrfs_extent_data_ref_offset(leaf, ref) != offset)
977                 return 0;
978         return 1;
979 }
980
981 static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans,
982                                            struct btrfs_root *root,
983                                            struct btrfs_path *path,
984                                            u64 bytenr, u64 parent,
985                                            u64 root_objectid,
986                                            u64 owner, u64 offset)
987 {
988         struct btrfs_key key;
989         struct btrfs_extent_data_ref *ref;
990         struct extent_buffer *leaf;
991         u32 nritems;
992         int ret;
993         int recow;
994         int err = -ENOENT;
995
996         key.objectid = bytenr;
997         if (parent) {
998                 key.type = BTRFS_SHARED_DATA_REF_KEY;
999                 key.offset = parent;
1000         } else {
1001                 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1002                 key.offset = hash_extent_data_ref(root_objectid,
1003                                                   owner, offset);
1004         }
1005 again:
1006         recow = 0;
1007         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1008         if (ret < 0) {
1009                 err = ret;
1010                 goto fail;
1011         }
1012
1013         if (parent) {
1014                 if (!ret)
1015                         return 0;
1016 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1017                 key.type = BTRFS_EXTENT_REF_V0_KEY;
1018                 btrfs_release_path(root, path);
1019                 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1020                 if (ret < 0) {
1021                         err = ret;
1022                         goto fail;
1023                 }
1024                 if (!ret)
1025                         return 0;
1026 #endif
1027                 goto fail;
1028         }
1029
1030         leaf = path->nodes[0];
1031         nritems = btrfs_header_nritems(leaf);
1032         while (1) {
1033                 if (path->slots[0] >= nritems) {
1034                         ret = btrfs_next_leaf(root, path);
1035                         if (ret < 0)
1036                                 err = ret;
1037                         if (ret)
1038                                 goto fail;
1039
1040                         leaf = path->nodes[0];
1041                         nritems = btrfs_header_nritems(leaf);
1042                         recow = 1;
1043                 }
1044
1045                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1046                 if (key.objectid != bytenr ||
1047                     key.type != BTRFS_EXTENT_DATA_REF_KEY)
1048                         goto fail;
1049
1050                 ref = btrfs_item_ptr(leaf, path->slots[0],
1051                                      struct btrfs_extent_data_ref);
1052
1053                 if (match_extent_data_ref(leaf, ref, root_objectid,
1054                                           owner, offset)) {
1055                         if (recow) {
1056                                 btrfs_release_path(root, path);
1057                                 goto again;
1058                         }
1059                         err = 0;
1060                         break;
1061                 }
1062                 path->slots[0]++;
1063         }
1064 fail:
1065         return err;
1066 }
1067
1068 static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans,
1069                                            struct btrfs_root *root,
1070                                            struct btrfs_path *path,
1071                                            u64 bytenr, u64 parent,
1072                                            u64 root_objectid, u64 owner,
1073                                            u64 offset, int refs_to_add)
1074 {
1075         struct btrfs_key key;
1076         struct extent_buffer *leaf;
1077         u32 size;
1078         u32 num_refs;
1079         int ret;
1080
1081         key.objectid = bytenr;
1082         if (parent) {
1083                 key.type = BTRFS_SHARED_DATA_REF_KEY;
1084                 key.offset = parent;
1085                 size = sizeof(struct btrfs_shared_data_ref);
1086         } else {
1087                 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1088                 key.offset = hash_extent_data_ref(root_objectid,
1089                                                   owner, offset);
1090                 size = sizeof(struct btrfs_extent_data_ref);
1091         }
1092
1093         ret = btrfs_insert_empty_item(trans, root, path, &key, size);
1094         if (ret && ret != -EEXIST)
1095                 goto fail;
1096
1097         leaf = path->nodes[0];
1098         if (parent) {
1099                 struct btrfs_shared_data_ref *ref;
1100                 ref = btrfs_item_ptr(leaf, path->slots[0],
1101                                      struct btrfs_shared_data_ref);
1102                 if (ret == 0) {
1103                         btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add);
1104                 } else {
1105                         num_refs = btrfs_shared_data_ref_count(leaf, ref);
1106                         num_refs += refs_to_add;
1107                         btrfs_set_shared_data_ref_count(leaf, ref, num_refs);
1108                 }
1109         } else {
1110                 struct btrfs_extent_data_ref *ref;
1111                 while (ret == -EEXIST) {
1112                         ref = btrfs_item_ptr(leaf, path->slots[0],
1113                                              struct btrfs_extent_data_ref);
1114                         if (match_extent_data_ref(leaf, ref, root_objectid,
1115                                                   owner, offset))
1116                                 break;
1117                         btrfs_release_path(root, path);
1118                         key.offset++;
1119                         ret = btrfs_insert_empty_item(trans, root, path, &key,
1120                                                       size);
1121                         if (ret && ret != -EEXIST)
1122                                 goto fail;
1123
1124                         leaf = path->nodes[0];
1125                 }
1126                 ref = btrfs_item_ptr(leaf, path->slots[0],
1127                                      struct btrfs_extent_data_ref);
1128                 if (ret == 0) {
1129                         btrfs_set_extent_data_ref_root(leaf, ref,
1130                                                        root_objectid);
1131                         btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
1132                         btrfs_set_extent_data_ref_offset(leaf, ref, offset);
1133                         btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add);
1134                 } else {
1135                         num_refs = btrfs_extent_data_ref_count(leaf, ref);
1136                         num_refs += refs_to_add;
1137                         btrfs_set_extent_data_ref_count(leaf, ref, num_refs);
1138                 }
1139         }
1140         btrfs_mark_buffer_dirty(leaf);
1141         ret = 0;
1142 fail:
1143         btrfs_release_path(root, path);
1144         return ret;
1145 }
1146
1147 static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans,
1148                                            struct btrfs_root *root,
1149                                            struct btrfs_path *path,
1150                                            int refs_to_drop)
1151 {
1152         struct btrfs_key key;
1153         struct btrfs_extent_data_ref *ref1 = NULL;
1154         struct btrfs_shared_data_ref *ref2 = NULL;
1155         struct extent_buffer *leaf;
1156         u32 num_refs = 0;
1157         int ret = 0;
1158
1159         leaf = path->nodes[0];
1160         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1161
1162         if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1163                 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1164                                       struct btrfs_extent_data_ref);
1165                 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1166         } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1167                 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1168                                       struct btrfs_shared_data_ref);
1169                 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1170 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1171         } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1172                 struct btrfs_extent_ref_v0 *ref0;
1173                 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1174                                       struct btrfs_extent_ref_v0);
1175                 num_refs = btrfs_ref_count_v0(leaf, ref0);
1176 #endif
1177         } else {
1178                 BUG();
1179         }
1180
1181         BUG_ON(num_refs < refs_to_drop);
1182         num_refs -= refs_to_drop;
1183
1184         if (num_refs == 0) {
1185                 ret = btrfs_del_item(trans, root, path);
1186         } else {
1187                 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
1188                         btrfs_set_extent_data_ref_count(leaf, ref1, num_refs);
1189                 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
1190                         btrfs_set_shared_data_ref_count(leaf, ref2, num_refs);
1191 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1192                 else {
1193                         struct btrfs_extent_ref_v0 *ref0;
1194                         ref0 = btrfs_item_ptr(leaf, path->slots[0],
1195                                         struct btrfs_extent_ref_v0);
1196                         btrfs_set_ref_count_v0(leaf, ref0, num_refs);
1197                 }
1198 #endif
1199                 btrfs_mark_buffer_dirty(leaf);
1200         }
1201         return ret;
1202 }
1203
1204 static noinline u32 extent_data_ref_count(struct btrfs_root *root,
1205                                           struct btrfs_path *path,
1206                                           struct btrfs_extent_inline_ref *iref)
1207 {
1208         struct btrfs_key key;
1209         struct extent_buffer *leaf;
1210         struct btrfs_extent_data_ref *ref1;
1211         struct btrfs_shared_data_ref *ref2;
1212         u32 num_refs = 0;
1213
1214         leaf = path->nodes[0];
1215         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1216         if (iref) {
1217                 if (btrfs_extent_inline_ref_type(leaf, iref) ==
1218                     BTRFS_EXTENT_DATA_REF_KEY) {
1219                         ref1 = (struct btrfs_extent_data_ref *)(&iref->offset);
1220                         num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1221                 } else {
1222                         ref2 = (struct btrfs_shared_data_ref *)(iref + 1);
1223                         num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1224                 }
1225         } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1226                 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1227                                       struct btrfs_extent_data_ref);
1228                 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1229         } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1230                 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1231                                       struct btrfs_shared_data_ref);
1232                 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1233 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1234         } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1235                 struct btrfs_extent_ref_v0 *ref0;
1236                 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1237                                       struct btrfs_extent_ref_v0);
1238                 num_refs = btrfs_ref_count_v0(leaf, ref0);
1239 #endif
1240         } else {
1241                 WARN_ON(1);
1242         }
1243         return num_refs;
1244 }
1245
1246 static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans,
1247                                           struct btrfs_root *root,
1248                                           struct btrfs_path *path,
1249                                           u64 bytenr, u64 parent,
1250                                           u64 root_objectid)
1251 {
1252         struct btrfs_key key;
1253         int ret;
1254
1255         key.objectid = bytenr;
1256         if (parent) {
1257                 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1258                 key.offset = parent;
1259         } else {
1260                 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1261                 key.offset = root_objectid;
1262         }
1263
1264         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1265         if (ret > 0)
1266                 ret = -ENOENT;
1267 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1268         if (ret == -ENOENT && parent) {
1269                 btrfs_release_path(root, path);
1270                 key.type = BTRFS_EXTENT_REF_V0_KEY;
1271                 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1272                 if (ret > 0)
1273                         ret = -ENOENT;
1274         }
1275 #endif
1276         return ret;
1277 }
1278
1279 static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans,
1280                                           struct btrfs_root *root,
1281                                           struct btrfs_path *path,
1282                                           u64 bytenr, u64 parent,
1283                                           u64 root_objectid)
1284 {
1285         struct btrfs_key key;
1286         int ret;
1287
1288         key.objectid = bytenr;
1289         if (parent) {
1290                 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1291                 key.offset = parent;
1292         } else {
1293                 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1294                 key.offset = root_objectid;
1295         }
1296
1297         ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
1298         btrfs_release_path(root, path);
1299         return ret;
1300 }
1301
1302 static inline int extent_ref_type(u64 parent, u64 owner)
1303 {
1304         int type;
1305         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1306                 if (parent > 0)
1307                         type = BTRFS_SHARED_BLOCK_REF_KEY;
1308                 else
1309                         type = BTRFS_TREE_BLOCK_REF_KEY;
1310         } else {
1311                 if (parent > 0)
1312                         type = BTRFS_SHARED_DATA_REF_KEY;
1313                 else
1314                         type = BTRFS_EXTENT_DATA_REF_KEY;
1315         }
1316         return type;
1317 }
1318
1319 static int find_next_key(struct btrfs_path *path, int level,
1320                          struct btrfs_key *key)
1321
1322 {
1323         for (; level < BTRFS_MAX_LEVEL; level++) {
1324                 if (!path->nodes[level])
1325                         break;
1326                 if (path->slots[level] + 1 >=
1327                     btrfs_header_nritems(path->nodes[level]))
1328                         continue;
1329                 if (level == 0)
1330                         btrfs_item_key_to_cpu(path->nodes[level], key,
1331                                               path->slots[level] + 1);
1332                 else
1333                         btrfs_node_key_to_cpu(path->nodes[level], key,
1334                                               path->slots[level] + 1);
1335                 return 0;
1336         }
1337         return 1;
1338 }
1339
1340 /*
1341  * look for inline back ref. if back ref is found, *ref_ret is set
1342  * to the address of inline back ref, and 0 is returned.
1343  *
1344  * if back ref isn't found, *ref_ret is set to the address where it
1345  * should be inserted, and -ENOENT is returned.
1346  *
1347  * if insert is true and there are too many inline back refs, the path
1348  * points to the extent item, and -EAGAIN is returned.
1349  *
1350  * NOTE: inline back refs are ordered in the same way that back ref
1351  *       items in the tree are ordered.
1352  */
1353 static noinline_for_stack
1354 int lookup_inline_extent_backref(struct btrfs_trans_handle *trans,
1355                                  struct btrfs_root *root,
1356                                  struct btrfs_path *path,
1357                                  struct btrfs_extent_inline_ref **ref_ret,
1358                                  u64 bytenr, u64 num_bytes,
1359                                  u64 parent, u64 root_objectid,
1360                                  u64 owner, u64 offset, int insert)
1361 {
1362         struct btrfs_key key;
1363         struct extent_buffer *leaf;
1364         struct btrfs_extent_item *ei;
1365         struct btrfs_extent_inline_ref *iref;
1366         u64 flags;
1367         u64 item_size;
1368         unsigned long ptr;
1369         unsigned long end;
1370         int extra_size;
1371         int type;
1372         int want;
1373         int ret;
1374         int err = 0;
1375
1376         key.objectid = bytenr;
1377         key.type = BTRFS_EXTENT_ITEM_KEY;
1378         key.offset = num_bytes;
1379
1380         want = extent_ref_type(parent, owner);
1381         if (insert) {
1382                 extra_size = btrfs_extent_inline_ref_size(want);
1383                 path->keep_locks = 1;
1384         } else
1385                 extra_size = -1;
1386         ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
1387         if (ret < 0) {
1388                 err = ret;
1389                 goto out;
1390         }
1391         BUG_ON(ret);
1392
1393         leaf = path->nodes[0];
1394         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1395 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1396         if (item_size < sizeof(*ei)) {
1397                 if (!insert) {
1398                         err = -ENOENT;
1399                         goto out;
1400                 }
1401                 ret = convert_extent_item_v0(trans, root, path, owner,
1402                                              extra_size);
1403                 if (ret < 0) {
1404                         err = ret;
1405                         goto out;
1406                 }
1407                 leaf = path->nodes[0];
1408                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1409         }
1410 #endif
1411         BUG_ON(item_size < sizeof(*ei));
1412
1413         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1414         flags = btrfs_extent_flags(leaf, ei);
1415
1416         ptr = (unsigned long)(ei + 1);
1417         end = (unsigned long)ei + item_size;
1418
1419         if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
1420                 ptr += sizeof(struct btrfs_tree_block_info);
1421                 BUG_ON(ptr > end);
1422         } else {
1423                 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA));
1424         }
1425
1426         err = -ENOENT;
1427         while (1) {
1428                 if (ptr >= end) {
1429                         WARN_ON(ptr > end);
1430                         break;
1431                 }
1432                 iref = (struct btrfs_extent_inline_ref *)ptr;
1433                 type = btrfs_extent_inline_ref_type(leaf, iref);
1434                 if (want < type)
1435                         break;
1436                 if (want > type) {
1437                         ptr += btrfs_extent_inline_ref_size(type);
1438                         continue;
1439                 }
1440
1441                 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1442                         struct btrfs_extent_data_ref *dref;
1443                         dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1444                         if (match_extent_data_ref(leaf, dref, root_objectid,
1445                                                   owner, offset)) {
1446                                 err = 0;
1447                                 break;
1448                         }
1449                         if (hash_extent_data_ref_item(leaf, dref) <
1450                             hash_extent_data_ref(root_objectid, owner, offset))
1451                                 break;
1452                 } else {
1453                         u64 ref_offset;
1454                         ref_offset = btrfs_extent_inline_ref_offset(leaf, iref);
1455                         if (parent > 0) {
1456                                 if (parent == ref_offset) {
1457                                         err = 0;
1458                                         break;
1459                                 }
1460                                 if (ref_offset < parent)
1461                                         break;
1462                         } else {
1463                                 if (root_objectid == ref_offset) {
1464                                         err = 0;
1465                                         break;
1466                                 }
1467                                 if (ref_offset < root_objectid)
1468                                         break;
1469                         }
1470                 }
1471                 ptr += btrfs_extent_inline_ref_size(type);
1472         }
1473         if (err == -ENOENT && insert) {
1474                 if (item_size + extra_size >=
1475                     BTRFS_MAX_EXTENT_ITEM_SIZE(root)) {
1476                         err = -EAGAIN;
1477                         goto out;
1478                 }
1479                 /*
1480                  * To add new inline back ref, we have to make sure
1481                  * there is no corresponding back ref item.
1482                  * For simplicity, we just do not add new inline back
1483                  * ref if there is any kind of item for this block
1484                  */
1485                 if (find_next_key(path, 0, &key) == 0 &&
1486                     key.objectid == bytenr &&
1487                     key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) {
1488                         err = -EAGAIN;
1489                         goto out;
1490                 }
1491         }
1492         *ref_ret = (struct btrfs_extent_inline_ref *)ptr;
1493 out:
1494         if (insert) {
1495                 path->keep_locks = 0;
1496                 btrfs_unlock_up_safe(path, 1);
1497         }
1498         return err;
1499 }
1500
1501 /*
1502  * helper to add new inline back ref
1503  */
1504 static noinline_for_stack
1505 int setup_inline_extent_backref(struct btrfs_trans_handle *trans,
1506                                 struct btrfs_root *root,
1507                                 struct btrfs_path *path,
1508                                 struct btrfs_extent_inline_ref *iref,
1509                                 u64 parent, u64 root_objectid,
1510                                 u64 owner, u64 offset, int refs_to_add,
1511                                 struct btrfs_delayed_extent_op *extent_op)
1512 {
1513         struct extent_buffer *leaf;
1514         struct btrfs_extent_item *ei;
1515         unsigned long ptr;
1516         unsigned long end;
1517         unsigned long item_offset;
1518         u64 refs;
1519         int size;
1520         int type;
1521         int ret;
1522
1523         leaf = path->nodes[0];
1524         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1525         item_offset = (unsigned long)iref - (unsigned long)ei;
1526
1527         type = extent_ref_type(parent, owner);
1528         size = btrfs_extent_inline_ref_size(type);
1529
1530         ret = btrfs_extend_item(trans, root, path, size);
1531         BUG_ON(ret);
1532
1533         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1534         refs = btrfs_extent_refs(leaf, ei);
1535         refs += refs_to_add;
1536         btrfs_set_extent_refs(leaf, ei, refs);
1537         if (extent_op)
1538                 __run_delayed_extent_op(extent_op, leaf, ei);
1539
1540         ptr = (unsigned long)ei + item_offset;
1541         end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]);
1542         if (ptr < end - size)
1543                 memmove_extent_buffer(leaf, ptr + size, ptr,
1544                                       end - size - ptr);
1545
1546         iref = (struct btrfs_extent_inline_ref *)ptr;
1547         btrfs_set_extent_inline_ref_type(leaf, iref, type);
1548         if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1549                 struct btrfs_extent_data_ref *dref;
1550                 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1551                 btrfs_set_extent_data_ref_root(leaf, dref, root_objectid);
1552                 btrfs_set_extent_data_ref_objectid(leaf, dref, owner);
1553                 btrfs_set_extent_data_ref_offset(leaf, dref, offset);
1554                 btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add);
1555         } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1556                 struct btrfs_shared_data_ref *sref;
1557                 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1558                 btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add);
1559                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1560         } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) {
1561                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1562         } else {
1563                 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
1564         }
1565         btrfs_mark_buffer_dirty(leaf);
1566         return 0;
1567 }
1568
1569 static int lookup_extent_backref(struct btrfs_trans_handle *trans,
1570                                  struct btrfs_root *root,
1571                                  struct btrfs_path *path,
1572                                  struct btrfs_extent_inline_ref **ref_ret,
1573                                  u64 bytenr, u64 num_bytes, u64 parent,
1574                                  u64 root_objectid, u64 owner, u64 offset)
1575 {
1576         int ret;
1577
1578         ret = lookup_inline_extent_backref(trans, root, path, ref_ret,
1579                                            bytenr, num_bytes, parent,
1580                                            root_objectid, owner, offset, 0);
1581         if (ret != -ENOENT)
1582                 return ret;
1583
1584         btrfs_release_path(root, path);
1585         *ref_ret = NULL;
1586
1587         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1588                 ret = lookup_tree_block_ref(trans, root, path, bytenr, parent,
1589                                             root_objectid);
1590         } else {
1591                 ret = lookup_extent_data_ref(trans, root, path, bytenr, parent,
1592                                              root_objectid, owner, offset);
1593         }
1594         return ret;
1595 }
1596
1597 /*
1598  * helper to update/remove inline back ref
1599  */
1600 static noinline_for_stack
1601 int update_inline_extent_backref(struct btrfs_trans_handle *trans,
1602                                  struct btrfs_root *root,
1603                                  struct btrfs_path *path,
1604                                  struct btrfs_extent_inline_ref *iref,
1605                                  int refs_to_mod,
1606                                  struct btrfs_delayed_extent_op *extent_op)
1607 {
1608         struct extent_buffer *leaf;
1609         struct btrfs_extent_item *ei;
1610         struct btrfs_extent_data_ref *dref = NULL;
1611         struct btrfs_shared_data_ref *sref = NULL;
1612         unsigned long ptr;
1613         unsigned long end;
1614         u32 item_size;
1615         int size;
1616         int type;
1617         int ret;
1618         u64 refs;
1619
1620         leaf = path->nodes[0];
1621         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1622         refs = btrfs_extent_refs(leaf, ei);
1623         WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0);
1624         refs += refs_to_mod;
1625         btrfs_set_extent_refs(leaf, ei, refs);
1626         if (extent_op)
1627                 __run_delayed_extent_op(extent_op, leaf, ei);
1628
1629         type = btrfs_extent_inline_ref_type(leaf, iref);
1630
1631         if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1632                 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1633                 refs = btrfs_extent_data_ref_count(leaf, dref);
1634         } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1635                 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1636                 refs = btrfs_shared_data_ref_count(leaf, sref);
1637         } else {
1638                 refs = 1;
1639                 BUG_ON(refs_to_mod != -1);
1640         }
1641
1642         BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod);
1643         refs += refs_to_mod;
1644
1645         if (refs > 0) {
1646                 if (type == BTRFS_EXTENT_DATA_REF_KEY)
1647                         btrfs_set_extent_data_ref_count(leaf, dref, refs);
1648                 else
1649                         btrfs_set_shared_data_ref_count(leaf, sref, refs);
1650         } else {
1651                 size =  btrfs_extent_inline_ref_size(type);
1652                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1653                 ptr = (unsigned long)iref;
1654                 end = (unsigned long)ei + item_size;
1655                 if (ptr + size < end)
1656                         memmove_extent_buffer(leaf, ptr, ptr + size,
1657                                               end - ptr - size);
1658                 item_size -= size;
1659                 ret = btrfs_truncate_item(trans, root, path, item_size, 1);
1660                 BUG_ON(ret);
1661         }
1662         btrfs_mark_buffer_dirty(leaf);
1663         return 0;
1664 }
1665
1666 static noinline_for_stack
1667 int insert_inline_extent_backref(struct btrfs_trans_handle *trans,
1668                                  struct btrfs_root *root,
1669                                  struct btrfs_path *path,
1670                                  u64 bytenr, u64 num_bytes, u64 parent,
1671                                  u64 root_objectid, u64 owner,
1672                                  u64 offset, int refs_to_add,
1673                                  struct btrfs_delayed_extent_op *extent_op)
1674 {
1675         struct btrfs_extent_inline_ref *iref;
1676         int ret;
1677
1678         ret = lookup_inline_extent_backref(trans, root, path, &iref,
1679                                            bytenr, num_bytes, parent,
1680                                            root_objectid, owner, offset, 1);
1681         if (ret == 0) {
1682                 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID);
1683                 ret = update_inline_extent_backref(trans, root, path, iref,
1684                                                    refs_to_add, extent_op);
1685         } else if (ret == -ENOENT) {
1686                 ret = setup_inline_extent_backref(trans, root, path, iref,
1687                                                   parent, root_objectid,
1688                                                   owner, offset, refs_to_add,
1689                                                   extent_op);
1690         }
1691         return ret;
1692 }
1693
1694 static int insert_extent_backref(struct btrfs_trans_handle *trans,
1695                                  struct btrfs_root *root,
1696                                  struct btrfs_path *path,
1697                                  u64 bytenr, u64 parent, u64 root_objectid,
1698                                  u64 owner, u64 offset, int refs_to_add)
1699 {
1700         int ret;
1701         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1702                 BUG_ON(refs_to_add != 1);
1703                 ret = insert_tree_block_ref(trans, root, path, bytenr,
1704                                             parent, root_objectid);
1705         } else {
1706                 ret = insert_extent_data_ref(trans, root, path, bytenr,
1707                                              parent, root_objectid,
1708                                              owner, offset, refs_to_add);
1709         }
1710         return ret;
1711 }
1712
1713 static int remove_extent_backref(struct btrfs_trans_handle *trans,
1714                                  struct btrfs_root *root,
1715                                  struct btrfs_path *path,
1716                                  struct btrfs_extent_inline_ref *iref,
1717                                  int refs_to_drop, int is_data)
1718 {
1719         int ret;
1720
1721         BUG_ON(!is_data && refs_to_drop != 1);
1722         if (iref) {
1723                 ret = update_inline_extent_backref(trans, root, path, iref,
1724                                                    -refs_to_drop, NULL);
1725         } else if (is_data) {
1726                 ret = remove_extent_data_ref(trans, root, path, refs_to_drop);
1727         } else {
1728                 ret = btrfs_del_item(trans, root, path);
1729         }
1730         return ret;
1731 }
1732
1733 static void btrfs_issue_discard(struct block_device *bdev,
1734                                 u64 start, u64 len)
1735 {
1736         blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_KERNEL,
1737                         BLKDEV_IFL_WAIT | BLKDEV_IFL_BARRIER);
1738 }
1739
1740 static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr,
1741                                 u64 num_bytes)
1742 {
1743         int ret;
1744         u64 map_length = num_bytes;
1745         struct btrfs_multi_bio *multi = NULL;
1746
1747         if (!btrfs_test_opt(root, DISCARD))
1748                 return 0;
1749
1750         /* Tell the block device(s) that the sectors can be discarded */
1751         ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
1752                               bytenr, &map_length, &multi, 0);
1753         if (!ret) {
1754                 struct btrfs_bio_stripe *stripe = multi->stripes;
1755                 int i;
1756
1757                 if (map_length > num_bytes)
1758                         map_length = num_bytes;
1759
1760                 for (i = 0; i < multi->num_stripes; i++, stripe++) {
1761                         btrfs_issue_discard(stripe->dev->bdev,
1762                                             stripe->physical,
1763                                             map_length);
1764                 }
1765                 kfree(multi);
1766         }
1767
1768         return ret;
1769 }
1770
1771 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1772                          struct btrfs_root *root,
1773                          u64 bytenr, u64 num_bytes, u64 parent,
1774                          u64 root_objectid, u64 owner, u64 offset)
1775 {
1776         int ret;
1777         BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID &&
1778                root_objectid == BTRFS_TREE_LOG_OBJECTID);
1779
1780         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1781                 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
1782                                         parent, root_objectid, (int)owner,
1783                                         BTRFS_ADD_DELAYED_REF, NULL);
1784         } else {
1785                 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
1786                                         parent, root_objectid, owner, offset,
1787                                         BTRFS_ADD_DELAYED_REF, NULL);
1788         }
1789         return ret;
1790 }
1791
1792 static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1793                                   struct btrfs_root *root,
1794                                   u64 bytenr, u64 num_bytes,
1795                                   u64 parent, u64 root_objectid,
1796                                   u64 owner, u64 offset, int refs_to_add,
1797                                   struct btrfs_delayed_extent_op *extent_op)
1798 {
1799         struct btrfs_path *path;
1800         struct extent_buffer *leaf;
1801         struct btrfs_extent_item *item;
1802         u64 refs;
1803         int ret;
1804         int err = 0;
1805
1806         path = btrfs_alloc_path();
1807         if (!path)
1808                 return -ENOMEM;
1809
1810         path->reada = 1;
1811         path->leave_spinning = 1;
1812         /* this will setup the path even if it fails to insert the back ref */
1813         ret = insert_inline_extent_backref(trans, root->fs_info->extent_root,
1814                                            path, bytenr, num_bytes, parent,
1815                                            root_objectid, owner, offset,
1816                                            refs_to_add, extent_op);
1817         if (ret == 0)
1818                 goto out;
1819
1820         if (ret != -EAGAIN) {
1821                 err = ret;
1822                 goto out;
1823         }
1824
1825         leaf = path->nodes[0];
1826         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1827         refs = btrfs_extent_refs(leaf, item);
1828         btrfs_set_extent_refs(leaf, item, refs + refs_to_add);
1829         if (extent_op)
1830                 __run_delayed_extent_op(extent_op, leaf, item);
1831
1832         btrfs_mark_buffer_dirty(leaf);
1833         btrfs_release_path(root->fs_info->extent_root, path);
1834
1835         path->reada = 1;
1836         path->leave_spinning = 1;
1837
1838         /* now insert the actual backref */
1839         ret = insert_extent_backref(trans, root->fs_info->extent_root,
1840                                     path, bytenr, parent, root_objectid,
1841                                     owner, offset, refs_to_add);
1842         BUG_ON(ret);
1843 out:
1844         btrfs_free_path(path);
1845         return err;
1846 }
1847
1848 static int run_delayed_data_ref(struct btrfs_trans_handle *trans,
1849                                 struct btrfs_root *root,
1850                                 struct btrfs_delayed_ref_node *node,
1851                                 struct btrfs_delayed_extent_op *extent_op,
1852                                 int insert_reserved)
1853 {
1854         int ret = 0;
1855         struct btrfs_delayed_data_ref *ref;
1856         struct btrfs_key ins;
1857         u64 parent = 0;
1858         u64 ref_root = 0;
1859         u64 flags = 0;
1860
1861         ins.objectid = node->bytenr;
1862         ins.offset = node->num_bytes;
1863         ins.type = BTRFS_EXTENT_ITEM_KEY;
1864
1865         ref = btrfs_delayed_node_to_data_ref(node);
1866         if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1867                 parent = ref->parent;
1868         else
1869                 ref_root = ref->root;
1870
1871         if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1872                 if (extent_op) {
1873                         BUG_ON(extent_op->update_key);
1874                         flags |= extent_op->flags_to_set;
1875                 }
1876                 ret = alloc_reserved_file_extent(trans, root,
1877                                                  parent, ref_root, flags,
1878                                                  ref->objectid, ref->offset,
1879                                                  &ins, node->ref_mod);
1880         } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1881                 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
1882                                              node->num_bytes, parent,
1883                                              ref_root, ref->objectid,
1884                                              ref->offset, node->ref_mod,
1885                                              extent_op);
1886         } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1887                 ret = __btrfs_free_extent(trans, root, node->bytenr,
1888                                           node->num_bytes, parent,
1889                                           ref_root, ref->objectid,
1890                                           ref->offset, node->ref_mod,
1891                                           extent_op);
1892         } else {
1893                 BUG();
1894         }
1895         return ret;
1896 }
1897
1898 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
1899                                     struct extent_buffer *leaf,
1900                                     struct btrfs_extent_item *ei)
1901 {
1902         u64 flags = btrfs_extent_flags(leaf, ei);
1903         if (extent_op->update_flags) {
1904                 flags |= extent_op->flags_to_set;
1905                 btrfs_set_extent_flags(leaf, ei, flags);
1906         }
1907
1908         if (extent_op->update_key) {
1909                 struct btrfs_tree_block_info *bi;
1910                 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK));
1911                 bi = (struct btrfs_tree_block_info *)(ei + 1);
1912                 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
1913         }
1914 }
1915
1916 static int run_delayed_extent_op(struct btrfs_trans_handle *trans,
1917                                  struct btrfs_root *root,
1918                                  struct btrfs_delayed_ref_node *node,
1919                                  struct btrfs_delayed_extent_op *extent_op)
1920 {
1921         struct btrfs_key key;
1922         struct btrfs_path *path;
1923         struct btrfs_extent_item *ei;
1924         struct extent_buffer *leaf;
1925         u32 item_size;
1926         int ret;
1927         int err = 0;
1928
1929         path = btrfs_alloc_path();
1930         if (!path)
1931                 return -ENOMEM;
1932
1933         key.objectid = node->bytenr;
1934         key.type = BTRFS_EXTENT_ITEM_KEY;
1935         key.offset = node->num_bytes;
1936
1937         path->reada = 1;
1938         path->leave_spinning = 1;
1939         ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key,
1940                                 path, 0, 1);
1941         if (ret < 0) {
1942                 err = ret;
1943                 goto out;
1944         }
1945         if (ret > 0) {
1946                 err = -EIO;
1947                 goto out;
1948         }
1949
1950         leaf = path->nodes[0];
1951         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1952 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1953         if (item_size < sizeof(*ei)) {
1954                 ret = convert_extent_item_v0(trans, root->fs_info->extent_root,
1955                                              path, (u64)-1, 0);
1956                 if (ret < 0) {
1957                         err = ret;
1958                         goto out;
1959                 }
1960                 leaf = path->nodes[0];
1961                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1962         }
1963 #endif
1964         BUG_ON(item_size < sizeof(*ei));
1965         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1966         __run_delayed_extent_op(extent_op, leaf, ei);
1967
1968         btrfs_mark_buffer_dirty(leaf);
1969 out:
1970         btrfs_free_path(path);
1971         return err;
1972 }
1973
1974 static int run_delayed_tree_ref(struct btrfs_trans_handle *trans,
1975                                 struct btrfs_root *root,
1976                                 struct btrfs_delayed_ref_node *node,
1977                                 struct btrfs_delayed_extent_op *extent_op,
1978                                 int insert_reserved)
1979 {
1980         int ret = 0;
1981         struct btrfs_delayed_tree_ref *ref;
1982         struct btrfs_key ins;
1983         u64 parent = 0;
1984         u64 ref_root = 0;
1985
1986         ins.objectid = node->bytenr;
1987         ins.offset = node->num_bytes;
1988         ins.type = BTRFS_EXTENT_ITEM_KEY;
1989
1990         ref = btrfs_delayed_node_to_tree_ref(node);
1991         if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
1992                 parent = ref->parent;
1993         else
1994                 ref_root = ref->root;
1995
1996         BUG_ON(node->ref_mod != 1);
1997         if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1998                 BUG_ON(!extent_op || !extent_op->update_flags ||
1999                        !extent_op->update_key);
2000                 ret = alloc_reserved_tree_block(trans, root,
2001                                                 parent, ref_root,
2002                                                 extent_op->flags_to_set,
2003                                                 &extent_op->key,
2004                                                 ref->level, &ins);
2005         } else if (node->action == BTRFS_ADD_DELAYED_REF) {
2006                 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
2007                                              node->num_bytes, parent, ref_root,
2008                                              ref->level, 0, 1, extent_op);
2009         } else if (node->action == BTRFS_DROP_DELAYED_REF) {
2010                 ret = __btrfs_free_extent(trans, root, node->bytenr,
2011                                           node->num_bytes, parent, ref_root,
2012                                           ref->level, 0, 1, extent_op);
2013         } else {
2014                 BUG();
2015         }
2016         return ret;
2017 }
2018
2019 /* helper function to actually process a single delayed ref entry */
2020 static int run_one_delayed_ref(struct btrfs_trans_handle *trans,
2021                                struct btrfs_root *root,
2022                                struct btrfs_delayed_ref_node *node,
2023                                struct btrfs_delayed_extent_op *extent_op,
2024                                int insert_reserved)
2025 {
2026         int ret;
2027         if (btrfs_delayed_ref_is_head(node)) {
2028                 struct btrfs_delayed_ref_head *head;
2029                 /*
2030                  * we've hit the end of the chain and we were supposed
2031                  * to insert this extent into the tree.  But, it got
2032                  * deleted before we ever needed to insert it, so all
2033                  * we have to do is clean up the accounting
2034                  */
2035                 BUG_ON(extent_op);
2036                 head = btrfs_delayed_node_to_head(node);
2037                 if (insert_reserved) {
2038                         btrfs_pin_extent(root, node->bytenr,
2039                                          node->num_bytes, 1);
2040                         if (head->is_data) {
2041                                 ret = btrfs_del_csums(trans, root,
2042                                                       node->bytenr,
2043                                                       node->num_bytes);
2044                                 BUG_ON(ret);
2045                         }
2046                 }
2047                 mutex_unlock(&head->mutex);
2048                 return 0;
2049         }
2050
2051         if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
2052             node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2053                 ret = run_delayed_tree_ref(trans, root, node, extent_op,
2054                                            insert_reserved);
2055         else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
2056                  node->type == BTRFS_SHARED_DATA_REF_KEY)
2057                 ret = run_delayed_data_ref(trans, root, node, extent_op,
2058                                            insert_reserved);
2059         else
2060                 BUG();
2061         return ret;
2062 }
2063
2064 static noinline struct btrfs_delayed_ref_node *
2065 select_delayed_ref(struct btrfs_delayed_ref_head *head)
2066 {
2067         struct rb_node *node;
2068         struct btrfs_delayed_ref_node *ref;
2069         int action = BTRFS_ADD_DELAYED_REF;
2070 again:
2071         /*
2072          * select delayed ref of type BTRFS_ADD_DELAYED_REF first.
2073          * this prevents ref count from going down to zero when
2074          * there still are pending delayed ref.
2075          */
2076         node = rb_prev(&head->node.rb_node);
2077         while (1) {
2078                 if (!node)
2079                         break;
2080                 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2081                                 rb_node);
2082                 if (ref->bytenr != head->node.bytenr)
2083                         break;
2084                 if (ref->action == action)
2085                         return ref;
2086                 node = rb_prev(node);
2087         }
2088         if (action == BTRFS_ADD_DELAYED_REF) {
2089                 action = BTRFS_DROP_DELAYED_REF;
2090                 goto again;
2091         }
2092         return NULL;
2093 }
2094
2095 static noinline int run_clustered_refs(struct btrfs_trans_handle *trans,
2096                                        struct btrfs_root *root,
2097                                        struct list_head *cluster)
2098 {
2099         struct btrfs_delayed_ref_root *delayed_refs;
2100         struct btrfs_delayed_ref_node *ref;
2101         struct btrfs_delayed_ref_head *locked_ref = NULL;
2102         struct btrfs_delayed_extent_op *extent_op;
2103         int ret;
2104         int count = 0;
2105         int must_insert_reserved = 0;
2106
2107         delayed_refs = &trans->transaction->delayed_refs;
2108         while (1) {
2109                 if (!locked_ref) {
2110                         /* pick a new head ref from the cluster list */
2111                         if (list_empty(cluster))
2112                                 break;
2113
2114                         locked_ref = list_entry(cluster->next,
2115                                      struct btrfs_delayed_ref_head, cluster);
2116
2117                         /* grab the lock that says we are going to process
2118                          * all the refs for this head */
2119                         ret = btrfs_delayed_ref_lock(trans, locked_ref);
2120
2121                         /*
2122                          * we may have dropped the spin lock to get the head
2123                          * mutex lock, and that might have given someone else
2124                          * time to free the head.  If that's true, it has been
2125                          * removed from our list and we can move on.
2126                          */
2127                         if (ret == -EAGAIN) {
2128                                 locked_ref = NULL;
2129                                 count++;
2130                                 continue;
2131                         }
2132                 }
2133
2134                 /*
2135                  * record the must insert reserved flag before we
2136                  * drop the spin lock.
2137                  */
2138                 must_insert_reserved = locked_ref->must_insert_reserved;
2139                 locked_ref->must_insert_reserved = 0;
2140
2141                 extent_op = locked_ref->extent_op;
2142                 locked_ref->extent_op = NULL;
2143
2144                 /*
2145                  * locked_ref is the head node, so we have to go one
2146                  * node back for any delayed ref updates
2147                  */
2148                 ref = select_delayed_ref(locked_ref);
2149                 if (!ref) {
2150                         /* All delayed refs have been processed, Go ahead
2151                          * and send the head node to run_one_delayed_ref,
2152                          * so that any accounting fixes can happen
2153                          */
2154                         ref = &locked_ref->node;
2155
2156                         if (extent_op && must_insert_reserved) {
2157                                 kfree(extent_op);
2158                                 extent_op = NULL;
2159                         }
2160
2161                         if (extent_op) {
2162                                 spin_unlock(&delayed_refs->lock);
2163
2164                                 ret = run_delayed_extent_op(trans, root,
2165                                                             ref, extent_op);
2166                                 BUG_ON(ret);
2167                                 kfree(extent_op);
2168
2169                                 cond_resched();
2170                                 spin_lock(&delayed_refs->lock);
2171                                 continue;
2172                         }
2173
2174                         list_del_init(&locked_ref->cluster);
2175                         locked_ref = NULL;
2176                 }
2177
2178                 ref->in_tree = 0;
2179                 rb_erase(&ref->rb_node, &delayed_refs->root);
2180                 delayed_refs->num_entries--;
2181
2182                 spin_unlock(&delayed_refs->lock);
2183
2184                 ret = run_one_delayed_ref(trans, root, ref, extent_op,
2185                                           must_insert_reserved);
2186                 BUG_ON(ret);
2187
2188                 btrfs_put_delayed_ref(ref);
2189                 kfree(extent_op);
2190                 count++;
2191
2192                 cond_resched();
2193                 spin_lock(&delayed_refs->lock);
2194         }
2195         return count;
2196 }
2197
2198 /*
2199  * this starts processing the delayed reference count updates and
2200  * extent insertions we have queued up so far.  count can be
2201  * 0, which means to process everything in the tree at the start
2202  * of the run (but not newly added entries), or it can be some target
2203  * number you'd like to process.
2204  */
2205 int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans,
2206                            struct btrfs_root *root, unsigned long count)
2207 {
2208         struct rb_node *node;
2209         struct btrfs_delayed_ref_root *delayed_refs;
2210         struct btrfs_delayed_ref_node *ref;
2211         struct list_head cluster;
2212         int ret;
2213         int run_all = count == (unsigned long)-1;
2214         int run_most = 0;
2215
2216         if (root == root->fs_info->extent_root)
2217                 root = root->fs_info->tree_root;
2218
2219         delayed_refs = &trans->transaction->delayed_refs;
2220         INIT_LIST_HEAD(&cluster);
2221 again:
2222         spin_lock(&delayed_refs->lock);
2223         if (count == 0) {
2224                 count = delayed_refs->num_entries * 2;
2225                 run_most = 1;
2226         }
2227         while (1) {
2228                 if (!(run_all || run_most) &&
2229                     delayed_refs->num_heads_ready < 64)
2230                         break;
2231
2232                 /*
2233                  * go find something we can process in the rbtree.  We start at
2234                  * the beginning of the tree, and then build a cluster
2235                  * of refs to process starting at the first one we are able to
2236                  * lock
2237                  */
2238                 ret = btrfs_find_ref_cluster(trans, &cluster,
2239                                              delayed_refs->run_delayed_start);
2240                 if (ret)
2241                         break;
2242
2243                 ret = run_clustered_refs(trans, root, &cluster);
2244                 BUG_ON(ret < 0);
2245
2246                 count -= min_t(unsigned long, ret, count);
2247
2248                 if (count == 0)
2249                         break;
2250         }
2251
2252         if (run_all) {
2253                 node = rb_first(&delayed_refs->root);
2254                 if (!node)
2255                         goto out;
2256                 count = (unsigned long)-1;
2257
2258                 while (node) {
2259                         ref = rb_entry(node, struct btrfs_delayed_ref_node,
2260                                        rb_node);
2261                         if (btrfs_delayed_ref_is_head(ref)) {
2262                                 struct btrfs_delayed_ref_head *head;
2263
2264                                 head = btrfs_delayed_node_to_head(ref);
2265                                 atomic_inc(&ref->refs);
2266
2267                                 spin_unlock(&delayed_refs->lock);
2268                                 mutex_lock(&head->mutex);
2269                                 mutex_unlock(&head->mutex);
2270
2271                                 btrfs_put_delayed_ref(ref);
2272                                 cond_resched();
2273                                 goto again;
2274                         }
2275                         node = rb_next(node);
2276                 }
2277                 spin_unlock(&delayed_refs->lock);
2278                 schedule_timeout(1);
2279                 goto again;
2280         }
2281 out:
2282         spin_unlock(&delayed_refs->lock);
2283         return 0;
2284 }
2285
2286 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans,
2287                                 struct btrfs_root *root,
2288                                 u64 bytenr, u64 num_bytes, u64 flags,
2289                                 int is_data)
2290 {
2291         struct btrfs_delayed_extent_op *extent_op;
2292         int ret;
2293
2294         extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2295         if (!extent_op)
2296                 return -ENOMEM;
2297
2298         extent_op->flags_to_set = flags;
2299         extent_op->update_flags = 1;
2300         extent_op->update_key = 0;
2301         extent_op->is_data = is_data ? 1 : 0;
2302
2303         ret = btrfs_add_delayed_extent_op(trans, bytenr, num_bytes, extent_op);
2304         if (ret)
2305                 kfree(extent_op);
2306         return ret;
2307 }
2308
2309 static noinline int check_delayed_ref(struct btrfs_trans_handle *trans,
2310                                       struct btrfs_root *root,
2311                                       struct btrfs_path *path,
2312                                       u64 objectid, u64 offset, u64 bytenr)
2313 {
2314         struct btrfs_delayed_ref_head *head;
2315         struct btrfs_delayed_ref_node *ref;
2316         struct btrfs_delayed_data_ref *data_ref;
2317         struct btrfs_delayed_ref_root *delayed_refs;
2318         struct rb_node *node;
2319         int ret = 0;
2320
2321         ret = -ENOENT;
2322         delayed_refs = &trans->transaction->delayed_refs;
2323         spin_lock(&delayed_refs->lock);
2324         head = btrfs_find_delayed_ref_head(trans, bytenr);
2325         if (!head)
2326                 goto out;
2327
2328         if (!mutex_trylock(&head->mutex)) {
2329                 atomic_inc(&head->node.refs);
2330                 spin_unlock(&delayed_refs->lock);
2331
2332                 btrfs_release_path(root->fs_info->extent_root, path);
2333
2334                 mutex_lock(&head->mutex);
2335                 mutex_unlock(&head->mutex);
2336                 btrfs_put_delayed_ref(&head->node);
2337                 return -EAGAIN;
2338         }
2339
2340         node = rb_prev(&head->node.rb_node);
2341         if (!node)
2342                 goto out_unlock;
2343
2344         ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2345
2346         if (ref->bytenr != bytenr)
2347                 goto out_unlock;
2348
2349         ret = 1;
2350         if (ref->type != BTRFS_EXTENT_DATA_REF_KEY)
2351                 goto out_unlock;
2352
2353         data_ref = btrfs_delayed_node_to_data_ref(ref);
2354
2355         node = rb_prev(node);
2356         if (node) {
2357                 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2358                 if (ref->bytenr == bytenr)
2359                         goto out_unlock;
2360         }
2361
2362         if (data_ref->root != root->root_key.objectid ||
2363             data_ref->objectid != objectid || data_ref->offset != offset)
2364                 goto out_unlock;
2365
2366         ret = 0;
2367 out_unlock:
2368         mutex_unlock(&head->mutex);
2369 out:
2370         spin_unlock(&delayed_refs->lock);
2371         return ret;
2372 }
2373
2374 static noinline int check_committed_ref(struct btrfs_trans_handle *trans,
2375                                         struct btrfs_root *root,
2376                                         struct btrfs_path *path,
2377                                         u64 objectid, u64 offset, u64 bytenr)
2378 {
2379         struct btrfs_root *extent_root = root->fs_info->extent_root;
2380         struct extent_buffer *leaf;
2381         struct btrfs_extent_data_ref *ref;
2382         struct btrfs_extent_inline_ref *iref;
2383         struct btrfs_extent_item *ei;
2384         struct btrfs_key key;
2385         u32 item_size;
2386         int ret;
2387
2388         key.objectid = bytenr;
2389         key.offset = (u64)-1;
2390         key.type = BTRFS_EXTENT_ITEM_KEY;
2391
2392         ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2393         if (ret < 0)
2394                 goto out;
2395         BUG_ON(ret == 0);
2396
2397         ret = -ENOENT;
2398         if (path->slots[0] == 0)
2399                 goto out;
2400
2401         path->slots[0]--;
2402         leaf = path->nodes[0];
2403         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2404
2405         if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2406                 goto out;
2407
2408         ret = 1;
2409         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2410 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2411         if (item_size < sizeof(*ei)) {
2412                 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
2413                 goto out;
2414         }
2415 #endif
2416         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2417
2418         if (item_size != sizeof(*ei) +
2419             btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY))
2420                 goto out;
2421
2422         if (btrfs_extent_generation(leaf, ei) <=
2423             btrfs_root_last_snapshot(&root->root_item))
2424                 goto out;
2425
2426         iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2427         if (btrfs_extent_inline_ref_type(leaf, iref) !=
2428             BTRFS_EXTENT_DATA_REF_KEY)
2429                 goto out;
2430
2431         ref = (struct btrfs_extent_data_ref *)(&iref->offset);
2432         if (btrfs_extent_refs(leaf, ei) !=
2433             btrfs_extent_data_ref_count(leaf, ref) ||
2434             btrfs_extent_data_ref_root(leaf, ref) !=
2435             root->root_key.objectid ||
2436             btrfs_extent_data_ref_objectid(leaf, ref) != objectid ||
2437             btrfs_extent_data_ref_offset(leaf, ref) != offset)
2438                 goto out;
2439
2440         ret = 0;
2441 out:
2442         return ret;
2443 }
2444
2445 int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans,
2446                           struct btrfs_root *root,
2447                           u64 objectid, u64 offset, u64 bytenr)
2448 {
2449         struct btrfs_path *path;
2450         int ret;
2451         int ret2;
2452
2453         path = btrfs_alloc_path();
2454         if (!path)
2455                 return -ENOENT;
2456
2457         do {
2458                 ret = check_committed_ref(trans, root, path, objectid,
2459                                           offset, bytenr);
2460                 if (ret && ret != -ENOENT)
2461                         goto out;
2462
2463                 ret2 = check_delayed_ref(trans, root, path, objectid,
2464                                          offset, bytenr);
2465         } while (ret2 == -EAGAIN);
2466
2467         if (ret2 && ret2 != -ENOENT) {
2468                 ret = ret2;
2469                 goto out;
2470         }
2471
2472         if (ret != -ENOENT || ret2 != -ENOENT)
2473                 ret = 0;
2474 out:
2475         btrfs_free_path(path);
2476         if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2477                 WARN_ON(ret > 0);
2478         return ret;
2479 }
2480
2481 #if 0
2482 int btrfs_cache_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2483                     struct extent_buffer *buf, u32 nr_extents)
2484 {
2485         struct btrfs_key key;
2486         struct btrfs_file_extent_item *fi;
2487         u64 root_gen;
2488         u32 nritems;
2489         int i;
2490         int level;
2491         int ret = 0;
2492         int shared = 0;
2493
2494         if (!root->ref_cows)
2495                 return 0;
2496
2497         if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
2498                 shared = 0;
2499                 root_gen = root->root_key.offset;
2500         } else {
2501                 shared = 1;
2502                 root_gen = trans->transid - 1;
2503         }
2504
2505         level = btrfs_header_level(buf);
2506         nritems = btrfs_header_nritems(buf);
2507
2508         if (level == 0) {
2509                 struct btrfs_leaf_ref *ref;
2510                 struct btrfs_extent_info *info;
2511
2512                 ref = btrfs_alloc_leaf_ref(root, nr_extents);
2513                 if (!ref) {
2514                         ret = -ENOMEM;
2515                         goto out;
2516                 }
2517
2518                 ref->root_gen = root_gen;
2519                 ref->bytenr = buf->start;
2520                 ref->owner = btrfs_header_owner(buf);
2521                 ref->generation = btrfs_header_generation(buf);
2522                 ref->nritems = nr_extents;
2523                 info = ref->extents;
2524
2525                 for (i = 0; nr_extents > 0 && i < nritems; i++) {
2526                         u64 disk_bytenr;
2527                         btrfs_item_key_to_cpu(buf, &key, i);
2528                         if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2529                                 continue;
2530                         fi = btrfs_item_ptr(buf, i,
2531                                             struct btrfs_file_extent_item);
2532                         if (btrfs_file_extent_type(buf, fi) ==
2533                             BTRFS_FILE_EXTENT_INLINE)
2534                                 continue;
2535                         disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2536                         if (disk_bytenr == 0)
2537                                 continue;
2538
2539                         info->bytenr = disk_bytenr;
2540                         info->num_bytes =
2541                                 btrfs_file_extent_disk_num_bytes(buf, fi);
2542                         info->objectid = key.objectid;
2543                         info->offset = key.offset;
2544                         info++;
2545                 }
2546
2547                 ret = btrfs_add_leaf_ref(root, ref, shared);
2548                 if (ret == -EEXIST && shared) {
2549                         struct btrfs_leaf_ref *old;
2550                         old = btrfs_lookup_leaf_ref(root, ref->bytenr);
2551                         BUG_ON(!old);
2552                         btrfs_remove_leaf_ref(root, old);
2553                         btrfs_free_leaf_ref(root, old);
2554                         ret = btrfs_add_leaf_ref(root, ref, shared);
2555                 }
2556                 WARN_ON(ret);
2557                 btrfs_free_leaf_ref(root, ref);
2558         }
2559 out:
2560         return ret;
2561 }
2562
2563 /* when a block goes through cow, we update the reference counts of
2564  * everything that block points to.  The internal pointers of the block
2565  * can be in just about any order, and it is likely to have clusters of
2566  * things that are close together and clusters of things that are not.
2567  *
2568  * To help reduce the seeks that come with updating all of these reference
2569  * counts, sort them by byte number before actual updates are done.
2570  *
2571  * struct refsort is used to match byte number to slot in the btree block.
2572  * we sort based on the byte number and then use the slot to actually
2573  * find the item.
2574  *
2575  * struct refsort is smaller than strcut btrfs_item and smaller than
2576  * struct btrfs_key_ptr.  Since we're currently limited to the page size
2577  * for a btree block, there's no way for a kmalloc of refsorts for a
2578  * single node to be bigger than a page.
2579  */
2580 struct refsort {
2581         u64 bytenr;
2582         u32 slot;
2583 };
2584
2585 /*
2586  * for passing into sort()
2587  */
2588 static int refsort_cmp(const void *a_void, const void *b_void)
2589 {
2590         const struct refsort *a = a_void;
2591         const struct refsort *b = b_void;
2592
2593         if (a->bytenr < b->bytenr)
2594                 return -1;
2595         if (a->bytenr > b->bytenr)
2596                 return 1;
2597         return 0;
2598 }
2599 #endif
2600
2601 static int __btrfs_mod_ref(struct btrfs_trans_handle *trans,
2602                            struct btrfs_root *root,
2603                            struct extent_buffer *buf,
2604                            int full_backref, int inc)
2605 {
2606         u64 bytenr;
2607         u64 num_bytes;
2608         u64 parent;
2609         u64 ref_root;
2610         u32 nritems;
2611         struct btrfs_key key;
2612         struct btrfs_file_extent_item *fi;
2613         int i;
2614         int level;
2615         int ret = 0;
2616         int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *,
2617                             u64, u64, u64, u64, u64, u64);
2618
2619         ref_root = btrfs_header_owner(buf);
2620         nritems = btrfs_header_nritems(buf);
2621         level = btrfs_header_level(buf);
2622
2623         if (!root->ref_cows && level == 0)
2624                 return 0;
2625
2626         if (inc)
2627                 process_func = btrfs_inc_extent_ref;
2628         else
2629                 process_func = btrfs_free_extent;
2630
2631         if (full_backref)
2632                 parent = buf->start;
2633         else
2634                 parent = 0;
2635
2636         for (i = 0; i < nritems; i++) {
2637                 if (level == 0) {
2638                         btrfs_item_key_to_cpu(buf, &key, i);
2639                         if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2640                                 continue;
2641                         fi = btrfs_item_ptr(buf, i,
2642                                             struct btrfs_file_extent_item);
2643                         if (btrfs_file_extent_type(buf, fi) ==
2644                             BTRFS_FILE_EXTENT_INLINE)
2645                                 continue;
2646                         bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2647                         if (bytenr == 0)
2648                                 continue;
2649
2650                         num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi);
2651                         key.offset -= btrfs_file_extent_offset(buf, fi);
2652                         ret = process_func(trans, root, bytenr, num_bytes,
2653                                            parent, ref_root, key.objectid,
2654                                            key.offset);
2655                         if (ret)
2656                                 goto fail;
2657                 } else {
2658                         bytenr = btrfs_node_blockptr(buf, i);
2659                         num_bytes = btrfs_level_size(root, level - 1);
2660                         ret = process_func(trans, root, bytenr, num_bytes,
2661                                            parent, ref_root, level - 1, 0);
2662                         if (ret)
2663                                 goto fail;
2664                 }
2665         }
2666         return 0;
2667 fail:
2668         BUG();
2669         return ret;
2670 }
2671
2672 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2673                   struct extent_buffer *buf, int full_backref)
2674 {
2675         return __btrfs_mod_ref(trans, root, buf, full_backref, 1);
2676 }
2677
2678 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2679                   struct extent_buffer *buf, int full_backref)
2680 {
2681         return __btrfs_mod_ref(trans, root, buf, full_backref, 0);
2682 }
2683
2684 static int write_one_cache_group(struct btrfs_trans_handle *trans,
2685                                  struct btrfs_root *root,
2686                                  struct btrfs_path *path,
2687                                  struct btrfs_block_group_cache *cache)
2688 {
2689         int ret;
2690         struct btrfs_root *extent_root = root->fs_info->extent_root;
2691         unsigned long bi;
2692         struct extent_buffer *leaf;
2693
2694         ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1);
2695         if (ret < 0)
2696                 goto fail;
2697         BUG_ON(ret);
2698
2699         leaf = path->nodes[0];
2700         bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
2701         write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item));
2702         btrfs_mark_buffer_dirty(leaf);
2703         btrfs_release_path(extent_root, path);
2704 fail:
2705         if (ret)
2706                 return ret;
2707         return 0;
2708
2709 }
2710
2711 static struct btrfs_block_group_cache *
2712 next_block_group(struct btrfs_root *root,
2713                  struct btrfs_block_group_cache *cache)
2714 {
2715         struct rb_node *node;
2716         spin_lock(&root->fs_info->block_group_cache_lock);
2717         node = rb_next(&cache->cache_node);
2718         btrfs_put_block_group(cache);
2719         if (node) {
2720                 cache = rb_entry(node, struct btrfs_block_group_cache,
2721                                  cache_node);
2722                 btrfs_get_block_group(cache);
2723         } else
2724                 cache = NULL;
2725         spin_unlock(&root->fs_info->block_group_cache_lock);
2726         return cache;
2727 }
2728
2729 static int cache_save_setup(struct btrfs_block_group_cache *block_group,
2730                             struct btrfs_trans_handle *trans,
2731                             struct btrfs_path *path)
2732 {
2733         struct btrfs_root *root = block_group->fs_info->tree_root;
2734         struct inode *inode = NULL;
2735         u64 alloc_hint = 0;
2736         int num_pages = 0;
2737         int retries = 0;
2738         int ret = 0;
2739
2740         /*
2741          * If this block group is smaller than 100 megs don't bother caching the
2742          * block group.
2743          */
2744         if (block_group->key.offset < (100 * 1024 * 1024)) {
2745                 spin_lock(&block_group->lock);
2746                 block_group->disk_cache_state = BTRFS_DC_WRITTEN;
2747                 spin_unlock(&block_group->lock);
2748                 return 0;
2749         }
2750
2751 again:
2752         inode = lookup_free_space_inode(root, block_group, path);
2753         if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
2754                 ret = PTR_ERR(inode);
2755                 btrfs_release_path(root, path);
2756                 goto out;
2757         }
2758
2759         if (IS_ERR(inode)) {
2760                 BUG_ON(retries);
2761                 retries++;
2762
2763                 if (block_group->ro)
2764                         goto out_free;
2765
2766                 ret = create_free_space_inode(root, trans, block_group, path);
2767                 if (ret)
2768                         goto out_free;
2769                 goto again;
2770         }
2771
2772         /*
2773          * We want to set the generation to 0, that way if anything goes wrong
2774          * from here on out we know not to trust this cache when we load up next
2775          * time.
2776          */
2777         BTRFS_I(inode)->generation = 0;
2778         ret = btrfs_update_inode(trans, root, inode);
2779         WARN_ON(ret);
2780
2781         if (i_size_read(inode) > 0) {
2782                 ret = btrfs_truncate_free_space_cache(root, trans, path,
2783                                                       inode);
2784                 if (ret)
2785                         goto out_put;
2786         }
2787
2788         spin_lock(&block_group->lock);
2789         if (block_group->cached != BTRFS_CACHE_FINISHED) {
2790                 spin_unlock(&block_group->lock);
2791                 goto out_put;
2792         }
2793         spin_unlock(&block_group->lock);
2794
2795         num_pages = (int)div64_u64(block_group->key.offset, 1024 * 1024 * 1024);
2796         if (!num_pages)
2797                 num_pages = 1;
2798
2799         /*
2800          * Just to make absolutely sure we have enough space, we're going to
2801          * preallocate 12 pages worth of space for each block group.  In
2802          * practice we ought to use at most 8, but we need extra space so we can
2803          * add our header and have a terminator between the extents and the
2804          * bitmaps.
2805          */
2806         num_pages *= 16;
2807         num_pages *= PAGE_CACHE_SIZE;
2808
2809         ret = btrfs_check_data_free_space(inode, num_pages);
2810         if (ret)
2811                 goto out_put;
2812
2813         ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages,
2814                                               num_pages, num_pages,
2815                                               &alloc_hint);
2816         btrfs_free_reserved_data_space(inode, num_pages);
2817 out_put:
2818         iput(inode);
2819 out_free:
2820         btrfs_release_path(root, path);
2821 out:
2822         spin_lock(&block_group->lock);
2823         if (ret)
2824                 block_group->disk_cache_state = BTRFS_DC_ERROR;
2825         else
2826                 block_group->disk_cache_state = BTRFS_DC_SETUP;
2827         spin_unlock(&block_group->lock);
2828
2829         return ret;
2830 }
2831
2832 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans,
2833                                    struct btrfs_root *root)
2834 {
2835         struct btrfs_block_group_cache *cache;
2836         int err = 0;
2837         struct btrfs_path *path;
2838         u64 last = 0;
2839
2840         path = btrfs_alloc_path();
2841         if (!path)
2842                 return -ENOMEM;
2843
2844 again:
2845         while (1) {
2846                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2847                 while (cache) {
2848                         if (cache->disk_cache_state == BTRFS_DC_CLEAR)
2849                                 break;
2850                         cache = next_block_group(root, cache);
2851                 }
2852                 if (!cache) {
2853                         if (last == 0)
2854                                 break;
2855                         last = 0;
2856                         continue;
2857                 }
2858                 err = cache_save_setup(cache, trans, path);
2859                 last = cache->key.objectid + cache->key.offset;
2860                 btrfs_put_block_group(cache);
2861         }
2862
2863         while (1) {
2864                 if (last == 0) {
2865                         err = btrfs_run_delayed_refs(trans, root,
2866                                                      (unsigned long)-1);
2867                         BUG_ON(err);
2868                 }
2869
2870                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2871                 while (cache) {
2872                         if (cache->disk_cache_state == BTRFS_DC_CLEAR) {
2873                                 btrfs_put_block_group(cache);
2874                                 goto again;
2875                         }
2876
2877                         if (cache->dirty)
2878                                 break;
2879                         cache = next_block_group(root, cache);
2880                 }
2881                 if (!cache) {
2882                         if (last == 0)
2883                                 break;
2884                         last = 0;
2885                         continue;
2886                 }
2887
2888                 if (cache->disk_cache_state == BTRFS_DC_SETUP)
2889                         cache->disk_cache_state = BTRFS_DC_NEED_WRITE;
2890                 cache->dirty = 0;
2891                 last = cache->key.objectid + cache->key.offset;
2892
2893                 err = write_one_cache_group(trans, root, path, cache);
2894                 BUG_ON(err);
2895                 btrfs_put_block_group(cache);
2896         }
2897
2898         while (1) {
2899                 /*
2900                  * I don't think this is needed since we're just marking our
2901                  * preallocated extent as written, but just in case it can't
2902                  * hurt.
2903                  */
2904                 if (last == 0) {
2905                         err = btrfs_run_delayed_refs(trans, root,
2906                                                      (unsigned long)-1);
2907                         BUG_ON(err);
2908                 }
2909
2910                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2911                 while (cache) {
2912                         /*
2913                          * Really this shouldn't happen, but it could if we
2914                          * couldn't write the entire preallocated extent and
2915                          * splitting the extent resulted in a new block.
2916                          */
2917                         if (cache->dirty) {
2918                                 btrfs_put_block_group(cache);
2919                                 goto again;
2920                         }
2921                         if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2922                                 break;
2923                         cache = next_block_group(root, cache);
2924                 }
2925                 if (!cache) {
2926                         if (last == 0)
2927                                 break;
2928                         last = 0;
2929                         continue;
2930                 }
2931
2932                 btrfs_write_out_cache(root, trans, cache, path);
2933
2934                 /*
2935                  * If we didn't have an error then the cache state is still
2936                  * NEED_WRITE, so we can set it to WRITTEN.
2937                  */
2938                 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2939                         cache->disk_cache_state = BTRFS_DC_WRITTEN;
2940                 last = cache->key.objectid + cache->key.offset;
2941                 btrfs_put_block_group(cache);
2942         }
2943
2944         btrfs_free_path(path);
2945         return 0;
2946 }
2947
2948 int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr)
2949 {
2950         struct btrfs_block_group_cache *block_group;
2951         int readonly = 0;
2952
2953         block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
2954         if (!block_group || block_group->ro)
2955                 readonly = 1;
2956         if (block_group)
2957                 btrfs_put_block_group(block_group);
2958         return readonly;
2959 }
2960
2961 static int update_space_info(struct btrfs_fs_info *info, u64 flags,
2962                              u64 total_bytes, u64 bytes_used,
2963                              struct btrfs_space_info **space_info)
2964 {
2965         struct btrfs_space_info *found;
2966         int i;
2967         int factor;
2968
2969         if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
2970                      BTRFS_BLOCK_GROUP_RAID10))
2971                 factor = 2;
2972         else
2973                 factor = 1;
2974
2975         found = __find_space_info(info, flags);
2976         if (found) {
2977                 spin_lock(&found->lock);
2978                 found->total_bytes += total_bytes;
2979                 found->bytes_used += bytes_used;
2980                 found->disk_used += bytes_used * factor;
2981                 found->full = 0;
2982                 spin_unlock(&found->lock);
2983                 *space_info = found;
2984                 return 0;
2985         }
2986         found = kzalloc(sizeof(*found), GFP_NOFS);
2987         if (!found)
2988                 return -ENOMEM;
2989
2990         for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
2991                 INIT_LIST_HEAD(&found->block_groups[i]);
2992         init_rwsem(&found->groups_sem);
2993         spin_lock_init(&found->lock);
2994         found->flags = flags & (BTRFS_BLOCK_GROUP_DATA |
2995                                 BTRFS_BLOCK_GROUP_SYSTEM |
2996                                 BTRFS_BLOCK_GROUP_METADATA);
2997         found->total_bytes = total_bytes;
2998         found->bytes_used = bytes_used;
2999         found->disk_used = bytes_used * factor;
3000         found->bytes_pinned = 0;
3001         found->bytes_reserved = 0;
3002         found->bytes_readonly = 0;
3003         found->bytes_may_use = 0;
3004         found->full = 0;
3005         found->force_alloc = 0;
3006         *space_info = found;
3007         list_add_rcu(&found->list, &info->space_info);
3008         atomic_set(&found->caching_threads, 0);
3009         return 0;
3010 }
3011
3012 static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
3013 {
3014         u64 extra_flags = flags & (BTRFS_BLOCK_GROUP_RAID0 |
3015                                    BTRFS_BLOCK_GROUP_RAID1 |
3016                                    BTRFS_BLOCK_GROUP_RAID10 |
3017                                    BTRFS_BLOCK_GROUP_DUP);
3018         if (extra_flags) {
3019                 if (flags & BTRFS_BLOCK_GROUP_DATA)
3020                         fs_info->avail_data_alloc_bits |= extra_flags;
3021                 if (flags & BTRFS_BLOCK_GROUP_METADATA)
3022                         fs_info->avail_metadata_alloc_bits |= extra_flags;
3023                 if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3024                         fs_info->avail_system_alloc_bits |= extra_flags;
3025         }
3026 }
3027
3028 u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags)
3029 {
3030         u64 num_devices = root->fs_info->fs_devices->rw_devices;
3031
3032         if (num_devices == 1)
3033                 flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0);
3034         if (num_devices < 4)
3035                 flags &= ~BTRFS_BLOCK_GROUP_RAID10;
3036
3037         if ((flags & BTRFS_BLOCK_GROUP_DUP) &&
3038             (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3039                       BTRFS_BLOCK_GROUP_RAID10))) {
3040                 flags &= ~BTRFS_BLOCK_GROUP_DUP;
3041         }
3042
3043         if ((flags & BTRFS_BLOCK_GROUP_RAID1) &&
3044             (flags & BTRFS_BLOCK_GROUP_RAID10)) {
3045                 flags &= ~BTRFS_BLOCK_GROUP_RAID1;
3046         }
3047
3048         if ((flags & BTRFS_BLOCK_GROUP_RAID0) &&
3049             ((flags & BTRFS_BLOCK_GROUP_RAID1) |
3050              (flags & BTRFS_BLOCK_GROUP_RAID10) |
3051              (flags & BTRFS_BLOCK_GROUP_DUP)))
3052                 flags &= ~BTRFS_BLOCK_GROUP_RAID0;
3053         return flags;
3054 }
3055
3056 static u64 get_alloc_profile(struct btrfs_root *root, u64 flags)
3057 {
3058         if (flags & BTRFS_BLOCK_GROUP_DATA)
3059                 flags |= root->fs_info->avail_data_alloc_bits &
3060                          root->fs_info->data_alloc_profile;
3061         else if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3062                 flags |= root->fs_info->avail_system_alloc_bits &
3063                          root->fs_info->system_alloc_profile;
3064         else if (flags & BTRFS_BLOCK_GROUP_METADATA)
3065                 flags |= root->fs_info->avail_metadata_alloc_bits &
3066                          root->fs_info->metadata_alloc_profile;
3067         return btrfs_reduce_alloc_profile(root, flags);
3068 }
3069
3070 static u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data)
3071 {
3072         u64 flags;
3073
3074         if (data)
3075                 flags = BTRFS_BLOCK_GROUP_DATA;
3076         else if (root == root->fs_info->chunk_root)
3077                 flags = BTRFS_BLOCK_GROUP_SYSTEM;
3078         else
3079                 flags = BTRFS_BLOCK_GROUP_METADATA;
3080
3081         return get_alloc_profile(root, flags);
3082 }
3083
3084 void btrfs_set_inode_space_info(struct btrfs_root *root, struct inode *inode)
3085 {
3086         BTRFS_I(inode)->space_info = __find_space_info(root->fs_info,
3087                                                        BTRFS_BLOCK_GROUP_DATA);
3088 }
3089
3090 /*
3091  * This will check the space that the inode allocates from to make sure we have
3092  * enough space for bytes.
3093  */
3094 int btrfs_check_data_free_space(struct inode *inode, u64 bytes)
3095 {
3096         struct btrfs_space_info *data_sinfo;
3097         struct btrfs_root *root = BTRFS_I(inode)->root;
3098         u64 used;
3099         int ret = 0, committed = 0, alloc_chunk = 1;
3100
3101         /* make sure bytes are sectorsize aligned */
3102         bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3103
3104         if (root == root->fs_info->tree_root) {
3105                 alloc_chunk = 0;
3106                 committed = 1;
3107         }
3108
3109         data_sinfo = BTRFS_I(inode)->space_info;
3110         if (!data_sinfo)
3111                 goto alloc;
3112
3113 again:
3114         /* make sure we have enough space to handle the data first */
3115         spin_lock(&data_sinfo->lock);
3116         used = data_sinfo->bytes_used + data_sinfo->bytes_reserved +
3117                 data_sinfo->bytes_pinned + data_sinfo->bytes_readonly +
3118                 data_sinfo->bytes_may_use;
3119
3120         if (used + bytes > data_sinfo->total_bytes) {
3121                 struct btrfs_trans_handle *trans;
3122
3123                 /*
3124                  * if we don't have enough free bytes in this space then we need
3125                  * to alloc a new chunk.
3126                  */
3127                 if (!data_sinfo->full && alloc_chunk) {
3128                         u64 alloc_target;
3129
3130                         data_sinfo->force_alloc = 1;
3131                         spin_unlock(&data_sinfo->lock);
3132 alloc:
3133                         alloc_target = btrfs_get_alloc_profile(root, 1);
3134                         trans = btrfs_join_transaction(root, 1);
3135                         if (IS_ERR(trans))
3136                                 return PTR_ERR(trans);
3137
3138                         ret = do_chunk_alloc(trans, root->fs_info->extent_root,
3139                                              bytes + 2 * 1024 * 1024,
3140                                              alloc_target, 0);
3141                         btrfs_end_transaction(trans, root);
3142                         if (ret < 0)
3143                                 return ret;
3144
3145                         if (!data_sinfo) {
3146                                 btrfs_set_inode_space_info(root, inode);
3147                                 data_sinfo = BTRFS_I(inode)->space_info;
3148                         }
3149                         goto again;
3150                 }
3151                 spin_unlock(&data_sinfo->lock);
3152
3153                 /* commit the current transaction and try again */
3154                 if (!committed && !root->fs_info->open_ioctl_trans) {
3155                         committed = 1;
3156                         trans = btrfs_join_transaction(root, 1);
3157                         if (IS_ERR(trans))
3158                                 return PTR_ERR(trans);
3159                         ret = btrfs_commit_transaction(trans, root);
3160                         if (ret)
3161                                 return ret;
3162                         goto again;
3163                 }
3164
3165 #if 0 /* I hope we never need this code again, just in case */
3166                 printk(KERN_ERR "no space left, need %llu, %llu bytes_used, "
3167                        "%llu bytes_reserved, " "%llu bytes_pinned, "
3168                        "%llu bytes_readonly, %llu may use %llu total\n",
3169                        (unsigned long long)bytes,
3170                        (unsigned long long)data_sinfo->bytes_used,
3171                        (unsigned long long)data_sinfo->bytes_reserved,
3172                        (unsigned long long)data_sinfo->bytes_pinned,
3173                        (unsigned long long)data_sinfo->bytes_readonly,
3174                        (unsigned long long)data_sinfo->bytes_may_use,
3175                        (unsigned long long)data_sinfo->total_bytes);
3176 #endif
3177                 return -ENOSPC;
3178         }
3179         data_sinfo->bytes_may_use += bytes;
3180         BTRFS_I(inode)->reserved_bytes += bytes;
3181         spin_unlock(&data_sinfo->lock);
3182
3183         return 0;
3184 }
3185
3186 /*
3187  * called when we are clearing an delalloc extent from the
3188  * inode's io_tree or there was an error for whatever reason
3189  * after calling btrfs_check_data_free_space
3190  */
3191 void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes)
3192 {
3193         struct btrfs_root *root = BTRFS_I(inode)->root;
3194         struct btrfs_space_info *data_sinfo;
3195
3196         /* make sure bytes are sectorsize aligned */
3197         bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3198
3199         data_sinfo = BTRFS_I(inode)->space_info;
3200         spin_lock(&data_sinfo->lock);
3201         data_sinfo->bytes_may_use -= bytes;
3202         BTRFS_I(inode)->reserved_bytes -= bytes;
3203         spin_unlock(&data_sinfo->lock);
3204 }
3205
3206 static void force_metadata_allocation(struct btrfs_fs_info *info)
3207 {
3208         struct list_head *head = &info->space_info;
3209         struct btrfs_space_info *found;
3210
3211         rcu_read_lock();
3212         list_for_each_entry_rcu(found, head, list) {
3213                 if (found->flags & BTRFS_BLOCK_GROUP_METADATA)
3214                         found->force_alloc = 1;
3215         }
3216         rcu_read_unlock();
3217 }
3218
3219 static int should_alloc_chunk(struct btrfs_space_info *sinfo,
3220                               u64 alloc_bytes)
3221 {
3222         u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly;
3223
3224         if (sinfo->bytes_used + sinfo->bytes_reserved +
3225             alloc_bytes + 256 * 1024 * 1024 < num_bytes)
3226                 return 0;
3227
3228         if (sinfo->bytes_used + sinfo->bytes_reserved +
3229             alloc_bytes < div_factor(num_bytes, 8))
3230                 return 0;
3231
3232         return 1;
3233 }
3234
3235 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
3236                           struct btrfs_root *extent_root, u64 alloc_bytes,
3237                           u64 flags, int force)
3238 {
3239         struct btrfs_space_info *space_info;
3240         struct btrfs_fs_info *fs_info = extent_root->fs_info;
3241         int ret = 0;
3242
3243         mutex_lock(&fs_info->chunk_mutex);
3244
3245         flags = btrfs_reduce_alloc_profile(extent_root, flags);
3246
3247         space_info = __find_space_info(extent_root->fs_info, flags);
3248         if (!space_info) {
3249                 ret = update_space_info(extent_root->fs_info, flags,
3250                                         0, 0, &space_info);
3251                 BUG_ON(ret);
3252         }
3253         BUG_ON(!space_info);
3254
3255         spin_lock(&space_info->lock);
3256         if (space_info->force_alloc)
3257                 force = 1;
3258         if (space_info->full) {
3259                 spin_unlock(&space_info->lock);
3260                 goto out;
3261         }
3262
3263         if (!force && !should_alloc_chunk(space_info, alloc_bytes)) {
3264                 spin_unlock(&space_info->lock);
3265                 goto out;
3266         }
3267         spin_unlock(&space_info->lock);
3268
3269         /*
3270          * If we have mixed data/metadata chunks we want to make sure we keep
3271          * allocating mixed chunks instead of individual chunks.
3272          */
3273         if (btrfs_mixed_space_info(space_info))
3274                 flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA);
3275
3276         /*
3277          * if we're doing a data chunk, go ahead and make sure that
3278          * we keep a reasonable number of metadata chunks allocated in the
3279          * FS as well.
3280          */
3281         if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) {
3282                 fs_info->data_chunk_allocations++;
3283                 if (!(fs_info->data_chunk_allocations %
3284                       fs_info->metadata_ratio))
3285                         force_metadata_allocation(fs_info);
3286         }
3287
3288         ret = btrfs_alloc_chunk(trans, extent_root, flags);
3289         spin_lock(&space_info->lock);
3290         if (ret)
3291                 space_info->full = 1;
3292         else
3293                 ret = 1;
3294         space_info->force_alloc = 0;
3295         spin_unlock(&space_info->lock);
3296 out:
3297         mutex_unlock(&extent_root->fs_info->chunk_mutex);
3298         return ret;
3299 }
3300
3301 static int maybe_allocate_chunk(struct btrfs_trans_handle *trans,
3302                                 struct btrfs_root *root,
3303                                 struct btrfs_space_info *sinfo, u64 num_bytes)
3304 {
3305         int ret;
3306         int end_trans = 0;
3307
3308         if (sinfo->full)
3309                 return 0;
3310
3311         spin_lock(&sinfo->lock);
3312         ret = should_alloc_chunk(sinfo, num_bytes + 2 * 1024 * 1024);
3313         spin_unlock(&sinfo->lock);
3314         if (!ret)
3315                 return 0;
3316
3317         if (!trans) {
3318                 trans = btrfs_join_transaction(root, 1);
3319                 BUG_ON(IS_ERR(trans));
3320                 end_trans = 1;
3321         }
3322
3323         ret = do_chunk_alloc(trans, root->fs_info->extent_root,
3324                              num_bytes + 2 * 1024 * 1024,
3325                              get_alloc_profile(root, sinfo->flags), 0);
3326
3327         if (end_trans)
3328                 btrfs_end_transaction(trans, root);
3329
3330         return ret == 1 ? 1 : 0;
3331 }
3332
3333 /*
3334  * shrink metadata reservation for delalloc
3335  */
3336 static int shrink_delalloc(struct btrfs_trans_handle *trans,
3337                            struct btrfs_root *root, u64 to_reclaim)
3338 {
3339         struct btrfs_block_rsv *block_rsv;
3340         u64 reserved;
3341         u64 max_reclaim;
3342         u64 reclaimed = 0;
3343         int pause = 1;
3344         int ret;
3345
3346         block_rsv = &root->fs_info->delalloc_block_rsv;
3347         spin_lock(&block_rsv->lock);
3348         reserved = block_rsv->reserved;
3349         spin_unlock(&block_rsv->lock);
3350
3351         if (reserved == 0)
3352                 return 0;
3353
3354         max_reclaim = min(reserved, to_reclaim);
3355
3356         while (1) {
3357                 ret = btrfs_start_one_delalloc_inode(root, trans ? 1 : 0);
3358                 if (!ret) {
3359                         __set_current_state(TASK_INTERRUPTIBLE);
3360                         schedule_timeout(pause);
3361                         pause <<= 1;
3362                         if (pause > HZ / 10)
3363                                 pause = HZ / 10;
3364                 } else {
3365                         pause = 1;
3366                 }
3367
3368                 spin_lock(&block_rsv->lock);
3369                 if (reserved > block_rsv->reserved)
3370                         reclaimed = reserved - block_rsv->reserved;
3371                 reserved = block_rsv->reserved;
3372                 spin_unlock(&block_rsv->lock);
3373
3374                 if (reserved == 0 || reclaimed >= max_reclaim)
3375                         break;
3376
3377                 if (trans && trans->transaction->blocked)
3378                         return -EAGAIN;
3379         }
3380         return reclaimed >= to_reclaim;
3381 }
3382
3383 static int should_retry_reserve(struct btrfs_trans_handle *trans,
3384                                 struct btrfs_root *root,
3385                                 struct btrfs_block_rsv *block_rsv,
3386                                 u64 num_bytes, int *retries)
3387 {
3388         struct btrfs_space_info *space_info = block_rsv->space_info;
3389         int ret;
3390
3391         if ((*retries) > 2)
3392                 return -ENOSPC;
3393
3394         ret = maybe_allocate_chunk(trans, root, space_info, num_bytes);
3395         if (ret)
3396                 return 1;
3397
3398         if (trans && trans->transaction->in_commit)
3399                 return -ENOSPC;
3400
3401         ret = shrink_delalloc(trans, root, num_bytes);
3402         if (ret)
3403                 return ret;
3404
3405         spin_lock(&space_info->lock);
3406         if (space_info->bytes_pinned < num_bytes)
3407                 ret = 1;
3408         spin_unlock(&space_info->lock);
3409         if (ret)
3410                 return -ENOSPC;
3411
3412         (*retries)++;
3413
3414         if (trans)
3415                 return -EAGAIN;
3416
3417         trans = btrfs_join_transaction(root, 1);
3418         BUG_ON(IS_ERR(trans));
3419         ret = btrfs_commit_transaction(trans, root);
3420         BUG_ON(ret);
3421
3422         return 1;
3423 }
3424
3425 static int reserve_metadata_bytes(struct btrfs_block_rsv *block_rsv,
3426                                   u64 num_bytes)
3427 {
3428         struct btrfs_space_info *space_info = block_rsv->space_info;
3429         u64 unused;
3430         int ret = -ENOSPC;
3431
3432         spin_lock(&space_info->lock);
3433         unused = space_info->bytes_used + space_info->bytes_reserved +
3434                  space_info->bytes_pinned + space_info->bytes_readonly;
3435
3436         if (unused < space_info->total_bytes)
3437                 unused = space_info->total_bytes - unused;
3438         else
3439                 unused = 0;
3440
3441         if (unused >= num_bytes) {
3442                 if (block_rsv->priority >= 10) {
3443                         space_info->bytes_reserved += num_bytes;
3444                         ret = 0;
3445                 } else {
3446                         if ((unused + block_rsv->reserved) *
3447                             block_rsv->priority >=
3448                             (num_bytes + block_rsv->reserved) * 10) {
3449                                 space_info->bytes_reserved += num_bytes;
3450                                 ret = 0;
3451                         }
3452                 }
3453         }
3454         spin_unlock(&space_info->lock);
3455
3456         return ret;
3457 }
3458
3459 static struct btrfs_block_rsv *get_block_rsv(struct btrfs_trans_handle *trans,
3460                                              struct btrfs_root *root)
3461 {
3462         struct btrfs_block_rsv *block_rsv;
3463         if (root->ref_cows)
3464                 block_rsv = trans->block_rsv;
3465         else
3466                 block_rsv = root->block_rsv;
3467
3468         if (!block_rsv)
3469                 block_rsv = &root->fs_info->empty_block_rsv;
3470
3471         return block_rsv;
3472 }
3473
3474 static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv,
3475                                u64 num_bytes)
3476 {
3477         int ret = -ENOSPC;
3478         spin_lock(&block_rsv->lock);
3479         if (block_rsv->reserved >= num_bytes) {
3480                 block_rsv->reserved -= num_bytes;
3481                 if (block_rsv->reserved < block_rsv->size)
3482                         block_rsv->full = 0;
3483                 ret = 0;
3484         }
3485         spin_unlock(&block_rsv->lock);
3486         return ret;
3487 }
3488
3489 static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv,
3490                                 u64 num_bytes, int update_size)
3491 {
3492         spin_lock(&block_rsv->lock);
3493         block_rsv->reserved += num_bytes;
3494         if (update_size)
3495                 block_rsv->size += num_bytes;
3496         else if (block_rsv->reserved >= block_rsv->size)
3497                 block_rsv->full = 1;
3498         spin_unlock(&block_rsv->lock);
3499 }
3500
3501 void block_rsv_release_bytes(struct btrfs_block_rsv *block_rsv,
3502                              struct btrfs_block_rsv *dest, u64 num_bytes)
3503 {
3504         struct btrfs_space_info *space_info = block_rsv->space_info;
3505
3506         spin_lock(&block_rsv->lock);
3507         if (num_bytes == (u64)-1)
3508                 num_bytes = block_rsv->size;
3509         block_rsv->size -= num_bytes;
3510         if (block_rsv->reserved >= block_rsv->size) {
3511                 num_bytes = block_rsv->reserved - block_rsv->size;
3512                 block_rsv->reserved = block_rsv->size;
3513                 block_rsv->full = 1;
3514         } else {
3515                 num_bytes = 0;
3516         }
3517         spin_unlock(&block_rsv->lock);
3518
3519         if (num_bytes > 0) {
3520                 if (dest) {
3521                         block_rsv_add_bytes(dest, num_bytes, 0);
3522                 } else {
3523                         spin_lock(&space_info->lock);
3524                         space_info->bytes_reserved -= num_bytes;
3525                         spin_unlock(&space_info->lock);
3526                 }
3527         }
3528 }
3529
3530 static int block_rsv_migrate_bytes(struct btrfs_block_rsv *src,
3531                                    struct btrfs_block_rsv *dst, u64 num_bytes)
3532 {
3533         int ret;
3534
3535         ret = block_rsv_use_bytes(src, num_bytes);
3536         if (ret)
3537                 return ret;
3538
3539         block_rsv_add_bytes(dst, num_bytes, 1);
3540         return 0;
3541 }
3542
3543 void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv)
3544 {
3545         memset(rsv, 0, sizeof(*rsv));
3546         spin_lock_init(&rsv->lock);
3547         atomic_set(&rsv->usage, 1);
3548         rsv->priority = 6;
3549         INIT_LIST_HEAD(&rsv->list);
3550 }
3551
3552 struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root)
3553 {
3554         struct btrfs_block_rsv *block_rsv;
3555         struct btrfs_fs_info *fs_info = root->fs_info;
3556         u64 alloc_target;
3557
3558         block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS);
3559         if (!block_rsv)
3560                 return NULL;
3561
3562         btrfs_init_block_rsv(block_rsv);
3563
3564         alloc_target = btrfs_get_alloc_profile(root, 0);
3565         block_rsv->space_info = __find_space_info(fs_info,
3566                                                   BTRFS_BLOCK_GROUP_METADATA);
3567
3568         return block_rsv;
3569 }
3570
3571 void btrfs_free_block_rsv(struct btrfs_root *root,
3572                           struct btrfs_block_rsv *rsv)
3573 {
3574         if (rsv && atomic_dec_and_test(&rsv->usage)) {
3575                 btrfs_block_rsv_release(root, rsv, (u64)-1);
3576                 if (!rsv->durable)
3577                         kfree(rsv);
3578         }
3579 }
3580
3581 /*
3582  * make the block_rsv struct be able to capture freed space.
3583  * the captured space will re-add to the the block_rsv struct
3584  * after transaction commit
3585  */
3586 void btrfs_add_durable_block_rsv(struct btrfs_fs_info *fs_info,
3587                                  struct btrfs_block_rsv *block_rsv)
3588 {
3589         block_rsv->durable = 1;
3590         mutex_lock(&fs_info->durable_block_rsv_mutex);
3591         list_add_tail(&block_rsv->list, &fs_info->durable_block_rsv_list);
3592         mutex_unlock(&fs_info->durable_block_rsv_mutex);
3593 }
3594
3595 int btrfs_block_rsv_add(struct btrfs_trans_handle *trans,
3596                         struct btrfs_root *root,
3597                         struct btrfs_block_rsv *block_rsv,
3598                         u64 num_bytes, int *retries)
3599 {
3600         int ret;
3601
3602         if (num_bytes == 0)
3603                 return 0;
3604 again:
3605         ret = reserve_metadata_bytes(block_rsv, num_bytes);
3606         if (!ret) {
3607                 block_rsv_add_bytes(block_rsv, num_bytes, 1);
3608                 return 0;
3609         }
3610
3611         ret = should_retry_reserve(trans, root, block_rsv, num_bytes, retries);
3612         if (ret > 0)
3613                 goto again;
3614
3615         return ret;
3616 }
3617
3618 int btrfs_block_rsv_check(struct btrfs_trans_handle *trans,
3619                           struct btrfs_root *root,
3620                           struct btrfs_block_rsv *block_rsv,
3621                           u64 min_reserved, int min_factor)
3622 {
3623         u64 num_bytes = 0;
3624         int commit_trans = 0;
3625         int ret = -ENOSPC;
3626
3627         if (!block_rsv)
3628                 return 0;
3629
3630         spin_lock(&block_rsv->lock);
3631         if (min_factor > 0)
3632                 num_bytes = div_factor(block_rsv->size, min_factor);
3633         if (min_reserved > num_bytes)
3634                 num_bytes = min_reserved;
3635
3636         if (block_rsv->reserved >= num_bytes) {
3637                 ret = 0;
3638         } else {
3639                 num_bytes -= block_rsv->reserved;
3640                 if (block_rsv->durable &&
3641                     block_rsv->freed[0] + block_rsv->freed[1] >= num_bytes)
3642                         commit_trans = 1;
3643         }
3644         spin_unlock(&block_rsv->lock);
3645         if (!ret)
3646                 return 0;
3647
3648         if (block_rsv->refill_used) {
3649                 ret = reserve_metadata_bytes(block_rsv, num_bytes);
3650                 if (!ret) {
3651                         block_rsv_add_bytes(block_rsv, num_bytes, 0);
3652                         return 0;
3653                 }
3654         }
3655
3656         if (commit_trans) {
3657                 if (trans)
3658                         return -EAGAIN;
3659
3660                 trans = btrfs_join_transaction(root, 1);
3661                 BUG_ON(IS_ERR(trans));
3662                 ret = btrfs_commit_transaction(trans, root);
3663                 return 0;
3664         }
3665
3666         WARN_ON(1);
3667         printk(KERN_INFO"block_rsv size %llu reserved %llu freed %llu %llu\n",
3668                 block_rsv->size, block_rsv->reserved,
3669                 block_rsv->freed[0], block_rsv->freed[1]);
3670
3671         return -ENOSPC;
3672 }
3673
3674 int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv,
3675                             struct btrfs_block_rsv *dst_rsv,
3676                             u64 num_bytes)
3677 {
3678         return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3679 }
3680
3681 void btrfs_block_rsv_release(struct btrfs_root *root,
3682                              struct btrfs_block_rsv *block_rsv,
3683                              u64 num_bytes)
3684 {
3685         struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
3686         if (global_rsv->full || global_rsv == block_rsv ||
3687             block_rsv->space_info != global_rsv->space_info)
3688                 global_rsv = NULL;
3689         block_rsv_release_bytes(block_rsv, global_rsv, num_bytes);
3690 }
3691
3692 /*
3693  * helper to calculate size of global block reservation.
3694  * the desired value is sum of space used by extent tree,
3695  * checksum tree and root tree
3696  */
3697 static u64 calc_global_metadata_size(struct btrfs_fs_info *fs_info)
3698 {
3699         struct btrfs_space_info *sinfo;
3700         u64 num_bytes;
3701         u64 meta_used;
3702         u64 data_used;
3703         int csum_size = btrfs_super_csum_size(&fs_info->super_copy);
3704 #if 0
3705         /*
3706          * per tree used space accounting can be inaccuracy, so we
3707          * can't rely on it.
3708          */
3709         spin_lock(&fs_info->extent_root->accounting_lock);
3710         num_bytes = btrfs_root_used(&fs_info->extent_root->root_item);
3711         spin_unlock(&fs_info->extent_root->accounting_lock);
3712
3713         spin_lock(&fs_info->csum_root->accounting_lock);
3714         num_bytes += btrfs_root_used(&fs_info->csum_root->root_item);
3715         spin_unlock(&fs_info->csum_root->accounting_lock);
3716
3717         spin_lock(&fs_info->tree_root->accounting_lock);
3718         num_bytes += btrfs_root_used(&fs_info->tree_root->root_item);
3719         spin_unlock(&fs_info->tree_root->accounting_lock);
3720 #endif
3721         sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_DATA);
3722         spin_lock(&sinfo->lock);
3723         data_used = sinfo->bytes_used;
3724         spin_unlock(&sinfo->lock);
3725
3726         sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
3727         spin_lock(&sinfo->lock);
3728         meta_used = sinfo->bytes_used;
3729         spin_unlock(&sinfo->lock);
3730
3731         num_bytes = (data_used >> fs_info->sb->s_blocksize_bits) *
3732                     csum_size * 2;
3733         num_bytes += div64_u64(data_used + meta_used, 50);
3734
3735         if (num_bytes * 3 > meta_used)
3736                 num_bytes = div64_u64(meta_used, 3);
3737
3738         return ALIGN(num_bytes, fs_info->extent_root->leafsize << 10);
3739 }
3740
3741 static void update_global_block_rsv(struct btrfs_fs_info *fs_info)
3742 {
3743         struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv;
3744         struct btrfs_space_info *sinfo = block_rsv->space_info;
3745         u64 num_bytes;
3746
3747         num_bytes = calc_global_metadata_size(fs_info);
3748
3749         spin_lock(&block_rsv->lock);
3750         spin_lock(&sinfo->lock);
3751
3752         block_rsv->size = num_bytes;
3753
3754         num_bytes = sinfo->bytes_used + sinfo->bytes_pinned +
3755                     sinfo->bytes_reserved + sinfo->bytes_readonly;
3756
3757         if (sinfo->total_bytes > num_bytes) {
3758                 num_bytes = sinfo->total_bytes - num_bytes;
3759                 block_rsv->reserved += num_bytes;
3760                 sinfo->bytes_reserved += num_bytes;
3761         }
3762
3763         if (block_rsv->reserved >= block_rsv->size) {
3764                 num_bytes = block_rsv->reserved - block_rsv->size;
3765                 sinfo->bytes_reserved -= num_bytes;
3766                 block_rsv->reserved = block_rsv->size;
3767                 block_rsv->full = 1;
3768         }
3769 #if 0
3770         printk(KERN_INFO"global block rsv size %llu reserved %llu\n",
3771                 block_rsv->size, block_rsv->reserved);
3772 #endif
3773         spin_unlock(&sinfo->lock);
3774         spin_unlock(&block_rsv->lock);
3775 }
3776
3777 static void init_global_block_rsv(struct btrfs_fs_info *fs_info)
3778 {
3779         struct btrfs_space_info *space_info;
3780
3781         space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM);
3782         fs_info->chunk_block_rsv.space_info = space_info;
3783         fs_info->chunk_block_rsv.priority = 10;
3784
3785         space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
3786         fs_info->global_block_rsv.space_info = space_info;
3787         fs_info->global_block_rsv.priority = 10;
3788         fs_info->global_block_rsv.refill_used = 1;
3789         fs_info->delalloc_block_rsv.space_info = space_info;
3790         fs_info->trans_block_rsv.space_info = space_info;
3791         fs_info->empty_block_rsv.space_info = space_info;
3792         fs_info->empty_block_rsv.priority = 10;
3793
3794         fs_info->extent_root->block_rsv = &fs_info->global_block_rsv;
3795         fs_info->csum_root->block_rsv = &fs_info->global_block_rsv;
3796         fs_info->dev_root->block_rsv = &fs_info->global_block_rsv;
3797         fs_info->tree_root->block_rsv = &fs_info->global_block_rsv;
3798         fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv;
3799
3800         btrfs_add_durable_block_rsv(fs_info, &fs_info->global_block_rsv);
3801
3802         btrfs_add_durable_block_rsv(fs_info, &fs_info->delalloc_block_rsv);
3803
3804         update_global_block_rsv(fs_info);
3805 }
3806
3807 static void release_global_block_rsv(struct btrfs_fs_info *fs_info)
3808 {
3809         block_rsv_release_bytes(&fs_info->global_block_rsv, NULL, (u64)-1);
3810         WARN_ON(fs_info->delalloc_block_rsv.size > 0);
3811         WARN_ON(fs_info->delalloc_block_rsv.reserved > 0);
3812         WARN_ON(fs_info->trans_block_rsv.size > 0);
3813         WARN_ON(fs_info->trans_block_rsv.reserved > 0);
3814         WARN_ON(fs_info->chunk_block_rsv.size > 0);
3815         WARN_ON(fs_info->chunk_block_rsv.reserved > 0);
3816 }
3817
3818 static u64 calc_trans_metadata_size(struct btrfs_root *root, int num_items)
3819 {
3820         return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) *
3821                 3 * num_items;
3822 }
3823
3824 int btrfs_trans_reserve_metadata(struct btrfs_trans_handle *trans,
3825                                  struct btrfs_root *root,
3826                                  int num_items, int *retries)
3827 {
3828         u64 num_bytes;
3829         int ret;
3830
3831         if (num_items == 0 || root->fs_info->chunk_root == root)
3832                 return 0;
3833
3834         num_bytes = calc_trans_metadata_size(root, num_items);
3835         ret = btrfs_block_rsv_add(trans, root, &root->fs_info->trans_block_rsv,
3836                                   num_bytes, retries);
3837         if (!ret) {
3838                 trans->bytes_reserved += num_bytes;
3839                 trans->block_rsv = &root->fs_info->trans_block_rsv;
3840         }
3841         return ret;
3842 }
3843
3844 void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans,
3845                                   struct btrfs_root *root)
3846 {
3847         if (!trans->bytes_reserved)
3848                 return;
3849
3850         BUG_ON(trans->block_rsv != &root->fs_info->trans_block_rsv);
3851         btrfs_block_rsv_release(root, trans->block_rsv,
3852                                 trans->bytes_reserved);
3853         trans->bytes_reserved = 0;
3854 }
3855
3856 int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans,
3857                                   struct inode *inode)
3858 {
3859         struct btrfs_root *root = BTRFS_I(inode)->root;
3860         struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
3861         struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv;
3862
3863         /*
3864          * one for deleting orphan item, one for updating inode and
3865          * two for calling btrfs_truncate_inode_items.
3866          *
3867          * btrfs_truncate_inode_items is a delete operation, it frees
3868          * more space than it uses in most cases. So two units of
3869          * metadata space should be enough for calling it many times.
3870          * If all of the metadata space is used, we can commit
3871          * transaction and use space it freed.
3872          */
3873         u64 num_bytes = calc_trans_metadata_size(root, 4);
3874         return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3875 }
3876
3877 void btrfs_orphan_release_metadata(struct inode *inode)
3878 {
3879         struct btrfs_root *root = BTRFS_I(inode)->root;
3880         u64 num_bytes = calc_trans_metadata_size(root, 4);
3881         btrfs_block_rsv_release(root, root->orphan_block_rsv, num_bytes);
3882 }
3883
3884 int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans,
3885                                 struct btrfs_pending_snapshot *pending)
3886 {
3887         struct btrfs_root *root = pending->root;
3888         struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
3889         struct btrfs_block_rsv *dst_rsv = &pending->block_rsv;
3890         /*
3891          * two for root back/forward refs, two for directory entries
3892          * and one for root of the snapshot.
3893          */
3894         u64 num_bytes = calc_trans_metadata_size(root, 5);
3895         dst_rsv->space_info = src_rsv->space_info;
3896         return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3897 }
3898
3899 static u64 calc_csum_metadata_size(struct inode *inode, u64 num_bytes)
3900 {
3901         return num_bytes >>= 3;
3902 }
3903
3904 int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes)
3905 {
3906         struct btrfs_root *root = BTRFS_I(inode)->root;
3907         struct btrfs_block_rsv *block_rsv = &root->fs_info->delalloc_block_rsv;
3908         u64 to_reserve;
3909         int nr_extents;
3910         int retries = 0;
3911         int ret;
3912
3913         if (btrfs_transaction_in_commit(root->fs_info))
3914                 schedule_timeout(1);
3915
3916         num_bytes = ALIGN(num_bytes, root->sectorsize);
3917 again:
3918         spin_lock(&BTRFS_I(inode)->accounting_lock);
3919         nr_extents = atomic_read(&BTRFS_I(inode)->outstanding_extents) + 1;
3920         if (nr_extents > BTRFS_I(inode)->reserved_extents) {
3921                 nr_extents -= BTRFS_I(inode)->reserved_extents;
3922                 to_reserve = calc_trans_metadata_size(root, nr_extents);
3923         } else {
3924                 nr_extents = 0;
3925                 to_reserve = 0;
3926         }
3927
3928         to_reserve += calc_csum_metadata_size(inode, num_bytes);
3929         ret = reserve_metadata_bytes(block_rsv, to_reserve);
3930         if (ret) {
3931                 spin_unlock(&BTRFS_I(inode)->accounting_lock);
3932                 ret = should_retry_reserve(NULL, root, block_rsv, to_reserve,
3933                                            &retries);
3934                 if (ret > 0)
3935                         goto again;
3936                 return ret;
3937         }
3938
3939         BTRFS_I(inode)->reserved_extents += nr_extents;
3940         atomic_inc(&BTRFS_I(inode)->outstanding_extents);
3941         spin_unlock(&BTRFS_I(inode)->accounting_lock);
3942
3943         block_rsv_add_bytes(block_rsv, to_reserve, 1);
3944
3945         if (block_rsv->size > 512 * 1024 * 1024)
3946                 shrink_delalloc(NULL, root, to_reserve);
3947
3948         return 0;
3949 }
3950
3951 void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes)
3952 {
3953         struct btrfs_root *root = BTRFS_I(inode)->root;
3954         u64 to_free;
3955         int nr_extents;
3956
3957         num_bytes = ALIGN(num_bytes, root->sectorsize);
3958         atomic_dec(&BTRFS_I(inode)->outstanding_extents);
3959
3960         spin_lock(&BTRFS_I(inode)->accounting_lock);
3961         nr_extents = atomic_read(&BTRFS_I(inode)->outstanding_extents);
3962         if (nr_extents < BTRFS_I(inode)->reserved_extents) {
3963                 nr_extents = BTRFS_I(inode)->reserved_extents - nr_extents;
3964                 BTRFS_I(inode)->reserved_extents -= nr_extents;
3965         } else {
3966                 nr_extents = 0;
3967         }
3968         spin_unlock(&BTRFS_I(inode)->accounting_lock);
3969
3970         to_free = calc_csum_metadata_size(inode, num_bytes);
3971         if (nr_extents > 0)
3972                 to_free += calc_trans_metadata_size(root, nr_extents);
3973
3974         btrfs_block_rsv_release(root, &root->fs_info->delalloc_block_rsv,
3975                                 to_free);
3976 }
3977
3978 int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes)
3979 {
3980         int ret;
3981
3982         ret = btrfs_check_data_free_space(inode, num_bytes);
3983         if (ret)
3984                 return ret;
3985
3986         ret = btrfs_delalloc_reserve_metadata(inode, num_bytes);
3987         if (ret) {
3988                 btrfs_free_reserved_data_space(inode, num_bytes);
3989                 return ret;
3990         }
3991
3992         return 0;
3993 }
3994
3995 void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes)
3996 {
3997         btrfs_delalloc_release_metadata(inode, num_bytes);
3998         btrfs_free_reserved_data_space(inode, num_bytes);
3999 }
4000
4001 static int update_block_group(struct btrfs_trans_handle *trans,
4002                               struct btrfs_root *root,
4003                               u64 bytenr, u64 num_bytes, int alloc)
4004 {
4005         struct btrfs_block_group_cache *cache = NULL;
4006         struct btrfs_fs_info *info = root->fs_info;
4007         u64 total = num_bytes;
4008         u64 old_val;
4009         u64 byte_in_group;
4010         int factor;
4011
4012         /* block accounting for super block */
4013         spin_lock(&info->delalloc_lock);
4014         old_val = btrfs_super_bytes_used(&info->super_copy);
4015         if (alloc)
4016                 old_val += num_bytes;
4017         else
4018                 old_val -= num_bytes;
4019         btrfs_set_super_bytes_used(&info->super_copy, old_val);
4020         spin_unlock(&info->delalloc_lock);
4021
4022         while (total) {
4023                 cache = btrfs_lookup_block_group(info, bytenr);
4024                 if (!cache)
4025                         return -1;
4026                 if (cache->flags & (BTRFS_BLOCK_GROUP_DUP |
4027                                     BTRFS_BLOCK_GROUP_RAID1 |
4028                                     BTRFS_BLOCK_GROUP_RAID10))
4029                         factor = 2;
4030                 else
4031                         factor = 1;
4032                 /*
4033                  * If this block group has free space cache written out, we
4034                  * need to make sure to load it if we are removing space.  This
4035                  * is because we need the unpinning stage to actually add the
4036                  * space back to the block group, otherwise we will leak space.
4037                  */
4038                 if (!alloc && cache->cached == BTRFS_CACHE_NO)
4039                         cache_block_group(cache, trans, 1);
4040
4041                 byte_in_group = bytenr - cache->key.objectid;
4042                 WARN_ON(byte_in_group > cache->key.offset);
4043
4044                 spin_lock(&cache->space_info->lock);
4045                 spin_lock(&cache->lock);
4046
4047                 if (btrfs_super_cache_generation(&info->super_copy) != 0 &&
4048                     cache->disk_cache_state < BTRFS_DC_CLEAR)
4049                         cache->disk_cache_state = BTRFS_DC_CLEAR;
4050
4051                 cache->dirty = 1;
4052                 old_val = btrfs_block_group_used(&cache->item);
4053                 num_bytes = min(total, cache->key.offset - byte_in_group);
4054                 if (alloc) {
4055                         old_val += num_bytes;
4056                         btrfs_set_block_group_used(&cache->item, old_val);
4057                         cache->reserved -= num_bytes;
4058                         cache->space_info->bytes_reserved -= num_bytes;
4059                         cache->space_info->bytes_used += num_bytes;
4060                         cache->space_info->disk_used += num_bytes * factor;
4061                         spin_unlock(&cache->lock);
4062                         spin_unlock(&cache->space_info->lock);
4063                 } else {
4064                         old_val -= num_bytes;
4065                         btrfs_set_block_group_used(&cache->item, old_val);
4066                         cache->pinned += num_bytes;
4067                         cache->space_info->bytes_pinned += num_bytes;
4068                         cache->space_info->bytes_used -= num_bytes;
4069                         cache->space_info->disk_used -= num_bytes * factor;
4070                         spin_unlock(&cache->lock);
4071                         spin_unlock(&cache->space_info->lock);
4072
4073                         set_extent_dirty(info->pinned_extents,
4074                                          bytenr, bytenr + num_bytes - 1,
4075                                          GFP_NOFS | __GFP_NOFAIL);
4076                 }
4077                 btrfs_put_block_group(cache);
4078                 total -= num_bytes;
4079                 bytenr += num_bytes;
4080         }
4081         return 0;
4082 }
4083
4084 static u64 first_logical_byte(struct btrfs_root *root, u64 search_start)
4085 {
4086         struct btrfs_block_group_cache *cache;
4087         u64 bytenr;
4088
4089         cache = btrfs_lookup_first_block_group(root->fs_info, search_start);
4090         if (!cache)
4091                 return 0;
4092
4093         bytenr = cache->key.objectid;
4094         btrfs_put_block_group(cache);
4095
4096         return bytenr;
4097 }
4098
4099 static int pin_down_extent(struct btrfs_root *root,
4100                            struct btrfs_block_group_cache *cache,
4101                            u64 bytenr, u64 num_bytes, int reserved)
4102 {
4103         spin_lock(&cache->space_info->lock);
4104         spin_lock(&cache->lock);
4105         cache->pinned += num_bytes;
4106         cache->space_info->bytes_pinned += num_bytes;
4107         if (reserved) {
4108                 cache->reserved -= num_bytes;
4109                 cache->space_info->bytes_reserved -= num_bytes;
4110         }
4111         spin_unlock(&cache->lock);
4112         spin_unlock(&cache->space_info->lock);
4113
4114         set_extent_dirty(root->fs_info->pinned_extents, bytenr,
4115                          bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL);
4116         return 0;
4117 }
4118
4119 /*
4120  * this function must be called within transaction
4121  */
4122 int btrfs_pin_extent(struct btrfs_root *root,
4123                      u64 bytenr, u64 num_bytes, int reserved)
4124 {
4125         struct btrfs_block_group_cache *cache;
4126
4127         cache = btrfs_lookup_block_group(root->fs_info, bytenr);
4128         BUG_ON(!cache);
4129
4130         pin_down_extent(root, cache, bytenr, num_bytes, reserved);
4131
4132         btrfs_put_block_group(cache);
4133         return 0;
4134 }
4135
4136 /*
4137  * update size of reserved extents. this function may return -EAGAIN
4138  * if 'reserve' is true or 'sinfo' is false.
4139  */
4140 static int update_reserved_bytes(struct btrfs_block_group_cache *cache,
4141                                  u64 num_bytes, int reserve, int sinfo)
4142 {
4143         int ret = 0;
4144         if (sinfo) {
4145                 struct btrfs_space_info *space_info = cache->space_info;
4146                 spin_lock(&space_info->lock);
4147                 spin_lock(&cache->lock);
4148                 if (reserve) {
4149                         if (cache->ro) {
4150                                 ret = -EAGAIN;
4151                         } else {
4152                                 cache->reserved += num_bytes;
4153                                 space_info->bytes_reserved += num_bytes;
4154                         }
4155                 } else {
4156                         if (cache->ro)
4157                                 space_info->bytes_readonly += num_bytes;
4158                         cache->reserved -= num_bytes;
4159                         space_info->bytes_reserved -= num_bytes;
4160                 }
4161                 spin_unlock(&cache->lock);
4162                 spin_unlock(&space_info->lock);
4163         } else {
4164                 spin_lock(&cache->lock);
4165                 if (cache->ro) {
4166                         ret = -EAGAIN;
4167                 } else {
4168                         if (reserve)
4169                                 cache->reserved += num_bytes;
4170                         else
4171                                 cache->reserved -= num_bytes;
4172                 }
4173                 spin_unlock(&cache->lock);
4174         }
4175         return ret;
4176 }
4177
4178 int btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans,
4179                                 struct btrfs_root *root)
4180 {
4181         struct btrfs_fs_info *fs_info = root->fs_info;
4182         struct btrfs_caching_control *next;
4183         struct btrfs_caching_control *caching_ctl;
4184         struct btrfs_block_group_cache *cache;
4185
4186         down_write(&fs_info->extent_commit_sem);
4187
4188         list_for_each_entry_safe(caching_ctl, next,
4189                                  &fs_info->caching_block_groups, list) {
4190                 cache = caching_ctl->block_group;
4191                 if (block_group_cache_done(cache)) {
4192                         cache->last_byte_to_unpin = (u64)-1;
4193                         list_del_init(&caching_ctl->list);
4194                         put_caching_control(caching_ctl);
4195                 } else {
4196                         cache->last_byte_to_unpin = caching_ctl->progress;
4197                 }
4198         }
4199
4200         if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4201                 fs_info->pinned_extents = &fs_info->freed_extents[1];
4202         else
4203                 fs_info->pinned_extents = &fs_info->freed_extents[0];
4204
4205         up_write(&fs_info->extent_commit_sem);
4206
4207         update_global_block_rsv(fs_info);
4208         return 0;
4209 }
4210
4211 static int unpin_extent_range(struct btrfs_root *root, u64 start, u64 end)
4212 {
4213         struct btrfs_fs_info *fs_info = root->fs_info;
4214         struct btrfs_block_group_cache *cache = NULL;
4215         u64 len;
4216
4217         while (start <= end) {
4218                 if (!cache ||
4219                     start >= cache->key.objectid + cache->key.offset) {
4220                         if (cache)
4221                                 btrfs_put_block_group(cache);
4222                         cache = btrfs_lookup_block_group(fs_info, start);
4223                         BUG_ON(!cache);
4224                 }
4225
4226                 len = cache->key.objectid + cache->key.offset - start;
4227                 len = min(len, end + 1 - start);
4228
4229                 if (start < cache->last_byte_to_unpin) {
4230                         len = min(len, cache->last_byte_to_unpin - start);
4231                         btrfs_add_free_space(cache, start, len);
4232                 }
4233
4234                 start += len;
4235
4236                 spin_lock(&cache->space_info->lock);
4237                 spin_lock(&cache->lock);
4238                 cache->pinned -= len;
4239                 cache->space_info->bytes_pinned -= len;
4240                 if (cache->ro) {
4241                         cache->space_info->bytes_readonly += len;
4242                 } else if (cache->reserved_pinned > 0) {
4243                         len = min(len, cache->reserved_pinned);
4244                         cache->reserved_pinned -= len;
4245                         cache->space_info->bytes_reserved += len;
4246                 }
4247                 spin_unlock(&cache->lock);
4248                 spin_unlock(&cache->space_info->lock);
4249         }
4250
4251         if (cache)
4252                 btrfs_put_block_group(cache);
4253         return 0;
4254 }
4255
4256 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans,
4257                                struct btrfs_root *root)
4258 {
4259         struct btrfs_fs_info *fs_info = root->fs_info;
4260         struct extent_io_tree *unpin;
4261         struct btrfs_block_rsv *block_rsv;
4262         struct btrfs_block_rsv *next_rsv;
4263         u64 start;
4264         u64 end;
4265         int idx;
4266         int ret;
4267
4268         if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4269                 unpin = &fs_info->freed_extents[1];
4270         else
4271                 unpin = &fs_info->freed_extents[0];
4272
4273         while (1) {
4274                 ret = find_first_extent_bit(unpin, 0, &start, &end,
4275                                             EXTENT_DIRTY);
4276                 if (ret)
4277                         break;
4278
4279                 ret = btrfs_discard_extent(root, start, end + 1 - start);
4280
4281                 clear_extent_dirty(unpin, start, end, GFP_NOFS);
4282                 unpin_extent_range(root, start, end);
4283                 cond_resched();
4284         }
4285
4286         mutex_lock(&fs_info->durable_block_rsv_mutex);
4287         list_for_each_entry_safe(block_rsv, next_rsv,
4288                                  &fs_info->durable_block_rsv_list, list) {
4289
4290                 idx = trans->transid & 0x1;
4291                 if (block_rsv->freed[idx] > 0) {
4292                         block_rsv_add_bytes(block_rsv,
4293                                             block_rsv->freed[idx], 0);
4294                         block_rsv->freed[idx] = 0;
4295                 }
4296                 if (atomic_read(&block_rsv->usage) == 0) {
4297                         btrfs_block_rsv_release(root, block_rsv, (u64)-1);
4298
4299                         if (block_rsv->freed[0] == 0 &&
4300                             block_rsv->freed[1] == 0) {
4301                                 list_del_init(&block_rsv->list);
4302                                 kfree(block_rsv);
4303                         }
4304                 } else {
4305                         btrfs_block_rsv_release(root, block_rsv, 0);
4306                 }
4307         }
4308         mutex_unlock(&fs_info->durable_block_rsv_mutex);
4309
4310         return 0;
4311 }
4312
4313 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
4314                                 struct btrfs_root *root,
4315                                 u64 bytenr, u64 num_bytes, u64 parent,
4316                                 u64 root_objectid, u64 owner_objectid,
4317                                 u64 owner_offset, int refs_to_drop,
4318                                 struct btrfs_delayed_extent_op *extent_op)
4319 {
4320         struct btrfs_key key;
4321         struct btrfs_path *path;
4322         struct btrfs_fs_info *info = root->fs_info;
4323         struct btrfs_root *extent_root = info->extent_root;
4324         struct extent_buffer *leaf;
4325         struct btrfs_extent_item *ei;
4326         struct btrfs_extent_inline_ref *iref;
4327         int ret;
4328         int is_data;
4329         int extent_slot = 0;
4330         int found_extent = 0;
4331         int num_to_del = 1;
4332         u32 item_size;
4333         u64 refs;
4334
4335         path = btrfs_alloc_path();
4336         if (!path)
4337                 return -ENOMEM;
4338
4339         path->reada = 1;
4340         path->leave_spinning = 1;
4341
4342         is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID;
4343         BUG_ON(!is_data && refs_to_drop != 1);
4344
4345         ret = lookup_extent_backref(trans, extent_root, path, &iref,
4346                                     bytenr, num_bytes, parent,
4347                                     root_objectid, owner_objectid,
4348                                     owner_offset);
4349         if (ret == 0) {
4350                 extent_slot = path->slots[0];
4351                 while (extent_slot >= 0) {
4352                         btrfs_item_key_to_cpu(path->nodes[0], &key,
4353                                               extent_slot);
4354                         if (key.objectid != bytenr)
4355                                 break;
4356                         if (key.type == BTRFS_EXTENT_ITEM_KEY &&
4357                             key.offset == num_bytes) {
4358                                 found_extent = 1;
4359                                 break;
4360                         }
4361                         if (path->slots[0] - extent_slot > 5)
4362                                 break;
4363                         extent_slot--;
4364                 }
4365 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4366                 item_size = btrfs_item_size_nr(path->nodes[0], extent_slot);
4367                 if (found_extent && item_size < sizeof(*ei))
4368                         found_extent = 0;
4369 #endif
4370                 if (!found_extent) {
4371                         BUG_ON(iref);
4372                         ret = remove_extent_backref(trans, extent_root, path,
4373                                                     NULL, refs_to_drop,
4374                                                     is_data);
4375                         BUG_ON(ret);
4376                         btrfs_release_path(extent_root, path);
4377                         path->leave_spinning = 1;
4378
4379                         key.objectid = bytenr;
4380                         key.type = BTRFS_EXTENT_ITEM_KEY;
4381                         key.offset = num_bytes;
4382
4383                         ret = btrfs_search_slot(trans, extent_root,
4384                                                 &key, path, -1, 1);
4385                         if (ret) {
4386                                 printk(KERN_ERR "umm, got %d back from search"
4387                                        ", was looking for %llu\n", ret,
4388                                        (unsigned long long)bytenr);
4389                                 btrfs_print_leaf(extent_root, path->nodes[0]);
4390                         }
4391                         BUG_ON(ret);
4392                         extent_slot = path->slots[0];
4393                 }
4394         } else {
4395                 btrfs_print_leaf(extent_root, path->nodes[0]);
4396                 WARN_ON(1);
4397                 printk(KERN_ERR "btrfs unable to find ref byte nr %llu "
4398                        "parent %llu root %llu  owner %llu offset %llu\n",
4399                        (unsigned long long)bytenr,
4400                        (unsigned long long)parent,
4401                        (unsigned long long)root_objectid,
4402                        (unsigned long long)owner_objectid,
4403                        (unsigned long long)owner_offset);
4404         }
4405
4406         leaf = path->nodes[0];
4407         item_size = btrfs_item_size_nr(leaf, extent_slot);
4408 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4409         if (item_size < sizeof(*ei)) {
4410                 BUG_ON(found_extent || extent_slot != path->slots[0]);
4411                 ret = convert_extent_item_v0(trans, extent_root, path,
4412                                              owner_objectid, 0);
4413                 BUG_ON(ret < 0);
4414
4415                 btrfs_release_path(extent_root, path);
4416                 path->leave_spinning = 1;
4417
4418                 key.objectid = bytenr;
4419                 key.type = BTRFS_EXTENT_ITEM_KEY;
4420                 key.offset = num_bytes;
4421
4422                 ret = btrfs_search_slot(trans, extent_root, &key, path,
4423                                         -1, 1);
4424                 if (ret) {
4425                         printk(KERN_ERR "umm, got %d back from search"
4426                                ", was looking for %llu\n", ret,
4427                                (unsigned long long)bytenr);
4428                         btrfs_print_leaf(extent_root, path->nodes[0]);
4429                 }
4430                 BUG_ON(ret);
4431                 extent_slot = path->slots[0];
4432                 leaf = path->nodes[0];
4433                 item_size = btrfs_item_size_nr(leaf, extent_slot);
4434         }
4435 #endif
4436         BUG_ON(item_size < sizeof(*ei));
4437         ei = btrfs_item_ptr(leaf, extent_slot,
4438                             struct btrfs_extent_item);
4439         if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID) {
4440                 struct btrfs_tree_block_info *bi;
4441                 BUG_ON(item_size < sizeof(*ei) + sizeof(*bi));
4442                 bi = (struct btrfs_tree_block_info *)(ei + 1);
4443                 WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi));
4444         }
4445
4446         refs = btrfs_extent_refs(leaf, ei);
4447         BUG_ON(refs < refs_to_drop);
4448         refs -= refs_to_drop;
4449
4450         if (refs > 0) {
4451                 if (extent_op)
4452                         __run_delayed_extent_op(extent_op, leaf, ei);
4453                 /*
4454                  * In the case of inline back ref, reference count will
4455                  * be updated by remove_extent_backref
4456                  */
4457                 if (iref) {
4458                         BUG_ON(!found_extent);
4459                 } else {
4460                         btrfs_set_extent_refs(leaf, ei, refs);
4461                         btrfs_mark_buffer_dirty(leaf);
4462                 }
4463                 if (found_extent) {
4464                         ret = remove_extent_backref(trans, extent_root, path,
4465                                                     iref, refs_to_drop,
4466                                                     is_data);
4467                         BUG_ON(ret);
4468                 }
4469         } else {
4470                 if (found_extent) {
4471                         BUG_ON(is_data && refs_to_drop !=
4472                                extent_data_ref_count(root, path, iref));
4473                         if (iref) {
4474                                 BUG_ON(path->slots[0] != extent_slot);
4475                         } else {
4476                                 BUG_ON(path->slots[0] != extent_slot + 1);
4477                                 path->slots[0] = extent_slot;
4478                                 num_to_del = 2;
4479                         }
4480                 }
4481
4482                 ret = btrfs_del_items(trans, extent_root, path, path->slots[0],
4483                                       num_to_del);
4484                 BUG_ON(ret);
4485                 btrfs_release_path(extent_root, path);
4486
4487                 if (is_data) {
4488                         ret = btrfs_del_csums(trans, root, bytenr, num_bytes);
4489                         BUG_ON(ret);
4490                 } else {
4491                         invalidate_mapping_pages(info->btree_inode->i_mapping,
4492                              bytenr >> PAGE_CACHE_SHIFT,
4493                              (bytenr + num_bytes - 1) >> PAGE_CACHE_SHIFT);
4494                 }
4495
4496                 ret = update_block_group(trans, root, bytenr, num_bytes, 0);
4497                 BUG_ON(ret);
4498         }
4499         btrfs_free_path(path);
4500         return ret;
4501 }
4502
4503 /*
4504  * when we free an block, it is possible (and likely) that we free the last
4505  * delayed ref for that extent as well.  This searches the delayed ref tree for
4506  * a given extent, and if there are no other delayed refs to be processed, it
4507  * removes it from the tree.
4508  */
4509 static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans,
4510                                       struct btrfs_root *root, u64 bytenr)
4511 {
4512         struct btrfs_delayed_ref_head *head;
4513         struct btrfs_delayed_ref_root *delayed_refs;
4514         struct btrfs_delayed_ref_node *ref;
4515         struct rb_node *node;
4516         int ret = 0;
4517
4518         delayed_refs = &trans->transaction->delayed_refs;
4519         spin_lock(&delayed_refs->lock);
4520         head = btrfs_find_delayed_ref_head(trans, bytenr);
4521         if (!head)
4522                 goto out;
4523
4524         node = rb_prev(&head->node.rb_node);
4525         if (!node)
4526                 goto out;
4527
4528         ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
4529
4530         /* there are still entries for this ref, we can't drop it */
4531         if (ref->bytenr == bytenr)
4532                 goto out;
4533
4534         if (head->extent_op) {
4535                 if (!head->must_insert_reserved)
4536                         goto out;
4537                 kfree(head->extent_op);
4538                 head->extent_op = NULL;
4539         }
4540
4541         /*
4542          * waiting for the lock here would deadlock.  If someone else has it
4543          * locked they are already in the process of dropping it anyway
4544          */
4545         if (!mutex_trylock(&head->mutex))
4546                 goto out;
4547
4548         /*
4549          * at this point we have a head with no other entries.  Go
4550          * ahead and process it.
4551          */
4552         head->node.in_tree = 0;
4553         rb_erase(&head->node.rb_node, &delayed_refs->root);
4554
4555         delayed_refs->num_entries--;
4556
4557         /*
4558          * we don't take a ref on the node because we're removing it from the
4559          * tree, so we just steal the ref the tree was holding.
4560          */
4561         delayed_refs->num_heads--;
4562         if (list_empty(&head->cluster))
4563                 delayed_refs->num_heads_ready--;
4564
4565         list_del_init(&head->cluster);
4566         spin_unlock(&delayed_refs->lock);
4567
4568         BUG_ON(head->extent_op);
4569         if (head->must_insert_reserved)
4570                 ret = 1;
4571
4572         mutex_unlock(&head->mutex);
4573         btrfs_put_delayed_ref(&head->node);
4574         return ret;
4575 out:
4576         spin_unlock(&delayed_refs->lock);
4577         return 0;
4578 }
4579
4580 void btrfs_free_tree_block(struct btrfs_trans_handle *trans,
4581                            struct btrfs_root *root,
4582                            struct extent_buffer *buf,
4583                            u64 parent, int last_ref)
4584 {
4585         struct btrfs_block_rsv *block_rsv;
4586         struct btrfs_block_group_cache *cache = NULL;
4587         int ret;
4588
4589         if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4590                 ret = btrfs_add_delayed_tree_ref(trans, buf->start, buf->len,
4591                                                 parent, root->root_key.objectid,
4592                                                 btrfs_header_level(buf),
4593                                                 BTRFS_DROP_DELAYED_REF, NULL);
4594                 BUG_ON(ret);
4595         }
4596
4597         if (!last_ref)
4598                 return;
4599
4600         block_rsv = get_block_rsv(trans, root);
4601         cache = btrfs_lookup_block_group(root->fs_info, buf->start);
4602         if (block_rsv->space_info != cache->space_info)
4603                 goto out;
4604
4605         if (btrfs_header_generation(buf) == trans->transid) {
4606                 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4607                         ret = check_ref_cleanup(trans, root, buf->start);
4608                         if (!ret)
4609                                 goto pin;
4610                 }
4611
4612                 if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) {
4613                         pin_down_extent(root, cache, buf->start, buf->len, 1);
4614                         goto pin;
4615                 }
4616
4617                 WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags));
4618
4619                 btrfs_add_free_space(cache, buf->start, buf->len);
4620                 ret = update_reserved_bytes(cache, buf->len, 0, 0);
4621                 if (ret == -EAGAIN) {
4622                         /* block group became read-only */
4623                         update_reserved_bytes(cache, buf->len, 0, 1);
4624                         goto out;
4625                 }
4626
4627                 ret = 1;
4628                 spin_lock(&block_rsv->lock);
4629                 if (block_rsv->reserved < block_rsv->size) {
4630                         block_rsv->reserved += buf->len;
4631                         ret = 0;
4632                 }
4633                 spin_unlock(&block_rsv->lock);
4634
4635                 if (ret) {
4636                         spin_lock(&cache->space_info->lock);
4637                         cache->space_info->bytes_reserved -= buf->len;
4638                         spin_unlock(&cache->space_info->lock);
4639                 }
4640                 goto out;
4641         }
4642 pin:
4643         if (block_rsv->durable && !cache->ro) {
4644                 ret = 0;
4645                 spin_lock(&cache->lock);
4646                 if (!cache->ro) {
4647                         cache->reserved_pinned += buf->len;
4648                         ret = 1;
4649                 }
4650                 spin_unlock(&cache->lock);
4651
4652                 if (ret) {
4653                         spin_lock(&block_rsv->lock);
4654                         block_rsv->freed[trans->transid & 0x1] += buf->len;
4655                         spin_unlock(&block_rsv->lock);
4656                 }
4657         }
4658 out:
4659         btrfs_put_block_group(cache);
4660 }
4661
4662 int btrfs_free_extent(struct btrfs_trans_handle *trans,
4663                       struct btrfs_root *root,
4664                       u64 bytenr, u64 num_bytes, u64 parent,
4665                       u64 root_objectid, u64 owner, u64 offset)
4666 {
4667         int ret;
4668
4669         /*
4670          * tree log blocks never actually go into the extent allocation
4671          * tree, just update pinning info and exit early.
4672          */
4673         if (root_objectid == BTRFS_TREE_LOG_OBJECTID) {
4674                 WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID);
4675                 /* unlocks the pinned mutex */
4676                 btrfs_pin_extent(root, bytenr, num_bytes, 1);
4677                 ret = 0;
4678         } else if (owner < BTRFS_FIRST_FREE_OBJECTID) {
4679                 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
4680                                         parent, root_objectid, (int)owner,
4681                                         BTRFS_DROP_DELAYED_REF, NULL);
4682                 BUG_ON(ret);
4683         } else {
4684                 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
4685                                         parent, root_objectid, owner,
4686                                         offset, BTRFS_DROP_DELAYED_REF, NULL);
4687                 BUG_ON(ret);
4688         }
4689         return ret;
4690 }
4691
4692 static u64 stripe_align(struct btrfs_root *root, u64 val)
4693 {
4694         u64 mask = ((u64)root->stripesize - 1);
4695         u64 ret = (val + mask) & ~mask;
4696         return ret;
4697 }
4698
4699 /*
4700  * when we wait for progress in the block group caching, its because
4701  * our allocation attempt failed at least once.  So, we must sleep
4702  * and let some progress happen before we try again.
4703  *
4704  * This function will sleep at least once waiting for new free space to
4705  * show up, and then it will check the block group free space numbers
4706  * for our min num_bytes.  Another option is to have it go ahead
4707  * and look in the rbtree for a free extent of a given size, but this
4708  * is a good start.
4709  */
4710 static noinline int
4711 wait_block_group_cache_progress(struct btrfs_block_group_cache *cache,
4712                                 u64 num_bytes)
4713 {
4714         struct btrfs_caching_control *caching_ctl;
4715         DEFINE_WAIT(wait);
4716
4717         caching_ctl = get_caching_control(cache);
4718         if (!caching_ctl)
4719                 return 0;
4720
4721         wait_event(caching_ctl->wait, block_group_cache_done(cache) ||
4722                    (cache->free_space >= num_bytes));
4723
4724         put_caching_control(caching_ctl);
4725         return 0;
4726 }
4727
4728 static noinline int
4729 wait_block_group_cache_done(struct btrfs_block_group_cache *cache)
4730 {
4731         struct btrfs_caching_control *caching_ctl;
4732         DEFINE_WAIT(wait);
4733
4734         caching_ctl = get_caching_control(cache);
4735         if (!caching_ctl)
4736                 return 0;
4737
4738         wait_event(caching_ctl->wait, block_group_cache_done(cache));
4739
4740         put_caching_control(caching_ctl);
4741         return 0;
4742 }
4743
4744 static int get_block_group_index(struct btrfs_block_group_cache *cache)
4745 {
4746         int index;
4747         if (cache->flags & BTRFS_BLOCK_GROUP_RAID10)
4748                 index = 0;
4749         else if (cache->flags & BTRFS_BLOCK_GROUP_RAID1)
4750                 index = 1;
4751         else if (cache->flags & BTRFS_BLOCK_GROUP_DUP)
4752                 index = 2;
4753         else if (cache->flags & BTRFS_BLOCK_GROUP_RAID0)
4754                 index = 3;
4755         else
4756                 index = 4;
4757         return index;
4758 }
4759
4760 enum btrfs_loop_type {
4761         LOOP_FIND_IDEAL = 0,
4762         LOOP_CACHING_NOWAIT = 1,
4763         LOOP_CACHING_WAIT = 2,
4764         LOOP_ALLOC_CHUNK = 3,
4765         LOOP_NO_EMPTY_SIZE = 4,
4766 };
4767
4768 /*
4769  * walks the btree of allocated extents and find a hole of a given size.
4770  * The key ins is changed to record the hole:
4771  * ins->objectid == block start
4772  * ins->flags = BTRFS_EXTENT_ITEM_KEY
4773  * ins->offset == number of blocks
4774  * Any available blocks before search_start are skipped.
4775  */
4776 static noinline int find_free_extent(struct btrfs_trans_handle *trans,
4777                                      struct btrfs_root *orig_root,
4778                                      u64 num_bytes, u64 empty_size,
4779                                      u64 search_start, u64 search_end,
4780                                      u64 hint_byte, struct btrfs_key *ins,
4781                                      int data)
4782 {
4783         int ret = 0;
4784         struct btrfs_root *root = orig_root->fs_info->extent_root;
4785         struct btrfs_free_cluster *last_ptr = NULL;
4786         struct btrfs_block_group_cache *block_group = NULL;
4787         int empty_cluster = 2 * 1024 * 1024;
4788         int allowed_chunk_alloc = 0;
4789         int done_chunk_alloc = 0;
4790         struct btrfs_space_info *space_info;
4791         int last_ptr_loop = 0;
4792         int loop = 0;
4793         int index = 0;
4794         bool found_uncached_bg = false;
4795         bool failed_cluster_refill = false;
4796         bool failed_alloc = false;
4797         bool use_cluster = true;
4798         u64 ideal_cache_percent = 0;
4799         u64 ideal_cache_offset = 0;
4800
4801         WARN_ON(num_bytes < root->sectorsize);
4802         btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY);
4803         ins->objectid = 0;
4804         ins->offset = 0;
4805
4806         space_info = __find_space_info(root->fs_info, data);
4807         if (!space_info) {
4808                 printk(KERN_ERR "No space info for %d\n", data);
4809                 return -ENOSPC;
4810         }
4811
4812         /*
4813          * If the space info is for both data and metadata it means we have a
4814          * small filesystem and we can't use the clustering stuff.
4815          */
4816         if (btrfs_mixed_space_info(space_info))
4817                 use_cluster = false;
4818
4819         if (orig_root->ref_cows || empty_size)
4820                 allowed_chunk_alloc = 1;
4821
4822         if (data & BTRFS_BLOCK_GROUP_METADATA && use_cluster) {
4823                 last_ptr = &root->fs_info->meta_alloc_cluster;
4824                 if (!btrfs_test_opt(root, SSD))
4825                         empty_cluster = 64 * 1024;
4826         }
4827
4828         if ((data & BTRFS_BLOCK_GROUP_DATA) && use_cluster &&
4829             btrfs_test_opt(root, SSD)) {
4830                 last_ptr = &root->fs_info->data_alloc_cluster;
4831         }
4832
4833         if (last_ptr) {
4834                 spin_lock(&last_ptr->lock);
4835                 if (last_ptr->block_group)
4836                         hint_byte = last_ptr->window_start;
4837                 spin_unlock(&last_ptr->lock);
4838         }
4839
4840         search_start = max(search_start, first_logical_byte(root, 0));
4841         search_start = max(search_start, hint_byte);
4842
4843         if (!last_ptr)
4844                 empty_cluster = 0;
4845
4846         if (search_start == hint_byte) {
4847 ideal_cache:
4848                 block_group = btrfs_lookup_block_group(root->fs_info,
4849                                                        search_start);
4850                 /*
4851                  * we don't want to use the block group if it doesn't match our
4852                  * allocation bits, or if its not cached.
4853                  *
4854                  * However if we are re-searching with an ideal block group
4855                  * picked out then we don't care that the block group is cached.
4856                  */
4857                 if (block_group && block_group_bits(block_group, data) &&
4858                     (block_group->cached != BTRFS_CACHE_NO ||
4859                      search_start == ideal_cache_offset)) {
4860                         down_read(&space_info->groups_sem);
4861                         if (list_empty(&block_group->list) ||
4862                             block_group->ro) {
4863                                 /*
4864                                  * someone is removing this block group,
4865                                  * we can't jump into the have_block_group
4866                                  * target because our list pointers are not
4867                                  * valid
4868                                  */
4869                                 btrfs_put_block_group(block_group);
4870                                 up_read(&space_info->groups_sem);
4871                         } else {
4872                                 index = get_block_group_index(block_group);
4873                                 goto have_block_group;
4874                         }
4875                 } else if (block_group) {
4876                         btrfs_put_block_group(block_group);
4877                 }
4878         }
4879 search:
4880         down_read(&space_info->groups_sem);
4881         list_for_each_entry(block_group, &space_info->block_groups[index],
4882                             list) {
4883                 u64 offset;
4884                 int cached;
4885
4886                 btrfs_get_block_group(block_group);
4887                 search_start = block_group->key.objectid;
4888
4889 have_block_group:
4890                 if (unlikely(block_group->cached == BTRFS_CACHE_NO)) {
4891                         u64 free_percent;
4892
4893                         ret = cache_block_group(block_group, trans, 1);
4894                         if (block_group->cached == BTRFS_CACHE_FINISHED)
4895                                 goto have_block_group;
4896
4897                         free_percent = btrfs_block_group_used(&block_group->item);
4898                         free_percent *= 100;
4899                         free_percent = div64_u64(free_percent,
4900                                                  block_group->key.offset);
4901                         free_percent = 100 - free_percent;
4902                         if (free_percent > ideal_cache_percent &&
4903                             likely(!block_group->ro)) {
4904                                 ideal_cache_offset = block_group->key.objectid;
4905                                 ideal_cache_percent = free_percent;
4906                         }
4907
4908                         /*
4909                          * We only want to start kthread caching if we are at
4910                          * the point where we will wait for caching to make
4911                          * progress, or if our ideal search is over and we've
4912                          * found somebody to start caching.
4913                          */
4914                         if (loop > LOOP_CACHING_NOWAIT ||
4915                             (loop > LOOP_FIND_IDEAL &&
4916                              atomic_read(&space_info->caching_threads) < 2)) {
4917                                 ret = cache_block_group(block_group, trans, 0);
4918                                 BUG_ON(ret);
4919                         }
4920                         found_uncached_bg = true;
4921
4922                         /*
4923                          * If loop is set for cached only, try the next block
4924                          * group.
4925                          */
4926                         if (loop == LOOP_FIND_IDEAL)
4927                                 goto loop;
4928                 }
4929
4930                 cached = block_group_cache_done(block_group);
4931                 if (unlikely(!cached))
4932                         found_uncached_bg = true;
4933
4934                 if (unlikely(block_group->ro))
4935                         goto loop;
4936
4937                 /*
4938                  * Ok we want to try and use the cluster allocator, so lets look
4939                  * there, unless we are on LOOP_NO_EMPTY_SIZE, since we will
4940                  * have tried the cluster allocator plenty of times at this
4941                  * point and not have found anything, so we are likely way too
4942                  * fragmented for the clustering stuff to find anything, so lets
4943                  * just skip it and let the allocator find whatever block it can
4944                  * find
4945                  */
4946                 if (last_ptr && loop < LOOP_NO_EMPTY_SIZE) {
4947                         /*
4948                          * the refill lock keeps out other
4949                          * people trying to start a new cluster
4950                          */
4951                         spin_lock(&last_ptr->refill_lock);
4952                         if (last_ptr->block_group &&
4953                             (last_ptr->block_group->ro ||
4954                             !block_group_bits(last_ptr->block_group, data))) {
4955                                 offset = 0;
4956                                 goto refill_cluster;
4957                         }
4958
4959                         offset = btrfs_alloc_from_cluster(block_group, last_ptr,
4960                                                  num_bytes, search_start);
4961                         if (offset) {
4962                                 /* we have a block, we're done */
4963                                 spin_unlock(&last_ptr->refill_lock);
4964                                 goto checks;
4965                         }
4966
4967                         spin_lock(&last_ptr->lock);
4968                         /*
4969                          * whoops, this cluster doesn't actually point to
4970                          * this block group.  Get a ref on the block
4971                          * group is does point to and try again
4972                          */
4973                         if (!last_ptr_loop && last_ptr->block_group &&
4974                             last_ptr->block_group != block_group) {
4975
4976                                 btrfs_put_block_group(block_group);
4977                                 block_group = last_ptr->block_group;
4978                                 btrfs_get_block_group(block_group);
4979                                 spin_unlock(&last_ptr->lock);
4980                                 spin_unlock(&last_ptr->refill_lock);
4981
4982                                 last_ptr_loop = 1;
4983                                 search_start = block_group->key.objectid;
4984                                 /*
4985                                  * we know this block group is properly
4986                                  * in the list because
4987                                  * btrfs_remove_block_group, drops the
4988                                  * cluster before it removes the block
4989                                  * group from the list
4990                                  */
4991                                 goto have_block_group;
4992                         }
4993                         spin_unlock(&last_ptr->lock);
4994 refill_cluster:
4995                         /*
4996                          * this cluster didn't work out, free it and
4997                          * start over
4998                          */
4999                         btrfs_return_cluster_to_free_space(NULL, last_ptr);
5000
5001                         last_ptr_loop = 0;
5002
5003                         /* allocate a cluster in this block group */
5004                         ret = btrfs_find_space_cluster(trans, root,
5005                                                block_group, last_ptr,
5006                                                offset, num_bytes,
5007                                                empty_cluster + empty_size);
5008                         if (ret == 0) {
5009                                 /*
5010                                  * now pull our allocation out of this
5011                                  * cluster
5012                                  */
5013                                 offset = btrfs_alloc_from_cluster(block_group,
5014                                                   last_ptr, num_bytes,
5015                                                   search_start);
5016                                 if (offset) {
5017                                         /* we found one, proceed */
5018                                         spin_unlock(&last_ptr->refill_lock);
5019                                         goto checks;
5020                                 }
5021                         } else if (!cached && loop > LOOP_CACHING_NOWAIT
5022                                    && !failed_cluster_refill) {
5023                                 spin_unlock(&last_ptr->refill_lock);
5024
5025                                 failed_cluster_refill = true;
5026                                 wait_block_group_cache_progress(block_group,
5027                                        num_bytes + empty_cluster + empty_size);
5028                                 goto have_block_group;
5029                         }
5030
5031                         /*
5032                          * at this point we either didn't find a cluster
5033                          * or we weren't able to allocate a block from our
5034                          * cluster.  Free the cluster we've been trying
5035                          * to use, and go to the next block group
5036                          */
5037                         btrfs_return_cluster_to_free_space(NULL, last_ptr);
5038                         spin_unlock(&last_ptr->refill_lock);
5039                         goto loop;
5040                 }
5041
5042                 offset = btrfs_find_space_for_alloc(block_group, search_start,
5043                                                     num_bytes, empty_size);
5044                 /*
5045                  * If we didn't find a chunk, and we haven't failed on this
5046                  * block group before, and this block group is in the middle of
5047                  * caching and we are ok with waiting, then go ahead and wait
5048                  * for progress to be made, and set failed_alloc to true.
5049                  *
5050                  * If failed_alloc is true then we've already waited on this
5051                  * block group once and should move on to the next block group.
5052                  */
5053                 if (!offset && !failed_alloc && !cached &&
5054                     loop > LOOP_CACHING_NOWAIT) {
5055                         wait_block_group_cache_progress(block_group,
5056                                                 num_bytes + empty_size);
5057                         failed_alloc = true;
5058                         goto have_block_group;
5059                 } else if (!offset) {
5060                         goto loop;
5061                 }
5062 checks:
5063                 search_start = stripe_align(root, offset);
5064                 /* move on to the next group */
5065                 if (search_start + num_bytes >= search_end) {
5066                         btrfs_add_free_space(block_group, offset, num_bytes);
5067                         goto loop;
5068                 }
5069
5070                 /* move on to the next group */
5071                 if (search_start + num_bytes >
5072                     block_group->key.objectid + block_group->key.offset) {
5073                         btrfs_add_free_space(block_group, offset, num_bytes);
5074                         goto loop;
5075                 }
5076
5077                 ins->objectid = search_start;
5078                 ins->offset = num_bytes;
5079
5080                 if (offset < search_start)
5081                         btrfs_add_free_space(block_group, offset,
5082                                              search_start - offset);
5083                 BUG_ON(offset > search_start);
5084
5085                 ret = update_reserved_bytes(block_group, num_bytes, 1,
5086                                             (data & BTRFS_BLOCK_GROUP_DATA));
5087                 if (ret == -EAGAIN) {
5088                         btrfs_add_free_space(block_group, offset, num_bytes);
5089                         goto loop;
5090                 }
5091
5092                 /* we are all good, lets return */
5093                 ins->objectid = search_start;
5094                 ins->offset = num_bytes;
5095
5096                 if (offset < search_start)
5097                         btrfs_add_free_space(block_group, offset,
5098                                              search_start - offset);
5099                 BUG_ON(offset > search_start);
5100                 break;
5101 loop:
5102                 failed_cluster_refill = false;
5103                 failed_alloc = false;
5104                 BUG_ON(index != get_block_group_index(block_group));
5105                 btrfs_put_block_group(block_group);
5106         }
5107         up_read(&space_info->groups_sem);
5108
5109         if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES)
5110                 goto search;
5111
5112         /* LOOP_FIND_IDEAL, only search caching/cached bg's, and don't wait for
5113          *                      for them to make caching progress.  Also
5114          *                      determine the best possible bg to cache
5115          * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking
5116          *                      caching kthreads as we move along
5117          * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching
5118          * LOOP_ALLOC_CHUNK, force a chunk allocation and try again
5119          * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try
5120          *                      again
5121          */
5122         if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE &&
5123             (found_uncached_bg || empty_size || empty_cluster ||
5124              allowed_chunk_alloc)) {
5125                 index = 0;
5126                 if (loop == LOOP_FIND_IDEAL && found_uncached_bg) {
5127                         found_uncached_bg = false;
5128                         loop++;
5129                         if (!ideal_cache_percent &&
5130                             atomic_read(&space_info->caching_threads))
5131                                 goto search;
5132
5133                         /*
5134                          * 1 of the following 2 things have happened so far
5135                          *
5136                          * 1) We found an ideal block group for caching that
5137                          * is mostly full and will cache quickly, so we might
5138                          * as well wait for it.
5139                          *
5140                          * 2) We searched for cached only and we didn't find
5141                          * anything, and we didn't start any caching kthreads
5142                          * either, so chances are we will loop through and
5143                          * start a couple caching kthreads, and then come back
5144                          * around and just wait for them.  This will be slower
5145                          * because we will have 2 caching kthreads reading at
5146                          * the same time when we could have just started one
5147                          * and waited for it to get far enough to give us an
5148                          * allocation, so go ahead and go to the wait caching
5149                          * loop.
5150                          */
5151                         loop = LOOP_CACHING_WAIT;
5152                         search_start = ideal_cache_offset;
5153                         ideal_cache_percent = 0;
5154                         goto ideal_cache;
5155                 } else if (loop == LOOP_FIND_IDEAL) {
5156                         /*
5157                          * Didn't find a uncached bg, wait on anything we find
5158                          * next.
5159                          */
5160                         loop = LOOP_CACHING_WAIT;
5161                         goto search;
5162                 }
5163
5164                 if (loop < LOOP_CACHING_WAIT) {
5165                         loop++;
5166                         goto search;
5167                 }
5168
5169                 if (loop == LOOP_ALLOC_CHUNK) {
5170                         empty_size = 0;
5171                         empty_cluster = 0;
5172                 }
5173
5174                 if (allowed_chunk_alloc) {
5175                         ret = do_chunk_alloc(trans, root, num_bytes +
5176                                              2 * 1024 * 1024, data, 1);
5177                         allowed_chunk_alloc = 0;
5178                         done_chunk_alloc = 1;
5179                 } else if (!done_chunk_alloc) {
5180                         space_info->force_alloc = 1;
5181                 }
5182
5183                 if (loop < LOOP_NO_EMPTY_SIZE) {
5184                         loop++;
5185                         goto search;
5186                 }
5187                 ret = -ENOSPC;
5188         } else if (!ins->objectid) {
5189                 ret = -ENOSPC;
5190         }
5191
5192         /* we found what we needed */
5193         if (ins->objectid) {
5194                 if (!(data & BTRFS_BLOCK_GROUP_DATA))
5195                         trans->block_group = block_group->key.objectid;
5196
5197                 btrfs_put_block_group(block_group);
5198                 ret = 0;
5199         }
5200
5201         return ret;
5202 }
5203
5204 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
5205                             int dump_block_groups)
5206 {
5207         struct btrfs_block_group_cache *cache;
5208         int index = 0;
5209
5210         spin_lock(&info->lock);
5211         printk(KERN_INFO "space_info has %llu free, is %sfull\n",
5212                (unsigned long long)(info->total_bytes - info->bytes_used -
5213                                     info->bytes_pinned - info->bytes_reserved -
5214                                     info->bytes_readonly),
5215                (info->full) ? "" : "not ");
5216         printk(KERN_INFO "space_info total=%llu, used=%llu, pinned=%llu, "
5217                "reserved=%llu, may_use=%llu, readonly=%llu\n",
5218                (unsigned long long)info->total_bytes,
5219                (unsigned long long)info->bytes_used,
5220                (unsigned long long)info->bytes_pinned,
5221                (unsigned long long)info->bytes_reserved,
5222                (unsigned long long)info->bytes_may_use,
5223                (unsigned long long)info->bytes_readonly);
5224         spin_unlock(&info->lock);
5225
5226         if (!dump_block_groups)
5227                 return;
5228
5229         down_read(&info->groups_sem);
5230 again:
5231         list_for_each_entry(cache, &info->block_groups[index], list) {
5232                 spin_lock(&cache->lock);
5233                 printk(KERN_INFO "block group %llu has %llu bytes, %llu used "
5234                        "%llu pinned %llu reserved\n",
5235                        (unsigned long long)cache->key.objectid,
5236                        (unsigned long long)cache->key.offset,
5237                        (unsigned long long)btrfs_block_group_used(&cache->item),
5238                        (unsigned long long)cache->pinned,
5239                        (unsigned long long)cache->reserved);
5240                 btrfs_dump_free_space(cache, bytes);
5241                 spin_unlock(&cache->lock);
5242         }
5243         if (++index < BTRFS_NR_RAID_TYPES)
5244                 goto again;
5245         up_read(&info->groups_sem);
5246 }
5247
5248 int btrfs_reserve_extent(struct btrfs_trans_handle *trans,
5249                          struct btrfs_root *root,
5250                          u64 num_bytes, u64 min_alloc_size,
5251                          u64 empty_size, u64 hint_byte,
5252                          u64 search_end, struct btrfs_key *ins,
5253                          u64 data)
5254 {
5255         int ret;
5256         u64 search_start = 0;
5257
5258         data = btrfs_get_alloc_profile(root, data);
5259 again:
5260         /*
5261          * the only place that sets empty_size is btrfs_realloc_node, which
5262          * is not called recursively on allocations
5263          */
5264         if (empty_size || root->ref_cows)
5265                 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
5266                                      num_bytes + 2 * 1024 * 1024, data, 0);
5267
5268         WARN_ON(num_bytes < root->sectorsize);
5269         ret = find_free_extent(trans, root, num_bytes, empty_size,
5270                                search_start, search_end, hint_byte,
5271                                ins, data);
5272
5273         if (ret == -ENOSPC && num_bytes > min_alloc_size) {
5274                 num_bytes = num_bytes >> 1;
5275                 num_bytes = num_bytes & ~(root->sectorsize - 1);
5276                 num_bytes = max(num_bytes, min_alloc_size);
5277                 do_chunk_alloc(trans, root->fs_info->extent_root,
5278                                num_bytes, data, 1);
5279                 goto again;
5280         }
5281         if (ret == -ENOSPC) {
5282                 struct btrfs_space_info *sinfo;
5283
5284                 sinfo = __find_space_info(root->fs_info, data);
5285                 printk(KERN_ERR "btrfs allocation failed flags %llu, "
5286                        "wanted %llu\n", (unsigned long long)data,
5287                        (unsigned long long)num_bytes);
5288                 dump_space_info(sinfo, num_bytes, 1);
5289         }
5290
5291         return ret;
5292 }
5293
5294 int btrfs_free_reserved_extent(struct btrfs_root *root, u64 start, u64 len)
5295 {
5296         struct btrfs_block_group_cache *cache;
5297         int ret = 0;
5298
5299         cache = btrfs_lookup_block_group(root->fs_info, start);
5300         if (!cache) {
5301                 printk(KERN_ERR "Unable to find block group for %llu\n",
5302                        (unsigned long long)start);
5303                 return -ENOSPC;
5304         }
5305
5306         ret = btrfs_discard_extent(root, start, len);
5307
5308         btrfs_add_free_space(cache, start, len);
5309         update_reserved_bytes(cache, len, 0, 1);
5310         btrfs_put_block_group(cache);
5311
5312         return ret;
5313 }
5314
5315 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5316                                       struct btrfs_root *root,
5317                                       u64 parent, u64 root_objectid,
5318                                       u64 flags, u64 owner, u64 offset,
5319                                       struct btrfs_key *ins, int ref_mod)
5320 {
5321         int ret;
5322         struct btrfs_fs_info *fs_info = root->fs_info;
5323         struct btrfs_extent_item *extent_item;
5324         struct btrfs_extent_inline_ref *iref;
5325         struct btrfs_path *path;
5326         struct extent_buffer *leaf;
5327         int type;
5328         u32 size;
5329
5330         if (parent > 0)
5331                 type = BTRFS_SHARED_DATA_REF_KEY;
5332         else
5333                 type = BTRFS_EXTENT_DATA_REF_KEY;
5334
5335         size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type);
5336
5337         path = btrfs_alloc_path();
5338         BUG_ON(!path);
5339
5340         path->leave_spinning = 1;
5341         ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5342                                       ins, size);
5343         BUG_ON(ret);
5344
5345         leaf = path->nodes[0];
5346         extent_item = btrfs_item_ptr(leaf, path->slots[0],
5347                                      struct btrfs_extent_item);
5348         btrfs_set_extent_refs(leaf, extent_item, ref_mod);
5349         btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5350         btrfs_set_extent_flags(leaf, extent_item,
5351                                flags | BTRFS_EXTENT_FLAG_DATA);
5352
5353         iref = (struct btrfs_extent_inline_ref *)(extent_item + 1);
5354         btrfs_set_extent_inline_ref_type(leaf, iref, type);
5355         if (parent > 0) {
5356                 struct btrfs_shared_data_ref *ref;
5357                 ref = (struct btrfs_shared_data_ref *)(iref + 1);
5358                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5359                 btrfs_set_shared_data_ref_count(leaf, ref, ref_mod);
5360         } else {
5361                 struct btrfs_extent_data_ref *ref;
5362                 ref = (struct btrfs_extent_data_ref *)(&iref->offset);
5363                 btrfs_set_extent_data_ref_root(leaf, ref, root_objectid);
5364                 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
5365                 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
5366                 btrfs_set_extent_data_ref_count(leaf, ref, ref_mod);
5367         }
5368
5369         btrfs_mark_buffer_dirty(path->nodes[0]);
5370         btrfs_free_path(path);
5371
5372         ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5373         if (ret) {
5374                 printk(KERN_ERR "btrfs update block group failed for %llu "
5375                        "%llu\n", (unsigned long long)ins->objectid,
5376                        (unsigned long long)ins->offset);
5377                 BUG();
5378         }
5379         return ret;
5380 }
5381
5382 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
5383                                      struct btrfs_root *root,
5384                                      u64 parent, u64 root_objectid,
5385                                      u64 flags, struct btrfs_disk_key *key,
5386                                      int level, struct btrfs_key *ins)
5387 {
5388         int ret;
5389         struct btrfs_fs_info *fs_info = root->fs_info;
5390         struct btrfs_extent_item *extent_item;
5391         struct btrfs_tree_block_info *block_info;
5392         struct btrfs_extent_inline_ref *iref;
5393         struct btrfs_path *path;
5394         struct extent_buffer *leaf;
5395         u32 size = sizeof(*extent_item) + sizeof(*block_info) + sizeof(*iref);
5396
5397         path = btrfs_alloc_path();
5398         BUG_ON(!path);
5399
5400         path->leave_spinning = 1;
5401         ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5402                                       ins, size);
5403         BUG_ON(ret);
5404
5405         leaf = path->nodes[0];
5406         extent_item = btrfs_item_ptr(leaf, path->slots[0],
5407                                      struct btrfs_extent_item);
5408         btrfs_set_extent_refs(leaf, extent_item, 1);
5409         btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5410         btrfs_set_extent_flags(leaf, extent_item,
5411                                flags | BTRFS_EXTENT_FLAG_TREE_BLOCK);
5412         block_info = (struct btrfs_tree_block_info *)(extent_item + 1);
5413
5414         btrfs_set_tree_block_key(leaf, block_info, key);
5415         btrfs_set_tree_block_level(leaf, block_info, level);
5416
5417         iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
5418         if (parent > 0) {
5419                 BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF));
5420                 btrfs_set_extent_inline_ref_type(leaf, iref,
5421                                                  BTRFS_SHARED_BLOCK_REF_KEY);
5422                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5423         } else {
5424                 btrfs_set_extent_inline_ref_type(leaf, iref,
5425                                                  BTRFS_TREE_BLOCK_REF_KEY);
5426                 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
5427         }
5428
5429         btrfs_mark_buffer_dirty(leaf);
5430         btrfs_free_path(path);
5431
5432         ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5433         if (ret) {
5434                 printk(KERN_ERR "btrfs update block group failed for %llu "
5435                        "%llu\n", (unsigned long long)ins->objectid,
5436                        (unsigned long long)ins->offset);
5437                 BUG();
5438         }
5439         return ret;
5440 }
5441
5442 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5443                                      struct btrfs_root *root,
5444                                      u64 root_objectid, u64 owner,
5445                                      u64 offset, struct btrfs_key *ins)
5446 {
5447         int ret;
5448
5449         BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID);
5450
5451         ret = btrfs_add_delayed_data_ref(trans, ins->objectid, ins->offset,
5452                                          0, root_objectid, owner, offset,
5453                                          BTRFS_ADD_DELAYED_EXTENT, NULL);
5454         return ret;
5455 }
5456
5457 /*
5458  * this is used by the tree logging recovery code.  It records that
5459  * an extent has been allocated and makes sure to clear the free
5460  * space cache bits as well
5461  */
5462 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans,
5463                                    struct btrfs_root *root,
5464                                    u64 root_objectid, u64 owner, u64 offset,
5465                                    struct btrfs_key *ins)
5466 {
5467         int ret;
5468         struct btrfs_block_group_cache *block_group;
5469         struct btrfs_caching_control *caching_ctl;
5470         u64 start = ins->objectid;
5471         u64 num_bytes = ins->offset;
5472
5473         block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid);
5474         cache_block_group(block_group, trans, 0);
5475         caching_ctl = get_caching_control(block_group);
5476
5477         if (!caching_ctl) {
5478                 BUG_ON(!block_group_cache_done(block_group));
5479                 ret = btrfs_remove_free_space(block_group, start, num_bytes);
5480                 BUG_ON(ret);
5481         } else {
5482                 mutex_lock(&caching_ctl->mutex);
5483
5484                 if (start >= caching_ctl->progress) {
5485                         ret = add_excluded_extent(root, start, num_bytes);
5486                         BUG_ON(ret);
5487                 } else if (start + num_bytes <= caching_ctl->progress) {
5488                         ret = btrfs_remove_free_space(block_group,
5489                                                       start, num_bytes);
5490                         BUG_ON(ret);
5491                 } else {
5492                         num_bytes = caching_ctl->progress - start;
5493                         ret = btrfs_remove_free_space(block_group,
5494                                                       start, num_bytes);
5495                         BUG_ON(ret);
5496
5497                         start = caching_ctl->progress;
5498                         num_bytes = ins->objectid + ins->offset -
5499                                     caching_ctl->progress;
5500                         ret = add_excluded_extent(root, start, num_bytes);
5501                         BUG_ON(ret);
5502                 }
5503
5504                 mutex_unlock(&caching_ctl->mutex);
5505                 put_caching_control(caching_ctl);
5506         }
5507
5508         ret = update_reserved_bytes(block_group, ins->offset, 1, 1);
5509         BUG_ON(ret);
5510         btrfs_put_block_group(block_group);
5511         ret = alloc_reserved_file_extent(trans, root, 0, root_objectid,
5512                                          0, owner, offset, ins, 1);
5513         return ret;
5514 }
5515
5516 struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans,
5517                                             struct btrfs_root *root,
5518                                             u64 bytenr, u32 blocksize,
5519                                             int level)
5520 {
5521         struct extent_buffer *buf;
5522
5523         buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
5524         if (!buf)
5525                 return ERR_PTR(-ENOMEM);
5526         btrfs_set_header_generation(buf, trans->transid);
5527         btrfs_set_buffer_lockdep_class(buf, level);
5528         btrfs_tree_lock(buf);
5529         clean_tree_block(trans, root, buf);
5530
5531         btrfs_set_lock_blocking(buf);
5532         btrfs_set_buffer_uptodate(buf);
5533
5534         if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) {
5535                 /*
5536                  * we allow two log transactions at a time, use different
5537                  * EXENT bit to differentiate dirty pages.
5538                  */
5539                 if (root->log_transid % 2 == 0)
5540                         set_extent_dirty(&root->dirty_log_pages, buf->start,
5541                                         buf->start + buf->len - 1, GFP_NOFS);
5542                 else
5543                         set_extent_new(&root->dirty_log_pages, buf->start,
5544                                         buf->start + buf->len - 1, GFP_NOFS);
5545         } else {
5546                 set_extent_dirty(&trans->transaction->dirty_pages, buf->start,
5547                          buf->start + buf->len - 1, GFP_NOFS);
5548         }
5549         trans->blocks_used++;
5550         /* this returns a buffer locked for blocking */
5551         return buf;
5552 }
5553
5554 static struct btrfs_block_rsv *
5555 use_block_rsv(struct btrfs_trans_handle *trans,
5556               struct btrfs_root *root, u32 blocksize)
5557 {
5558         struct btrfs_block_rsv *block_rsv;
5559         int ret;
5560
5561         block_rsv = get_block_rsv(trans, root);
5562
5563         if (block_rsv->size == 0) {
5564                 ret = reserve_metadata_bytes(block_rsv, blocksize);
5565                 if (ret)
5566                         return ERR_PTR(ret);
5567                 return block_rsv;
5568         }
5569
5570         ret = block_rsv_use_bytes(block_rsv, blocksize);
5571         if (!ret)
5572                 return block_rsv;
5573
5574         WARN_ON(1);
5575         printk(KERN_INFO"block_rsv size %llu reserved %llu freed %llu %llu\n",
5576                 block_rsv->size, block_rsv->reserved,
5577                 block_rsv->freed[0], block_rsv->freed[1]);
5578
5579         return ERR_PTR(-ENOSPC);
5580 }
5581
5582 static void unuse_block_rsv(struct btrfs_block_rsv *block_rsv, u32 blocksize)
5583 {
5584         block_rsv_add_bytes(block_rsv, blocksize, 0);
5585         block_rsv_release_bytes(block_rsv, NULL, 0);
5586 }
5587
5588 /*
5589  * finds a free extent and does all the dirty work required for allocation
5590  * returns the key for the extent through ins, and a tree buffer for
5591  * the first block of the extent through buf.
5592  *
5593  * returns the tree buffer or NULL.
5594  */
5595 struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans,
5596                                         struct btrfs_root *root, u32 blocksize,
5597                                         u64 parent, u64 root_objectid,
5598                                         struct btrfs_disk_key *key, int level,
5599                                         u64 hint, u64 empty_size)
5600 {
5601         struct btrfs_key ins;
5602         struct btrfs_block_rsv *block_rsv;
5603         struct extent_buffer *buf;
5604         u64 flags = 0;
5605         int ret;
5606
5607
5608         block_rsv = use_block_rsv(trans, root, blocksize);
5609         if (IS_ERR(block_rsv))
5610                 return ERR_CAST(block_rsv);
5611
5612         ret = btrfs_reserve_extent(trans, root, blocksize, blocksize,
5613                                    empty_size, hint, (u64)-1, &ins, 0);
5614         if (ret) {
5615                 unuse_block_rsv(block_rsv, blocksize);
5616                 return ERR_PTR(ret);
5617         }
5618
5619         buf = btrfs_init_new_buffer(trans, root, ins.objectid,
5620