Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com> |
| 3 | * |
| 4 | * Uses a block device as cache for other block devices; optimized for SSDs. |
| 5 | * All allocation is done in buckets, which should match the erase block size |
| 6 | * of the device. |
| 7 | * |
| 8 | * Buckets containing cached data are kept on a heap sorted by priority; |
| 9 | * bucket priority is increased on cache hit, and periodically all the buckets |
| 10 | * on the heap have their priority scaled down. This currently is just used as |
| 11 | * an LRU but in the future should allow for more intelligent heuristics. |
| 12 | * |
| 13 | * Buckets have an 8 bit counter; freeing is accomplished by incrementing the |
| 14 | * counter. Garbage collection is used to remove stale pointers. |
| 15 | * |
| 16 | * Indexing is done via a btree; nodes are not necessarily fully sorted, rather |
| 17 | * as keys are inserted we only sort the pages that have not yet been written. |
| 18 | * When garbage collection is run, we resort the entire node. |
| 19 | * |
| 20 | * All configuration is done via sysfs; see Documentation/bcache.txt. |
| 21 | */ |
| 22 | |
| 23 | #include "bcache.h" |
| 24 | #include "btree.h" |
| 25 | #include "debug.h" |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 26 | #include "writeback.h" |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 27 | |
| 28 | #include <linux/slab.h> |
| 29 | #include <linux/bitops.h> |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 30 | #include <linux/freezer.h> |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 31 | #include <linux/hash.h> |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 32 | #include <linux/kthread.h> |
Geert Uytterhoeven | cd953ed | 2013-03-27 18:56:28 +0100 | [diff] [blame] | 33 | #include <linux/prefetch.h> |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 34 | #include <linux/random.h> |
| 35 | #include <linux/rcupdate.h> |
| 36 | #include <trace/events/bcache.h> |
| 37 | |
| 38 | /* |
| 39 | * Todo: |
| 40 | * register_bcache: Return errors out to userspace correctly |
| 41 | * |
| 42 | * Writeback: don't undirty key until after a cache flush |
| 43 | * |
| 44 | * Create an iterator for key pointers |
| 45 | * |
| 46 | * On btree write error, mark bucket such that it won't be freed from the cache |
| 47 | * |
| 48 | * Journalling: |
| 49 | * Check for bad keys in replay |
| 50 | * Propagate barriers |
| 51 | * Refcount journal entries in journal_replay |
| 52 | * |
| 53 | * Garbage collection: |
| 54 | * Finish incremental gc |
| 55 | * Gc should free old UUIDs, data for invalid UUIDs |
| 56 | * |
| 57 | * Provide a way to list backing device UUIDs we have data cached for, and |
| 58 | * probably how long it's been since we've seen them, and a way to invalidate |
| 59 | * dirty data for devices that will never be attached again |
| 60 | * |
| 61 | * Keep 1 min/5 min/15 min statistics of how busy a block device has been, so |
| 62 | * that based on that and how much dirty data we have we can keep writeback |
| 63 | * from being starved |
| 64 | * |
| 65 | * Add a tracepoint or somesuch to watch for writeback starvation |
| 66 | * |
| 67 | * When btree depth > 1 and splitting an interior node, we have to make sure |
| 68 | * alloc_bucket() cannot fail. This should be true but is not completely |
| 69 | * obvious. |
| 70 | * |
| 71 | * Make sure all allocations get charged to the root cgroup |
| 72 | * |
| 73 | * Plugging? |
| 74 | * |
| 75 | * If data write is less than hard sector size of ssd, round up offset in open |
| 76 | * bucket to the next whole sector |
| 77 | * |
| 78 | * Also lookup by cgroup in get_open_bucket() |
| 79 | * |
| 80 | * Superblock needs to be fleshed out for multiple cache devices |
| 81 | * |
| 82 | * Add a sysfs tunable for the number of writeback IOs in flight |
| 83 | * |
| 84 | * Add a sysfs tunable for the number of open data buckets |
| 85 | * |
| 86 | * IO tracking: Can we track when one process is doing io on behalf of another? |
| 87 | * IO tracking: Don't use just an average, weigh more recent stuff higher |
| 88 | * |
| 89 | * Test module load/unload |
| 90 | */ |
| 91 | |
Kent Overstreet | df8e897 | 2013-07-24 17:37:59 -0700 | [diff] [blame] | 92 | enum { |
| 93 | BTREE_INSERT_STATUS_INSERT, |
| 94 | BTREE_INSERT_STATUS_BACK_MERGE, |
| 95 | BTREE_INSERT_STATUS_OVERWROTE, |
| 96 | BTREE_INSERT_STATUS_FRONT_MERGE, |
| 97 | }; |
| 98 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 99 | #define MAX_NEED_GC 64 |
| 100 | #define MAX_SAVE_PRIO 72 |
| 101 | |
| 102 | #define PTR_DIRTY_BIT (((uint64_t) 1 << 36)) |
| 103 | |
| 104 | #define PTR_HASH(c, k) \ |
| 105 | (((k)->ptr[0] >> c->bucket_bits) | PTR_GEN(k, 0)) |
| 106 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 107 | static struct workqueue_struct *btree_io_wq; |
| 108 | |
Kent Overstreet | df8e897 | 2013-07-24 17:37:59 -0700 | [diff] [blame] | 109 | static inline bool should_split(struct btree *b) |
| 110 | { |
| 111 | struct bset *i = write_block(b); |
| 112 | return b->written >= btree_blocks(b) || |
| 113 | (b->written + __set_blocks(i, i->keys + 15, b->c) |
| 114 | > btree_blocks(b)); |
| 115 | } |
| 116 | |
| 117 | #define insert_lock(s, b) ((b)->level <= (s)->lock) |
| 118 | |
| 119 | /* |
| 120 | * These macros are for recursing down the btree - they handle the details of |
| 121 | * locking and looking up nodes in the cache for you. They're best treated as |
| 122 | * mere syntax when reading code that uses them. |
| 123 | * |
| 124 | * op->lock determines whether we take a read or a write lock at a given depth. |
| 125 | * If you've got a read lock and find that you need a write lock (i.e. you're |
| 126 | * going to have to split), set op->lock and return -EINTR; btree_root() will |
| 127 | * call you again and you'll have the correct lock. |
| 128 | */ |
| 129 | |
| 130 | /** |
| 131 | * btree - recurse down the btree on a specified key |
| 132 | * @fn: function to call, which will be passed the child node |
| 133 | * @key: key to recurse on |
| 134 | * @b: parent btree node |
| 135 | * @op: pointer to struct btree_op |
| 136 | */ |
| 137 | #define btree(fn, key, b, op, ...) \ |
| 138 | ({ \ |
| 139 | int _r, l = (b)->level - 1; \ |
| 140 | bool _w = l <= (op)->lock; \ |
| 141 | struct btree *_child = bch_btree_node_get((b)->c, key, l, _w); \ |
| 142 | if (!IS_ERR(_child)) { \ |
| 143 | _child->parent = (b); \ |
| 144 | _r = bch_btree_ ## fn(_child, op, ##__VA_ARGS__); \ |
| 145 | rw_unlock(_w, _child); \ |
| 146 | } else \ |
| 147 | _r = PTR_ERR(_child); \ |
| 148 | _r; \ |
| 149 | }) |
| 150 | |
| 151 | /** |
| 152 | * btree_root - call a function on the root of the btree |
| 153 | * @fn: function to call, which will be passed the child node |
| 154 | * @c: cache set |
| 155 | * @op: pointer to struct btree_op |
| 156 | */ |
| 157 | #define btree_root(fn, c, op, ...) \ |
| 158 | ({ \ |
| 159 | int _r = -EINTR; \ |
| 160 | do { \ |
| 161 | struct btree *_b = (c)->root; \ |
| 162 | bool _w = insert_lock(op, _b); \ |
| 163 | rw_lock(_w, _b, _b->level); \ |
| 164 | if (_b == (c)->root && \ |
| 165 | _w == insert_lock(op, _b)) { \ |
| 166 | _b->parent = NULL; \ |
| 167 | _r = bch_btree_ ## fn(_b, op, ##__VA_ARGS__); \ |
| 168 | } \ |
| 169 | rw_unlock(_w, _b); \ |
| 170 | bch_cannibalize_unlock(c); \ |
| 171 | if (_r == -ENOSPC) { \ |
| 172 | wait_event((c)->try_wait, \ |
| 173 | !(c)->try_harder); \ |
| 174 | _r = -EINTR; \ |
| 175 | } \ |
| 176 | } while (_r == -EINTR); \ |
| 177 | \ |
| 178 | _r; \ |
| 179 | }) |
| 180 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 181 | /* Btree key manipulation */ |
| 182 | |
Kent Overstreet | e7c590e | 2013-09-10 18:39:16 -0700 | [diff] [blame] | 183 | void __bkey_put(struct cache_set *c, struct bkey *k) |
| 184 | { |
| 185 | unsigned i; |
| 186 | |
| 187 | for (i = 0; i < KEY_PTRS(k); i++) |
| 188 | if (ptr_available(c, k, i)) |
| 189 | atomic_dec_bug(&PTR_BUCKET(c, k, i)->pin); |
| 190 | } |
| 191 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 192 | static void bkey_put(struct cache_set *c, struct bkey *k, int level) |
| 193 | { |
| 194 | if ((level && KEY_OFFSET(k)) || !level) |
| 195 | __bkey_put(c, k); |
| 196 | } |
| 197 | |
| 198 | /* Btree IO */ |
| 199 | |
| 200 | static uint64_t btree_csum_set(struct btree *b, struct bset *i) |
| 201 | { |
| 202 | uint64_t crc = b->key.ptr[0]; |
| 203 | void *data = (void *) i + 8, *end = end(i); |
| 204 | |
Kent Overstreet | 169ef1c | 2013-03-28 12:50:55 -0600 | [diff] [blame] | 205 | crc = bch_crc64_update(crc, data, end - data); |
Kent Overstreet | c19ed23 | 2013-03-26 13:49:02 -0700 | [diff] [blame] | 206 | return crc ^ 0xffffffffffffffffULL; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 207 | } |
| 208 | |
Kent Overstreet | f3059a5 | 2013-05-15 17:13:45 -0700 | [diff] [blame] | 209 | static void bch_btree_node_read_done(struct btree *b) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 210 | { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 211 | const char *err = "bad btree header"; |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 212 | struct bset *i = b->sets[0].data; |
| 213 | struct btree_iter *iter; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 214 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 215 | iter = mempool_alloc(b->c->fill_iter, GFP_NOWAIT); |
| 216 | iter->size = b->c->sb.bucket_size / b->c->sb.block_size; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 217 | iter->used = 0; |
| 218 | |
Kent Overstreet | 280481d | 2013-10-24 16:36:03 -0700 | [diff] [blame^] | 219 | #ifdef CONFIG_BCACHE_DEBUG |
| 220 | iter->b = b; |
| 221 | #endif |
| 222 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 223 | if (!i->seq) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 224 | goto err; |
| 225 | |
| 226 | for (; |
| 227 | b->written < btree_blocks(b) && i->seq == b->sets[0].data->seq; |
| 228 | i = write_block(b)) { |
| 229 | err = "unsupported bset version"; |
| 230 | if (i->version > BCACHE_BSET_VERSION) |
| 231 | goto err; |
| 232 | |
| 233 | err = "bad btree header"; |
| 234 | if (b->written + set_blocks(i, b->c) > btree_blocks(b)) |
| 235 | goto err; |
| 236 | |
| 237 | err = "bad magic"; |
Kent Overstreet | 81ab419 | 2013-10-31 15:46:42 -0700 | [diff] [blame] | 238 | if (i->magic != bset_magic(&b->c->sb)) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 239 | goto err; |
| 240 | |
| 241 | err = "bad checksum"; |
| 242 | switch (i->version) { |
| 243 | case 0: |
| 244 | if (i->csum != csum_set(i)) |
| 245 | goto err; |
| 246 | break; |
| 247 | case BCACHE_BSET_VERSION: |
| 248 | if (i->csum != btree_csum_set(b, i)) |
| 249 | goto err; |
| 250 | break; |
| 251 | } |
| 252 | |
| 253 | err = "empty set"; |
| 254 | if (i != b->sets[0].data && !i->keys) |
| 255 | goto err; |
| 256 | |
| 257 | bch_btree_iter_push(iter, i->start, end(i)); |
| 258 | |
| 259 | b->written += set_blocks(i, b->c); |
| 260 | } |
| 261 | |
| 262 | err = "corrupted btree"; |
| 263 | for (i = write_block(b); |
| 264 | index(i, b) < btree_blocks(b); |
| 265 | i = ((void *) i) + block_bytes(b->c)) |
| 266 | if (i->seq == b->sets[0].data->seq) |
| 267 | goto err; |
| 268 | |
| 269 | bch_btree_sort_and_fix_extents(b, iter); |
| 270 | |
| 271 | i = b->sets[0].data; |
| 272 | err = "short btree key"; |
| 273 | if (b->sets[0].size && |
| 274 | bkey_cmp(&b->key, &b->sets[0].end) < 0) |
| 275 | goto err; |
| 276 | |
| 277 | if (b->written < btree_blocks(b)) |
| 278 | bch_bset_init_next(b); |
| 279 | out: |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 280 | mempool_free(iter, b->c->fill_iter); |
| 281 | return; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 282 | err: |
| 283 | set_btree_node_io_error(b); |
Kent Overstreet | 07e86cc | 2013-03-25 11:46:43 -0700 | [diff] [blame] | 284 | bch_cache_set_error(b->c, "%s at bucket %zu, block %zu, %u keys", |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 285 | err, PTR_BUCKET_NR(b->c, &b->key, 0), |
| 286 | index(i, b), i->keys); |
| 287 | goto out; |
| 288 | } |
| 289 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 290 | static void btree_node_read_endio(struct bio *bio, int error) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 291 | { |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 292 | struct closure *cl = bio->bi_private; |
| 293 | closure_put(cl); |
| 294 | } |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 295 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 296 | void bch_btree_node_read(struct btree *b) |
| 297 | { |
| 298 | uint64_t start_time = local_clock(); |
| 299 | struct closure cl; |
| 300 | struct bio *bio; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 301 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 302 | trace_bcache_btree_read(b); |
| 303 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 304 | closure_init_stack(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 305 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 306 | bio = bch_bbio_alloc(b->c); |
| 307 | bio->bi_rw = REQ_META|READ_SYNC; |
| 308 | bio->bi_size = KEY_SIZE(&b->key) << 9; |
| 309 | bio->bi_end_io = btree_node_read_endio; |
| 310 | bio->bi_private = &cl; |
| 311 | |
| 312 | bch_bio_map(bio, b->sets[0].data); |
| 313 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 314 | bch_submit_bbio(bio, b->c, &b->key, 0); |
| 315 | closure_sync(&cl); |
| 316 | |
| 317 | if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) |
| 318 | set_btree_node_io_error(b); |
| 319 | |
| 320 | bch_bbio_free(bio, b->c); |
| 321 | |
| 322 | if (btree_node_io_error(b)) |
| 323 | goto err; |
| 324 | |
| 325 | bch_btree_node_read_done(b); |
| 326 | |
| 327 | spin_lock(&b->c->btree_read_time_lock); |
| 328 | bch_time_stats_update(&b->c->btree_read_time, start_time); |
| 329 | spin_unlock(&b->c->btree_read_time_lock); |
| 330 | |
| 331 | return; |
| 332 | err: |
Geert Uytterhoeven | 61cbd25 | 2013-09-23 23:17:30 -0700 | [diff] [blame] | 333 | bch_cache_set_error(b->c, "io error reading bucket %zu", |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 334 | PTR_BUCKET_NR(b->c, &b->key, 0)); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 335 | } |
| 336 | |
| 337 | static void btree_complete_write(struct btree *b, struct btree_write *w) |
| 338 | { |
| 339 | if (w->prio_blocked && |
| 340 | !atomic_sub_return(w->prio_blocked, &b->c->prio_blocked)) |
Kent Overstreet | 119ba0f | 2013-04-24 19:01:12 -0700 | [diff] [blame] | 341 | wake_up_allocators(b->c); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 342 | |
| 343 | if (w->journal) { |
| 344 | atomic_dec_bug(w->journal); |
| 345 | __closure_wake_up(&b->c->journal.wait); |
| 346 | } |
| 347 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 348 | w->prio_blocked = 0; |
| 349 | w->journal = NULL; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 350 | } |
| 351 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 352 | static void __btree_node_write_done(struct closure *cl) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 353 | { |
| 354 | struct btree *b = container_of(cl, struct btree, io.cl); |
| 355 | struct btree_write *w = btree_prev_write(b); |
| 356 | |
| 357 | bch_bbio_free(b->bio, b->c); |
| 358 | b->bio = NULL; |
| 359 | btree_complete_write(b, w); |
| 360 | |
| 361 | if (btree_node_dirty(b)) |
| 362 | queue_delayed_work(btree_io_wq, &b->work, |
| 363 | msecs_to_jiffies(30000)); |
| 364 | |
| 365 | closure_return(cl); |
| 366 | } |
| 367 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 368 | static void btree_node_write_done(struct closure *cl) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 369 | { |
| 370 | struct btree *b = container_of(cl, struct btree, io.cl); |
| 371 | struct bio_vec *bv; |
| 372 | int n; |
| 373 | |
| 374 | __bio_for_each_segment(bv, b->bio, n, 0) |
| 375 | __free_page(bv->bv_page); |
| 376 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 377 | __btree_node_write_done(cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 378 | } |
| 379 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 380 | static void btree_node_write_endio(struct bio *bio, int error) |
| 381 | { |
| 382 | struct closure *cl = bio->bi_private; |
| 383 | struct btree *b = container_of(cl, struct btree, io.cl); |
| 384 | |
| 385 | if (error) |
| 386 | set_btree_node_io_error(b); |
| 387 | |
| 388 | bch_bbio_count_io_errors(b->c, bio, error, "writing btree"); |
| 389 | closure_put(cl); |
| 390 | } |
| 391 | |
| 392 | static void do_btree_node_write(struct btree *b) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 393 | { |
| 394 | struct closure *cl = &b->io.cl; |
| 395 | struct bset *i = b->sets[b->nsets].data; |
| 396 | BKEY_PADDED(key) k; |
| 397 | |
| 398 | i->version = BCACHE_BSET_VERSION; |
| 399 | i->csum = btree_csum_set(b, i); |
| 400 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 401 | BUG_ON(b->bio); |
| 402 | b->bio = bch_bbio_alloc(b->c); |
| 403 | |
| 404 | b->bio->bi_end_io = btree_node_write_endio; |
Kent Overstreet | faadf0c | 2013-11-01 18:03:08 -0700 | [diff] [blame] | 405 | b->bio->bi_private = cl; |
Kent Overstreet | e49c7c3 | 2013-06-26 17:25:38 -0700 | [diff] [blame] | 406 | b->bio->bi_rw = REQ_META|WRITE_SYNC|REQ_FUA; |
| 407 | b->bio->bi_size = set_blocks(i, b->c) * block_bytes(b->c); |
Kent Overstreet | 169ef1c | 2013-03-28 12:50:55 -0600 | [diff] [blame] | 408 | bch_bio_map(b->bio, i); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 409 | |
Kent Overstreet | e49c7c3 | 2013-06-26 17:25:38 -0700 | [diff] [blame] | 410 | /* |
| 411 | * If we're appending to a leaf node, we don't technically need FUA - |
| 412 | * this write just needs to be persisted before the next journal write, |
| 413 | * which will be marked FLUSH|FUA. |
| 414 | * |
| 415 | * Similarly if we're writing a new btree root - the pointer is going to |
| 416 | * be in the next journal entry. |
| 417 | * |
| 418 | * But if we're writing a new btree node (that isn't a root) or |
| 419 | * appending to a non leaf btree node, we need either FUA or a flush |
| 420 | * when we write the parent with the new pointer. FUA is cheaper than a |
| 421 | * flush, and writes appending to leaf nodes aren't blocking anything so |
| 422 | * just make all btree node writes FUA to keep things sane. |
| 423 | */ |
| 424 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 425 | bkey_copy(&k.key, &b->key); |
| 426 | SET_PTR_OFFSET(&k.key, 0, PTR_OFFSET(&k.key, 0) + bset_offset(b, i)); |
| 427 | |
Kent Overstreet | 8e51e41 | 2013-06-06 18:15:57 -0700 | [diff] [blame] | 428 | if (!bio_alloc_pages(b->bio, GFP_NOIO)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 429 | int j; |
| 430 | struct bio_vec *bv; |
| 431 | void *base = (void *) ((unsigned long) i & ~(PAGE_SIZE - 1)); |
| 432 | |
| 433 | bio_for_each_segment(bv, b->bio, j) |
| 434 | memcpy(page_address(bv->bv_page), |
| 435 | base + j * PAGE_SIZE, PAGE_SIZE); |
| 436 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 437 | bch_submit_bbio(b->bio, b->c, &k.key, 0); |
| 438 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 439 | continue_at(cl, btree_node_write_done, NULL); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 440 | } else { |
| 441 | b->bio->bi_vcnt = 0; |
Kent Overstreet | 169ef1c | 2013-03-28 12:50:55 -0600 | [diff] [blame] | 442 | bch_bio_map(b->bio, i); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 443 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 444 | bch_submit_bbio(b->bio, b->c, &k.key, 0); |
| 445 | |
| 446 | closure_sync(cl); |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 447 | __btree_node_write_done(cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 448 | } |
| 449 | } |
| 450 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 451 | void bch_btree_node_write(struct btree *b, struct closure *parent) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 452 | { |
| 453 | struct bset *i = b->sets[b->nsets].data; |
| 454 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 455 | trace_bcache_btree_write(b); |
| 456 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 457 | BUG_ON(current->bio_list); |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 458 | BUG_ON(b->written >= btree_blocks(b)); |
| 459 | BUG_ON(b->written && !i->keys); |
| 460 | BUG_ON(b->sets->data->seq != i->seq); |
Kent Overstreet | 280481d | 2013-10-24 16:36:03 -0700 | [diff] [blame^] | 461 | bch_check_keys(b, "writing"); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 462 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 463 | cancel_delayed_work(&b->work); |
| 464 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 465 | /* If caller isn't waiting for write, parent refcount is cache set */ |
| 466 | closure_lock(&b->io, parent ?: &b->c->cl); |
| 467 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 468 | clear_bit(BTREE_NODE_dirty, &b->flags); |
| 469 | change_bit(BTREE_NODE_write_idx, &b->flags); |
| 470 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 471 | do_btree_node_write(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 472 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 473 | b->written += set_blocks(i, b->c); |
| 474 | atomic_long_add(set_blocks(i, b->c) * b->c->sb.block_size, |
| 475 | &PTR_CACHE(b->c, &b->key, 0)->btree_sectors_written); |
| 476 | |
| 477 | bch_btree_sort_lazy(b); |
| 478 | |
| 479 | if (b->written < btree_blocks(b)) |
| 480 | bch_bset_init_next(b); |
| 481 | } |
| 482 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 483 | static void btree_node_write_work(struct work_struct *w) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 484 | { |
| 485 | struct btree *b = container_of(to_delayed_work(w), struct btree, work); |
| 486 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 487 | rw_lock(true, b, b->level); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 488 | |
| 489 | if (btree_node_dirty(b)) |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 490 | bch_btree_node_write(b, NULL); |
| 491 | rw_unlock(true, b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 492 | } |
| 493 | |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 494 | static void bch_btree_leaf_dirty(struct btree *b, atomic_t *journal_ref) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 495 | { |
| 496 | struct bset *i = b->sets[b->nsets].data; |
| 497 | struct btree_write *w = btree_current_write(b); |
| 498 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 499 | BUG_ON(!b->written); |
| 500 | BUG_ON(!i->keys); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 501 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 502 | if (!btree_node_dirty(b)) |
| 503 | queue_delayed_work(btree_io_wq, &b->work, 30 * HZ); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 504 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 505 | set_btree_node_dirty(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 506 | |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 507 | if (journal_ref) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 508 | if (w->journal && |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 509 | journal_pin_cmp(b->c, w->journal, journal_ref)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 510 | atomic_dec_bug(w->journal); |
| 511 | w->journal = NULL; |
| 512 | } |
| 513 | |
| 514 | if (!w->journal) { |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 515 | w->journal = journal_ref; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 516 | atomic_inc(w->journal); |
| 517 | } |
| 518 | } |
| 519 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 520 | /* Force write if set is too big */ |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 521 | if (set_bytes(i) > PAGE_SIZE - 48 && |
| 522 | !current->bio_list) |
| 523 | bch_btree_node_write(b, NULL); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 524 | } |
| 525 | |
| 526 | /* |
| 527 | * Btree in memory cache - allocation/freeing |
| 528 | * mca -> memory cache |
| 529 | */ |
| 530 | |
| 531 | static void mca_reinit(struct btree *b) |
| 532 | { |
| 533 | unsigned i; |
| 534 | |
| 535 | b->flags = 0; |
| 536 | b->written = 0; |
| 537 | b->nsets = 0; |
| 538 | |
| 539 | for (i = 0; i < MAX_BSETS; i++) |
| 540 | b->sets[i].size = 0; |
| 541 | /* |
| 542 | * Second loop starts at 1 because b->sets[0]->data is the memory we |
| 543 | * allocated |
| 544 | */ |
| 545 | for (i = 1; i < MAX_BSETS; i++) |
| 546 | b->sets[i].data = NULL; |
| 547 | } |
| 548 | |
| 549 | #define mca_reserve(c) (((c->root && c->root->level) \ |
| 550 | ? c->root->level : 1) * 8 + 16) |
| 551 | #define mca_can_free(c) \ |
| 552 | max_t(int, 0, c->bucket_cache_used - mca_reserve(c)) |
| 553 | |
| 554 | static void mca_data_free(struct btree *b) |
| 555 | { |
| 556 | struct bset_tree *t = b->sets; |
| 557 | BUG_ON(!closure_is_unlocked(&b->io.cl)); |
| 558 | |
| 559 | if (bset_prev_bytes(b) < PAGE_SIZE) |
| 560 | kfree(t->prev); |
| 561 | else |
| 562 | free_pages((unsigned long) t->prev, |
| 563 | get_order(bset_prev_bytes(b))); |
| 564 | |
| 565 | if (bset_tree_bytes(b) < PAGE_SIZE) |
| 566 | kfree(t->tree); |
| 567 | else |
| 568 | free_pages((unsigned long) t->tree, |
| 569 | get_order(bset_tree_bytes(b))); |
| 570 | |
| 571 | free_pages((unsigned long) t->data, b->page_order); |
| 572 | |
| 573 | t->prev = NULL; |
| 574 | t->tree = NULL; |
| 575 | t->data = NULL; |
| 576 | list_move(&b->list, &b->c->btree_cache_freed); |
| 577 | b->c->bucket_cache_used--; |
| 578 | } |
| 579 | |
| 580 | static void mca_bucket_free(struct btree *b) |
| 581 | { |
| 582 | BUG_ON(btree_node_dirty(b)); |
| 583 | |
| 584 | b->key.ptr[0] = 0; |
| 585 | hlist_del_init_rcu(&b->hash); |
| 586 | list_move(&b->list, &b->c->btree_cache_freeable); |
| 587 | } |
| 588 | |
| 589 | static unsigned btree_order(struct bkey *k) |
| 590 | { |
| 591 | return ilog2(KEY_SIZE(k) / PAGE_SECTORS ?: 1); |
| 592 | } |
| 593 | |
| 594 | static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp) |
| 595 | { |
| 596 | struct bset_tree *t = b->sets; |
| 597 | BUG_ON(t->data); |
| 598 | |
| 599 | b->page_order = max_t(unsigned, |
| 600 | ilog2(b->c->btree_pages), |
| 601 | btree_order(k)); |
| 602 | |
| 603 | t->data = (void *) __get_free_pages(gfp, b->page_order); |
| 604 | if (!t->data) |
| 605 | goto err; |
| 606 | |
| 607 | t->tree = bset_tree_bytes(b) < PAGE_SIZE |
| 608 | ? kmalloc(bset_tree_bytes(b), gfp) |
| 609 | : (void *) __get_free_pages(gfp, get_order(bset_tree_bytes(b))); |
| 610 | if (!t->tree) |
| 611 | goto err; |
| 612 | |
| 613 | t->prev = bset_prev_bytes(b) < PAGE_SIZE |
| 614 | ? kmalloc(bset_prev_bytes(b), gfp) |
| 615 | : (void *) __get_free_pages(gfp, get_order(bset_prev_bytes(b))); |
| 616 | if (!t->prev) |
| 617 | goto err; |
| 618 | |
| 619 | list_move(&b->list, &b->c->btree_cache); |
| 620 | b->c->bucket_cache_used++; |
| 621 | return; |
| 622 | err: |
| 623 | mca_data_free(b); |
| 624 | } |
| 625 | |
| 626 | static struct btree *mca_bucket_alloc(struct cache_set *c, |
| 627 | struct bkey *k, gfp_t gfp) |
| 628 | { |
| 629 | struct btree *b = kzalloc(sizeof(struct btree), gfp); |
| 630 | if (!b) |
| 631 | return NULL; |
| 632 | |
| 633 | init_rwsem(&b->lock); |
| 634 | lockdep_set_novalidate_class(&b->lock); |
| 635 | INIT_LIST_HEAD(&b->list); |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 636 | INIT_DELAYED_WORK(&b->work, btree_node_write_work); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 637 | b->c = c; |
| 638 | closure_init_unlocked(&b->io); |
| 639 | |
| 640 | mca_data_alloc(b, k, gfp); |
| 641 | return b; |
| 642 | } |
| 643 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 644 | static int mca_reap(struct btree *b, unsigned min_order, bool flush) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 645 | { |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 646 | struct closure cl; |
| 647 | |
| 648 | closure_init_stack(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 649 | lockdep_assert_held(&b->c->bucket_lock); |
| 650 | |
| 651 | if (!down_write_trylock(&b->lock)) |
| 652 | return -ENOMEM; |
| 653 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 654 | BUG_ON(btree_node_dirty(b) && !b->sets[0].data); |
| 655 | |
| 656 | if (b->page_order < min_order || |
| 657 | (!flush && |
| 658 | (btree_node_dirty(b) || |
| 659 | atomic_read(&b->io.cl.remaining) != -1))) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 660 | rw_unlock(true, b); |
| 661 | return -ENOMEM; |
| 662 | } |
| 663 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 664 | if (btree_node_dirty(b)) { |
| 665 | bch_btree_node_write(b, &cl); |
| 666 | closure_sync(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 667 | } |
| 668 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 669 | /* wait for any in flight btree write */ |
Kent Overstreet | faadf0c | 2013-11-01 18:03:08 -0700 | [diff] [blame] | 670 | closure_wait_event(&b->io.wait, &cl, |
| 671 | atomic_read(&b->io.cl.remaining) == -1); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 672 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 673 | return 0; |
| 674 | } |
| 675 | |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 676 | static unsigned long bch_mca_scan(struct shrinker *shrink, |
| 677 | struct shrink_control *sc) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 678 | { |
| 679 | struct cache_set *c = container_of(shrink, struct cache_set, shrink); |
| 680 | struct btree *b, *t; |
| 681 | unsigned long i, nr = sc->nr_to_scan; |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 682 | unsigned long freed = 0; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 683 | |
| 684 | if (c->shrinker_disabled) |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 685 | return SHRINK_STOP; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 686 | |
| 687 | if (c->try_harder) |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 688 | return SHRINK_STOP; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 689 | |
| 690 | /* Return -1 if we can't do anything right now */ |
Kent Overstreet | a698e08 | 2013-09-23 23:17:34 -0700 | [diff] [blame] | 691 | if (sc->gfp_mask & __GFP_IO) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 692 | mutex_lock(&c->bucket_lock); |
| 693 | else if (!mutex_trylock(&c->bucket_lock)) |
| 694 | return -1; |
| 695 | |
Kent Overstreet | 36c9ea9 | 2013-06-03 13:04:56 -0700 | [diff] [blame] | 696 | /* |
| 697 | * It's _really_ critical that we don't free too many btree nodes - we |
| 698 | * have to always leave ourselves a reserve. The reserve is how we |
| 699 | * guarantee that allocating memory for a new btree node can always |
| 700 | * succeed, so that inserting keys into the btree can always succeed and |
| 701 | * IO can always make forward progress: |
| 702 | */ |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 703 | nr /= c->btree_pages; |
| 704 | nr = min_t(unsigned long, nr, mca_can_free(c)); |
| 705 | |
| 706 | i = 0; |
| 707 | list_for_each_entry_safe(b, t, &c->btree_cache_freeable, list) { |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 708 | if (freed >= nr) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 709 | break; |
| 710 | |
| 711 | if (++i > 3 && |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 712 | !mca_reap(b, 0, false)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 713 | mca_data_free(b); |
| 714 | rw_unlock(true, b); |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 715 | freed++; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 716 | } |
| 717 | } |
| 718 | |
| 719 | /* |
| 720 | * Can happen right when we first start up, before we've read in any |
| 721 | * btree nodes |
| 722 | */ |
| 723 | if (list_empty(&c->btree_cache)) |
| 724 | goto out; |
| 725 | |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 726 | for (i = 0; (nr--) && i < c->bucket_cache_used; i++) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 727 | b = list_first_entry(&c->btree_cache, struct btree, list); |
| 728 | list_rotate_left(&c->btree_cache); |
| 729 | |
| 730 | if (!b->accessed && |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 731 | !mca_reap(b, 0, false)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 732 | mca_bucket_free(b); |
| 733 | mca_data_free(b); |
| 734 | rw_unlock(true, b); |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 735 | freed++; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 736 | } else |
| 737 | b->accessed = 0; |
| 738 | } |
| 739 | out: |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 740 | mutex_unlock(&c->bucket_lock); |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 741 | return freed; |
| 742 | } |
| 743 | |
| 744 | static unsigned long bch_mca_count(struct shrinker *shrink, |
| 745 | struct shrink_control *sc) |
| 746 | { |
| 747 | struct cache_set *c = container_of(shrink, struct cache_set, shrink); |
| 748 | |
| 749 | if (c->shrinker_disabled) |
| 750 | return 0; |
| 751 | |
| 752 | if (c->try_harder) |
| 753 | return 0; |
| 754 | |
| 755 | return mca_can_free(c) * c->btree_pages; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 756 | } |
| 757 | |
| 758 | void bch_btree_cache_free(struct cache_set *c) |
| 759 | { |
| 760 | struct btree *b; |
| 761 | struct closure cl; |
| 762 | closure_init_stack(&cl); |
| 763 | |
| 764 | if (c->shrink.list.next) |
| 765 | unregister_shrinker(&c->shrink); |
| 766 | |
| 767 | mutex_lock(&c->bucket_lock); |
| 768 | |
| 769 | #ifdef CONFIG_BCACHE_DEBUG |
| 770 | if (c->verify_data) |
| 771 | list_move(&c->verify_data->list, &c->btree_cache); |
| 772 | #endif |
| 773 | |
| 774 | list_splice(&c->btree_cache_freeable, |
| 775 | &c->btree_cache); |
| 776 | |
| 777 | while (!list_empty(&c->btree_cache)) { |
| 778 | b = list_first_entry(&c->btree_cache, struct btree, list); |
| 779 | |
| 780 | if (btree_node_dirty(b)) |
| 781 | btree_complete_write(b, btree_current_write(b)); |
| 782 | clear_bit(BTREE_NODE_dirty, &b->flags); |
| 783 | |
| 784 | mca_data_free(b); |
| 785 | } |
| 786 | |
| 787 | while (!list_empty(&c->btree_cache_freed)) { |
| 788 | b = list_first_entry(&c->btree_cache_freed, |
| 789 | struct btree, list); |
| 790 | list_del(&b->list); |
| 791 | cancel_delayed_work_sync(&b->work); |
| 792 | kfree(b); |
| 793 | } |
| 794 | |
| 795 | mutex_unlock(&c->bucket_lock); |
| 796 | } |
| 797 | |
| 798 | int bch_btree_cache_alloc(struct cache_set *c) |
| 799 | { |
| 800 | unsigned i; |
| 801 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 802 | for (i = 0; i < mca_reserve(c); i++) |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 803 | if (!mca_bucket_alloc(c, &ZERO_KEY, GFP_KERNEL)) |
| 804 | return -ENOMEM; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 805 | |
| 806 | list_splice_init(&c->btree_cache, |
| 807 | &c->btree_cache_freeable); |
| 808 | |
| 809 | #ifdef CONFIG_BCACHE_DEBUG |
| 810 | mutex_init(&c->verify_lock); |
| 811 | |
| 812 | c->verify_data = mca_bucket_alloc(c, &ZERO_KEY, GFP_KERNEL); |
| 813 | |
| 814 | if (c->verify_data && |
| 815 | c->verify_data->sets[0].data) |
| 816 | list_del_init(&c->verify_data->list); |
| 817 | else |
| 818 | c->verify_data = NULL; |
| 819 | #endif |
| 820 | |
Dave Chinner | 7dc19d5 | 2013-08-28 10:18:11 +1000 | [diff] [blame] | 821 | c->shrink.count_objects = bch_mca_count; |
| 822 | c->shrink.scan_objects = bch_mca_scan; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 823 | c->shrink.seeks = 4; |
| 824 | c->shrink.batch = c->btree_pages * 2; |
| 825 | register_shrinker(&c->shrink); |
| 826 | |
| 827 | return 0; |
| 828 | } |
| 829 | |
| 830 | /* Btree in memory cache - hash table */ |
| 831 | |
| 832 | static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) |
| 833 | { |
| 834 | return &c->bucket_hash[hash_32(PTR_HASH(c, k), BUCKET_HASH_BITS)]; |
| 835 | } |
| 836 | |
| 837 | static struct btree *mca_find(struct cache_set *c, struct bkey *k) |
| 838 | { |
| 839 | struct btree *b; |
| 840 | |
| 841 | rcu_read_lock(); |
| 842 | hlist_for_each_entry_rcu(b, mca_hash(c, k), hash) |
| 843 | if (PTR_HASH(c, &b->key) == PTR_HASH(c, k)) |
| 844 | goto out; |
| 845 | b = NULL; |
| 846 | out: |
| 847 | rcu_read_unlock(); |
| 848 | return b; |
| 849 | } |
| 850 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 851 | static struct btree *mca_cannibalize(struct cache_set *c, struct bkey *k) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 852 | { |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 853 | struct btree *b; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 854 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 855 | trace_bcache_btree_cache_cannibalize(c); |
| 856 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 857 | if (!c->try_harder) { |
| 858 | c->try_harder = current; |
| 859 | c->try_harder_start = local_clock(); |
| 860 | } else if (c->try_harder != current) |
| 861 | return ERR_PTR(-ENOSPC); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 862 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 863 | list_for_each_entry_reverse(b, &c->btree_cache, list) |
| 864 | if (!mca_reap(b, btree_order(k), false)) |
| 865 | return b; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 866 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 867 | list_for_each_entry_reverse(b, &c->btree_cache, list) |
| 868 | if (!mca_reap(b, btree_order(k), true)) |
| 869 | return b; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 870 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 871 | return ERR_PTR(-ENOMEM); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 872 | } |
| 873 | |
| 874 | /* |
| 875 | * We can only have one thread cannibalizing other cached btree nodes at a time, |
| 876 | * or we'll deadlock. We use an open coded mutex to ensure that, which a |
| 877 | * cannibalize_bucket() will take. This means every time we unlock the root of |
| 878 | * the btree, we need to release this lock if we have it held. |
| 879 | */ |
Kent Overstreet | df8e897 | 2013-07-24 17:37:59 -0700 | [diff] [blame] | 880 | static void bch_cannibalize_unlock(struct cache_set *c) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 881 | { |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 882 | if (c->try_harder == current) { |
Kent Overstreet | 169ef1c | 2013-03-28 12:50:55 -0600 | [diff] [blame] | 883 | bch_time_stats_update(&c->try_harder_time, c->try_harder_start); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 884 | c->try_harder = NULL; |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 885 | wake_up(&c->try_wait); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 886 | } |
| 887 | } |
| 888 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 889 | static struct btree *mca_alloc(struct cache_set *c, struct bkey *k, int level) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 890 | { |
| 891 | struct btree *b; |
| 892 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 893 | BUG_ON(current->bio_list); |
| 894 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 895 | lockdep_assert_held(&c->bucket_lock); |
| 896 | |
| 897 | if (mca_find(c, k)) |
| 898 | return NULL; |
| 899 | |
| 900 | /* btree_free() doesn't free memory; it sticks the node on the end of |
| 901 | * the list. Check if there's any freed nodes there: |
| 902 | */ |
| 903 | list_for_each_entry(b, &c->btree_cache_freeable, list) |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 904 | if (!mca_reap(b, btree_order(k), false)) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 905 | goto out; |
| 906 | |
| 907 | /* We never free struct btree itself, just the memory that holds the on |
| 908 | * disk node. Check the freed list before allocating a new one: |
| 909 | */ |
| 910 | list_for_each_entry(b, &c->btree_cache_freed, list) |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 911 | if (!mca_reap(b, 0, false)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 912 | mca_data_alloc(b, k, __GFP_NOWARN|GFP_NOIO); |
| 913 | if (!b->sets[0].data) |
| 914 | goto err; |
| 915 | else |
| 916 | goto out; |
| 917 | } |
| 918 | |
| 919 | b = mca_bucket_alloc(c, k, __GFP_NOWARN|GFP_NOIO); |
| 920 | if (!b) |
| 921 | goto err; |
| 922 | |
| 923 | BUG_ON(!down_write_trylock(&b->lock)); |
| 924 | if (!b->sets->data) |
| 925 | goto err; |
| 926 | out: |
| 927 | BUG_ON(!closure_is_unlocked(&b->io.cl)); |
| 928 | |
| 929 | bkey_copy(&b->key, k); |
| 930 | list_move(&b->list, &c->btree_cache); |
| 931 | hlist_del_init_rcu(&b->hash); |
| 932 | hlist_add_head_rcu(&b->hash, mca_hash(c, k)); |
| 933 | |
| 934 | lock_set_subclass(&b->lock.dep_map, level + 1, _THIS_IP_); |
| 935 | b->level = level; |
Kent Overstreet | d6fd3b1 | 2013-07-24 17:20:19 -0700 | [diff] [blame] | 936 | b->parent = (void *) ~0UL; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 937 | |
| 938 | mca_reinit(b); |
| 939 | |
| 940 | return b; |
| 941 | err: |
| 942 | if (b) |
| 943 | rw_unlock(true, b); |
| 944 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 945 | b = mca_cannibalize(c, k); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 946 | if (!IS_ERR(b)) |
| 947 | goto out; |
| 948 | |
| 949 | return b; |
| 950 | } |
| 951 | |
| 952 | /** |
| 953 | * bch_btree_node_get - find a btree node in the cache and lock it, reading it |
| 954 | * in from disk if necessary. |
| 955 | * |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 956 | * If IO is necessary and running under generic_make_request, returns -EAGAIN. |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 957 | * |
| 958 | * The btree node will have either a read or a write lock held, depending on |
| 959 | * level and op->lock. |
| 960 | */ |
| 961 | struct btree *bch_btree_node_get(struct cache_set *c, struct bkey *k, |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 962 | int level, bool write) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 963 | { |
| 964 | int i = 0; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 965 | struct btree *b; |
| 966 | |
| 967 | BUG_ON(level < 0); |
| 968 | retry: |
| 969 | b = mca_find(c, k); |
| 970 | |
| 971 | if (!b) { |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 972 | if (current->bio_list) |
| 973 | return ERR_PTR(-EAGAIN); |
| 974 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 975 | mutex_lock(&c->bucket_lock); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 976 | b = mca_alloc(c, k, level); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 977 | mutex_unlock(&c->bucket_lock); |
| 978 | |
| 979 | if (!b) |
| 980 | goto retry; |
| 981 | if (IS_ERR(b)) |
| 982 | return b; |
| 983 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 984 | bch_btree_node_read(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 985 | |
| 986 | if (!write) |
| 987 | downgrade_write(&b->lock); |
| 988 | } else { |
| 989 | rw_lock(write, b, level); |
| 990 | if (PTR_HASH(c, &b->key) != PTR_HASH(c, k)) { |
| 991 | rw_unlock(write, b); |
| 992 | goto retry; |
| 993 | } |
| 994 | BUG_ON(b->level != level); |
| 995 | } |
| 996 | |
| 997 | b->accessed = 1; |
| 998 | |
| 999 | for (; i <= b->nsets && b->sets[i].size; i++) { |
| 1000 | prefetch(b->sets[i].tree); |
| 1001 | prefetch(b->sets[i].data); |
| 1002 | } |
| 1003 | |
| 1004 | for (; i <= b->nsets; i++) |
| 1005 | prefetch(b->sets[i].data); |
| 1006 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1007 | if (btree_node_io_error(b)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1008 | rw_unlock(write, b); |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1009 | return ERR_PTR(-EIO); |
| 1010 | } |
| 1011 | |
| 1012 | BUG_ON(!b->written); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1013 | |
| 1014 | return b; |
| 1015 | } |
| 1016 | |
| 1017 | static void btree_node_prefetch(struct cache_set *c, struct bkey *k, int level) |
| 1018 | { |
| 1019 | struct btree *b; |
| 1020 | |
| 1021 | mutex_lock(&c->bucket_lock); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1022 | b = mca_alloc(c, k, level); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1023 | mutex_unlock(&c->bucket_lock); |
| 1024 | |
| 1025 | if (!IS_ERR_OR_NULL(b)) { |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1026 | bch_btree_node_read(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1027 | rw_unlock(true, b); |
| 1028 | } |
| 1029 | } |
| 1030 | |
| 1031 | /* Btree alloc */ |
| 1032 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1033 | static void btree_node_free(struct btree *b) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1034 | { |
| 1035 | unsigned i; |
| 1036 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1037 | trace_bcache_btree_node_free(b); |
| 1038 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1039 | BUG_ON(b == b->c->root); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1040 | |
| 1041 | if (btree_node_dirty(b)) |
| 1042 | btree_complete_write(b, btree_current_write(b)); |
| 1043 | clear_bit(BTREE_NODE_dirty, &b->flags); |
| 1044 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1045 | cancel_delayed_work(&b->work); |
| 1046 | |
| 1047 | mutex_lock(&b->c->bucket_lock); |
| 1048 | |
| 1049 | for (i = 0; i < KEY_PTRS(&b->key); i++) { |
| 1050 | BUG_ON(atomic_read(&PTR_BUCKET(b->c, &b->key, i)->pin)); |
| 1051 | |
| 1052 | bch_inc_gen(PTR_CACHE(b->c, &b->key, i), |
| 1053 | PTR_BUCKET(b->c, &b->key, i)); |
| 1054 | } |
| 1055 | |
| 1056 | bch_bucket_free(b->c, &b->key); |
| 1057 | mca_bucket_free(b); |
| 1058 | mutex_unlock(&b->c->bucket_lock); |
| 1059 | } |
| 1060 | |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1061 | struct btree *bch_btree_node_alloc(struct cache_set *c, int level) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1062 | { |
| 1063 | BKEY_PADDED(key) k; |
| 1064 | struct btree *b = ERR_PTR(-EAGAIN); |
| 1065 | |
| 1066 | mutex_lock(&c->bucket_lock); |
| 1067 | retry: |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1068 | if (__bch_bucket_alloc_set(c, WATERMARK_METADATA, &k.key, 1, true)) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1069 | goto err; |
| 1070 | |
| 1071 | SET_KEY_SIZE(&k.key, c->btree_pages * PAGE_SECTORS); |
| 1072 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1073 | b = mca_alloc(c, &k.key, level); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1074 | if (IS_ERR(b)) |
| 1075 | goto err_free; |
| 1076 | |
| 1077 | if (!b) { |
Kent Overstreet | b1a67b0 | 2013-03-25 11:46:44 -0700 | [diff] [blame] | 1078 | cache_bug(c, |
| 1079 | "Tried to allocate bucket that was in btree cache"); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1080 | __bkey_put(c, &k.key); |
| 1081 | goto retry; |
| 1082 | } |
| 1083 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1084 | b->accessed = 1; |
| 1085 | bch_bset_init_next(b); |
| 1086 | |
| 1087 | mutex_unlock(&c->bucket_lock); |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1088 | |
| 1089 | trace_bcache_btree_node_alloc(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1090 | return b; |
| 1091 | err_free: |
| 1092 | bch_bucket_free(c, &k.key); |
| 1093 | __bkey_put(c, &k.key); |
| 1094 | err: |
| 1095 | mutex_unlock(&c->bucket_lock); |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1096 | |
| 1097 | trace_bcache_btree_node_alloc_fail(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1098 | return b; |
| 1099 | } |
| 1100 | |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1101 | static struct btree *btree_node_alloc_replacement(struct btree *b) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1102 | { |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1103 | struct btree *n = bch_btree_node_alloc(b->c, b->level); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1104 | if (!IS_ERR_OR_NULL(n)) |
| 1105 | bch_btree_sort_into(b, n); |
| 1106 | |
| 1107 | return n; |
| 1108 | } |
| 1109 | |
| 1110 | /* Garbage collection */ |
| 1111 | |
| 1112 | uint8_t __bch_btree_mark_key(struct cache_set *c, int level, struct bkey *k) |
| 1113 | { |
| 1114 | uint8_t stale = 0; |
| 1115 | unsigned i; |
| 1116 | struct bucket *g; |
| 1117 | |
| 1118 | /* |
| 1119 | * ptr_invalid() can't return true for the keys that mark btree nodes as |
| 1120 | * freed, but since ptr_bad() returns true we'll never actually use them |
| 1121 | * for anything and thus we don't want mark their pointers here |
| 1122 | */ |
| 1123 | if (!bkey_cmp(k, &ZERO_KEY)) |
| 1124 | return stale; |
| 1125 | |
| 1126 | for (i = 0; i < KEY_PTRS(k); i++) { |
| 1127 | if (!ptr_available(c, k, i)) |
| 1128 | continue; |
| 1129 | |
| 1130 | g = PTR_BUCKET(c, k, i); |
| 1131 | |
| 1132 | if (gen_after(g->gc_gen, PTR_GEN(k, i))) |
| 1133 | g->gc_gen = PTR_GEN(k, i); |
| 1134 | |
| 1135 | if (ptr_stale(c, k, i)) { |
| 1136 | stale = max(stale, ptr_stale(c, k, i)); |
| 1137 | continue; |
| 1138 | } |
| 1139 | |
| 1140 | cache_bug_on(GC_MARK(g) && |
| 1141 | (GC_MARK(g) == GC_MARK_METADATA) != (level != 0), |
| 1142 | c, "inconsistent ptrs: mark = %llu, level = %i", |
| 1143 | GC_MARK(g), level); |
| 1144 | |
| 1145 | if (level) |
| 1146 | SET_GC_MARK(g, GC_MARK_METADATA); |
| 1147 | else if (KEY_DIRTY(k)) |
| 1148 | SET_GC_MARK(g, GC_MARK_DIRTY); |
| 1149 | |
| 1150 | /* guard against overflow */ |
| 1151 | SET_GC_SECTORS_USED(g, min_t(unsigned, |
| 1152 | GC_SECTORS_USED(g) + KEY_SIZE(k), |
| 1153 | (1 << 14) - 1)); |
| 1154 | |
| 1155 | BUG_ON(!GC_SECTORS_USED(g)); |
| 1156 | } |
| 1157 | |
| 1158 | return stale; |
| 1159 | } |
| 1160 | |
| 1161 | #define btree_mark_key(b, k) __bch_btree_mark_key(b->c, b->level, k) |
| 1162 | |
| 1163 | static int btree_gc_mark_node(struct btree *b, unsigned *keys, |
| 1164 | struct gc_stat *gc) |
| 1165 | { |
| 1166 | uint8_t stale = 0; |
| 1167 | unsigned last_dev = -1; |
| 1168 | struct bcache_device *d = NULL; |
| 1169 | struct bkey *k; |
| 1170 | struct btree_iter iter; |
| 1171 | struct bset_tree *t; |
| 1172 | |
| 1173 | gc->nodes++; |
| 1174 | |
| 1175 | for_each_key_filter(b, k, &iter, bch_ptr_invalid) { |
| 1176 | if (last_dev != KEY_INODE(k)) { |
| 1177 | last_dev = KEY_INODE(k); |
| 1178 | |
| 1179 | d = KEY_INODE(k) < b->c->nr_uuids |
| 1180 | ? b->c->devices[last_dev] |
| 1181 | : NULL; |
| 1182 | } |
| 1183 | |
| 1184 | stale = max(stale, btree_mark_key(b, k)); |
| 1185 | |
| 1186 | if (bch_ptr_bad(b, k)) |
| 1187 | continue; |
| 1188 | |
| 1189 | *keys += bkey_u64s(k); |
| 1190 | |
| 1191 | gc->key_bytes += bkey_u64s(k); |
| 1192 | gc->nkeys++; |
| 1193 | |
| 1194 | gc->data += KEY_SIZE(k); |
Kent Overstreet | 444fc0b | 2013-05-11 17:07:26 -0700 | [diff] [blame] | 1195 | if (KEY_DIRTY(k)) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1196 | gc->dirty += KEY_SIZE(k); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1197 | } |
| 1198 | |
| 1199 | for (t = b->sets; t <= &b->sets[b->nsets]; t++) |
| 1200 | btree_bug_on(t->size && |
| 1201 | bset_written(b, t) && |
| 1202 | bkey_cmp(&b->key, &t->end) < 0, |
| 1203 | b, "found short btree key in gc"); |
| 1204 | |
| 1205 | return stale; |
| 1206 | } |
| 1207 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1208 | static struct btree *btree_gc_alloc(struct btree *b, struct bkey *k) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1209 | { |
| 1210 | /* |
| 1211 | * We block priorities from being written for the duration of garbage |
| 1212 | * collection, so we can't sleep in btree_alloc() -> |
| 1213 | * bch_bucket_alloc_set(), or we'd risk deadlock - so we don't pass it |
| 1214 | * our closure. |
| 1215 | */ |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1216 | struct btree *n = btree_node_alloc_replacement(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1217 | |
| 1218 | if (!IS_ERR_OR_NULL(n)) { |
| 1219 | swap(b, n); |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1220 | __bkey_put(b->c, &b->key); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1221 | |
| 1222 | memcpy(k->ptr, b->key.ptr, |
| 1223 | sizeof(uint64_t) * KEY_PTRS(&b->key)); |
| 1224 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1225 | btree_node_free(n); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1226 | up_write(&n->lock); |
| 1227 | } |
| 1228 | |
| 1229 | return b; |
| 1230 | } |
| 1231 | |
| 1232 | /* |
| 1233 | * Leaving this at 2 until we've got incremental garbage collection done; it |
| 1234 | * could be higher (and has been tested with 4) except that garbage collection |
| 1235 | * could take much longer, adversely affecting latency. |
| 1236 | */ |
| 1237 | #define GC_MERGE_NODES 2U |
| 1238 | |
| 1239 | struct gc_merge_info { |
| 1240 | struct btree *b; |
| 1241 | struct bkey *k; |
| 1242 | unsigned keys; |
| 1243 | }; |
| 1244 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1245 | static void btree_gc_coalesce(struct btree *b, struct gc_stat *gc, |
| 1246 | struct gc_merge_info *r) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1247 | { |
| 1248 | unsigned nodes = 0, keys = 0, blocks; |
| 1249 | int i; |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1250 | struct closure cl; |
| 1251 | |
| 1252 | closure_init_stack(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1253 | |
| 1254 | while (nodes < GC_MERGE_NODES && r[nodes].b) |
| 1255 | keys += r[nodes++].keys; |
| 1256 | |
| 1257 | blocks = btree_default_blocks(b->c) * 2 / 3; |
| 1258 | |
| 1259 | if (nodes < 2 || |
| 1260 | __set_blocks(b->sets[0].data, keys, b->c) > blocks * (nodes - 1)) |
| 1261 | return; |
| 1262 | |
| 1263 | for (i = nodes - 1; i >= 0; --i) { |
| 1264 | if (r[i].b->written) |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1265 | r[i].b = btree_gc_alloc(r[i].b, r[i].k); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1266 | |
| 1267 | if (r[i].b->written) |
| 1268 | return; |
| 1269 | } |
| 1270 | |
| 1271 | for (i = nodes - 1; i > 0; --i) { |
| 1272 | struct bset *n1 = r[i].b->sets->data; |
| 1273 | struct bset *n2 = r[i - 1].b->sets->data; |
| 1274 | struct bkey *k, *last = NULL; |
| 1275 | |
| 1276 | keys = 0; |
| 1277 | |
| 1278 | if (i == 1) { |
| 1279 | /* |
| 1280 | * Last node we're not getting rid of - we're getting |
| 1281 | * rid of the node at r[0]. Have to try and fit all of |
| 1282 | * the remaining keys into this node; we can't ensure |
| 1283 | * they will always fit due to rounding and variable |
| 1284 | * length keys (shouldn't be possible in practice, |
| 1285 | * though) |
| 1286 | */ |
| 1287 | if (__set_blocks(n1, n1->keys + r->keys, |
| 1288 | b->c) > btree_blocks(r[i].b)) |
| 1289 | return; |
| 1290 | |
| 1291 | keys = n2->keys; |
| 1292 | last = &r->b->key; |
| 1293 | } else |
| 1294 | for (k = n2->start; |
| 1295 | k < end(n2); |
| 1296 | k = bkey_next(k)) { |
| 1297 | if (__set_blocks(n1, n1->keys + keys + |
| 1298 | bkey_u64s(k), b->c) > blocks) |
| 1299 | break; |
| 1300 | |
| 1301 | last = k; |
| 1302 | keys += bkey_u64s(k); |
| 1303 | } |
| 1304 | |
| 1305 | BUG_ON(__set_blocks(n1, n1->keys + keys, |
| 1306 | b->c) > btree_blocks(r[i].b)); |
| 1307 | |
| 1308 | if (last) { |
| 1309 | bkey_copy_key(&r[i].b->key, last); |
| 1310 | bkey_copy_key(r[i].k, last); |
| 1311 | } |
| 1312 | |
| 1313 | memcpy(end(n1), |
| 1314 | n2->start, |
| 1315 | (void *) node(n2, keys) - (void *) n2->start); |
| 1316 | |
| 1317 | n1->keys += keys; |
| 1318 | |
| 1319 | memmove(n2->start, |
| 1320 | node(n2, keys), |
| 1321 | (void *) end(n2) - (void *) node(n2, keys)); |
| 1322 | |
| 1323 | n2->keys -= keys; |
| 1324 | |
| 1325 | r[i].keys = n1->keys; |
| 1326 | r[i - 1].keys = n2->keys; |
| 1327 | } |
| 1328 | |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1329 | btree_node_free(r->b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1330 | up_write(&r->b->lock); |
| 1331 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1332 | trace_bcache_btree_gc_coalesce(nodes); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1333 | |
| 1334 | gc->nodes--; |
| 1335 | nodes--; |
| 1336 | |
| 1337 | memmove(&r[0], &r[1], sizeof(struct gc_merge_info) * nodes); |
| 1338 | memset(&r[nodes], 0, sizeof(struct gc_merge_info)); |
| 1339 | } |
| 1340 | |
| 1341 | static int btree_gc_recurse(struct btree *b, struct btree_op *op, |
| 1342 | struct closure *writes, struct gc_stat *gc) |
| 1343 | { |
| 1344 | void write(struct btree *r) |
| 1345 | { |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1346 | if (!r->written || btree_node_dirty(r)) |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1347 | bch_btree_node_write(r, writes); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1348 | |
| 1349 | up_write(&r->lock); |
| 1350 | } |
| 1351 | |
| 1352 | int ret = 0, stale; |
| 1353 | unsigned i; |
| 1354 | struct gc_merge_info r[GC_MERGE_NODES]; |
| 1355 | |
| 1356 | memset(r, 0, sizeof(r)); |
| 1357 | |
| 1358 | while ((r->k = bch_next_recurse_key(b, &b->c->gc_done))) { |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1359 | r->b = bch_btree_node_get(b->c, r->k, b->level - 1, true); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1360 | |
| 1361 | if (IS_ERR(r->b)) { |
| 1362 | ret = PTR_ERR(r->b); |
| 1363 | break; |
| 1364 | } |
| 1365 | |
| 1366 | r->keys = 0; |
| 1367 | stale = btree_gc_mark_node(r->b, &r->keys, gc); |
| 1368 | |
| 1369 | if (!b->written && |
| 1370 | (r->b->level || stale > 10 || |
| 1371 | b->c->gc_always_rewrite)) |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1372 | r->b = btree_gc_alloc(r->b, r->k); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1373 | |
| 1374 | if (r->b->level) |
| 1375 | ret = btree_gc_recurse(r->b, op, writes, gc); |
| 1376 | |
| 1377 | if (ret) { |
| 1378 | write(r->b); |
| 1379 | break; |
| 1380 | } |
| 1381 | |
| 1382 | bkey_copy_key(&b->c->gc_done, r->k); |
| 1383 | |
| 1384 | if (!b->written) |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1385 | btree_gc_coalesce(b, gc, r); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1386 | |
| 1387 | if (r[GC_MERGE_NODES - 1].b) |
| 1388 | write(r[GC_MERGE_NODES - 1].b); |
| 1389 | |
| 1390 | memmove(&r[1], &r[0], |
| 1391 | sizeof(struct gc_merge_info) * (GC_MERGE_NODES - 1)); |
| 1392 | |
| 1393 | /* When we've got incremental GC working, we'll want to do |
| 1394 | * if (should_resched()) |
| 1395 | * return -EAGAIN; |
| 1396 | */ |
| 1397 | cond_resched(); |
| 1398 | #if 0 |
| 1399 | if (need_resched()) { |
| 1400 | ret = -EAGAIN; |
| 1401 | break; |
| 1402 | } |
| 1403 | #endif |
| 1404 | } |
| 1405 | |
| 1406 | for (i = 1; i < GC_MERGE_NODES && r[i].b; i++) |
| 1407 | write(r[i].b); |
| 1408 | |
| 1409 | /* Might have freed some children, must remove their keys */ |
| 1410 | if (!b->written) |
| 1411 | bch_btree_sort(b); |
| 1412 | |
| 1413 | return ret; |
| 1414 | } |
| 1415 | |
| 1416 | static int bch_btree_gc_root(struct btree *b, struct btree_op *op, |
| 1417 | struct closure *writes, struct gc_stat *gc) |
| 1418 | { |
| 1419 | struct btree *n = NULL; |
| 1420 | unsigned keys = 0; |
| 1421 | int ret = 0, stale = btree_gc_mark_node(b, &keys, gc); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1422 | struct closure cl; |
| 1423 | |
| 1424 | closure_init_stack(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1425 | |
| 1426 | if (b->level || stale > 10) |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1427 | n = btree_node_alloc_replacement(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1428 | |
| 1429 | if (!IS_ERR_OR_NULL(n)) |
| 1430 | swap(b, n); |
| 1431 | |
| 1432 | if (b->level) |
| 1433 | ret = btree_gc_recurse(b, op, writes, gc); |
| 1434 | |
| 1435 | if (!b->written || btree_node_dirty(b)) { |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1436 | bch_btree_node_write(b, n ? &cl : NULL); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1437 | } |
| 1438 | |
| 1439 | if (!IS_ERR_OR_NULL(n)) { |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1440 | closure_sync(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1441 | bch_btree_set_root(b); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 1442 | btree_node_free(n); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1443 | rw_unlock(true, b); |
| 1444 | } |
| 1445 | |
| 1446 | return ret; |
| 1447 | } |
| 1448 | |
| 1449 | static void btree_gc_start(struct cache_set *c) |
| 1450 | { |
| 1451 | struct cache *ca; |
| 1452 | struct bucket *b; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1453 | unsigned i; |
| 1454 | |
| 1455 | if (!c->gc_mark_valid) |
| 1456 | return; |
| 1457 | |
| 1458 | mutex_lock(&c->bucket_lock); |
| 1459 | |
| 1460 | c->gc_mark_valid = 0; |
| 1461 | c->gc_done = ZERO_KEY; |
| 1462 | |
| 1463 | for_each_cache(ca, c, i) |
| 1464 | for_each_bucket(b, ca) { |
| 1465 | b->gc_gen = b->gen; |
Kent Overstreet | 29ebf46 | 2013-07-11 19:43:21 -0700 | [diff] [blame] | 1466 | if (!atomic_read(&b->pin)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1467 | SET_GC_MARK(b, GC_MARK_RECLAIMABLE); |
Kent Overstreet | 29ebf46 | 2013-07-11 19:43:21 -0700 | [diff] [blame] | 1468 | SET_GC_SECTORS_USED(b, 0); |
| 1469 | } |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1470 | } |
| 1471 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1472 | mutex_unlock(&c->bucket_lock); |
| 1473 | } |
| 1474 | |
| 1475 | size_t bch_btree_gc_finish(struct cache_set *c) |
| 1476 | { |
| 1477 | size_t available = 0; |
| 1478 | struct bucket *b; |
| 1479 | struct cache *ca; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1480 | unsigned i; |
| 1481 | |
| 1482 | mutex_lock(&c->bucket_lock); |
| 1483 | |
| 1484 | set_gc_sectors(c); |
| 1485 | c->gc_mark_valid = 1; |
| 1486 | c->need_gc = 0; |
| 1487 | |
| 1488 | if (c->root) |
| 1489 | for (i = 0; i < KEY_PTRS(&c->root->key); i++) |
| 1490 | SET_GC_MARK(PTR_BUCKET(c, &c->root->key, i), |
| 1491 | GC_MARK_METADATA); |
| 1492 | |
| 1493 | for (i = 0; i < KEY_PTRS(&c->uuid_bucket); i++) |
| 1494 | SET_GC_MARK(PTR_BUCKET(c, &c->uuid_bucket, i), |
| 1495 | GC_MARK_METADATA); |
| 1496 | |
| 1497 | for_each_cache(ca, c, i) { |
| 1498 | uint64_t *i; |
| 1499 | |
| 1500 | ca->invalidate_needs_gc = 0; |
| 1501 | |
| 1502 | for (i = ca->sb.d; i < ca->sb.d + ca->sb.keys; i++) |
| 1503 | SET_GC_MARK(ca->buckets + *i, GC_MARK_METADATA); |
| 1504 | |
| 1505 | for (i = ca->prio_buckets; |
| 1506 | i < ca->prio_buckets + prio_buckets(ca) * 2; i++) |
| 1507 | SET_GC_MARK(ca->buckets + *i, GC_MARK_METADATA); |
| 1508 | |
| 1509 | for_each_bucket(b, ca) { |
| 1510 | b->last_gc = b->gc_gen; |
| 1511 | c->need_gc = max(c->need_gc, bucket_gc_gen(b)); |
| 1512 | |
| 1513 | if (!atomic_read(&b->pin) && |
| 1514 | GC_MARK(b) == GC_MARK_RECLAIMABLE) { |
| 1515 | available++; |
| 1516 | if (!GC_SECTORS_USED(b)) |
| 1517 | bch_bucket_add_unused(ca, b); |
| 1518 | } |
| 1519 | } |
| 1520 | } |
| 1521 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1522 | mutex_unlock(&c->bucket_lock); |
| 1523 | return available; |
| 1524 | } |
| 1525 | |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 1526 | static void bch_btree_gc(struct cache_set *c) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1527 | { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1528 | int ret; |
| 1529 | unsigned long available; |
| 1530 | struct gc_stat stats; |
| 1531 | struct closure writes; |
| 1532 | struct btree_op op; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1533 | uint64_t start_time = local_clock(); |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1534 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1535 | trace_bcache_gc_start(c); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1536 | |
| 1537 | memset(&stats, 0, sizeof(struct gc_stat)); |
| 1538 | closure_init_stack(&writes); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1539 | bch_btree_op_init(&op, SHRT_MAX); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1540 | |
| 1541 | btree_gc_start(c); |
| 1542 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1543 | atomic_inc(&c->prio_blocked); |
| 1544 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1545 | ret = btree_root(gc_root, c, &op, &writes, &stats); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1546 | closure_sync(&writes); |
| 1547 | |
| 1548 | if (ret) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1549 | pr_warn("gc failed!"); |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 1550 | return; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1551 | } |
| 1552 | |
| 1553 | /* Possibly wait for new UUIDs or whatever to hit disk */ |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1554 | bch_journal_meta(c, &writes); |
| 1555 | closure_sync(&writes); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1556 | |
| 1557 | available = bch_btree_gc_finish(c); |
| 1558 | |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1559 | atomic_dec(&c->prio_blocked); |
| 1560 | wake_up_allocators(c); |
| 1561 | |
Kent Overstreet | 169ef1c | 2013-03-28 12:50:55 -0600 | [diff] [blame] | 1562 | bch_time_stats_update(&c->btree_gc_time, start_time); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1563 | |
| 1564 | stats.key_bytes *= sizeof(uint64_t); |
| 1565 | stats.dirty <<= 9; |
| 1566 | stats.data <<= 9; |
| 1567 | stats.in_use = (c->nbuckets - available) * 100 / c->nbuckets; |
| 1568 | memcpy(&c->gc_stats, &stats, sizeof(struct gc_stat)); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1569 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1570 | trace_bcache_gc_end(c); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1571 | |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 1572 | bch_moving_gc(c); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1573 | } |
| 1574 | |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 1575 | static int bch_gc_thread(void *arg) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1576 | { |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 1577 | struct cache_set *c = arg; |
| 1578 | |
| 1579 | while (1) { |
| 1580 | bch_btree_gc(c); |
| 1581 | |
| 1582 | set_current_state(TASK_INTERRUPTIBLE); |
| 1583 | if (kthread_should_stop()) |
| 1584 | break; |
| 1585 | |
| 1586 | try_to_freeze(); |
| 1587 | schedule(); |
| 1588 | } |
| 1589 | |
| 1590 | return 0; |
| 1591 | } |
| 1592 | |
| 1593 | int bch_gc_thread_start(struct cache_set *c) |
| 1594 | { |
| 1595 | c->gc_thread = kthread_create(bch_gc_thread, c, "bcache_gc"); |
| 1596 | if (IS_ERR(c->gc_thread)) |
| 1597 | return PTR_ERR(c->gc_thread); |
| 1598 | |
| 1599 | set_task_state(c->gc_thread, TASK_INTERRUPTIBLE); |
| 1600 | return 0; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1601 | } |
| 1602 | |
| 1603 | /* Initial partial gc */ |
| 1604 | |
| 1605 | static int bch_btree_check_recurse(struct btree *b, struct btree_op *op, |
| 1606 | unsigned long **seen) |
| 1607 | { |
| 1608 | int ret; |
| 1609 | unsigned i; |
| 1610 | struct bkey *k; |
| 1611 | struct bucket *g; |
| 1612 | struct btree_iter iter; |
| 1613 | |
| 1614 | for_each_key_filter(b, k, &iter, bch_ptr_invalid) { |
| 1615 | for (i = 0; i < KEY_PTRS(k); i++) { |
| 1616 | if (!ptr_available(b->c, k, i)) |
| 1617 | continue; |
| 1618 | |
| 1619 | g = PTR_BUCKET(b->c, k, i); |
| 1620 | |
| 1621 | if (!__test_and_set_bit(PTR_BUCKET_NR(b->c, k, i), |
| 1622 | seen[PTR_DEV(k, i)]) || |
| 1623 | !ptr_stale(b->c, k, i)) { |
| 1624 | g->gen = PTR_GEN(k, i); |
| 1625 | |
| 1626 | if (b->level) |
| 1627 | g->prio = BTREE_PRIO; |
| 1628 | else if (g->prio == BTREE_PRIO) |
| 1629 | g->prio = INITIAL_PRIO; |
| 1630 | } |
| 1631 | } |
| 1632 | |
| 1633 | btree_mark_key(b, k); |
| 1634 | } |
| 1635 | |
| 1636 | if (b->level) { |
| 1637 | k = bch_next_recurse_key(b, &ZERO_KEY); |
| 1638 | |
| 1639 | while (k) { |
| 1640 | struct bkey *p = bch_next_recurse_key(b, k); |
| 1641 | if (p) |
| 1642 | btree_node_prefetch(b->c, p, b->level - 1); |
| 1643 | |
| 1644 | ret = btree(check_recurse, k, b, op, seen); |
| 1645 | if (ret) |
| 1646 | return ret; |
| 1647 | |
| 1648 | k = p; |
| 1649 | } |
| 1650 | } |
| 1651 | |
| 1652 | return 0; |
| 1653 | } |
| 1654 | |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 1655 | int bch_btree_check(struct cache_set *c) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1656 | { |
| 1657 | int ret = -ENOMEM; |
| 1658 | unsigned i; |
| 1659 | unsigned long *seen[MAX_CACHES_PER_SET]; |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 1660 | struct btree_op op; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1661 | |
| 1662 | memset(seen, 0, sizeof(seen)); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1663 | bch_btree_op_init(&op, SHRT_MAX); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1664 | |
| 1665 | for (i = 0; c->cache[i]; i++) { |
| 1666 | size_t n = DIV_ROUND_UP(c->cache[i]->sb.nbuckets, 8); |
| 1667 | seen[i] = kmalloc(n, GFP_KERNEL); |
| 1668 | if (!seen[i]) |
| 1669 | goto err; |
| 1670 | |
| 1671 | /* Disables the seen array until prio_read() uses it too */ |
| 1672 | memset(seen[i], 0xFF, n); |
| 1673 | } |
| 1674 | |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 1675 | ret = btree_root(check_recurse, c, &op, seen); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1676 | err: |
| 1677 | for (i = 0; i < MAX_CACHES_PER_SET; i++) |
| 1678 | kfree(seen[i]); |
| 1679 | return ret; |
| 1680 | } |
| 1681 | |
| 1682 | /* Btree insertion */ |
| 1683 | |
| 1684 | static void shift_keys(struct btree *b, struct bkey *where, struct bkey *insert) |
| 1685 | { |
| 1686 | struct bset *i = b->sets[b->nsets].data; |
| 1687 | |
| 1688 | memmove((uint64_t *) where + bkey_u64s(insert), |
| 1689 | where, |
| 1690 | (void *) end(i) - (void *) where); |
| 1691 | |
| 1692 | i->keys += bkey_u64s(insert); |
| 1693 | bkey_copy(where, insert); |
| 1694 | bch_bset_fix_lookup_table(b, where); |
| 1695 | } |
| 1696 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1697 | static bool fix_overlapping_extents(struct btree *b, struct bkey *insert, |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1698 | struct btree_iter *iter, |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1699 | struct bkey *replace_key) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1700 | { |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 1701 | void subtract_dirty(struct bkey *k, uint64_t offset, int sectors) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1702 | { |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 1703 | if (KEY_DIRTY(k)) |
| 1704 | bcache_dev_sectors_dirty_add(b->c, KEY_INODE(k), |
| 1705 | offset, -sectors); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1706 | } |
| 1707 | |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 1708 | uint64_t old_offset; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1709 | unsigned old_size, sectors_found = 0; |
| 1710 | |
| 1711 | while (1) { |
| 1712 | struct bkey *k = bch_btree_iter_next(iter); |
| 1713 | if (!k || |
| 1714 | bkey_cmp(&START_KEY(k), insert) >= 0) |
| 1715 | break; |
| 1716 | |
| 1717 | if (bkey_cmp(k, &START_KEY(insert)) <= 0) |
| 1718 | continue; |
| 1719 | |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 1720 | old_offset = KEY_START(k); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1721 | old_size = KEY_SIZE(k); |
| 1722 | |
| 1723 | /* |
| 1724 | * We might overlap with 0 size extents; we can't skip these |
| 1725 | * because if they're in the set we're inserting to we have to |
| 1726 | * adjust them so they don't overlap with the key we're |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1727 | * inserting. But we don't want to check them for replace |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1728 | * operations. |
| 1729 | */ |
| 1730 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1731 | if (replace_key && KEY_SIZE(k)) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1732 | /* |
| 1733 | * k might have been split since we inserted/found the |
| 1734 | * key we're replacing |
| 1735 | */ |
| 1736 | unsigned i; |
| 1737 | uint64_t offset = KEY_START(k) - |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1738 | KEY_START(replace_key); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1739 | |
| 1740 | /* But it must be a subset of the replace key */ |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1741 | if (KEY_START(k) < KEY_START(replace_key) || |
| 1742 | KEY_OFFSET(k) > KEY_OFFSET(replace_key)) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1743 | goto check_failed; |
| 1744 | |
| 1745 | /* We didn't find a key that we were supposed to */ |
| 1746 | if (KEY_START(k) > KEY_START(insert) + sectors_found) |
| 1747 | goto check_failed; |
| 1748 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1749 | if (KEY_PTRS(replace_key) != KEY_PTRS(k)) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1750 | goto check_failed; |
| 1751 | |
| 1752 | /* skip past gen */ |
| 1753 | offset <<= 8; |
| 1754 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1755 | BUG_ON(!KEY_PTRS(replace_key)); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1756 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1757 | for (i = 0; i < KEY_PTRS(replace_key); i++) |
| 1758 | if (k->ptr[i] != replace_key->ptr[i] + offset) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1759 | goto check_failed; |
| 1760 | |
| 1761 | sectors_found = KEY_OFFSET(k) - KEY_START(insert); |
| 1762 | } |
| 1763 | |
| 1764 | if (bkey_cmp(insert, k) < 0 && |
| 1765 | bkey_cmp(&START_KEY(insert), &START_KEY(k)) > 0) { |
| 1766 | /* |
| 1767 | * We overlapped in the middle of an existing key: that |
| 1768 | * means we have to split the old key. But we have to do |
| 1769 | * slightly different things depending on whether the |
| 1770 | * old key has been written out yet. |
| 1771 | */ |
| 1772 | |
| 1773 | struct bkey *top; |
| 1774 | |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 1775 | subtract_dirty(k, KEY_START(insert), KEY_SIZE(insert)); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1776 | |
| 1777 | if (bkey_written(b, k)) { |
| 1778 | /* |
| 1779 | * We insert a new key to cover the top of the |
| 1780 | * old key, and the old key is modified in place |
| 1781 | * to represent the bottom split. |
| 1782 | * |
| 1783 | * It's completely arbitrary whether the new key |
| 1784 | * is the top or the bottom, but it has to match |
| 1785 | * up with what btree_sort_fixup() does - it |
| 1786 | * doesn't check for this kind of overlap, it |
| 1787 | * depends on us inserting a new key for the top |
| 1788 | * here. |
| 1789 | */ |
| 1790 | top = bch_bset_search(b, &b->sets[b->nsets], |
| 1791 | insert); |
| 1792 | shift_keys(b, top, k); |
| 1793 | } else { |
| 1794 | BKEY_PADDED(key) temp; |
| 1795 | bkey_copy(&temp.key, k); |
| 1796 | shift_keys(b, k, &temp.key); |
| 1797 | top = bkey_next(k); |
| 1798 | } |
| 1799 | |
| 1800 | bch_cut_front(insert, top); |
| 1801 | bch_cut_back(&START_KEY(insert), k); |
| 1802 | bch_bset_fix_invalidated_key(b, k); |
| 1803 | return false; |
| 1804 | } |
| 1805 | |
| 1806 | if (bkey_cmp(insert, k) < 0) { |
| 1807 | bch_cut_front(insert, k); |
| 1808 | } else { |
Kent Overstreet | 1fa8455 | 2013-11-10 21:55:27 -0800 | [diff] [blame] | 1809 | if (bkey_cmp(&START_KEY(insert), &START_KEY(k)) > 0) |
| 1810 | old_offset = KEY_START(insert); |
| 1811 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1812 | if (bkey_written(b, k) && |
| 1813 | bkey_cmp(&START_KEY(insert), &START_KEY(k)) <= 0) { |
| 1814 | /* |
| 1815 | * Completely overwrote, so we don't have to |
| 1816 | * invalidate the binary search tree |
| 1817 | */ |
| 1818 | bch_cut_front(k, k); |
| 1819 | } else { |
| 1820 | __bch_cut_back(&START_KEY(insert), k); |
| 1821 | bch_bset_fix_invalidated_key(b, k); |
| 1822 | } |
| 1823 | } |
| 1824 | |
Kent Overstreet | 279afba | 2013-06-05 06:21:07 -0700 | [diff] [blame] | 1825 | subtract_dirty(k, old_offset, old_size - KEY_SIZE(k)); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1826 | } |
| 1827 | |
| 1828 | check_failed: |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1829 | if (replace_key) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1830 | if (!sectors_found) { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1831 | return true; |
| 1832 | } else if (sectors_found < KEY_SIZE(insert)) { |
| 1833 | SET_KEY_OFFSET(insert, KEY_OFFSET(insert) - |
| 1834 | (KEY_SIZE(insert) - sectors_found)); |
| 1835 | SET_KEY_SIZE(insert, sectors_found); |
| 1836 | } |
| 1837 | } |
| 1838 | |
| 1839 | return false; |
| 1840 | } |
| 1841 | |
| 1842 | static bool btree_insert_key(struct btree *b, struct btree_op *op, |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1843 | struct bkey *k, struct bkey *replace_key) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1844 | { |
| 1845 | struct bset *i = b->sets[b->nsets].data; |
| 1846 | struct bkey *m, *prev; |
Kent Overstreet | 85b1492 | 2013-05-14 20:33:16 -0700 | [diff] [blame] | 1847 | unsigned status = BTREE_INSERT_STATUS_INSERT; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1848 | |
| 1849 | BUG_ON(bkey_cmp(k, &b->key) > 0); |
| 1850 | BUG_ON(b->level && !KEY_PTRS(k)); |
| 1851 | BUG_ON(!b->level && !KEY_OFFSET(k)); |
| 1852 | |
| 1853 | if (!b->level) { |
| 1854 | struct btree_iter iter; |
| 1855 | struct bkey search = KEY(KEY_INODE(k), KEY_START(k), 0); |
| 1856 | |
| 1857 | /* |
| 1858 | * bset_search() returns the first key that is strictly greater |
| 1859 | * than the search key - but for back merging, we want to find |
| 1860 | * the first key that is greater than or equal to KEY_START(k) - |
| 1861 | * unless KEY_START(k) is 0. |
| 1862 | */ |
| 1863 | if (KEY_OFFSET(&search)) |
| 1864 | SET_KEY_OFFSET(&search, KEY_OFFSET(&search) - 1); |
| 1865 | |
| 1866 | prev = NULL; |
| 1867 | m = bch_btree_iter_init(b, &iter, &search); |
| 1868 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1869 | if (fix_overlapping_extents(b, k, &iter, replace_key)) { |
| 1870 | op->insert_collision = true; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1871 | return false; |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1872 | } |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1873 | |
Kent Overstreet | 1fa8455 | 2013-11-10 21:55:27 -0800 | [diff] [blame] | 1874 | if (KEY_DIRTY(k)) |
| 1875 | bcache_dev_sectors_dirty_add(b->c, KEY_INODE(k), |
| 1876 | KEY_START(k), KEY_SIZE(k)); |
| 1877 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1878 | while (m != end(i) && |
| 1879 | bkey_cmp(k, &START_KEY(m)) > 0) |
| 1880 | prev = m, m = bkey_next(m); |
| 1881 | |
| 1882 | if (key_merging_disabled(b->c)) |
| 1883 | goto insert; |
| 1884 | |
| 1885 | /* prev is in the tree, if we merge we're done */ |
Kent Overstreet | 85b1492 | 2013-05-14 20:33:16 -0700 | [diff] [blame] | 1886 | status = BTREE_INSERT_STATUS_BACK_MERGE; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1887 | if (prev && |
| 1888 | bch_bkey_try_merge(b, prev, k)) |
| 1889 | goto merged; |
| 1890 | |
Kent Overstreet | 85b1492 | 2013-05-14 20:33:16 -0700 | [diff] [blame] | 1891 | status = BTREE_INSERT_STATUS_OVERWROTE; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1892 | if (m != end(i) && |
| 1893 | KEY_PTRS(m) == KEY_PTRS(k) && !KEY_SIZE(m)) |
| 1894 | goto copy; |
| 1895 | |
Kent Overstreet | 85b1492 | 2013-05-14 20:33:16 -0700 | [diff] [blame] | 1896 | status = BTREE_INSERT_STATUS_FRONT_MERGE; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1897 | if (m != end(i) && |
| 1898 | bch_bkey_try_merge(b, k, m)) |
| 1899 | goto copy; |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1900 | } else { |
| 1901 | BUG_ON(replace_key); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1902 | m = bch_bset_search(b, &b->sets[b->nsets], k); |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1903 | } |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1904 | |
| 1905 | insert: shift_keys(b, m, k); |
| 1906 | copy: bkey_copy(m, k); |
| 1907 | merged: |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1908 | bch_check_keys(b, "%u for %s", status, |
| 1909 | replace_key ? "replace" : "insert"); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1910 | |
| 1911 | if (b->level && !KEY_OFFSET(k)) |
Kent Overstreet | 5794351 | 2013-04-25 13:58:35 -0700 | [diff] [blame] | 1912 | btree_current_write(b)->prio_blocked++; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1913 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1914 | trace_bcache_btree_insert_key(b, k, replace_key != NULL, status); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1915 | |
| 1916 | return true; |
| 1917 | } |
| 1918 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1919 | static bool bch_btree_insert_keys(struct btree *b, struct btree_op *op, |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1920 | struct keylist *insert_keys, |
| 1921 | struct bkey *replace_key) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1922 | { |
| 1923 | bool ret = false; |
Kent Overstreet | 280481d | 2013-10-24 16:36:03 -0700 | [diff] [blame^] | 1924 | int oldsize = bch_count_data(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1925 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1926 | while (!bch_keylist_empty(insert_keys)) { |
Kent Overstreet | 403b6cd | 2013-07-24 17:22:44 -0700 | [diff] [blame] | 1927 | struct bset *i = write_block(b); |
Kent Overstreet | c2f95ae | 2013-07-24 17:24:25 -0700 | [diff] [blame] | 1928 | struct bkey *k = insert_keys->keys; |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1929 | |
Kent Overstreet | 403b6cd | 2013-07-24 17:22:44 -0700 | [diff] [blame] | 1930 | if (b->written + __set_blocks(i, i->keys + bkey_u64s(k), b->c) |
| 1931 | > btree_blocks(b)) |
| 1932 | break; |
| 1933 | |
| 1934 | if (bkey_cmp(k, &b->key) <= 0) { |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1935 | bkey_put(b->c, k, b->level); |
| 1936 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1937 | ret |= btree_insert_key(b, op, k, replace_key); |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1938 | bch_keylist_pop_front(insert_keys); |
| 1939 | } else if (bkey_cmp(&START_KEY(k), &b->key) < 0) { |
| 1940 | #if 0 |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1941 | if (replace_key) { |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1942 | bkey_put(b->c, k, b->level); |
| 1943 | bch_keylist_pop_front(insert_keys); |
| 1944 | op->insert_collision = true; |
| 1945 | break; |
| 1946 | } |
| 1947 | #endif |
| 1948 | BKEY_PADDED(key) temp; |
Kent Overstreet | c2f95ae | 2013-07-24 17:24:25 -0700 | [diff] [blame] | 1949 | bkey_copy(&temp.key, insert_keys->keys); |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1950 | |
| 1951 | bch_cut_back(&b->key, &temp.key); |
Kent Overstreet | c2f95ae | 2013-07-24 17:24:25 -0700 | [diff] [blame] | 1952 | bch_cut_front(&b->key, insert_keys->keys); |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1953 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1954 | ret |= btree_insert_key(b, op, &temp.key, replace_key); |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1955 | break; |
| 1956 | } else { |
| 1957 | break; |
| 1958 | } |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1959 | } |
| 1960 | |
Kent Overstreet | 403b6cd | 2013-07-24 17:22:44 -0700 | [diff] [blame] | 1961 | BUG_ON(!bch_keylist_empty(insert_keys) && b->level); |
| 1962 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1963 | BUG_ON(bch_count_data(b) < oldsize); |
| 1964 | return ret; |
| 1965 | } |
| 1966 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 1967 | static int btree_split(struct btree *b, struct btree_op *op, |
| 1968 | struct keylist *insert_keys, |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 1969 | struct keylist *parent_keys, |
| 1970 | struct bkey *replace_key) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1971 | { |
Kent Overstreet | d6fd3b1 | 2013-07-24 17:20:19 -0700 | [diff] [blame] | 1972 | bool split; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1973 | struct btree *n1, *n2 = NULL, *n3 = NULL; |
| 1974 | uint64_t start_time = local_clock(); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 1975 | struct closure cl; |
| 1976 | |
| 1977 | closure_init_stack(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1978 | |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1979 | n1 = btree_node_alloc_replacement(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1980 | if (IS_ERR(n1)) |
| 1981 | goto err; |
| 1982 | |
| 1983 | split = set_blocks(n1->sets[0].data, n1->c) > (btree_blocks(b) * 4) / 5; |
| 1984 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1985 | if (split) { |
| 1986 | unsigned keys = 0; |
| 1987 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 1988 | trace_bcache_btree_node_split(b, n1->sets[0].data->keys); |
| 1989 | |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1990 | n2 = bch_btree_node_alloc(b->c, b->level); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1991 | if (IS_ERR(n2)) |
| 1992 | goto err_free1; |
| 1993 | |
Kent Overstreet | d6fd3b1 | 2013-07-24 17:20:19 -0700 | [diff] [blame] | 1994 | if (!b->parent) { |
Kent Overstreet | 35fcd84 | 2013-07-24 17:29:09 -0700 | [diff] [blame] | 1995 | n3 = bch_btree_node_alloc(b->c, b->level + 1); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 1996 | if (IS_ERR(n3)) |
| 1997 | goto err_free2; |
| 1998 | } |
| 1999 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2000 | bch_btree_insert_keys(n1, op, insert_keys, replace_key); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2001 | |
Kent Overstreet | d6fd3b1 | 2013-07-24 17:20:19 -0700 | [diff] [blame] | 2002 | /* |
| 2003 | * Has to be a linear search because we don't have an auxiliary |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2004 | * search tree yet |
| 2005 | */ |
| 2006 | |
| 2007 | while (keys < (n1->sets[0].data->keys * 3) / 5) |
| 2008 | keys += bkey_u64s(node(n1->sets[0].data, keys)); |
| 2009 | |
| 2010 | bkey_copy_key(&n1->key, node(n1->sets[0].data, keys)); |
| 2011 | keys += bkey_u64s(node(n1->sets[0].data, keys)); |
| 2012 | |
| 2013 | n2->sets[0].data->keys = n1->sets[0].data->keys - keys; |
| 2014 | n1->sets[0].data->keys = keys; |
| 2015 | |
| 2016 | memcpy(n2->sets[0].data->start, |
| 2017 | end(n1->sets[0].data), |
| 2018 | n2->sets[0].data->keys * sizeof(uint64_t)); |
| 2019 | |
| 2020 | bkey_copy_key(&n2->key, &b->key); |
| 2021 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2022 | bch_keylist_add(parent_keys, &n2->key); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2023 | bch_btree_node_write(n2, &cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2024 | rw_unlock(true, n2); |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 2025 | } else { |
| 2026 | trace_bcache_btree_node_compact(b, n1->sets[0].data->keys); |
| 2027 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2028 | bch_btree_insert_keys(n1, op, insert_keys, replace_key); |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 2029 | } |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2030 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2031 | bch_keylist_add(parent_keys, &n1->key); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2032 | bch_btree_node_write(n1, &cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2033 | |
| 2034 | if (n3) { |
Kent Overstreet | d6fd3b1 | 2013-07-24 17:20:19 -0700 | [diff] [blame] | 2035 | /* Depth increases, make a new root */ |
| 2036 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2037 | bkey_copy_key(&n3->key, &MAX_KEY); |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2038 | bch_btree_insert_keys(n3, op, parent_keys, NULL); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2039 | bch_btree_node_write(n3, &cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2040 | |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2041 | closure_sync(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2042 | bch_btree_set_root(n3); |
| 2043 | rw_unlock(true, n3); |
Kent Overstreet | d6fd3b1 | 2013-07-24 17:20:19 -0700 | [diff] [blame] | 2044 | } else if (!b->parent) { |
| 2045 | /* Root filled up but didn't need to be split */ |
| 2046 | |
Kent Overstreet | c2f95ae | 2013-07-24 17:24:25 -0700 | [diff] [blame] | 2047 | bch_keylist_reset(parent_keys); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2048 | closure_sync(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2049 | bch_btree_set_root(n1); |
| 2050 | } else { |
| 2051 | unsigned i; |
| 2052 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2053 | bkey_copy(parent_keys->top, &b->key); |
| 2054 | bkey_copy_key(parent_keys->top, &ZERO_KEY); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2055 | |
| 2056 | for (i = 0; i < KEY_PTRS(&b->key); i++) { |
| 2057 | uint8_t g = PTR_BUCKET(b->c, &b->key, i)->gen + 1; |
| 2058 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2059 | SET_PTR_GEN(parent_keys->top, i, g); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2060 | } |
| 2061 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2062 | bch_keylist_push(parent_keys); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2063 | closure_sync(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2064 | atomic_inc(&b->c->prio_blocked); |
| 2065 | } |
| 2066 | |
| 2067 | rw_unlock(true, n1); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 2068 | btree_node_free(b); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2069 | |
Kent Overstreet | 169ef1c | 2013-03-28 12:50:55 -0600 | [diff] [blame] | 2070 | bch_time_stats_update(&b->c->btree_split_time, start_time); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2071 | |
| 2072 | return 0; |
| 2073 | err_free2: |
| 2074 | __bkey_put(n2->c, &n2->key); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 2075 | btree_node_free(n2); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2076 | rw_unlock(true, n2); |
| 2077 | err_free1: |
| 2078 | __bkey_put(n1->c, &n1->key); |
Kent Overstreet | e8e1d46 | 2013-07-24 17:27:07 -0700 | [diff] [blame] | 2079 | btree_node_free(n1); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2080 | rw_unlock(true, n1); |
| 2081 | err: |
| 2082 | if (n3 == ERR_PTR(-EAGAIN) || |
| 2083 | n2 == ERR_PTR(-EAGAIN) || |
| 2084 | n1 == ERR_PTR(-EAGAIN)) |
| 2085 | return -EAGAIN; |
| 2086 | |
| 2087 | pr_warn("couldn't split"); |
| 2088 | return -ENOMEM; |
| 2089 | } |
| 2090 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2091 | static int bch_btree_insert_node(struct btree *b, struct btree_op *op, |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 2092 | struct keylist *insert_keys, |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2093 | atomic_t *journal_ref, |
| 2094 | struct bkey *replace_key) |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2095 | { |
| 2096 | int ret = 0; |
| 2097 | struct keylist split_keys; |
| 2098 | |
| 2099 | bch_keylist_init(&split_keys); |
| 2100 | |
| 2101 | BUG_ON(b->level); |
| 2102 | |
| 2103 | do { |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2104 | BUG_ON(b->level && replace_key); |
| 2105 | |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2106 | if (should_split(b)) { |
| 2107 | if (current->bio_list) { |
| 2108 | op->lock = b->c->root->level + 1; |
| 2109 | ret = -EAGAIN; |
| 2110 | } else if (op->lock <= b->c->root->level) { |
| 2111 | op->lock = b->c->root->level + 1; |
| 2112 | ret = -EINTR; |
| 2113 | } else { |
| 2114 | struct btree *parent = b->parent; |
| 2115 | |
| 2116 | ret = btree_split(b, op, insert_keys, |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2117 | &split_keys, replace_key); |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2118 | insert_keys = &split_keys; |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2119 | replace_key = NULL; |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2120 | b = parent; |
Kent Overstreet | 403b6cd | 2013-07-24 17:22:44 -0700 | [diff] [blame] | 2121 | if (!ret) |
| 2122 | ret = -EINTR; |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2123 | } |
| 2124 | } else { |
| 2125 | BUG_ON(write_block(b) != b->sets[b->nsets].data); |
| 2126 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2127 | if (bch_btree_insert_keys(b, op, insert_keys, |
| 2128 | replace_key)) { |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2129 | if (!b->level) { |
Kent Overstreet | c18536a | 2013-07-24 17:44:17 -0700 | [diff] [blame] | 2130 | bch_btree_leaf_dirty(b, journal_ref); |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2131 | } else { |
| 2132 | struct closure cl; |
| 2133 | |
| 2134 | closure_init_stack(&cl); |
| 2135 | bch_btree_node_write(b, &cl); |
| 2136 | closure_sync(&cl); |
| 2137 | } |
Kent Overstreet | 26c949f | 2013-09-10 18:41:15 -0700 | [diff] [blame] | 2138 | } |
| 2139 | } |
| 2140 | } while (!bch_keylist_empty(&split_keys)); |
| 2141 | |
| 2142 | return ret; |
| 2143 | } |
| 2144 | |
Kent Overstreet | e7c590e | 2013-09-10 18:39:16 -0700 | [diff] [blame] | 2145 | int bch_btree_insert_check_key(struct btree *b, struct btree_op *op, |
| 2146 | struct bkey *check_key) |
| 2147 | { |
| 2148 | int ret = -EINTR; |
| 2149 | uint64_t btree_ptr = b->key.ptr[0]; |
| 2150 | unsigned long seq = b->seq; |
| 2151 | struct keylist insert; |
| 2152 | bool upgrade = op->lock == -1; |
| 2153 | |
| 2154 | bch_keylist_init(&insert); |
| 2155 | |
| 2156 | if (upgrade) { |
| 2157 | rw_unlock(false, b); |
| 2158 | rw_lock(true, b, b->level); |
| 2159 | |
| 2160 | if (b->key.ptr[0] != btree_ptr || |
| 2161 | b->seq != seq + 1) |
| 2162 | goto out; |
| 2163 | } |
| 2164 | |
| 2165 | SET_KEY_PTRS(check_key, 1); |
| 2166 | get_random_bytes(&check_key->ptr[0], sizeof(uint64_t)); |
| 2167 | |
| 2168 | SET_PTR_DEV(check_key, 0, PTR_CHECK_DEV); |
| 2169 | |
| 2170 | bch_keylist_add(&insert, check_key); |
| 2171 | |
Kent Overstreet | 1b207d8 | 2013-09-10 18:52:54 -0700 | [diff] [blame] | 2172 | ret = bch_btree_insert_node(b, op, &insert, NULL, NULL); |
Kent Overstreet | e7c590e | 2013-09-10 18:39:16 -0700 | [diff] [blame] | 2173 | |
| 2174 | BUG_ON(!ret && !bch_keylist_empty(&insert)); |
| 2175 | out: |
| 2176 | if (upgrade) |
| 2177 | downgrade_write(&b->lock); |
| 2178 | return ret; |
| 2179 | } |
| 2180 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2181 | struct btree_insert_op { |
| 2182 | struct btree_op op; |
| 2183 | struct keylist *keys; |
| 2184 | atomic_t *journal_ref; |
| 2185 | struct bkey *replace_key; |
| 2186 | }; |
| 2187 | |
| 2188 | int btree_insert_fn(struct btree_op *b_op, struct btree *b) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2189 | { |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2190 | struct btree_insert_op *op = container_of(b_op, |
| 2191 | struct btree_insert_op, op); |
Kent Overstreet | 403b6cd | 2013-07-24 17:22:44 -0700 | [diff] [blame] | 2192 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2193 | int ret = bch_btree_insert_node(b, &op->op, op->keys, |
| 2194 | op->journal_ref, op->replace_key); |
| 2195 | if (ret && !bch_keylist_empty(op->keys)) |
| 2196 | return ret; |
| 2197 | else |
| 2198 | return MAP_DONE; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2199 | } |
| 2200 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2201 | int bch_btree_insert(struct cache_set *c, struct keylist *keys, |
| 2202 | atomic_t *journal_ref, struct bkey *replace_key) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2203 | { |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2204 | struct btree_insert_op op; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2205 | int ret = 0; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2206 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2207 | BUG_ON(current->bio_list); |
Kent Overstreet | 4f3d401 | 2013-09-10 18:46:36 -0700 | [diff] [blame] | 2208 | BUG_ON(bch_keylist_empty(keys)); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2209 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2210 | bch_btree_op_init(&op.op, 0); |
| 2211 | op.keys = keys; |
| 2212 | op.journal_ref = journal_ref; |
| 2213 | op.replace_key = replace_key; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2214 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2215 | while (!ret && !bch_keylist_empty(keys)) { |
| 2216 | op.op.lock = 0; |
| 2217 | ret = bch_btree_map_leaf_nodes(&op.op, c, |
| 2218 | &START_KEY(keys->keys), |
| 2219 | btree_insert_fn); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2220 | } |
| 2221 | |
Kent Overstreet | cc7b881 | 2013-07-24 18:07:22 -0700 | [diff] [blame] | 2222 | if (ret) { |
| 2223 | struct bkey *k; |
| 2224 | |
| 2225 | pr_err("error %i", ret); |
| 2226 | |
| 2227 | while ((k = bch_keylist_pop(keys))) |
| 2228 | bkey_put(c, k, 0); |
| 2229 | } else if (op.op.insert_collision) |
| 2230 | ret = -ESRCH; |
Kent Overstreet | 6054c6d | 2013-07-24 18:06:22 -0700 | [diff] [blame] | 2231 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2232 | return ret; |
| 2233 | } |
| 2234 | |
| 2235 | void bch_btree_set_root(struct btree *b) |
| 2236 | { |
| 2237 | unsigned i; |
Kent Overstreet | e49c7c3 | 2013-06-26 17:25:38 -0700 | [diff] [blame] | 2238 | struct closure cl; |
| 2239 | |
| 2240 | closure_init_stack(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2241 | |
Kent Overstreet | c37511b | 2013-04-26 15:39:55 -0700 | [diff] [blame] | 2242 | trace_bcache_btree_set_root(b); |
| 2243 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2244 | BUG_ON(!b->written); |
| 2245 | |
| 2246 | for (i = 0; i < KEY_PTRS(&b->key); i++) |
| 2247 | BUG_ON(PTR_BUCKET(b->c, &b->key, i)->prio != BTREE_PRIO); |
| 2248 | |
| 2249 | mutex_lock(&b->c->bucket_lock); |
| 2250 | list_del_init(&b->list); |
| 2251 | mutex_unlock(&b->c->bucket_lock); |
| 2252 | |
| 2253 | b->c->root = b; |
| 2254 | __bkey_put(b->c, &b->key); |
| 2255 | |
Kent Overstreet | e49c7c3 | 2013-06-26 17:25:38 -0700 | [diff] [blame] | 2256 | bch_journal_meta(b->c, &cl); |
| 2257 | closure_sync(&cl); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2258 | } |
| 2259 | |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2260 | /* Map across nodes or keys */ |
| 2261 | |
| 2262 | static int bch_btree_map_nodes_recurse(struct btree *b, struct btree_op *op, |
| 2263 | struct bkey *from, |
| 2264 | btree_map_nodes_fn *fn, int flags) |
| 2265 | { |
| 2266 | int ret = MAP_CONTINUE; |
| 2267 | |
| 2268 | if (b->level) { |
| 2269 | struct bkey *k; |
| 2270 | struct btree_iter iter; |
| 2271 | |
| 2272 | bch_btree_iter_init(b, &iter, from); |
| 2273 | |
| 2274 | while ((k = bch_btree_iter_next_filter(&iter, b, |
| 2275 | bch_ptr_bad))) { |
| 2276 | ret = btree(map_nodes_recurse, k, b, |
| 2277 | op, from, fn, flags); |
| 2278 | from = NULL; |
| 2279 | |
| 2280 | if (ret != MAP_CONTINUE) |
| 2281 | return ret; |
| 2282 | } |
| 2283 | } |
| 2284 | |
| 2285 | if (!b->level || flags == MAP_ALL_NODES) |
| 2286 | ret = fn(op, b); |
| 2287 | |
| 2288 | return ret; |
| 2289 | } |
| 2290 | |
| 2291 | int __bch_btree_map_nodes(struct btree_op *op, struct cache_set *c, |
| 2292 | struct bkey *from, btree_map_nodes_fn *fn, int flags) |
| 2293 | { |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2294 | return btree_root(map_nodes_recurse, c, op, from, fn, flags); |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2295 | } |
| 2296 | |
| 2297 | static int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op, |
| 2298 | struct bkey *from, btree_map_keys_fn *fn, |
| 2299 | int flags) |
| 2300 | { |
| 2301 | int ret = MAP_CONTINUE; |
| 2302 | struct bkey *k; |
| 2303 | struct btree_iter iter; |
| 2304 | |
| 2305 | bch_btree_iter_init(b, &iter, from); |
| 2306 | |
| 2307 | while ((k = bch_btree_iter_next_filter(&iter, b, bch_ptr_bad))) { |
| 2308 | ret = !b->level |
| 2309 | ? fn(op, b, k) |
| 2310 | : btree(map_keys_recurse, k, b, op, from, fn, flags); |
| 2311 | from = NULL; |
| 2312 | |
| 2313 | if (ret != MAP_CONTINUE) |
| 2314 | return ret; |
| 2315 | } |
| 2316 | |
| 2317 | if (!b->level && (flags & MAP_END_KEY)) |
| 2318 | ret = fn(op, b, &KEY(KEY_INODE(&b->key), |
| 2319 | KEY_OFFSET(&b->key), 0)); |
| 2320 | |
| 2321 | return ret; |
| 2322 | } |
| 2323 | |
| 2324 | int bch_btree_map_keys(struct btree_op *op, struct cache_set *c, |
| 2325 | struct bkey *from, btree_map_keys_fn *fn, int flags) |
| 2326 | { |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2327 | return btree_root(map_keys_recurse, c, op, from, fn, flags); |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2328 | } |
| 2329 | |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2330 | /* Keybuf code */ |
| 2331 | |
| 2332 | static inline int keybuf_cmp(struct keybuf_key *l, struct keybuf_key *r) |
| 2333 | { |
| 2334 | /* Overlapping keys compare equal */ |
| 2335 | if (bkey_cmp(&l->key, &START_KEY(&r->key)) <= 0) |
| 2336 | return -1; |
| 2337 | if (bkey_cmp(&START_KEY(&l->key), &r->key) >= 0) |
| 2338 | return 1; |
| 2339 | return 0; |
| 2340 | } |
| 2341 | |
| 2342 | static inline int keybuf_nonoverlapping_cmp(struct keybuf_key *l, |
| 2343 | struct keybuf_key *r) |
| 2344 | { |
| 2345 | return clamp_t(int64_t, bkey_cmp(&l->key, &r->key), -1, 1); |
| 2346 | } |
| 2347 | |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2348 | struct refill { |
| 2349 | struct btree_op op; |
| 2350 | struct keybuf *buf; |
| 2351 | struct bkey *end; |
| 2352 | keybuf_pred_fn *pred; |
| 2353 | }; |
| 2354 | |
| 2355 | static int refill_keybuf_fn(struct btree_op *op, struct btree *b, |
| 2356 | struct bkey *k) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2357 | { |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2358 | struct refill *refill = container_of(op, struct refill, op); |
| 2359 | struct keybuf *buf = refill->buf; |
| 2360 | int ret = MAP_CONTINUE; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2361 | |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2362 | if (bkey_cmp(k, refill->end) >= 0) { |
| 2363 | ret = MAP_DONE; |
| 2364 | goto out; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2365 | } |
| 2366 | |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2367 | if (!KEY_SIZE(k)) /* end key */ |
| 2368 | goto out; |
| 2369 | |
| 2370 | if (refill->pred(buf, k)) { |
| 2371 | struct keybuf_key *w; |
| 2372 | |
| 2373 | spin_lock(&buf->lock); |
| 2374 | |
| 2375 | w = array_alloc(&buf->freelist); |
| 2376 | if (!w) { |
| 2377 | spin_unlock(&buf->lock); |
| 2378 | return MAP_DONE; |
| 2379 | } |
| 2380 | |
| 2381 | w->private = NULL; |
| 2382 | bkey_copy(&w->key, k); |
| 2383 | |
| 2384 | if (RB_INSERT(&buf->keys, w, node, keybuf_cmp)) |
| 2385 | array_free(&buf->freelist, w); |
| 2386 | |
| 2387 | if (array_freelist_empty(&buf->freelist)) |
| 2388 | ret = MAP_DONE; |
| 2389 | |
| 2390 | spin_unlock(&buf->lock); |
| 2391 | } |
| 2392 | out: |
| 2393 | buf->last_scanned = *k; |
| 2394 | return ret; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2395 | } |
| 2396 | |
| 2397 | void bch_refill_keybuf(struct cache_set *c, struct keybuf *buf, |
Kent Overstreet | 72c2706 | 2013-06-05 06:24:39 -0700 | [diff] [blame] | 2398 | struct bkey *end, keybuf_pred_fn *pred) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2399 | { |
| 2400 | struct bkey start = buf->last_scanned; |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2401 | struct refill refill; |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2402 | |
| 2403 | cond_resched(); |
| 2404 | |
Kent Overstreet | b54d693 | 2013-07-24 18:04:18 -0700 | [diff] [blame] | 2405 | bch_btree_op_init(&refill.op, -1); |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2406 | refill.buf = buf; |
| 2407 | refill.end = end; |
| 2408 | refill.pred = pred; |
| 2409 | |
| 2410 | bch_btree_map_keys(&refill.op, c, &buf->last_scanned, |
| 2411 | refill_keybuf_fn, MAP_END_KEY); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2412 | |
| 2413 | pr_debug("found %s keys from %llu:%llu to %llu:%llu", |
| 2414 | RB_EMPTY_ROOT(&buf->keys) ? "no" : |
| 2415 | array_freelist_empty(&buf->freelist) ? "some" : "a few", |
| 2416 | KEY_INODE(&start), KEY_OFFSET(&start), |
| 2417 | KEY_INODE(&buf->last_scanned), KEY_OFFSET(&buf->last_scanned)); |
| 2418 | |
| 2419 | spin_lock(&buf->lock); |
| 2420 | |
| 2421 | if (!RB_EMPTY_ROOT(&buf->keys)) { |
| 2422 | struct keybuf_key *w; |
| 2423 | w = RB_FIRST(&buf->keys, struct keybuf_key, node); |
| 2424 | buf->start = START_KEY(&w->key); |
| 2425 | |
| 2426 | w = RB_LAST(&buf->keys, struct keybuf_key, node); |
| 2427 | buf->end = w->key; |
| 2428 | } else { |
| 2429 | buf->start = MAX_KEY; |
| 2430 | buf->end = MAX_KEY; |
| 2431 | } |
| 2432 | |
| 2433 | spin_unlock(&buf->lock); |
| 2434 | } |
| 2435 | |
| 2436 | static void __bch_keybuf_del(struct keybuf *buf, struct keybuf_key *w) |
| 2437 | { |
| 2438 | rb_erase(&w->node, &buf->keys); |
| 2439 | array_free(&buf->freelist, w); |
| 2440 | } |
| 2441 | |
| 2442 | void bch_keybuf_del(struct keybuf *buf, struct keybuf_key *w) |
| 2443 | { |
| 2444 | spin_lock(&buf->lock); |
| 2445 | __bch_keybuf_del(buf, w); |
| 2446 | spin_unlock(&buf->lock); |
| 2447 | } |
| 2448 | |
| 2449 | bool bch_keybuf_check_overlapping(struct keybuf *buf, struct bkey *start, |
| 2450 | struct bkey *end) |
| 2451 | { |
| 2452 | bool ret = false; |
| 2453 | struct keybuf_key *p, *w, s; |
| 2454 | s.key = *start; |
| 2455 | |
| 2456 | if (bkey_cmp(end, &buf->start) <= 0 || |
| 2457 | bkey_cmp(start, &buf->end) >= 0) |
| 2458 | return false; |
| 2459 | |
| 2460 | spin_lock(&buf->lock); |
| 2461 | w = RB_GREATER(&buf->keys, s, node, keybuf_nonoverlapping_cmp); |
| 2462 | |
| 2463 | while (w && bkey_cmp(&START_KEY(&w->key), end) < 0) { |
| 2464 | p = w; |
| 2465 | w = RB_NEXT(w, node); |
| 2466 | |
| 2467 | if (p->private) |
| 2468 | ret = true; |
| 2469 | else |
| 2470 | __bch_keybuf_del(buf, p); |
| 2471 | } |
| 2472 | |
| 2473 | spin_unlock(&buf->lock); |
| 2474 | return ret; |
| 2475 | } |
| 2476 | |
| 2477 | struct keybuf_key *bch_keybuf_next(struct keybuf *buf) |
| 2478 | { |
| 2479 | struct keybuf_key *w; |
| 2480 | spin_lock(&buf->lock); |
| 2481 | |
| 2482 | w = RB_FIRST(&buf->keys, struct keybuf_key, node); |
| 2483 | |
| 2484 | while (w && w->private) |
| 2485 | w = RB_NEXT(w, node); |
| 2486 | |
| 2487 | if (w) |
| 2488 | w->private = ERR_PTR(-EINTR); |
| 2489 | |
| 2490 | spin_unlock(&buf->lock); |
| 2491 | return w; |
| 2492 | } |
| 2493 | |
| 2494 | struct keybuf_key *bch_keybuf_next_rescan(struct cache_set *c, |
Kent Overstreet | 48dad8b | 2013-09-10 18:48:51 -0700 | [diff] [blame] | 2495 | struct keybuf *buf, |
| 2496 | struct bkey *end, |
| 2497 | keybuf_pred_fn *pred) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2498 | { |
| 2499 | struct keybuf_key *ret; |
| 2500 | |
| 2501 | while (1) { |
| 2502 | ret = bch_keybuf_next(buf); |
| 2503 | if (ret) |
| 2504 | break; |
| 2505 | |
| 2506 | if (bkey_cmp(&buf->last_scanned, end) >= 0) { |
| 2507 | pr_debug("scan finished"); |
| 2508 | break; |
| 2509 | } |
| 2510 | |
Kent Overstreet | 72c2706 | 2013-06-05 06:24:39 -0700 | [diff] [blame] | 2511 | bch_refill_keybuf(c, buf, end, pred); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2512 | } |
| 2513 | |
| 2514 | return ret; |
| 2515 | } |
| 2516 | |
Kent Overstreet | 72c2706 | 2013-06-05 06:24:39 -0700 | [diff] [blame] | 2517 | void bch_keybuf_init(struct keybuf *buf) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2518 | { |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2519 | buf->last_scanned = MAX_KEY; |
| 2520 | buf->keys = RB_ROOT; |
| 2521 | |
| 2522 | spin_lock_init(&buf->lock); |
| 2523 | array_allocator_init(&buf->freelist); |
| 2524 | } |
| 2525 | |
| 2526 | void bch_btree_exit(void) |
| 2527 | { |
| 2528 | if (btree_io_wq) |
| 2529 | destroy_workqueue(btree_io_wq); |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2530 | } |
| 2531 | |
| 2532 | int __init bch_btree_init(void) |
| 2533 | { |
Kent Overstreet | 72a4451 | 2013-10-24 17:19:26 -0700 | [diff] [blame] | 2534 | btree_io_wq = create_singlethread_workqueue("bch_btree_io"); |
| 2535 | if (!btree_io_wq) |
Kent Overstreet | cafe563 | 2013-03-23 16:11:31 -0700 | [diff] [blame] | 2536 | return -ENOMEM; |
| 2537 | |
| 2538 | return 0; |
| 2539 | } |