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