]> git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/alloc_foreground.c
Update bcachefs sources to 50d6a25d9c bcachefs: Erasure coding fixes
[bcachefs-tools-debian] / libbcachefs / alloc_foreground.c
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3  * Copyright 2012 Google, Inc.
4  *
5  * Foreground allocator code: allocate buckets from freelist, and allocate in
6  * sector granularity from writepoints.
7  *
8  * bch2_bucket_alloc() allocates a single bucket from a specific device.
9  *
10  * bch2_bucket_alloc_set() allocates one or more buckets from different devices
11  * in a given filesystem.
12  */
13
14 #include "bcachefs.h"
15 #include "alloc_background.h"
16 #include "alloc_foreground.h"
17 #include "btree_gc.h"
18 #include "buckets.h"
19 #include "clock.h"
20 #include "debug.h"
21 #include "disk_groups.h"
22 #include "ec.h"
23 #include "io.h"
24
25 #include <linux/math64.h>
26 #include <linux/rculist.h>
27 #include <linux/rcupdate.h>
28 #include <trace/events/bcachefs.h>
29
30 /*
31  * Open buckets represent a bucket that's currently being allocated from.  They
32  * serve two purposes:
33  *
34  *  - They track buckets that have been partially allocated, allowing for
35  *    sub-bucket sized allocations - they're used by the sector allocator below
36  *
37  *  - They provide a reference to the buckets they own that mark and sweep GC
38  *    can find, until the new allocation has a pointer to it inserted into the
39  *    btree
40  *
41  * When allocating some space with the sector allocator, the allocation comes
42  * with a reference to an open bucket - the caller is required to put that
43  * reference _after_ doing the index update that makes its allocation reachable.
44  */
45
46 void __bch2_open_bucket_put(struct bch_fs *c, struct open_bucket *ob)
47 {
48         struct bch_dev *ca = bch_dev_bkey_exists(c, ob->ptr.dev);
49
50         if (ob->ec) {
51                 bch2_ec_bucket_written(c, ob);
52                 return;
53         }
54
55         percpu_down_read(&c->mark_lock);
56         spin_lock(&ob->lock);
57
58         bch2_mark_alloc_bucket(c, ca, PTR_BUCKET_NR(ca, &ob->ptr), false);
59         ob->valid = false;
60         ob->type = 0;
61
62         spin_unlock(&ob->lock);
63         percpu_up_read(&c->mark_lock);
64
65         spin_lock(&c->freelist_lock);
66         ob->freelist = c->open_buckets_freelist;
67         c->open_buckets_freelist = ob - c->open_buckets;
68
69         c->open_buckets_nr_free++;
70         ca->nr_open_buckets--;
71         spin_unlock(&c->freelist_lock);
72
73         closure_wake_up(&c->open_buckets_wait);
74 }
75
76 void bch2_open_bucket_write_error(struct bch_fs *c,
77                                   struct open_buckets *obs,
78                                   unsigned dev)
79 {
80         struct open_bucket *ob;
81         unsigned i;
82
83         open_bucket_for_each(c, obs, ob, i)
84                 if (ob->ptr.dev == dev &&
85                     ob->ec)
86                         bch2_ec_bucket_cancel(c, ob);
87 }
88
89 static struct open_bucket *bch2_open_bucket_alloc(struct bch_fs *c)
90 {
91         struct open_bucket *ob;
92
93         BUG_ON(!c->open_buckets_freelist || !c->open_buckets_nr_free);
94
95         ob = c->open_buckets + c->open_buckets_freelist;
96         c->open_buckets_freelist = ob->freelist;
97         atomic_set(&ob->pin, 1);
98         ob->type = 0;
99
100         c->open_buckets_nr_free--;
101         return ob;
102 }
103
104 static void open_bucket_free_unused(struct bch_fs *c,
105                                     struct write_point *wp,
106                                     struct open_bucket *ob)
107 {
108         struct bch_dev *ca = bch_dev_bkey_exists(c, ob->ptr.dev);
109         bool may_realloc = wp->type == BCH_DATA_user;
110
111         BUG_ON(ca->open_buckets_partial_nr >
112                ARRAY_SIZE(ca->open_buckets_partial));
113
114         if (ca->open_buckets_partial_nr <
115             ARRAY_SIZE(ca->open_buckets_partial) &&
116             may_realloc) {
117                 spin_lock(&c->freelist_lock);
118                 ob->on_partial_list = true;
119                 ca->open_buckets_partial[ca->open_buckets_partial_nr++] =
120                         ob - c->open_buckets;
121                 spin_unlock(&c->freelist_lock);
122
123                 closure_wake_up(&c->open_buckets_wait);
124                 closure_wake_up(&c->freelist_wait);
125         } else {
126                 bch2_open_bucket_put(c, ob);
127         }
128 }
129
130 static void verify_not_stale(struct bch_fs *c, const struct open_buckets *obs)
131 {
132 #ifdef CONFIG_BCACHEFS_DEBUG
133         struct open_bucket *ob;
134         unsigned i;
135
136         open_bucket_for_each(c, obs, ob, i) {
137                 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->ptr.dev);
138
139                 BUG_ON(ptr_stale(ca, &ob->ptr));
140         }
141 #endif
142 }
143
144 /* _only_ for allocating the journal on a new device: */
145 long bch2_bucket_alloc_new_fs(struct bch_dev *ca)
146 {
147         struct bucket_array *buckets;
148         ssize_t b;
149
150         rcu_read_lock();
151         buckets = bucket_array(ca);
152
153         for (b = buckets->first_bucket; b < buckets->nbuckets; b++)
154                 if (is_available_bucket(buckets->b[b].mark) &&
155                     !buckets->b[b].mark.owned_by_allocator)
156                         goto success;
157         b = -1;
158 success:
159         rcu_read_unlock();
160         return b;
161 }
162
163 static inline unsigned open_buckets_reserved(enum alloc_reserve reserve)
164 {
165         switch (reserve) {
166         case RESERVE_BTREE:
167         case RESERVE_BTREE_MOVINGGC:
168                 return 0;
169         case RESERVE_MOVINGGC:
170                 return OPEN_BUCKETS_COUNT / 4;
171         default:
172                 return OPEN_BUCKETS_COUNT / 2;
173         }
174 }
175
176 /**
177  * bch_bucket_alloc - allocate a single bucket from a specific device
178  *
179  * Returns index of bucket on success, 0 on failure
180  * */
181 struct open_bucket *bch2_bucket_alloc(struct bch_fs *c, struct bch_dev *ca,
182                                       enum alloc_reserve reserve,
183                                       bool may_alloc_partial,
184                                       struct closure *cl)
185 {
186         struct open_bucket *ob;
187         long b = 0;
188
189         spin_lock(&c->freelist_lock);
190
191         if (may_alloc_partial) {
192                 int i;
193
194                 for (i = ca->open_buckets_partial_nr - 1; i >= 0; --i) {
195                         ob = c->open_buckets + ca->open_buckets_partial[i];
196
197                         if (reserve <= ob->alloc_reserve) {
198                                 array_remove_item(ca->open_buckets_partial,
199                                                   ca->open_buckets_partial_nr,
200                                                   i);
201                                 ob->on_partial_list = false;
202                                 ob->alloc_reserve = reserve;
203                                 spin_unlock(&c->freelist_lock);
204                                 return ob;
205                         }
206                 }
207         }
208
209         if (unlikely(c->open_buckets_nr_free <= open_buckets_reserved(reserve))) {
210                 if (cl)
211                         closure_wait(&c->open_buckets_wait, cl);
212
213                 if (!c->blocked_allocate_open_bucket)
214                         c->blocked_allocate_open_bucket = local_clock();
215
216                 spin_unlock(&c->freelist_lock);
217                 trace_open_bucket_alloc_fail(ca, reserve);
218                 return ERR_PTR(-OPEN_BUCKETS_EMPTY);
219         }
220
221         if (likely(fifo_pop(&ca->free[RESERVE_NONE], b)))
222                 goto out;
223
224         switch (reserve) {
225         case RESERVE_BTREE_MOVINGGC:
226         case RESERVE_MOVINGGC:
227                 if (fifo_pop(&ca->free[RESERVE_MOVINGGC], b))
228                         goto out;
229                 break;
230         default:
231                 break;
232         }
233
234         if (cl)
235                 closure_wait(&c->freelist_wait, cl);
236
237         if (!c->blocked_allocate)
238                 c->blocked_allocate = local_clock();
239
240         spin_unlock(&c->freelist_lock);
241
242         trace_bucket_alloc_fail(ca, reserve);
243         return ERR_PTR(-FREELIST_EMPTY);
244 out:
245         verify_not_on_freelist(c, ca, b);
246
247         ob = bch2_open_bucket_alloc(c);
248
249         spin_lock(&ob->lock);
250
251         ob->valid       = true;
252         ob->sectors_free = ca->mi.bucket_size;
253         ob->alloc_reserve = reserve;
254         ob->ptr         = (struct bch_extent_ptr) {
255                 .type   = 1 << BCH_EXTENT_ENTRY_ptr,
256                 .gen    = bucket(ca, b)->mark.gen,
257                 .offset = bucket_to_sector(ca, b),
258                 .dev    = ca->dev_idx,
259         };
260
261         spin_unlock(&ob->lock);
262
263         if (c->blocked_allocate_open_bucket) {
264                 bch2_time_stats_update(
265                         &c->times[BCH_TIME_blocked_allocate_open_bucket],
266                         c->blocked_allocate_open_bucket);
267                 c->blocked_allocate_open_bucket = 0;
268         }
269
270         if (c->blocked_allocate) {
271                 bch2_time_stats_update(
272                         &c->times[BCH_TIME_blocked_allocate],
273                         c->blocked_allocate);
274                 c->blocked_allocate = 0;
275         }
276
277         ca->nr_open_buckets++;
278         spin_unlock(&c->freelist_lock);
279
280         bch2_wake_allocator(ca);
281
282         trace_bucket_alloc(ca, reserve);
283         return ob;
284 }
285
286 static int __dev_stripe_cmp(struct dev_stripe_state *stripe,
287                             unsigned l, unsigned r)
288 {
289         return ((stripe->next_alloc[l] > stripe->next_alloc[r]) -
290                 (stripe->next_alloc[l] < stripe->next_alloc[r]));
291 }
292
293 #define dev_stripe_cmp(l, r) __dev_stripe_cmp(stripe, l, r)
294
295 struct dev_alloc_list bch2_dev_alloc_list(struct bch_fs *c,
296                                           struct dev_stripe_state *stripe,
297                                           struct bch_devs_mask *devs)
298 {
299         struct dev_alloc_list ret = { .nr = 0 };
300         unsigned i;
301
302         for_each_set_bit(i, devs->d, BCH_SB_MEMBERS_MAX)
303                 ret.devs[ret.nr++] = i;
304
305         bubble_sort(ret.devs, ret.nr, dev_stripe_cmp);
306         return ret;
307 }
308
309 void bch2_dev_stripe_increment(struct bch_dev *ca,
310                                struct dev_stripe_state *stripe)
311 {
312         u64 *v = stripe->next_alloc + ca->dev_idx;
313         u64 free_space = dev_buckets_available(ca);
314         u64 free_space_inv = free_space
315                 ? div64_u64(1ULL << 48, free_space)
316                 : 1ULL << 48;
317         u64 scale = *v / 4;
318
319         if (*v + free_space_inv >= *v)
320                 *v += free_space_inv;
321         else
322                 *v = U64_MAX;
323
324         for (v = stripe->next_alloc;
325              v < stripe->next_alloc + ARRAY_SIZE(stripe->next_alloc); v++)
326                 *v = *v < scale ? 0 : *v - scale;
327 }
328
329 #define BUCKET_MAY_ALLOC_PARTIAL        (1 << 0)
330 #define BUCKET_ALLOC_USE_DURABILITY     (1 << 1)
331
332 static void add_new_bucket(struct bch_fs *c,
333                            struct open_buckets *ptrs,
334                            struct bch_devs_mask *devs_may_alloc,
335                            unsigned *nr_effective,
336                            bool *have_cache,
337                            unsigned flags,
338                            struct open_bucket *ob)
339 {
340         unsigned durability =
341                 bch_dev_bkey_exists(c, ob->ptr.dev)->mi.durability;
342
343         __clear_bit(ob->ptr.dev, devs_may_alloc->d);
344         *nr_effective   += (flags & BUCKET_ALLOC_USE_DURABILITY)
345                 ? durability : 1;
346         *have_cache     |= !durability;
347
348         ob_push(c, ptrs, ob);
349 }
350
351 int bch2_bucket_alloc_set(struct bch_fs *c,
352                       struct open_buckets *ptrs,
353                       struct dev_stripe_state *stripe,
354                       struct bch_devs_mask *devs_may_alloc,
355                       unsigned nr_replicas,
356                       unsigned *nr_effective,
357                       bool *have_cache,
358                       enum alloc_reserve reserve,
359                       unsigned flags,
360                       struct closure *cl)
361 {
362         struct dev_alloc_list devs_sorted =
363                 bch2_dev_alloc_list(c, stripe, devs_may_alloc);
364         struct bch_dev *ca;
365         int ret = -INSUFFICIENT_DEVICES;
366         unsigned i;
367
368         BUG_ON(*nr_effective >= nr_replicas);
369
370         for (i = 0; i < devs_sorted.nr; i++) {
371                 struct open_bucket *ob;
372
373                 ca = rcu_dereference(c->devs[devs_sorted.devs[i]]);
374                 if (!ca)
375                         continue;
376
377                 if (!ca->mi.durability && *have_cache)
378                         continue;
379
380                 ob = bch2_bucket_alloc(c, ca, reserve,
381                                 flags & BUCKET_MAY_ALLOC_PARTIAL, cl);
382                 if (IS_ERR(ob)) {
383                         ret = PTR_ERR(ob);
384
385                         if (cl)
386                                 return ret;
387                         continue;
388                 }
389
390                 add_new_bucket(c, ptrs, devs_may_alloc,
391                                nr_effective, have_cache, flags, ob);
392
393                 bch2_dev_stripe_increment(ca, stripe);
394
395                 if (*nr_effective >= nr_replicas)
396                         return 0;
397         }
398
399         return ret;
400 }
401
402 /* Allocate from stripes: */
403
404 /*
405  * if we can't allocate a new stripe because there are already too many
406  * partially filled stripes, force allocating from an existing stripe even when
407  * it's to a device we don't want:
408  */
409
410 static int bucket_alloc_from_stripe(struct bch_fs *c,
411                          struct open_buckets *ptrs,
412                          struct write_point *wp,
413                          struct bch_devs_mask *devs_may_alloc,
414                          u16 target,
415                          unsigned erasure_code,
416                          unsigned nr_replicas,
417                          unsigned *nr_effective,
418                          bool *have_cache,
419                          unsigned flags,
420                          struct closure *cl)
421 {
422         struct dev_alloc_list devs_sorted;
423         struct ec_stripe_head *h;
424         struct open_bucket *ob;
425         struct bch_dev *ca;
426         unsigned i, ec_idx;
427
428         if (!erasure_code)
429                 return 0;
430
431         if (nr_replicas < 2)
432                 return 0;
433
434         if (ec_open_bucket(c, ptrs))
435                 return 0;
436
437         h = bch2_ec_stripe_head_get(c, target, 0, nr_replicas - 1,
438                                     wp == &c->copygc_write_point,
439                                     cl);
440         if (IS_ERR(h))
441                 return -PTR_ERR(h);
442         if (!h)
443                 return 0;
444
445         devs_sorted = bch2_dev_alloc_list(c, &wp->stripe, devs_may_alloc);
446
447         for (i = 0; i < devs_sorted.nr; i++)
448                 for (ec_idx = 0; ec_idx < h->s->nr_data; ec_idx++) {
449                         if (!h->s->blocks[ec_idx])
450                                 continue;
451
452                         ob = c->open_buckets + h->s->blocks[ec_idx];
453                         if (ob->ptr.dev == devs_sorted.devs[i] &&
454                             !test_and_set_bit(ec_idx, h->s->blocks_allocated))
455                                 goto got_bucket;
456                 }
457         goto out_put_head;
458 got_bucket:
459         ca = bch_dev_bkey_exists(c, ob->ptr.dev);
460
461         ob->ec_idx      = ec_idx;
462         ob->ec          = h->s;
463
464         add_new_bucket(c, ptrs, devs_may_alloc,
465                        nr_effective, have_cache, flags, ob);
466         atomic_inc(&h->s->pin);
467 out_put_head:
468         bch2_ec_stripe_head_put(c, h);
469         return 0;
470 }
471
472 /* Sector allocator */
473
474 static void get_buckets_from_writepoint(struct bch_fs *c,
475                                         struct open_buckets *ptrs,
476                                         struct write_point *wp,
477                                         struct bch_devs_mask *devs_may_alloc,
478                                         unsigned nr_replicas,
479                                         unsigned *nr_effective,
480                                         bool *have_cache,
481                                         unsigned flags,
482                                         bool need_ec)
483 {
484         struct open_buckets ptrs_skip = { .nr = 0 };
485         struct open_bucket *ob;
486         unsigned i;
487
488         open_bucket_for_each(c, &wp->ptrs, ob, i) {
489                 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->ptr.dev);
490
491                 if (*nr_effective < nr_replicas &&
492                     test_bit(ob->ptr.dev, devs_may_alloc->d) &&
493                     (ca->mi.durability ||
494                      (wp->type == BCH_DATA_user && !*have_cache)) &&
495                     (ob->ec || !need_ec)) {
496                         add_new_bucket(c, ptrs, devs_may_alloc,
497                                        nr_effective, have_cache,
498                                        flags, ob);
499                 } else {
500                         ob_push(c, &ptrs_skip, ob);
501                 }
502         }
503         wp->ptrs = ptrs_skip;
504 }
505
506 static int open_bucket_add_buckets(struct bch_fs *c,
507                         struct open_buckets *ptrs,
508                         struct write_point *wp,
509                         struct bch_devs_list *devs_have,
510                         u16 target,
511                         unsigned erasure_code,
512                         unsigned nr_replicas,
513                         unsigned *nr_effective,
514                         bool *have_cache,
515                         enum alloc_reserve reserve,
516                         unsigned flags,
517                         struct closure *_cl)
518 {
519         struct bch_devs_mask devs;
520         struct open_bucket *ob;
521         struct closure *cl = NULL;
522         int ret;
523         unsigned i;
524
525         rcu_read_lock();
526         devs = target_rw_devs(c, wp->type, target);
527         rcu_read_unlock();
528
529         /* Don't allocate from devices we already have pointers to: */
530         for (i = 0; i < devs_have->nr; i++)
531                 __clear_bit(devs_have->devs[i], devs.d);
532
533         open_bucket_for_each(c, ptrs, ob, i)
534                 __clear_bit(ob->ptr.dev, devs.d);
535
536         if (erasure_code) {
537                 if (!ec_open_bucket(c, ptrs)) {
538                         get_buckets_from_writepoint(c, ptrs, wp, &devs,
539                                                     nr_replicas, nr_effective,
540                                                     have_cache, flags, true);
541                         if (*nr_effective >= nr_replicas)
542                                 return 0;
543                 }
544
545                 if (!ec_open_bucket(c, ptrs)) {
546                         ret = bucket_alloc_from_stripe(c, ptrs, wp, &devs,
547                                                  target, erasure_code,
548                                                  nr_replicas, nr_effective,
549                                                  have_cache, flags, _cl);
550                         if (ret == -FREELIST_EMPTY ||
551                             ret == -OPEN_BUCKETS_EMPTY)
552                                 return ret;
553                         if (*nr_effective >= nr_replicas)
554                                 return 0;
555                 }
556         }
557
558         get_buckets_from_writepoint(c, ptrs, wp, &devs,
559                                     nr_replicas, nr_effective,
560                                     have_cache, flags, false);
561         if (*nr_effective >= nr_replicas)
562                 return 0;
563
564         percpu_down_read(&c->mark_lock);
565         rcu_read_lock();
566
567 retry_blocking:
568         /*
569          * Try nonblocking first, so that if one device is full we'll try from
570          * other devices:
571          */
572         ret = bch2_bucket_alloc_set(c, ptrs, &wp->stripe, &devs,
573                                 nr_replicas, nr_effective, have_cache,
574                                 reserve, flags, cl);
575         if (ret && ret != -INSUFFICIENT_DEVICES && !cl && _cl) {
576                 cl = _cl;
577                 goto retry_blocking;
578         }
579
580         rcu_read_unlock();
581         percpu_up_read(&c->mark_lock);
582
583         return ret;
584 }
585
586 void bch2_open_buckets_stop_dev(struct bch_fs *c, struct bch_dev *ca,
587                                 struct open_buckets *obs)
588 {
589         struct open_buckets ptrs = { .nr = 0 };
590         struct open_bucket *ob, *ob2;
591         unsigned i, j;
592
593         open_bucket_for_each(c, obs, ob, i) {
594                 bool drop = !ca || ob->ptr.dev == ca->dev_idx;
595
596                 if (!drop && ob->ec) {
597                         mutex_lock(&ob->ec->lock);
598                         for (j = 0; j < ob->ec->new_stripe.key.v.nr_blocks; j++) {
599                                 if (!ob->ec->blocks[j])
600                                         continue;
601
602                                 ob2 = c->open_buckets + ob->ec->blocks[j];
603                                 drop |= ob2->ptr.dev == ca->dev_idx;
604                         }
605                         mutex_unlock(&ob->ec->lock);
606                 }
607
608                 if (drop)
609                         bch2_open_bucket_put(c, ob);
610                 else
611                         ob_push(c, &ptrs, ob);
612         }
613
614         *obs = ptrs;
615 }
616
617 void bch2_writepoint_stop(struct bch_fs *c, struct bch_dev *ca,
618                           struct write_point *wp)
619 {
620         mutex_lock(&wp->lock);
621         bch2_open_buckets_stop_dev(c, ca, &wp->ptrs);
622         mutex_unlock(&wp->lock);
623 }
624
625 static inline struct hlist_head *writepoint_hash(struct bch_fs *c,
626                                                  unsigned long write_point)
627 {
628         unsigned hash =
629                 hash_long(write_point, ilog2(ARRAY_SIZE(c->write_points_hash)));
630
631         return &c->write_points_hash[hash];
632 }
633
634 static struct write_point *__writepoint_find(struct hlist_head *head,
635                                              unsigned long write_point)
636 {
637         struct write_point *wp;
638
639         rcu_read_lock();
640         hlist_for_each_entry_rcu(wp, head, node)
641                 if (wp->write_point == write_point)
642                         goto out;
643         wp = NULL;
644 out:
645         rcu_read_unlock();
646         return wp;
647 }
648
649 static inline bool too_many_writepoints(struct bch_fs *c, unsigned factor)
650 {
651         u64 stranded    = c->write_points_nr * c->bucket_size_max;
652         u64 free        = bch2_fs_usage_read_short(c).free;
653
654         return stranded * factor > free;
655 }
656
657 static bool try_increase_writepoints(struct bch_fs *c)
658 {
659         struct write_point *wp;
660
661         if (c->write_points_nr == ARRAY_SIZE(c->write_points) ||
662             too_many_writepoints(c, 32))
663                 return false;
664
665         wp = c->write_points + c->write_points_nr++;
666         hlist_add_head_rcu(&wp->node, writepoint_hash(c, wp->write_point));
667         return true;
668 }
669
670 static bool try_decrease_writepoints(struct bch_fs *c,
671                                      unsigned old_nr)
672 {
673         struct write_point *wp;
674
675         mutex_lock(&c->write_points_hash_lock);
676         if (c->write_points_nr < old_nr) {
677                 mutex_unlock(&c->write_points_hash_lock);
678                 return true;
679         }
680
681         if (c->write_points_nr == 1 ||
682             !too_many_writepoints(c, 8)) {
683                 mutex_unlock(&c->write_points_hash_lock);
684                 return false;
685         }
686
687         wp = c->write_points + --c->write_points_nr;
688
689         hlist_del_rcu(&wp->node);
690         mutex_unlock(&c->write_points_hash_lock);
691
692         bch2_writepoint_stop(c, NULL, wp);
693         return true;
694 }
695
696 static struct write_point *writepoint_find(struct bch_fs *c,
697                                            unsigned long write_point)
698 {
699         struct write_point *wp, *oldest;
700         struct hlist_head *head;
701
702         if (!(write_point & 1UL)) {
703                 wp = (struct write_point *) write_point;
704                 mutex_lock(&wp->lock);
705                 return wp;
706         }
707
708         head = writepoint_hash(c, write_point);
709 restart_find:
710         wp = __writepoint_find(head, write_point);
711         if (wp) {
712 lock_wp:
713                 mutex_lock(&wp->lock);
714                 if (wp->write_point == write_point)
715                         goto out;
716                 mutex_unlock(&wp->lock);
717                 goto restart_find;
718         }
719 restart_find_oldest:
720         oldest = NULL;
721         for (wp = c->write_points;
722              wp < c->write_points + c->write_points_nr; wp++)
723                 if (!oldest || time_before64(wp->last_used, oldest->last_used))
724                         oldest = wp;
725
726         mutex_lock(&oldest->lock);
727         mutex_lock(&c->write_points_hash_lock);
728         if (oldest >= c->write_points + c->write_points_nr ||
729             try_increase_writepoints(c)) {
730                 mutex_unlock(&c->write_points_hash_lock);
731                 mutex_unlock(&oldest->lock);
732                 goto restart_find_oldest;
733         }
734
735         wp = __writepoint_find(head, write_point);
736         if (wp && wp != oldest) {
737                 mutex_unlock(&c->write_points_hash_lock);
738                 mutex_unlock(&oldest->lock);
739                 goto lock_wp;
740         }
741
742         wp = oldest;
743         hlist_del_rcu(&wp->node);
744         wp->write_point = write_point;
745         hlist_add_head_rcu(&wp->node, head);
746         mutex_unlock(&c->write_points_hash_lock);
747 out:
748         wp->last_used = sched_clock();
749         return wp;
750 }
751
752 /*
753  * Get us an open_bucket we can allocate from, return with it locked:
754  */
755 struct write_point *bch2_alloc_sectors_start(struct bch_fs *c,
756                                 unsigned target,
757                                 unsigned erasure_code,
758                                 struct write_point_specifier write_point,
759                                 struct bch_devs_list *devs_have,
760                                 unsigned nr_replicas,
761                                 unsigned nr_replicas_required,
762                                 enum alloc_reserve reserve,
763                                 unsigned flags,
764                                 struct closure *cl)
765 {
766         struct write_point *wp;
767         struct open_bucket *ob;
768         struct open_buckets ptrs;
769         unsigned nr_effective, write_points_nr;
770         unsigned ob_flags = 0;
771         bool have_cache;
772         int ret;
773         int i;
774
775         if (!(flags & BCH_WRITE_ONLY_SPECIFIED_DEVS))
776                 ob_flags |= BUCKET_ALLOC_USE_DURABILITY;
777
778         BUG_ON(!nr_replicas || !nr_replicas_required);
779 retry:
780         ptrs.nr         = 0;
781         nr_effective    = 0;
782         write_points_nr = c->write_points_nr;
783         have_cache      = false;
784
785         wp = writepoint_find(c, write_point.v);
786
787         if (wp->type == BCH_DATA_user)
788                 ob_flags |= BUCKET_MAY_ALLOC_PARTIAL;
789
790         /* metadata may not allocate on cache devices: */
791         if (wp->type != BCH_DATA_user)
792                 have_cache = true;
793
794         if (!target || (flags & BCH_WRITE_ONLY_SPECIFIED_DEVS)) {
795                 ret = open_bucket_add_buckets(c, &ptrs, wp, devs_have,
796                                               target, erasure_code,
797                                               nr_replicas, &nr_effective,
798                                               &have_cache, reserve,
799                                               ob_flags, cl);
800         } else {
801                 ret = open_bucket_add_buckets(c, &ptrs, wp, devs_have,
802                                               target, erasure_code,
803                                               nr_replicas, &nr_effective,
804                                               &have_cache, reserve,
805                                               ob_flags, NULL);
806                 if (!ret)
807                         goto alloc_done;
808
809                 ret = open_bucket_add_buckets(c, &ptrs, wp, devs_have,
810                                               0, erasure_code,
811                                               nr_replicas, &nr_effective,
812                                               &have_cache, reserve,
813                                               ob_flags, cl);
814         }
815 alloc_done:
816         BUG_ON(!ret && nr_effective < nr_replicas);
817
818         if (erasure_code && !ec_open_bucket(c, &ptrs))
819                 pr_debug("failed to get ec bucket: ret %u", ret);
820
821         if (ret == -INSUFFICIENT_DEVICES &&
822             nr_effective >= nr_replicas_required)
823                 ret = 0;
824
825         if (ret)
826                 goto err;
827
828         /* Free buckets we didn't use: */
829         open_bucket_for_each(c, &wp->ptrs, ob, i)
830                 open_bucket_free_unused(c, wp, ob);
831
832         wp->ptrs = ptrs;
833
834         wp->sectors_free = UINT_MAX;
835
836         open_bucket_for_each(c, &wp->ptrs, ob, i)
837                 wp->sectors_free = min(wp->sectors_free, ob->sectors_free);
838
839         BUG_ON(!wp->sectors_free || wp->sectors_free == UINT_MAX);
840
841         verify_not_stale(c, &wp->ptrs);
842
843         return wp;
844 err:
845         open_bucket_for_each(c, &wp->ptrs, ob, i)
846                 if (ptrs.nr < ARRAY_SIZE(ptrs.v))
847                         ob_push(c, &ptrs, ob);
848                 else
849                         open_bucket_free_unused(c, wp, ob);
850         wp->ptrs = ptrs;
851
852         mutex_unlock(&wp->lock);
853
854         if (ret == -FREELIST_EMPTY &&
855             try_decrease_writepoints(c, write_points_nr))
856                 goto retry;
857
858         switch (ret) {
859         case -OPEN_BUCKETS_EMPTY:
860         case -FREELIST_EMPTY:
861                 return cl ? ERR_PTR(-EAGAIN) : ERR_PTR(-ENOSPC);
862         case -INSUFFICIENT_DEVICES:
863                 return ERR_PTR(-EROFS);
864         default:
865                 BUG();
866         }
867 }
868
869 /*
870  * Append pointers to the space we just allocated to @k, and mark @sectors space
871  * as allocated out of @ob
872  */
873 void bch2_alloc_sectors_append_ptrs(struct bch_fs *c, struct write_point *wp,
874                                     struct bkey_i *k, unsigned sectors)
875
876 {
877         struct open_bucket *ob;
878         unsigned i;
879
880         BUG_ON(sectors > wp->sectors_free);
881         wp->sectors_free -= sectors;
882
883         open_bucket_for_each(c, &wp->ptrs, ob, i) {
884                 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->ptr.dev);
885                 struct bch_extent_ptr tmp = ob->ptr;
886
887                 tmp.cached = !ca->mi.durability &&
888                         wp->type == BCH_DATA_user;
889
890                 tmp.offset += ca->mi.bucket_size - ob->sectors_free;
891                 bch2_bkey_append_ptr(k, tmp);
892
893                 BUG_ON(sectors > ob->sectors_free);
894                 ob->sectors_free -= sectors;
895         }
896 }
897
898 /*
899  * Append pointers to the space we just allocated to @k, and mark @sectors space
900  * as allocated out of @ob
901  */
902 void bch2_alloc_sectors_done(struct bch_fs *c, struct write_point *wp)
903 {
904         struct open_buckets ptrs = { .nr = 0 }, keep = { .nr = 0 };
905         struct open_bucket *ob;
906         unsigned i;
907
908         open_bucket_for_each(c, &wp->ptrs, ob, i)
909                 ob_push(c, !ob->sectors_free ? &ptrs : &keep, ob);
910         wp->ptrs = keep;
911
912         mutex_unlock(&wp->lock);
913
914         bch2_open_buckets_put(c, &ptrs);
915 }
916
917 static inline void writepoint_init(struct write_point *wp,
918                                    enum bch_data_type type)
919 {
920         mutex_init(&wp->lock);
921         wp->type = type;
922 }
923
924 void bch2_fs_allocator_foreground_init(struct bch_fs *c)
925 {
926         struct open_bucket *ob;
927         struct write_point *wp;
928
929         mutex_init(&c->write_points_hash_lock);
930         c->write_points_nr = ARRAY_SIZE(c->write_points);
931
932         /* open bucket 0 is a sentinal NULL: */
933         spin_lock_init(&c->open_buckets[0].lock);
934
935         for (ob = c->open_buckets + 1;
936              ob < c->open_buckets + ARRAY_SIZE(c->open_buckets); ob++) {
937                 spin_lock_init(&ob->lock);
938                 c->open_buckets_nr_free++;
939
940                 ob->freelist = c->open_buckets_freelist;
941                 c->open_buckets_freelist = ob - c->open_buckets;
942         }
943
944         writepoint_init(&c->btree_write_point,          BCH_DATA_btree);
945         writepoint_init(&c->rebalance_write_point,      BCH_DATA_user);
946         writepoint_init(&c->copygc_write_point,         BCH_DATA_user);
947
948         for (wp = c->write_points;
949              wp < c->write_points + c->write_points_nr; wp++) {
950                 writepoint_init(wp, BCH_DATA_user);
951
952                 wp->last_used   = sched_clock();
953                 wp->write_point = (unsigned long) wp;
954                 hlist_add_head_rcu(&wp->node,
955                                    writepoint_hash(c, wp->write_point));
956         }
957 }