1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright 2012 Google, Inc.
5 * Foreground allocator code: allocate buckets from freelist, and allocate in
6 * sector granularity from writepoints.
8 * bch2_bucket_alloc() allocates a single bucket from a specific device.
10 * bch2_bucket_alloc_set() allocates one or more buckets from different devices
11 * in a given filesystem.
15 #include "alloc_background.h"
16 #include "alloc_foreground.h"
17 #include "btree_iter.h"
18 #include "btree_update.h"
21 #include "buckets_waiting_for_journal.h"
24 #include "disk_groups.h"
30 #include <linux/math64.h>
31 #include <linux/rculist.h>
32 #include <linux/rcupdate.h>
33 #include <trace/events/bcachefs.h>
35 const char * const bch2_alloc_reserves[] = {
43 * Open buckets represent a bucket that's currently being allocated from. They
46 * - They track buckets that have been partially allocated, allowing for
47 * sub-bucket sized allocations - they're used by the sector allocator below
49 * - They provide a reference to the buckets they own that mark and sweep GC
50 * can find, until the new allocation has a pointer to it inserted into the
53 * When allocating some space with the sector allocator, the allocation comes
54 * with a reference to an open bucket - the caller is required to put that
55 * reference _after_ doing the index update that makes its allocation reachable.
58 static void bch2_open_bucket_hash_add(struct bch_fs *c, struct open_bucket *ob)
60 open_bucket_idx_t idx = ob - c->open_buckets;
61 open_bucket_idx_t *slot = open_bucket_hashslot(c, ob->dev, ob->bucket);
67 static void bch2_open_bucket_hash_remove(struct bch_fs *c, struct open_bucket *ob)
69 open_bucket_idx_t idx = ob - c->open_buckets;
70 open_bucket_idx_t *slot = open_bucket_hashslot(c, ob->dev, ob->bucket);
72 while (*slot != idx) {
74 slot = &c->open_buckets[*slot].hash;
81 void __bch2_open_bucket_put(struct bch_fs *c, struct open_bucket *ob)
83 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->dev);
86 bch2_ec_bucket_written(c, ob);
90 percpu_down_read(&c->mark_lock);
96 spin_unlock(&ob->lock);
97 percpu_up_read(&c->mark_lock);
99 spin_lock(&c->freelist_lock);
100 bch2_open_bucket_hash_remove(c, ob);
102 ob->freelist = c->open_buckets_freelist;
103 c->open_buckets_freelist = ob - c->open_buckets;
105 c->open_buckets_nr_free++;
106 ca->nr_open_buckets--;
107 spin_unlock(&c->freelist_lock);
109 closure_wake_up(&c->open_buckets_wait);
112 void bch2_open_bucket_write_error(struct bch_fs *c,
113 struct open_buckets *obs,
116 struct open_bucket *ob;
119 open_bucket_for_each(c, obs, ob, i)
120 if (ob->dev == dev && ob->ec)
121 bch2_ec_bucket_cancel(c, ob);
124 static struct open_bucket *bch2_open_bucket_alloc(struct bch_fs *c)
126 struct open_bucket *ob;
128 BUG_ON(!c->open_buckets_freelist || !c->open_buckets_nr_free);
130 ob = c->open_buckets + c->open_buckets_freelist;
131 c->open_buckets_freelist = ob->freelist;
132 atomic_set(&ob->pin, 1);
135 c->open_buckets_nr_free--;
139 static void open_bucket_free_unused(struct bch_fs *c,
140 struct write_point *wp,
141 struct open_bucket *ob)
143 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->dev);
144 bool may_realloc = wp->data_type == BCH_DATA_user;
146 BUG_ON(ca->open_buckets_partial_nr >
147 ARRAY_SIZE(ca->open_buckets_partial));
149 if (ca->open_buckets_partial_nr <
150 ARRAY_SIZE(ca->open_buckets_partial) &&
152 spin_lock(&c->freelist_lock);
153 ob->on_partial_list = true;
154 ca->open_buckets_partial[ca->open_buckets_partial_nr++] =
155 ob - c->open_buckets;
156 spin_unlock(&c->freelist_lock);
158 closure_wake_up(&c->open_buckets_wait);
159 closure_wake_up(&c->freelist_wait);
161 bch2_open_bucket_put(c, ob);
165 /* _only_ for allocating the journal on a new device: */
166 long bch2_bucket_alloc_new_fs(struct bch_dev *ca)
168 while (ca->new_fs_bucket_idx < ca->mi.nbuckets) {
169 u64 b = ca->new_fs_bucket_idx++;
171 if (!is_superblock_bucket(ca, b) &&
172 (!ca->buckets_nouse || !test_bit(b, ca->buckets_nouse)))
179 static inline unsigned open_buckets_reserved(enum alloc_reserve reserve)
183 case RESERVE_btree_movinggc:
185 case RESERVE_movinggc:
186 return OPEN_BUCKETS_COUNT / 4;
188 return OPEN_BUCKETS_COUNT / 2;
192 static struct open_bucket *__try_alloc_bucket(struct bch_fs *c, struct bch_dev *ca,
194 enum alloc_reserve reserve,
195 struct bch_alloc_v4 *a,
197 u64 *skipped_need_journal_commit,
201 struct open_bucket *ob;
203 if (unlikely(ca->buckets_nouse && test_bit(bucket, ca->buckets_nouse))) {
208 if (bch2_bucket_is_open(c, ca->dev_idx, bucket)) {
213 if (bch2_bucket_needs_journal_commit(&c->buckets_waiting_for_journal,
214 c->journal.flushed_seq_ondisk, ca->dev_idx, bucket)) {
215 (*skipped_need_journal_commit)++;
219 spin_lock(&c->freelist_lock);
221 if (unlikely(c->open_buckets_nr_free <= open_buckets_reserved(reserve))) {
223 closure_wait(&c->open_buckets_wait, cl);
225 if (!c->blocked_allocate_open_bucket)
226 c->blocked_allocate_open_bucket = local_clock();
228 spin_unlock(&c->freelist_lock);
230 trace_open_bucket_alloc_fail(ca, bch2_alloc_reserves[reserve]);
231 return ERR_PTR(-OPEN_BUCKETS_EMPTY);
234 /* Recheck under lock: */
235 if (bch2_bucket_is_open(c, ca->dev_idx, bucket)) {
236 spin_unlock(&c->freelist_lock);
241 ob = bch2_open_bucket_alloc(c);
243 spin_lock(&ob->lock);
246 ob->sectors_free = ca->mi.bucket_size;
247 ob->alloc_reserve = reserve;
248 ob->dev = ca->dev_idx;
251 spin_unlock(&ob->lock);
253 ca->nr_open_buckets++;
254 bch2_open_bucket_hash_add(c, ob);
256 if (c->blocked_allocate_open_bucket) {
257 bch2_time_stats_update(
258 &c->times[BCH_TIME_blocked_allocate_open_bucket],
259 c->blocked_allocate_open_bucket);
260 c->blocked_allocate_open_bucket = 0;
263 if (c->blocked_allocate) {
264 bch2_time_stats_update(
265 &c->times[BCH_TIME_blocked_allocate],
266 c->blocked_allocate);
267 c->blocked_allocate = 0;
270 spin_unlock(&c->freelist_lock);
272 trace_bucket_alloc(ca, bch2_alloc_reserves[reserve]);
276 static struct open_bucket *try_alloc_bucket(struct btree_trans *trans, struct bch_dev *ca,
277 enum alloc_reserve reserve, u64 free_entry,
279 u64 *skipped_need_journal_commit,
283 struct bch_fs *c = trans->c;
284 struct btree_iter iter;
286 struct open_bucket *ob;
287 struct bch_alloc_v4 a;
288 u64 b = free_entry & ~(~0ULL << 56);
289 unsigned genbits = free_entry >> 56;
290 struct printbuf buf = PRINTBUF;
293 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, POS(ca->dev_idx, b), BTREE_ITER_CACHED);
294 k = bch2_btree_iter_peek_slot(&iter);
301 bch2_alloc_to_v4(k, &a);
303 if (bch2_fs_inconsistent_on(a.data_type != BCH_DATA_free, c,
304 "non free bucket in freespace btree (state %s)\n"
306 " at %llu (genbits %u)",
307 bch2_data_types[a.data_type],
308 (bch2_bkey_val_to_text(&buf, c, k), buf.buf),
309 free_entry, genbits)) {
314 if (bch2_fs_inconsistent_on(genbits != (alloc_freespace_genbits(a) >> 56), c,
315 "bucket in freespace btree with wrong genbits (got %u should be %llu)\n"
317 genbits, alloc_freespace_genbits(a) >> 56,
318 (bch2_bkey_val_to_text(&buf, c, k), buf.buf))) {
323 if (bch2_fs_inconsistent_on(b < ca->mi.first_bucket || b >= ca->mi.nbuckets, c,
324 "freespace btree has bucket outside allowed range (got %llu, valid %u-%llu)",
325 b, ca->mi.first_bucket, ca->mi.nbuckets)) {
330 ob = __try_alloc_bucket(c, ca, b, reserve, &a,
332 skipped_need_journal_commit,
336 bch2_trans_iter_exit(trans, &iter);
341 static struct open_bucket *try_alloc_partial_bucket(struct bch_fs *c, struct bch_dev *ca,
342 enum alloc_reserve reserve)
344 struct open_bucket *ob;
347 spin_lock(&c->freelist_lock);
349 for (i = ca->open_buckets_partial_nr - 1; i >= 0; --i) {
350 ob = c->open_buckets + ca->open_buckets_partial[i];
352 if (reserve <= ob->alloc_reserve) {
353 array_remove_item(ca->open_buckets_partial,
354 ca->open_buckets_partial_nr,
356 ob->on_partial_list = false;
357 ob->alloc_reserve = reserve;
358 spin_unlock(&c->freelist_lock);
363 spin_unlock(&c->freelist_lock);
368 * This path is for before the freespace btree is initialized:
370 * If ca->new_fs_bucket_idx is nonzero, we haven't yet marked superblock &
371 * journal buckets - journal buckets will be < ca->new_fs_bucket_idx
373 static noinline struct open_bucket *
374 bch2_bucket_alloc_trans_early(struct btree_trans *trans,
376 enum alloc_reserve reserve,
380 u64 *skipped_need_journal_commit,
384 struct btree_iter iter;
386 struct open_bucket *ob = NULL;
389 *cur_bucket = max_t(u64, *cur_bucket, ca->mi.first_bucket);
390 *cur_bucket = max_t(u64, *cur_bucket, ca->new_fs_bucket_idx);
392 for_each_btree_key(trans, iter, BTREE_ID_alloc, POS(ca->dev_idx, *cur_bucket),
393 BTREE_ITER_SLOTS, k, ret) {
394 struct bch_alloc_v4 a;
396 if (bkey_cmp(k.k->p, POS(ca->dev_idx, ca->mi.nbuckets)) >= 0)
399 if (ca->new_fs_bucket_idx &&
400 is_superblock_bucket(ca, k.k->p.offset))
403 bch2_alloc_to_v4(k, &a);
405 if (a.data_type != BCH_DATA_free)
410 ob = __try_alloc_bucket(trans->c, ca, k.k->p.offset, reserve, &a,
412 skipped_need_journal_commit,
418 bch2_trans_iter_exit(trans, &iter);
420 *cur_bucket = iter.pos.offset;
422 return ob ?: ERR_PTR(ret ?: -FREELIST_EMPTY);
425 static struct open_bucket *bch2_bucket_alloc_trans(struct btree_trans *trans,
427 enum alloc_reserve reserve,
431 u64 *skipped_need_journal_commit,
435 struct btree_iter iter;
437 struct open_bucket *ob = NULL;
440 if (unlikely(!ca->mi.freespace_initialized))
441 return bch2_bucket_alloc_trans_early(trans, ca, reserve,
445 skipped_need_journal_commit,
449 BUG_ON(ca->new_fs_bucket_idx);
451 for_each_btree_key(trans, iter, BTREE_ID_freespace,
452 POS(ca->dev_idx, *cur_bucket), 0, k, ret) {
453 if (k.k->p.inode != ca->dev_idx)
456 for (*cur_bucket = max(*cur_bucket, bkey_start_offset(k.k));
457 *cur_bucket != k.k->p.offset && !ob;
459 if (btree_trans_too_many_iters(trans)) {
460 ob = ERR_PTR(-EINTR);
466 ob = try_alloc_bucket(trans, ca, reserve,
469 skipped_need_journal_commit,
476 bch2_trans_iter_exit(trans, &iter);
478 return ob ?: ERR_PTR(ret);
482 * bch_bucket_alloc - allocate a single bucket from a specific device
484 * Returns index of bucket on success, 0 on failure
486 struct open_bucket *bch2_bucket_alloc(struct bch_fs *c, struct bch_dev *ca,
487 enum alloc_reserve reserve,
488 bool may_alloc_partial,
491 struct open_bucket *ob = NULL;
492 struct bch_dev_usage usage;
495 u64 buckets_seen = 0;
496 u64 skipped_open = 0;
497 u64 skipped_need_journal_commit = 0;
498 u64 skipped_nouse = 0;
499 bool waiting = false;
502 usage = bch2_dev_usage_read(ca);
503 avail = __dev_buckets_available(ca, usage,reserve);
505 if (usage.d[BCH_DATA_need_discard].buckets > avail)
508 if (usage.d[BCH_DATA_need_gc_gens].buckets > avail)
511 if (should_invalidate_buckets(ca, usage))
512 bch2_do_invalidates(c);
515 if (cl && !waiting) {
516 closure_wait(&c->freelist_wait, cl);
521 if (!c->blocked_allocate)
522 c->blocked_allocate = local_clock();
524 ob = ERR_PTR(-FREELIST_EMPTY);
529 closure_wake_up(&c->freelist_wait);
531 if (may_alloc_partial) {
532 ob = try_alloc_partial_bucket(c, ca, reserve);
537 ret = bch2_trans_do(c, NULL, NULL, 0,
538 PTR_ERR_OR_ZERO(ob = bch2_bucket_alloc_trans(&trans, ca, reserve,
542 &skipped_need_journal_commit,
546 if (skipped_need_journal_commit * 2 > avail)
547 bch2_journal_flush_async(&c->journal, NULL);
550 ob = ERR_PTR(ret ?: -FREELIST_EMPTY);
553 trace_bucket_alloc_fail(ca, bch2_alloc_reserves[reserve], avail,
556 skipped_need_journal_commit,
558 cl == NULL, PTR_ERR(ob));
559 atomic_long_inc(&c->bucket_alloc_fail);
565 static int __dev_stripe_cmp(struct dev_stripe_state *stripe,
566 unsigned l, unsigned r)
568 return ((stripe->next_alloc[l] > stripe->next_alloc[r]) -
569 (stripe->next_alloc[l] < stripe->next_alloc[r]));
572 #define dev_stripe_cmp(l, r) __dev_stripe_cmp(stripe, l, r)
574 struct dev_alloc_list bch2_dev_alloc_list(struct bch_fs *c,
575 struct dev_stripe_state *stripe,
576 struct bch_devs_mask *devs)
578 struct dev_alloc_list ret = { .nr = 0 };
581 for_each_set_bit(i, devs->d, BCH_SB_MEMBERS_MAX)
582 ret.devs[ret.nr++] = i;
584 bubble_sort(ret.devs, ret.nr, dev_stripe_cmp);
588 void bch2_dev_stripe_increment(struct bch_dev *ca,
589 struct dev_stripe_state *stripe)
591 u64 *v = stripe->next_alloc + ca->dev_idx;
592 u64 free_space = dev_buckets_available(ca, RESERVE_none);
593 u64 free_space_inv = free_space
594 ? div64_u64(1ULL << 48, free_space)
598 if (*v + free_space_inv >= *v)
599 *v += free_space_inv;
603 for (v = stripe->next_alloc;
604 v < stripe->next_alloc + ARRAY_SIZE(stripe->next_alloc); v++)
605 *v = *v < scale ? 0 : *v - scale;
608 #define BUCKET_MAY_ALLOC_PARTIAL (1 << 0)
609 #define BUCKET_ALLOC_USE_DURABILITY (1 << 1)
611 static void add_new_bucket(struct bch_fs *c,
612 struct open_buckets *ptrs,
613 struct bch_devs_mask *devs_may_alloc,
614 unsigned *nr_effective,
617 struct open_bucket *ob)
619 unsigned durability =
620 bch_dev_bkey_exists(c, ob->dev)->mi.durability;
622 __clear_bit(ob->dev, devs_may_alloc->d);
623 *nr_effective += (flags & BUCKET_ALLOC_USE_DURABILITY)
625 *have_cache |= !durability;
627 ob_push(c, ptrs, ob);
630 int bch2_bucket_alloc_set(struct bch_fs *c,
631 struct open_buckets *ptrs,
632 struct dev_stripe_state *stripe,
633 struct bch_devs_mask *devs_may_alloc,
634 unsigned nr_replicas,
635 unsigned *nr_effective,
637 enum alloc_reserve reserve,
641 struct dev_alloc_list devs_sorted =
642 bch2_dev_alloc_list(c, stripe, devs_may_alloc);
645 int ret = -INSUFFICIENT_DEVICES;
648 BUG_ON(*nr_effective >= nr_replicas);
650 for (i = 0; i < devs_sorted.nr; i++) {
651 struct open_bucket *ob;
653 dev = devs_sorted.devs[i];
656 ca = rcu_dereference(c->devs[dev]);
658 percpu_ref_get(&ca->ref);
664 if (!ca->mi.durability && *have_cache) {
665 percpu_ref_put(&ca->ref);
669 ob = bch2_bucket_alloc(c, ca, reserve,
670 flags & BUCKET_MAY_ALLOC_PARTIAL, cl);
672 bch2_dev_stripe_increment(ca, stripe);
673 percpu_ref_put(&ca->ref);
683 add_new_bucket(c, ptrs, devs_may_alloc,
684 nr_effective, have_cache, flags, ob);
686 if (*nr_effective >= nr_replicas) {
695 /* Allocate from stripes: */
698 * if we can't allocate a new stripe because there are already too many
699 * partially filled stripes, force allocating from an existing stripe even when
700 * it's to a device we don't want:
703 static int bucket_alloc_from_stripe(struct bch_fs *c,
704 struct open_buckets *ptrs,
705 struct write_point *wp,
706 struct bch_devs_mask *devs_may_alloc,
708 unsigned erasure_code,
709 unsigned nr_replicas,
710 unsigned *nr_effective,
715 struct dev_alloc_list devs_sorted;
716 struct ec_stripe_head *h;
717 struct open_bucket *ob;
727 if (ec_open_bucket(c, ptrs))
730 h = bch2_ec_stripe_head_get(c, target, 0, nr_replicas - 1,
731 wp == &c->copygc_write_point,
738 devs_sorted = bch2_dev_alloc_list(c, &wp->stripe, devs_may_alloc);
740 for (i = 0; i < devs_sorted.nr; i++)
741 for (ec_idx = 0; ec_idx < h->s->nr_data; ec_idx++) {
742 if (!h->s->blocks[ec_idx])
745 ob = c->open_buckets + h->s->blocks[ec_idx];
746 if (ob->dev == devs_sorted.devs[i] &&
747 !test_and_set_bit(ec_idx, h->s->blocks_allocated))
752 ca = bch_dev_bkey_exists(c, ob->dev);
757 add_new_bucket(c, ptrs, devs_may_alloc,
758 nr_effective, have_cache, flags, ob);
759 atomic_inc(&h->s->pin);
761 bch2_ec_stripe_head_put(c, h);
765 /* Sector allocator */
767 static void get_buckets_from_writepoint(struct bch_fs *c,
768 struct open_buckets *ptrs,
769 struct write_point *wp,
770 struct bch_devs_mask *devs_may_alloc,
771 unsigned nr_replicas,
772 unsigned *nr_effective,
777 struct open_buckets ptrs_skip = { .nr = 0 };
778 struct open_bucket *ob;
781 open_bucket_for_each(c, &wp->ptrs, ob, i) {
782 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->dev);
784 if (*nr_effective < nr_replicas &&
785 test_bit(ob->dev, devs_may_alloc->d) &&
786 (ca->mi.durability ||
787 (wp->data_type == BCH_DATA_user && !*have_cache)) &&
788 (ob->ec || !need_ec)) {
789 add_new_bucket(c, ptrs, devs_may_alloc,
790 nr_effective, have_cache,
793 ob_push(c, &ptrs_skip, ob);
796 wp->ptrs = ptrs_skip;
799 static int open_bucket_add_buckets(struct bch_fs *c,
800 struct open_buckets *ptrs,
801 struct write_point *wp,
802 struct bch_devs_list *devs_have,
804 unsigned erasure_code,
805 unsigned nr_replicas,
806 unsigned *nr_effective,
808 enum alloc_reserve reserve,
812 struct bch_devs_mask devs;
813 struct open_bucket *ob;
814 struct closure *cl = NULL;
819 devs = target_rw_devs(c, wp->data_type, target);
822 /* Don't allocate from devices we already have pointers to: */
823 for (i = 0; i < devs_have->nr; i++)
824 __clear_bit(devs_have->devs[i], devs.d);
826 open_bucket_for_each(c, ptrs, ob, i)
827 __clear_bit(ob->dev, devs.d);
830 if (!ec_open_bucket(c, ptrs)) {
831 get_buckets_from_writepoint(c, ptrs, wp, &devs,
832 nr_replicas, nr_effective,
833 have_cache, flags, true);
834 if (*nr_effective >= nr_replicas)
838 if (!ec_open_bucket(c, ptrs)) {
839 ret = bucket_alloc_from_stripe(c, ptrs, wp, &devs,
840 target, erasure_code,
841 nr_replicas, nr_effective,
842 have_cache, flags, _cl);
843 if (ret == -FREELIST_EMPTY ||
844 ret == -OPEN_BUCKETS_EMPTY)
846 if (*nr_effective >= nr_replicas)
851 get_buckets_from_writepoint(c, ptrs, wp, &devs,
852 nr_replicas, nr_effective,
853 have_cache, flags, false);
854 if (*nr_effective >= nr_replicas)
859 * Try nonblocking first, so that if one device is full we'll try from
862 ret = bch2_bucket_alloc_set(c, ptrs, &wp->stripe, &devs,
863 nr_replicas, nr_effective, have_cache,
865 if (ret && ret != -INSUFFICIENT_DEVICES && !cl && _cl) {
873 void bch2_open_buckets_stop_dev(struct bch_fs *c, struct bch_dev *ca,
874 struct open_buckets *obs)
876 struct open_buckets ptrs = { .nr = 0 };
877 struct open_bucket *ob, *ob2;
880 open_bucket_for_each(c, obs, ob, i) {
881 bool drop = !ca || ob->dev == ca->dev_idx;
883 if (!drop && ob->ec) {
884 mutex_lock(&ob->ec->lock);
885 for (j = 0; j < ob->ec->new_stripe.key.v.nr_blocks; j++) {
886 if (!ob->ec->blocks[j])
889 ob2 = c->open_buckets + ob->ec->blocks[j];
890 drop |= ob2->dev == ca->dev_idx;
892 mutex_unlock(&ob->ec->lock);
896 bch2_open_bucket_put(c, ob);
898 ob_push(c, &ptrs, ob);
904 void bch2_writepoint_stop(struct bch_fs *c, struct bch_dev *ca,
905 struct write_point *wp)
907 mutex_lock(&wp->lock);
908 bch2_open_buckets_stop_dev(c, ca, &wp->ptrs);
909 mutex_unlock(&wp->lock);
912 static inline struct hlist_head *writepoint_hash(struct bch_fs *c,
913 unsigned long write_point)
916 hash_long(write_point, ilog2(ARRAY_SIZE(c->write_points_hash)));
918 return &c->write_points_hash[hash];
921 static struct write_point *__writepoint_find(struct hlist_head *head,
922 unsigned long write_point)
924 struct write_point *wp;
927 hlist_for_each_entry_rcu(wp, head, node)
928 if (wp->write_point == write_point)
936 static inline bool too_many_writepoints(struct bch_fs *c, unsigned factor)
938 u64 stranded = c->write_points_nr * c->bucket_size_max;
939 u64 free = bch2_fs_usage_read_short(c).free;
941 return stranded * factor > free;
944 static bool try_increase_writepoints(struct bch_fs *c)
946 struct write_point *wp;
948 if (c->write_points_nr == ARRAY_SIZE(c->write_points) ||
949 too_many_writepoints(c, 32))
952 wp = c->write_points + c->write_points_nr++;
953 hlist_add_head_rcu(&wp->node, writepoint_hash(c, wp->write_point));
957 static bool try_decrease_writepoints(struct bch_fs *c,
960 struct write_point *wp;
962 mutex_lock(&c->write_points_hash_lock);
963 if (c->write_points_nr < old_nr) {
964 mutex_unlock(&c->write_points_hash_lock);
968 if (c->write_points_nr == 1 ||
969 !too_many_writepoints(c, 8)) {
970 mutex_unlock(&c->write_points_hash_lock);
974 wp = c->write_points + --c->write_points_nr;
976 hlist_del_rcu(&wp->node);
977 mutex_unlock(&c->write_points_hash_lock);
979 bch2_writepoint_stop(c, NULL, wp);
983 static struct write_point *writepoint_find(struct bch_fs *c,
984 unsigned long write_point)
986 struct write_point *wp, *oldest;
987 struct hlist_head *head;
989 if (!(write_point & 1UL)) {
990 wp = (struct write_point *) write_point;
991 mutex_lock(&wp->lock);
995 head = writepoint_hash(c, write_point);
997 wp = __writepoint_find(head, write_point);
1000 mutex_lock(&wp->lock);
1001 if (wp->write_point == write_point)
1003 mutex_unlock(&wp->lock);
1006 restart_find_oldest:
1008 for (wp = c->write_points;
1009 wp < c->write_points + c->write_points_nr; wp++)
1010 if (!oldest || time_before64(wp->last_used, oldest->last_used))
1013 mutex_lock(&oldest->lock);
1014 mutex_lock(&c->write_points_hash_lock);
1015 if (oldest >= c->write_points + c->write_points_nr ||
1016 try_increase_writepoints(c)) {
1017 mutex_unlock(&c->write_points_hash_lock);
1018 mutex_unlock(&oldest->lock);
1019 goto restart_find_oldest;
1022 wp = __writepoint_find(head, write_point);
1023 if (wp && wp != oldest) {
1024 mutex_unlock(&c->write_points_hash_lock);
1025 mutex_unlock(&oldest->lock);
1030 hlist_del_rcu(&wp->node);
1031 wp->write_point = write_point;
1032 hlist_add_head_rcu(&wp->node, head);
1033 mutex_unlock(&c->write_points_hash_lock);
1035 wp->last_used = sched_clock();
1040 * Get us an open_bucket we can allocate from, return with it locked:
1042 struct write_point *bch2_alloc_sectors_start(struct bch_fs *c,
1044 unsigned erasure_code,
1045 struct write_point_specifier write_point,
1046 struct bch_devs_list *devs_have,
1047 unsigned nr_replicas,
1048 unsigned nr_replicas_required,
1049 enum alloc_reserve reserve,
1053 struct write_point *wp;
1054 struct open_bucket *ob;
1055 struct open_buckets ptrs;
1056 unsigned nr_effective, write_points_nr;
1057 unsigned ob_flags = 0;
1062 if (!(flags & BCH_WRITE_ONLY_SPECIFIED_DEVS))
1063 ob_flags |= BUCKET_ALLOC_USE_DURABILITY;
1065 BUG_ON(!nr_replicas || !nr_replicas_required);
1069 write_points_nr = c->write_points_nr;
1072 wp = writepoint_find(c, write_point.v);
1074 if (wp->data_type == BCH_DATA_user)
1075 ob_flags |= BUCKET_MAY_ALLOC_PARTIAL;
1077 /* metadata may not allocate on cache devices: */
1078 if (wp->data_type != BCH_DATA_user)
1081 if (!target || (flags & BCH_WRITE_ONLY_SPECIFIED_DEVS)) {
1082 ret = open_bucket_add_buckets(c, &ptrs, wp, devs_have,
1083 target, erasure_code,
1084 nr_replicas, &nr_effective,
1085 &have_cache, reserve,
1088 ret = open_bucket_add_buckets(c, &ptrs, wp, devs_have,
1089 target, erasure_code,
1090 nr_replicas, &nr_effective,
1091 &have_cache, reserve,
1096 ret = open_bucket_add_buckets(c, &ptrs, wp, devs_have,
1098 nr_replicas, &nr_effective,
1099 &have_cache, reserve,
1103 BUG_ON(!ret && nr_effective < nr_replicas);
1105 if (erasure_code && !ec_open_bucket(c, &ptrs))
1106 pr_debug("failed to get ec bucket: ret %u", ret);
1108 if (ret == -INSUFFICIENT_DEVICES &&
1109 nr_effective >= nr_replicas_required)
1115 /* Free buckets we didn't use: */
1116 open_bucket_for_each(c, &wp->ptrs, ob, i)
1117 open_bucket_free_unused(c, wp, ob);
1121 wp->sectors_free = UINT_MAX;
1123 open_bucket_for_each(c, &wp->ptrs, ob, i)
1124 wp->sectors_free = min(wp->sectors_free, ob->sectors_free);
1126 BUG_ON(!wp->sectors_free || wp->sectors_free == UINT_MAX);
1130 open_bucket_for_each(c, &wp->ptrs, ob, i)
1131 if (ptrs.nr < ARRAY_SIZE(ptrs.v))
1132 ob_push(c, &ptrs, ob);
1134 open_bucket_free_unused(c, wp, ob);
1137 mutex_unlock(&wp->lock);
1139 if (ret == -FREELIST_EMPTY &&
1140 try_decrease_writepoints(c, write_points_nr))
1144 case -OPEN_BUCKETS_EMPTY:
1145 case -FREELIST_EMPTY:
1146 return cl ? ERR_PTR(-EAGAIN) : ERR_PTR(-ENOSPC);
1147 case -INSUFFICIENT_DEVICES:
1148 return ERR_PTR(-EROFS);
1150 return ERR_PTR(ret);
1154 struct bch_extent_ptr bch2_ob_ptr(struct bch_fs *c, struct open_bucket *ob)
1156 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->dev);
1158 return (struct bch_extent_ptr) {
1159 .type = 1 << BCH_EXTENT_ENTRY_ptr,
1162 .offset = bucket_to_sector(ca, ob->bucket) +
1163 ca->mi.bucket_size -
1169 * Append pointers to the space we just allocated to @k, and mark @sectors space
1170 * as allocated out of @ob
1172 void bch2_alloc_sectors_append_ptrs(struct bch_fs *c, struct write_point *wp,
1173 struct bkey_i *k, unsigned sectors,
1177 struct open_bucket *ob;
1180 BUG_ON(sectors > wp->sectors_free);
1181 wp->sectors_free -= sectors;
1183 open_bucket_for_each(c, &wp->ptrs, ob, i) {
1184 struct bch_dev *ca = bch_dev_bkey_exists(c, ob->dev);
1185 struct bch_extent_ptr ptr = bch2_ob_ptr(c, ob);
1187 ptr.cached = cached ||
1188 (!ca->mi.durability &&
1189 wp->data_type == BCH_DATA_user);
1191 bch2_bkey_append_ptr(k, ptr);
1193 BUG_ON(sectors > ob->sectors_free);
1194 ob->sectors_free -= sectors;
1199 * Append pointers to the space we just allocated to @k, and mark @sectors space
1200 * as allocated out of @ob
1202 void bch2_alloc_sectors_done(struct bch_fs *c, struct write_point *wp)
1204 struct open_buckets ptrs = { .nr = 0 }, keep = { .nr = 0 };
1205 struct open_bucket *ob;
1208 open_bucket_for_each(c, &wp->ptrs, ob, i)
1209 ob_push(c, !ob->sectors_free ? &ptrs : &keep, ob);
1212 mutex_unlock(&wp->lock);
1214 bch2_open_buckets_put(c, &ptrs);
1217 static inline void writepoint_init(struct write_point *wp,
1218 enum bch_data_type type)
1220 mutex_init(&wp->lock);
1221 wp->data_type = type;
1224 void bch2_fs_allocator_foreground_init(struct bch_fs *c)
1226 struct open_bucket *ob;
1227 struct write_point *wp;
1229 mutex_init(&c->write_points_hash_lock);
1230 c->write_points_nr = ARRAY_SIZE(c->write_points);
1232 /* open bucket 0 is a sentinal NULL: */
1233 spin_lock_init(&c->open_buckets[0].lock);
1235 for (ob = c->open_buckets + 1;
1236 ob < c->open_buckets + ARRAY_SIZE(c->open_buckets); ob++) {
1237 spin_lock_init(&ob->lock);
1238 c->open_buckets_nr_free++;
1240 ob->freelist = c->open_buckets_freelist;
1241 c->open_buckets_freelist = ob - c->open_buckets;
1244 writepoint_init(&c->btree_write_point, BCH_DATA_btree);
1245 writepoint_init(&c->rebalance_write_point, BCH_DATA_user);
1246 writepoint_init(&c->copygc_write_point, BCH_DATA_user);
1248 for (wp = c->write_points;
1249 wp < c->write_points + c->write_points_nr; wp++) {
1250 writepoint_init(wp, BCH_DATA_user);
1252 wp->last_used = sched_clock();
1253 wp->write_point = (unsigned long) wp;
1254 hlist_add_head_rcu(&wp->node,
1255 writepoint_hash(c, wp->write_point));
1259 void bch2_open_buckets_to_text(struct printbuf *out, struct bch_fs *c)
1261 struct open_bucket *ob;
1263 for (ob = c->open_buckets;
1264 ob < c->open_buckets + ARRAY_SIZE(c->open_buckets);
1266 spin_lock(&ob->lock);
1267 if (ob->valid && !ob->on_partial_list) {
1268 pr_buf(out, "%zu ref %u type %s\n",
1269 ob - c->open_buckets,
1270 atomic_read(&ob->pin),
1271 bch2_data_types[ob->data_type]);
1273 spin_unlock(&ob->lock);