git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/movinggc.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Moving/copying garbage collector
   4  *
   5  * Copyright 2012 Google, Inc.
   6  */
   7
   8 #include "bcachefs.h"
   9 #include "alloc_background.h"
  10 #include "alloc_foreground.h"
  11 #include "btree_iter.h"
  12 #include "btree_update.h"
  13 #include "btree_write_buffer.h"
  14 #include "buckets.h"
  15 #include "clock.h"
  16 #include "disk_groups.h"
  17 #include "errcode.h"
  18 #include "error.h"
  19 #include "extents.h"
  20 #include "eytzinger.h"
  21 #include "io.h"
  22 #include "keylist.h"
  23 #include "lru.h"
  24 #include "move.h"
  25 #include "movinggc.h"
  26 #include "super-io.h"
  27
  28 #include <trace/events/bcachefs.h>
  29 #include <linux/bsearch.h>
  30 #include <linux/freezer.h>
  31 #include <linux/kthread.h>
  32 #include <linux/math64.h>
  33 #include <linux/sched/task.h>
  34 #include <linux/sort.h>
  35 #include <linux/wait.h>
  36
  37 struct buckets_in_flight {
  38         struct rhashtable               table;
  39         struct move_bucket_in_flight    *first;
  40         struct move_bucket_in_flight    *last;
  41         size_t                          nr;
  42         size_t                          sectors;
  43 };
  44
  45 static const struct rhashtable_params bch_move_bucket_params = {
  46         .head_offset    = offsetof(struct move_bucket_in_flight, hash),
  47         .key_offset     = offsetof(struct move_bucket_in_flight, bucket.k),
  48         .key_len        = sizeof(struct move_bucket_key),
  49 };
  50
  51 static struct move_bucket_in_flight *
  52 move_bucket_in_flight_add(struct buckets_in_flight *list, struct move_bucket b)
  53 {
  54         struct move_bucket_in_flight *new = kzalloc(sizeof(*new), GFP_KERNEL);
  55         int ret;
  56
  57         if (!new)
  58                 return ERR_PTR(-ENOMEM);
  59
  60         new->bucket = b;
  61
  62         ret = rhashtable_lookup_insert_fast(&list->table, &new->hash,
  63                                             bch_move_bucket_params);
  64         if (ret) {
  65                 kfree(new);
  66                 return ERR_PTR(ret);
  67         }
  68
  69         if (!list->first)
  70                 list->first = new;
  71         else
  72                 list->last->next = new;
  73
  74         list->last = new;
  75         list->nr++;
  76         list->sectors += b.sectors;
  77         return new;
  78 }
  79
  80 static int bch2_bucket_is_movable(struct btree_trans *trans,
  81                                   struct move_bucket *b, u64 time)
  82 {
  83         struct btree_iter iter;
  84         struct bkey_s_c k;
  85         struct bch_alloc_v4 _a;
  86         const struct bch_alloc_v4 *a;
  87         int ret;
  88
  89         if (bch2_bucket_is_open(trans->c,
  90                                 b->k.bucket.inode,
  91                                 b->k.bucket.offset))
  92                 return 0;
  93
  94         bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc,
  95                              b->k.bucket, BTREE_ITER_CACHED);
  96         k = bch2_btree_iter_peek_slot(&iter);
  97         ret = bkey_err(k);
  98         bch2_trans_iter_exit(trans, &iter);
  99
 100         if (ret)
 101                 return ret;
 102
 103         a = bch2_alloc_to_v4(k, &_a);
 104         b->k.gen        = a->gen;
 105         b->sectors      = a->dirty_sectors;
 106
 107         ret = data_type_movable(a->data_type) &&
 108                 a->fragmentation_lru &&
 109                 a->fragmentation_lru <= time;
 110
 111         if (!ret) {
 112                 struct printbuf buf = PRINTBUF;
 113
 114                 bch2_bkey_val_to_text(&buf, trans->c, k);
 115                 pr_debug("%s", buf.buf);
 116                 printbuf_exit(&buf);
 117         }
 118
 119         return ret;
 120 }
 121
 122 static void move_buckets_wait(struct btree_trans *trans,
 123                               struct moving_context *ctxt,
 124                               struct buckets_in_flight *list,
 125                               bool flush)
 126 {
 127         struct move_bucket_in_flight *i;
 128         int ret;
 129
 130         while ((i = list->first)) {
 131                 if (flush)
 132                         move_ctxt_wait_event(ctxt, trans, !atomic_read(&i->count));
 133
 134                 if (atomic_read(&i->count))
 135                         break;
 136
 137                 list->first = i->next;
 138                 if (!list->first)
 139                         list->last = NULL;
 140
 141                 list->nr--;
 142                 list->sectors -= i->bucket.sectors;
 143
 144                 ret = rhashtable_remove_fast(&list->table, &i->hash,
 145                                              bch_move_bucket_params);
 146                 BUG_ON(ret);
 147                 kfree(i);
 148         }
 149
 150         bch2_trans_unlock(trans);
 151 }
 152
 153 static bool bucket_in_flight(struct buckets_in_flight *list,
 154                              struct move_bucket_key k)
 155 {
 156         return rhashtable_lookup_fast(&list->table, &k, bch_move_bucket_params);
 157 }
 158
 159 typedef DARRAY(struct move_bucket) move_buckets;
 160
 161 static int bch2_copygc_get_buckets(struct btree_trans *trans,
 162                         struct moving_context *ctxt,
 163                         struct buckets_in_flight *buckets_in_flight,
 164                         move_buckets *buckets)
 165 {
 166         struct bch_fs *c = trans->c;
 167         struct btree_iter iter;
 168         struct bkey_s_c k;
 169         size_t nr_to_get = max(16UL, buckets_in_flight->nr / 4);
 170         size_t saw = 0, in_flight = 0, not_movable = 0, sectors = 0;
 171         int ret;
 172
 173         move_buckets_wait(trans, ctxt, buckets_in_flight, false);
 174
 175         ret = bch2_btree_write_buffer_flush(trans);
 176         if (bch2_fs_fatal_err_on(ret, c, "%s: error %s from bch2_btree_write_buffer_flush()",
 177                                  __func__, bch2_err_str(ret)))
 178                 return ret;
 179
 180         ret = for_each_btree_key2_upto(trans, iter, BTREE_ID_lru,
 181                                   lru_pos(BCH_LRU_FRAGMENTATION_START, 0, 0),
 182                                   lru_pos(BCH_LRU_FRAGMENTATION_START, U64_MAX, LRU_TIME_MAX),
 183                                   0, k, ({
 184                 struct move_bucket b = { .k.bucket = u64_to_bucket(k.k->p.offset) };
 185                 int ret = 0;
 186
 187                 saw++;
 188
 189                 if (!bch2_bucket_is_movable(trans, &b, lru_pos_time(k.k->p)))
 190                         not_movable++;
 191                 else if (bucket_in_flight(buckets_in_flight, b.k))
 192                         in_flight++;
 193                 else {
 194                         ret = darray_push(buckets, b) ?: buckets->nr >= nr_to_get;
 195                         if (ret >= 0)
 196                                 sectors += b.sectors;
 197                 }
 198                 ret;
 199         }));
 200
 201         pr_debug("have: %zu (%zu) saw %zu in flight %zu not movable %zu got %zu (%zu)/%zu buckets ret %i",
 202                  buckets_in_flight->nr, buckets_in_flight->sectors,
 203                  saw, in_flight, not_movable, buckets->nr, sectors, nr_to_get, ret);
 204
 205         return ret < 0 ? ret : 0;
 206 }
 207
 208 static int bch2_copygc(struct btree_trans *trans,
 209                        struct moving_context *ctxt,
 210                        struct buckets_in_flight *buckets_in_flight)
 211 {
 212         struct bch_fs *c = trans->c;
 213         struct data_update_opts data_opts = {
 214                 .btree_insert_flags = BTREE_INSERT_USE_RESERVE|JOURNAL_WATERMARK_copygc,
 215         };
 216         move_buckets buckets = { 0 };
 217         struct move_bucket_in_flight *f;
 218         struct move_bucket *i;
 219         u64 moved = atomic64_read(&ctxt->stats->sectors_moved);
 220         int ret = 0;
 221
 222         ret = bch2_copygc_get_buckets(trans, ctxt, buckets_in_flight, &buckets);
 223         if (ret)
 224                 goto err;
 225
 226         darray_for_each(buckets, i) {
 227                 if (unlikely(freezing(current)))
 228                         break;
 229
 230                 f = move_bucket_in_flight_add(buckets_in_flight, *i);
 231                 ret = PTR_ERR_OR_ZERO(f);
 232                 if (ret == -EEXIST) /* rare race: copygc_get_buckets returned same bucket more than once */
 233                         continue;
 234                 if (ret == -ENOMEM) { /* flush IO, continue later */
 235                         ret = 0;
 236                         break;
 237                 }
 238
 239                 ret = __bch2_evacuate_bucket(trans, ctxt, f, f->bucket.k.bucket,
 240                                              f->bucket.k.gen, data_opts);
 241                 if (ret)
 242                         goto err;
 243         }
 244 err:
 245         darray_exit(&buckets);
 246
 247         /* no entries in LRU btree found, or got to end: */
 248         if (ret == -ENOENT)
 249                 ret = 0;
 250
 251         if (ret < 0 && !bch2_err_matches(ret, EROFS))
 252                 bch_err(c, "error from bch2_move_data() in copygc: %s", bch2_err_str(ret));
 253
 254         moved = atomic64_read(&ctxt->stats->sectors_moved) - moved;
 255         trace_and_count(c, copygc, c, moved, 0, 0, 0);
 256         return ret;
 257 }
 258
 259 /*
 260  * Copygc runs when the amount of fragmented data is above some arbitrary
 261  * threshold:
 262  *
 263  * The threshold at the limit - when the device is full - is the amount of space
 264  * we reserved in bch2_recalc_capacity; we can't have more than that amount of
 265  * disk space stranded due to fragmentation and store everything we have
 266  * promised to store.
 267  *
 268  * But we don't want to be running copygc unnecessarily when the device still
 269  * has plenty of free space - rather, we want copygc to smoothly run every so
 270  * often and continually reduce the amount of fragmented space as the device
 271  * fills up. So, we increase the threshold by half the current free space.
 272  */
 273 unsigned long bch2_copygc_wait_amount(struct bch_fs *c)
 274 {
 275         struct bch_dev *ca;
 276         unsigned dev_idx;
 277         s64 wait = S64_MAX, fragmented_allowed, fragmented;
 278         unsigned i;
 279
 280         for_each_rw_member(ca, c, dev_idx) {
 281                 struct bch_dev_usage usage = bch2_dev_usage_read(ca);
 282
 283                 fragmented_allowed = ((__dev_buckets_available(ca, usage, RESERVE_stripe) *
 284                                        ca->mi.bucket_size) >> 1);
 285                 fragmented = 0;
 286
 287                 for (i = 0; i < BCH_DATA_NR; i++)
 288                         if (data_type_movable(i))
 289                                 fragmented += usage.d[i].fragmented;
 290
 291                 wait = min(wait, max(0LL, fragmented_allowed - fragmented));
 292         }
 293
 294         return wait;
 295 }
 296
 297 void bch2_copygc_wait_to_text(struct printbuf *out, struct bch_fs *c)
 298 {
 299         prt_printf(out, "Currently waiting for:     ");
 300         prt_human_readable_u64(out, max(0LL, c->copygc_wait -
 301                                         atomic64_read(&c->io_clock[WRITE].now)) << 9);
 302         prt_newline(out);
 303
 304         prt_printf(out, "Currently waiting since:   ");
 305         prt_human_readable_u64(out, max(0LL,
 306                                         atomic64_read(&c->io_clock[WRITE].now) -
 307                                         c->copygc_wait_at) << 9);
 308         prt_newline(out);
 309
 310         prt_printf(out, "Currently calculated wait: ");
 311         prt_human_readable_u64(out, bch2_copygc_wait_amount(c));
 312         prt_newline(out);
 313 }
 314
 315 static int bch2_copygc_thread(void *arg)
 316 {
 317         struct bch_fs *c = arg;
 318         struct btree_trans trans;
 319         struct moving_context ctxt;
 320         struct bch_move_stats move_stats;
 321         struct io_clock *clock = &c->io_clock[WRITE];
 322         struct buckets_in_flight move_buckets;
 323         u64 last, wait;
 324         int ret = 0;
 325
 326         memset(&move_buckets, 0, sizeof(move_buckets));
 327
 328         ret = rhashtable_init(&move_buckets.table, &bch_move_bucket_params);
 329         if (ret) {
 330                 bch_err(c, "error allocating copygc buckets in flight: %s",
 331                         bch2_err_str(ret));
 332                 return ret;
 333         }
 334
 335         set_freezable();
 336         bch2_trans_init(&trans, c, 0, 0);
 337
 338         bch2_move_stats_init(&move_stats, "copygc");
 339         bch2_moving_ctxt_init(&ctxt, c, NULL, &move_stats,
 340                               writepoint_ptr(&c->copygc_write_point),
 341                               false);
 342
 343         while (!ret && !kthread_should_stop()) {
 344                 bch2_trans_unlock(&trans);
 345                 cond_resched();
 346
 347                 if (!c->copy_gc_enabled) {
 348                         move_buckets_wait(&trans, &ctxt, &move_buckets, true);
 349                         kthread_wait_freezable(c->copy_gc_enabled);
 350                 }
 351
 352                 if (unlikely(freezing(current))) {
 353                         move_buckets_wait(&trans, &ctxt, &move_buckets, true);
 354                         __refrigerator(false);
 355                         continue;
 356                 }
 357
 358                 last = atomic64_read(&clock->now);
 359                 wait = bch2_copygc_wait_amount(c);
 360
 361                 if (wait > clock->max_slop) {
 362                         c->copygc_wait_at = last;
 363                         c->copygc_wait = last + wait;
 364                         move_buckets_wait(&trans, &ctxt, &move_buckets, true);
 365                         trace_and_count(c, copygc_wait, c, wait, last + wait);
 366                         bch2_kthread_io_clock_wait(clock, last + wait,
 367                                         MAX_SCHEDULE_TIMEOUT);
 368                         continue;
 369                 }
 370
 371                 c->copygc_wait = 0;
 372
 373                 c->copygc_running = true;
 374                 ret = bch2_copygc(&trans, &ctxt, &move_buckets);
 375                 c->copygc_running = false;
 376
 377                 wake_up(&c->copygc_running_wq);
 378         }
 379
 380         move_buckets_wait(&trans, &ctxt, &move_buckets, true);
 381         bch2_trans_exit(&trans);
 382         bch2_moving_ctxt_exit(&ctxt);
 383
 384         return 0;
 385 }
 386
 387 void bch2_copygc_stop(struct bch_fs *c)
 388 {
 389         if (c->copygc_thread) {
 390                 kthread_stop(c->copygc_thread);
 391                 put_task_struct(c->copygc_thread);
 392         }
 393         c->copygc_thread = NULL;
 394 }
 395
 396 int bch2_copygc_start(struct bch_fs *c)
 397 {
 398         struct task_struct *t;
 399         int ret;
 400
 401         if (c->copygc_thread)
 402                 return 0;
 403
 404         if (c->opts.nochanges)
 405                 return 0;
 406
 407         if (bch2_fs_init_fault("copygc_start"))
 408                 return -ENOMEM;
 409
 410         t = kthread_create(bch2_copygc_thread, c, "bch-copygc/%s", c->name);
 411         ret = PTR_ERR_OR_ZERO(t);
 412         if (ret) {
 413                 bch_err(c, "error creating copygc thread: %s", bch2_err_str(ret));
 414                 return ret;
 415         }
 416
 417         get_task_struct(t);
 418
 419         c->copygc_thread = t;
 420         wake_up_process(c->copygc_thread);
 421
 422         return 0;
 423 }
 424
 425 void bch2_fs_copygc_init(struct bch_fs *c)
 426 {
 427         init_waitqueue_head(&c->copygc_running_wq);
 428         c->copygc_running = false;
 429 }