]>
Commit | Line | Data |
---|---|---|
cafe5635 KO |
1 | #ifndef _BCACHE_H |
2 | #define _BCACHE_H | |
3 | ||
4 | /* | |
5 | * SOME HIGH LEVEL CODE DOCUMENTATION: | |
6 | * | |
7 | * Bcache mostly works with cache sets, cache devices, and backing devices. | |
8 | * | |
9 | * Support for multiple cache devices hasn't quite been finished off yet, but | |
10 | * it's about 95% plumbed through. A cache set and its cache devices is sort of | |
11 | * like a md raid array and its component devices. Most of the code doesn't care | |
12 | * about individual cache devices, the main abstraction is the cache set. | |
13 | * | |
14 | * Multiple cache devices is intended to give us the ability to mirror dirty | |
15 | * cached data and metadata, without mirroring clean cached data. | |
16 | * | |
17 | * Backing devices are different, in that they have a lifetime independent of a | |
18 | * cache set. When you register a newly formatted backing device it'll come up | |
19 | * in passthrough mode, and then you can attach and detach a backing device from | |
20 | * a cache set at runtime - while it's mounted and in use. Detaching implicitly | |
21 | * invalidates any cached data for that backing device. | |
22 | * | |
23 | * A cache set can have multiple (many) backing devices attached to it. | |
24 | * | |
25 | * There's also flash only volumes - this is the reason for the distinction | |
26 | * between struct cached_dev and struct bcache_device. A flash only volume | |
27 | * works much like a bcache device that has a backing device, except the | |
28 | * "cached" data is always dirty. The end result is that we get thin | |
29 | * provisioning with very little additional code. | |
30 | * | |
31 | * Flash only volumes work but they're not production ready because the moving | |
32 | * garbage collector needs more work. More on that later. | |
33 | * | |
34 | * BUCKETS/ALLOCATION: | |
35 | * | |
36 | * Bcache is primarily designed for caching, which means that in normal | |
37 | * operation all of our available space will be allocated. Thus, we need an | |
38 | * efficient way of deleting things from the cache so we can write new things to | |
39 | * it. | |
40 | * | |
41 | * To do this, we first divide the cache device up into buckets. A bucket is the | |
42 | * unit of allocation; they're typically around 1 mb - anywhere from 128k to 2M+ | |
43 | * works efficiently. | |
44 | * | |
45 | * Each bucket has a 16 bit priority, and an 8 bit generation associated with | |
46 | * it. The gens and priorities for all the buckets are stored contiguously and | |
47 | * packed on disk (in a linked list of buckets - aside from the superblock, all | |
48 | * of bcache's metadata is stored in buckets). | |
49 | * | |
50 | * The priority is used to implement an LRU. We reset a bucket's priority when | |
51 | * we allocate it or on cache it, and every so often we decrement the priority | |
52 | * of each bucket. It could be used to implement something more sophisticated, | |
53 | * if anyone ever gets around to it. | |
54 | * | |
55 | * The generation is used for invalidating buckets. Each pointer also has an 8 | |
56 | * bit generation embedded in it; for a pointer to be considered valid, its gen | |
57 | * must match the gen of the bucket it points into. Thus, to reuse a bucket all | |
58 | * we have to do is increment its gen (and write its new gen to disk; we batch | |
59 | * this up). | |
60 | * | |
61 | * Bcache is entirely COW - we never write twice to a bucket, even buckets that | |
62 | * contain metadata (including btree nodes). | |
63 | * | |
64 | * THE BTREE: | |
65 | * | |
66 | * Bcache is in large part design around the btree. | |
67 | * | |
68 | * At a high level, the btree is just an index of key -> ptr tuples. | |
69 | * | |
70 | * Keys represent extents, and thus have a size field. Keys also have a variable | |
71 | * number of pointers attached to them (potentially zero, which is handy for | |
72 | * invalidating the cache). | |
73 | * | |
74 | * The key itself is an inode:offset pair. The inode number corresponds to a | |
75 | * backing device or a flash only volume. The offset is the ending offset of the | |
76 | * extent within the inode - not the starting offset; this makes lookups | |
77 | * slightly more convenient. | |
78 | * | |
79 | * Pointers contain the cache device id, the offset on that device, and an 8 bit | |
80 | * generation number. More on the gen later. | |
81 | * | |
82 | * Index lookups are not fully abstracted - cache lookups in particular are | |
83 | * still somewhat mixed in with the btree code, but things are headed in that | |
84 | * direction. | |
85 | * | |
86 | * Updates are fairly well abstracted, though. There are two different ways of | |
87 | * updating the btree; insert and replace. | |
88 | * | |
89 | * BTREE_INSERT will just take a list of keys and insert them into the btree - | |
90 | * overwriting (possibly only partially) any extents they overlap with. This is | |
91 | * used to update the index after a write. | |
92 | * | |
93 | * BTREE_REPLACE is really cmpxchg(); it inserts a key into the btree iff it is | |
94 | * overwriting a key that matches another given key. This is used for inserting | |
95 | * data into the cache after a cache miss, and for background writeback, and for | |
96 | * the moving garbage collector. | |
97 | * | |
98 | * There is no "delete" operation; deleting things from the index is | |
99 | * accomplished by either by invalidating pointers (by incrementing a bucket's | |
100 | * gen) or by inserting a key with 0 pointers - which will overwrite anything | |
101 | * previously present at that location in the index. | |
102 | * | |
103 | * This means that there are always stale/invalid keys in the btree. They're | |
104 | * filtered out by the code that iterates through a btree node, and removed when | |
105 | * a btree node is rewritten. | |
106 | * | |
107 | * BTREE NODES: | |
108 | * | |
109 | * Our unit of allocation is a bucket, and we we can't arbitrarily allocate and | |
110 | * free smaller than a bucket - so, that's how big our btree nodes are. | |
111 | * | |
112 | * (If buckets are really big we'll only use part of the bucket for a btree node | |
113 | * - no less than 1/4th - but a bucket still contains no more than a single | |
114 | * btree node. I'd actually like to change this, but for now we rely on the | |
115 | * bucket's gen for deleting btree nodes when we rewrite/split a node.) | |
116 | * | |
117 | * Anyways, btree nodes are big - big enough to be inefficient with a textbook | |
118 | * btree implementation. | |
119 | * | |
120 | * The way this is solved is that btree nodes are internally log structured; we | |
121 | * can append new keys to an existing btree node without rewriting it. This | |
122 | * means each set of keys we write is sorted, but the node is not. | |
123 | * | |
124 | * We maintain this log structure in memory - keeping 1Mb of keys sorted would | |
125 | * be expensive, and we have to distinguish between the keys we have written and | |
126 | * the keys we haven't. So to do a lookup in a btree node, we have to search | |
127 | * each sorted set. But we do merge written sets together lazily, so the cost of | |
128 | * these extra searches is quite low (normally most of the keys in a btree node | |
129 | * will be in one big set, and then there'll be one or two sets that are much | |
130 | * smaller). | |
131 | * | |
132 | * This log structure makes bcache's btree more of a hybrid between a | |
133 | * conventional btree and a compacting data structure, with some of the | |
134 | * advantages of both. | |
135 | * | |
136 | * GARBAGE COLLECTION: | |
137 | * | |
138 | * We can't just invalidate any bucket - it might contain dirty data or | |
139 | * metadata. If it once contained dirty data, other writes might overwrite it | |
140 | * later, leaving no valid pointers into that bucket in the index. | |
141 | * | |
142 | * Thus, the primary purpose of garbage collection is to find buckets to reuse. | |
143 | * It also counts how much valid data it each bucket currently contains, so that | |
144 | * allocation can reuse buckets sooner when they've been mostly overwritten. | |
145 | * | |
146 | * It also does some things that are really internal to the btree | |
147 | * implementation. If a btree node contains pointers that are stale by more than | |
148 | * some threshold, it rewrites the btree node to avoid the bucket's generation | |
149 | * wrapping around. It also merges adjacent btree nodes if they're empty enough. | |
150 | * | |
151 | * THE JOURNAL: | |
152 | * | |
153 | * Bcache's journal is not necessary for consistency; we always strictly | |
154 | * order metadata writes so that the btree and everything else is consistent on | |
155 | * disk in the event of an unclean shutdown, and in fact bcache had writeback | |
156 | * caching (with recovery from unclean shutdown) before journalling was | |
157 | * implemented. | |
158 | * | |
159 | * Rather, the journal is purely a performance optimization; we can't complete a | |
160 | * write until we've updated the index on disk, otherwise the cache would be | |
161 | * inconsistent in the event of an unclean shutdown. This means that without the | |
162 | * journal, on random write workloads we constantly have to update all the leaf | |
163 | * nodes in the btree, and those writes will be mostly empty (appending at most | |
164 | * a few keys each) - highly inefficient in terms of amount of metadata writes, | |
165 | * and it puts more strain on the various btree resorting/compacting code. | |
166 | * | |
167 | * The journal is just a log of keys we've inserted; on startup we just reinsert | |
168 | * all the keys in the open journal entries. That means that when we're updating | |
169 | * a node in the btree, we can wait until a 4k block of keys fills up before | |
170 | * writing them out. | |
171 | * | |
172 | * For simplicity, we only journal updates to leaf nodes; updates to parent | |
173 | * nodes are rare enough (since our leaf nodes are huge) that it wasn't worth | |
174 | * the complexity to deal with journalling them (in particular, journal replay) | |
175 | * - updates to non leaf nodes just happen synchronously (see btree_split()). | |
176 | */ | |
177 | ||
178 | #define pr_fmt(fmt) "bcache: %s() " fmt "\n", __func__ | |
179 | ||
81ab4190 | 180 | #include <linux/bcache.h> |
cafe5635 | 181 | #include <linux/bio.h> |
cafe5635 KO |
182 | #include <linux/kobject.h> |
183 | #include <linux/list.h> | |
184 | #include <linux/mutex.h> | |
185 | #include <linux/rbtree.h> | |
186 | #include <linux/rwsem.h> | |
187 | #include <linux/types.h> | |
188 | #include <linux/workqueue.h> | |
189 | ||
190 | #include "util.h" | |
191 | #include "closure.h" | |
192 | ||
193 | struct bucket { | |
194 | atomic_t pin; | |
195 | uint16_t prio; | |
196 | uint8_t gen; | |
197 | uint8_t disk_gen; | |
198 | uint8_t last_gc; /* Most out of date gen in the btree */ | |
199 | uint8_t gc_gen; | |
200 | uint16_t gc_mark; | |
201 | }; | |
202 | ||
203 | /* | |
204 | * I'd use bitfields for these, but I don't trust the compiler not to screw me | |
205 | * as multiple threads touch struct bucket without locking | |
206 | */ | |
207 | ||
208 | BITMASK(GC_MARK, struct bucket, gc_mark, 0, 2); | |
209 | #define GC_MARK_RECLAIMABLE 0 | |
210 | #define GC_MARK_DIRTY 1 | |
211 | #define GC_MARK_METADATA 2 | |
212 | BITMASK(GC_SECTORS_USED, struct bucket, gc_mark, 2, 14); | |
213 | ||
cafe5635 KO |
214 | #include "journal.h" |
215 | #include "stats.h" | |
216 | struct search; | |
217 | struct btree; | |
218 | struct keybuf; | |
219 | ||
220 | struct keybuf_key { | |
221 | struct rb_node node; | |
222 | BKEY_PADDED(key); | |
223 | void *private; | |
224 | }; | |
225 | ||
cafe5635 | 226 | struct keybuf { |
cafe5635 KO |
227 | struct bkey last_scanned; |
228 | spinlock_t lock; | |
229 | ||
230 | /* | |
231 | * Beginning and end of range in rb tree - so that we can skip taking | |
232 | * lock and checking the rb tree when we need to check for overlapping | |
233 | * keys. | |
234 | */ | |
235 | struct bkey start; | |
236 | struct bkey end; | |
237 | ||
238 | struct rb_root keys; | |
239 | ||
48a915a8 | 240 | #define KEYBUF_NR 500 |
cafe5635 KO |
241 | DECLARE_ARRAY_ALLOCATOR(struct keybuf_key, freelist, KEYBUF_NR); |
242 | }; | |
243 | ||
244 | struct bio_split_pool { | |
245 | struct bio_set *bio_split; | |
246 | mempool_t *bio_split_hook; | |
247 | }; | |
248 | ||
249 | struct bio_split_hook { | |
250 | struct closure cl; | |
251 | struct bio_split_pool *p; | |
252 | struct bio *bio; | |
253 | bio_end_io_t *bi_end_io; | |
254 | void *bi_private; | |
255 | }; | |
256 | ||
257 | struct bcache_device { | |
258 | struct closure cl; | |
259 | ||
260 | struct kobject kobj; | |
261 | ||
262 | struct cache_set *c; | |
263 | unsigned id; | |
264 | #define BCACHEDEVNAME_SIZE 12 | |
265 | char name[BCACHEDEVNAME_SIZE]; | |
266 | ||
267 | struct gendisk *disk; | |
268 | ||
c4d951dd KO |
269 | unsigned long flags; |
270 | #define BCACHE_DEV_CLOSING 0 | |
271 | #define BCACHE_DEV_DETACHING 1 | |
272 | #define BCACHE_DEV_UNLINK_DONE 2 | |
cafe5635 | 273 | |
48a915a8 | 274 | unsigned nr_stripes; |
2d679fc7 | 275 | unsigned stripe_size; |
279afbad | 276 | atomic_t *stripe_sectors_dirty; |
48a915a8 | 277 | unsigned long *full_dirty_stripes; |
279afbad | 278 | |
cafe5635 KO |
279 | unsigned long sectors_dirty_last; |
280 | long sectors_dirty_derivative; | |
281 | ||
282 | mempool_t *unaligned_bvec; | |
283 | struct bio_set *bio_split; | |
284 | ||
285 | unsigned data_csum:1; | |
286 | ||
287 | int (*cache_miss)(struct btree *, struct search *, | |
288 | struct bio *, unsigned); | |
289 | int (*ioctl) (struct bcache_device *, fmode_t, unsigned, unsigned long); | |
290 | ||
291 | struct bio_split_pool bio_split_hook; | |
292 | }; | |
293 | ||
294 | struct io { | |
295 | /* Used to track sequential IO so it can be skipped */ | |
296 | struct hlist_node hash; | |
297 | struct list_head lru; | |
298 | ||
299 | unsigned long jiffies; | |
300 | unsigned sequential; | |
301 | sector_t last; | |
302 | }; | |
303 | ||
304 | struct cached_dev { | |
305 | struct list_head list; | |
306 | struct bcache_device disk; | |
307 | struct block_device *bdev; | |
308 | ||
309 | struct cache_sb sb; | |
310 | struct bio sb_bio; | |
311 | struct bio_vec sb_bv[1]; | |
312 | struct closure_with_waitlist sb_write; | |
313 | ||
314 | /* Refcount on the cache set. Always nonzero when we're caching. */ | |
315 | atomic_t count; | |
316 | struct work_struct detach; | |
317 | ||
318 | /* | |
319 | * Device might not be running if it's dirty and the cache set hasn't | |
320 | * showed up yet. | |
321 | */ | |
322 | atomic_t running; | |
323 | ||
324 | /* | |
325 | * Writes take a shared lock from start to finish; scanning for dirty | |
326 | * data to refill the rb tree requires an exclusive lock. | |
327 | */ | |
328 | struct rw_semaphore writeback_lock; | |
329 | ||
330 | /* | |
331 | * Nonzero, and writeback has a refcount (d->count), iff there is dirty | |
332 | * data in the cache. Protected by writeback_lock; must have an | |
333 | * shared lock to set and exclusive lock to clear. | |
334 | */ | |
335 | atomic_t has_dirty; | |
336 | ||
c2a4f318 | 337 | struct bch_ratelimit writeback_rate; |
cafe5635 KO |
338 | struct delayed_work writeback_rate_update; |
339 | ||
340 | /* | |
341 | * Internal to the writeback code, so read_dirty() can keep track of | |
342 | * where it's at. | |
343 | */ | |
344 | sector_t last_read; | |
345 | ||
c2a4f318 KO |
346 | /* Limit number of writeback bios in flight */ |
347 | struct semaphore in_flight; | |
5e6926da | 348 | struct task_struct *writeback_thread; |
cafe5635 KO |
349 | |
350 | struct keybuf writeback_keys; | |
351 | ||
352 | /* For tracking sequential IO */ | |
353 | #define RECENT_IO_BITS 7 | |
354 | #define RECENT_IO (1 << RECENT_IO_BITS) | |
355 | struct io io[RECENT_IO]; | |
356 | struct hlist_head io_hash[RECENT_IO + 1]; | |
357 | struct list_head io_lru; | |
358 | spinlock_t io_lock; | |
359 | ||
360 | struct cache_accounting accounting; | |
361 | ||
362 | /* The rest of this all shows up in sysfs */ | |
363 | unsigned sequential_cutoff; | |
364 | unsigned readahead; | |
365 | ||
cafe5635 | 366 | unsigned verify:1; |
5ceaaad7 | 367 | unsigned bypass_torture_test:1; |
cafe5635 | 368 | |
72c27061 | 369 | unsigned partial_stripes_expensive:1; |
cafe5635 KO |
370 | unsigned writeback_metadata:1; |
371 | unsigned writeback_running:1; | |
372 | unsigned char writeback_percent; | |
373 | unsigned writeback_delay; | |
374 | ||
375 | int writeback_rate_change; | |
376 | int64_t writeback_rate_derivative; | |
377 | uint64_t writeback_rate_target; | |
378 | ||
379 | unsigned writeback_rate_update_seconds; | |
380 | unsigned writeback_rate_d_term; | |
381 | unsigned writeback_rate_p_term_inverse; | |
382 | unsigned writeback_rate_d_smooth; | |
383 | }; | |
384 | ||
385 | enum alloc_watermarks { | |
386 | WATERMARK_PRIO, | |
387 | WATERMARK_METADATA, | |
388 | WATERMARK_MOVINGGC, | |
389 | WATERMARK_NONE, | |
390 | WATERMARK_MAX | |
391 | }; | |
392 | ||
393 | struct cache { | |
394 | struct cache_set *set; | |
395 | struct cache_sb sb; | |
396 | struct bio sb_bio; | |
397 | struct bio_vec sb_bv[1]; | |
398 | ||
399 | struct kobject kobj; | |
400 | struct block_device *bdev; | |
401 | ||
402 | unsigned watermark[WATERMARK_MAX]; | |
403 | ||
119ba0f8 | 404 | struct task_struct *alloc_thread; |
cafe5635 KO |
405 | |
406 | struct closure prio; | |
407 | struct prio_set *disk_buckets; | |
408 | ||
409 | /* | |
410 | * When allocating new buckets, prio_write() gets first dibs - since we | |
411 | * may not be allocate at all without writing priorities and gens. | |
412 | * prio_buckets[] contains the last buckets we wrote priorities to (so | |
413 | * gc can mark them as metadata), prio_next[] contains the buckets | |
414 | * allocated for the next prio write. | |
415 | */ | |
416 | uint64_t *prio_buckets; | |
417 | uint64_t *prio_last_buckets; | |
418 | ||
419 | /* | |
420 | * free: Buckets that are ready to be used | |
421 | * | |
422 | * free_inc: Incoming buckets - these are buckets that currently have | |
423 | * cached data in them, and we can't reuse them until after we write | |
424 | * their new gen to disk. After prio_write() finishes writing the new | |
425 | * gens/prios, they'll be moved to the free list (and possibly discarded | |
426 | * in the process) | |
427 | * | |
428 | * unused: GC found nothing pointing into these buckets (possibly | |
429 | * because all the data they contained was overwritten), so we only | |
430 | * need to discard them before they can be moved to the free list. | |
431 | */ | |
432 | DECLARE_FIFO(long, free); | |
433 | DECLARE_FIFO(long, free_inc); | |
434 | DECLARE_FIFO(long, unused); | |
435 | ||
436 | size_t fifo_last_bucket; | |
437 | ||
438 | /* Allocation stuff: */ | |
439 | struct bucket *buckets; | |
440 | ||
441 | DECLARE_HEAP(struct bucket *, heap); | |
442 | ||
443 | /* | |
444 | * max(gen - disk_gen) for all buckets. When it gets too big we have to | |
445 | * call prio_write() to keep gens from wrapping. | |
446 | */ | |
447 | uint8_t need_save_prio; | |
448 | unsigned gc_move_threshold; | |
449 | ||
450 | /* | |
451 | * If nonzero, we know we aren't going to find any buckets to invalidate | |
452 | * until a gc finishes - otherwise we could pointlessly burn a ton of | |
453 | * cpu | |
454 | */ | |
455 | unsigned invalidate_needs_gc:1; | |
456 | ||
457 | bool discard; /* Get rid of? */ | |
458 | ||
cafe5635 KO |
459 | struct journal_device journal; |
460 | ||
461 | /* The rest of this all shows up in sysfs */ | |
462 | #define IO_ERROR_SHIFT 20 | |
463 | atomic_t io_errors; | |
464 | atomic_t io_count; | |
465 | ||
466 | atomic_long_t meta_sectors_written; | |
467 | atomic_long_t btree_sectors_written; | |
468 | atomic_long_t sectors_written; | |
469 | ||
470 | struct bio_split_pool bio_split_hook; | |
471 | }; | |
472 | ||
473 | struct gc_stat { | |
474 | size_t nodes; | |
475 | size_t key_bytes; | |
476 | ||
477 | size_t nkeys; | |
478 | uint64_t data; /* sectors */ | |
cafe5635 KO |
479 | unsigned in_use; /* percent */ |
480 | }; | |
481 | ||
482 | /* | |
483 | * Flag bits, for how the cache set is shutting down, and what phase it's at: | |
484 | * | |
485 | * CACHE_SET_UNREGISTERING means we're not just shutting down, we're detaching | |
486 | * all the backing devices first (their cached data gets invalidated, and they | |
487 | * won't automatically reattach). | |
488 | * | |
489 | * CACHE_SET_STOPPING always gets set first when we're closing down a cache set; | |
490 | * we'll continue to run normally for awhile with CACHE_SET_STOPPING set (i.e. | |
491 | * flushing dirty data). | |
cafe5635 KO |
492 | */ |
493 | #define CACHE_SET_UNREGISTERING 0 | |
494 | #define CACHE_SET_STOPPING 1 | |
cafe5635 KO |
495 | |
496 | struct cache_set { | |
497 | struct closure cl; | |
498 | ||
499 | struct list_head list; | |
500 | struct kobject kobj; | |
501 | struct kobject internal; | |
502 | struct dentry *debug; | |
503 | struct cache_accounting accounting; | |
504 | ||
505 | unsigned long flags; | |
506 | ||
507 | struct cache_sb sb; | |
508 | ||
509 | struct cache *cache[MAX_CACHES_PER_SET]; | |
510 | struct cache *cache_by_alloc[MAX_CACHES_PER_SET]; | |
511 | int caches_loaded; | |
512 | ||
513 | struct bcache_device **devices; | |
514 | struct list_head cached_devs; | |
515 | uint64_t cached_dev_sectors; | |
516 | struct closure caching; | |
517 | ||
518 | struct closure_with_waitlist sb_write; | |
519 | ||
520 | mempool_t *search; | |
521 | mempool_t *bio_meta; | |
522 | struct bio_set *bio_split; | |
523 | ||
524 | /* For the btree cache */ | |
525 | struct shrinker shrink; | |
526 | ||
cafe5635 KO |
527 | /* For the btree cache and anything allocation related */ |
528 | struct mutex bucket_lock; | |
529 | ||
530 | /* log2(bucket_size), in sectors */ | |
531 | unsigned short bucket_bits; | |
532 | ||
533 | /* log2(block_size), in sectors */ | |
534 | unsigned short block_bits; | |
535 | ||
536 | /* | |
537 | * Default number of pages for a new btree node - may be less than a | |
538 | * full bucket | |
539 | */ | |
540 | unsigned btree_pages; | |
541 | ||
542 | /* | |
543 | * Lists of struct btrees; lru is the list for structs that have memory | |
544 | * allocated for actual btree node, freed is for structs that do not. | |
545 | * | |
546 | * We never free a struct btree, except on shutdown - we just put it on | |
547 | * the btree_cache_freed list and reuse it later. This simplifies the | |
548 | * code, and it doesn't cost us much memory as the memory usage is | |
549 | * dominated by buffers that hold the actual btree node data and those | |
550 | * can be freed - and the number of struct btrees allocated is | |
551 | * effectively bounded. | |
552 | * | |
553 | * btree_cache_freeable effectively is a small cache - we use it because | |
554 | * high order page allocations can be rather expensive, and it's quite | |
555 | * common to delete and allocate btree nodes in quick succession. It | |
556 | * should never grow past ~2-3 nodes in practice. | |
557 | */ | |
558 | struct list_head btree_cache; | |
559 | struct list_head btree_cache_freeable; | |
560 | struct list_head btree_cache_freed; | |
561 | ||
562 | /* Number of elements in btree_cache + btree_cache_freeable lists */ | |
563 | unsigned bucket_cache_used; | |
564 | ||
565 | /* | |
566 | * If we need to allocate memory for a new btree node and that | |
567 | * allocation fails, we can cannibalize another node in the btree cache | |
568 | * to satisfy the allocation. However, only one thread can be doing this | |
569 | * at a time, for obvious reasons - try_harder and try_wait are | |
570 | * basically a lock for this that we can wait on asynchronously. The | |
571 | * btree_root() macro releases the lock when it returns. | |
572 | */ | |
e8e1d468 KO |
573 | struct task_struct *try_harder; |
574 | wait_queue_head_t try_wait; | |
cafe5635 KO |
575 | uint64_t try_harder_start; |
576 | ||
577 | /* | |
578 | * When we free a btree node, we increment the gen of the bucket the | |
579 | * node is in - but we can't rewrite the prios and gens until we | |
580 | * finished whatever it is we were doing, otherwise after a crash the | |
581 | * btree node would be freed but for say a split, we might not have the | |
582 | * pointers to the new nodes inserted into the btree yet. | |
583 | * | |
584 | * This is a refcount that blocks prio_write() until the new keys are | |
585 | * written. | |
586 | */ | |
587 | atomic_t prio_blocked; | |
35fcd848 | 588 | wait_queue_head_t bucket_wait; |
cafe5635 KO |
589 | |
590 | /* | |
591 | * For any bio we don't skip we subtract the number of sectors from | |
592 | * rescale; when it hits 0 we rescale all the bucket priorities. | |
593 | */ | |
594 | atomic_t rescale; | |
595 | /* | |
596 | * When we invalidate buckets, we use both the priority and the amount | |
597 | * of good data to determine which buckets to reuse first - to weight | |
598 | * those together consistently we keep track of the smallest nonzero | |
599 | * priority of any bucket. | |
600 | */ | |
601 | uint16_t min_prio; | |
602 | ||
603 | /* | |
604 | * max(gen - gc_gen) for all buckets. When it gets too big we have to gc | |
605 | * to keep gens from wrapping around. | |
606 | */ | |
607 | uint8_t need_gc; | |
608 | struct gc_stat gc_stats; | |
609 | size_t nbuckets; | |
610 | ||
72a44517 | 611 | struct task_struct *gc_thread; |
cafe5635 KO |
612 | /* Where in the btree gc currently is */ |
613 | struct bkey gc_done; | |
614 | ||
615 | /* | |
616 | * The allocation code needs gc_mark in struct bucket to be correct, but | |
617 | * it's not while a gc is in progress. Protected by bucket_lock. | |
618 | */ | |
619 | int gc_mark_valid; | |
620 | ||
621 | /* Counts how many sectors bio_insert has added to the cache */ | |
622 | atomic_t sectors_to_gc; | |
623 | ||
72a44517 | 624 | wait_queue_head_t moving_gc_wait; |
cafe5635 KO |
625 | struct keybuf moving_gc_keys; |
626 | /* Number of moving GC bios in flight */ | |
72a44517 | 627 | struct semaphore moving_in_flight; |
cafe5635 KO |
628 | |
629 | struct btree *root; | |
630 | ||
631 | #ifdef CONFIG_BCACHE_DEBUG | |
632 | struct btree *verify_data; | |
633 | struct mutex verify_lock; | |
634 | #endif | |
635 | ||
636 | unsigned nr_uuids; | |
637 | struct uuid_entry *uuids; | |
638 | BKEY_PADDED(uuid_bucket); | |
639 | struct closure_with_waitlist uuid_write; | |
640 | ||
641 | /* | |
642 | * A btree node on disk could have too many bsets for an iterator to fit | |
57943511 | 643 | * on the stack - have to dynamically allocate them |
cafe5635 | 644 | */ |
57943511 | 645 | mempool_t *fill_iter; |
cafe5635 KO |
646 | |
647 | /* | |
648 | * btree_sort() is a merge sort and requires temporary space - single | |
649 | * element mempool | |
650 | */ | |
651 | struct mutex sort_lock; | |
652 | struct bset *sort; | |
6ded34d1 | 653 | unsigned sort_crit_factor; |
cafe5635 KO |
654 | |
655 | /* List of buckets we're currently writing data to */ | |
656 | struct list_head data_buckets; | |
657 | spinlock_t data_bucket_lock; | |
658 | ||
659 | struct journal journal; | |
660 | ||
661 | #define CONGESTED_MAX 1024 | |
662 | unsigned congested_last_us; | |
663 | atomic_t congested; | |
664 | ||
665 | /* The rest of this all shows up in sysfs */ | |
666 | unsigned congested_read_threshold_us; | |
667 | unsigned congested_write_threshold_us; | |
668 | ||
cafe5635 KO |
669 | struct time_stats sort_time; |
670 | struct time_stats btree_gc_time; | |
671 | struct time_stats btree_split_time; | |
cafe5635 KO |
672 | struct time_stats btree_read_time; |
673 | struct time_stats try_harder_time; | |
674 | ||
675 | atomic_long_t cache_read_races; | |
676 | atomic_long_t writeback_keys_done; | |
677 | atomic_long_t writeback_keys_failed; | |
77c320eb KO |
678 | |
679 | enum { | |
680 | ON_ERROR_UNREGISTER, | |
681 | ON_ERROR_PANIC, | |
682 | } on_error; | |
cafe5635 KO |
683 | unsigned error_limit; |
684 | unsigned error_decay; | |
77c320eb | 685 | |
cafe5635 KO |
686 | unsigned short journal_delay_ms; |
687 | unsigned verify:1; | |
688 | unsigned key_merging_disabled:1; | |
280481d0 | 689 | unsigned expensive_debug_checks:1; |
cafe5635 KO |
690 | unsigned gc_always_rewrite:1; |
691 | unsigned shrinker_disabled:1; | |
692 | unsigned copy_gc_enabled:1; | |
693 | ||
694 | #define BUCKET_HASH_BITS 12 | |
695 | struct hlist_head bucket_hash[1 << BUCKET_HASH_BITS]; | |
696 | }; | |
697 | ||
cafe5635 KO |
698 | struct bbio { |
699 | unsigned submit_time_us; | |
700 | union { | |
701 | struct bkey key; | |
702 | uint64_t _pad[3]; | |
703 | /* | |
704 | * We only need pad = 3 here because we only ever carry around a | |
705 | * single pointer - i.e. the pointer we're doing io to/from. | |
706 | */ | |
707 | }; | |
708 | struct bio bio; | |
709 | }; | |
710 | ||
711 | static inline unsigned local_clock_us(void) | |
712 | { | |
713 | return local_clock() >> 10; | |
714 | } | |
715 | ||
cafe5635 KO |
716 | #define BTREE_PRIO USHRT_MAX |
717 | #define INITIAL_PRIO 32768 | |
718 | ||
719 | #define btree_bytes(c) ((c)->btree_pages * PAGE_SIZE) | |
720 | #define btree_blocks(b) \ | |
721 | ((unsigned) (KEY_SIZE(&b->key) >> (b)->c->block_bits)) | |
722 | ||
723 | #define btree_default_blocks(c) \ | |
724 | ((unsigned) ((PAGE_SECTORS * (c)->btree_pages) >> (c)->block_bits)) | |
725 | ||
726 | #define bucket_pages(c) ((c)->sb.bucket_size / PAGE_SECTORS) | |
727 | #define bucket_bytes(c) ((c)->sb.bucket_size << 9) | |
728 | #define block_bytes(c) ((c)->sb.block_size << 9) | |
729 | ||
730 | #define __set_bytes(i, k) (sizeof(*(i)) + (k) * sizeof(uint64_t)) | |
731 | #define set_bytes(i) __set_bytes(i, i->keys) | |
732 | ||
733 | #define __set_blocks(i, k, c) DIV_ROUND_UP(__set_bytes(i, k), block_bytes(c)) | |
734 | #define set_blocks(i, c) __set_blocks(i, (i)->keys, c) | |
735 | ||
736 | #define node(i, j) ((struct bkey *) ((i)->d + (j))) | |
737 | #define end(i) node(i, (i)->keys) | |
738 | ||
739 | #define index(i, b) \ | |
740 | ((size_t) (((void *) i - (void *) (b)->sets[0].data) / \ | |
741 | block_bytes(b->c))) | |
742 | ||
743 | #define btree_data_space(b) (PAGE_SIZE << (b)->page_order) | |
744 | ||
745 | #define prios_per_bucket(c) \ | |
746 | ((bucket_bytes(c) - sizeof(struct prio_set)) / \ | |
747 | sizeof(struct bucket_disk)) | |
748 | #define prio_buckets(c) \ | |
749 | DIV_ROUND_UP((size_t) (c)->sb.nbuckets, prios_per_bucket(c)) | |
750 | ||
cafe5635 KO |
751 | static inline size_t sector_to_bucket(struct cache_set *c, sector_t s) |
752 | { | |
753 | return s >> c->bucket_bits; | |
754 | } | |
755 | ||
756 | static inline sector_t bucket_to_sector(struct cache_set *c, size_t b) | |
757 | { | |
758 | return ((sector_t) b) << c->bucket_bits; | |
759 | } | |
760 | ||
761 | static inline sector_t bucket_remainder(struct cache_set *c, sector_t s) | |
762 | { | |
763 | return s & (c->sb.bucket_size - 1); | |
764 | } | |
765 | ||
766 | static inline struct cache *PTR_CACHE(struct cache_set *c, | |
767 | const struct bkey *k, | |
768 | unsigned ptr) | |
769 | { | |
770 | return c->cache[PTR_DEV(k, ptr)]; | |
771 | } | |
772 | ||
773 | static inline size_t PTR_BUCKET_NR(struct cache_set *c, | |
774 | const struct bkey *k, | |
775 | unsigned ptr) | |
776 | { | |
777 | return sector_to_bucket(c, PTR_OFFSET(k, ptr)); | |
778 | } | |
779 | ||
780 | static inline struct bucket *PTR_BUCKET(struct cache_set *c, | |
781 | const struct bkey *k, | |
782 | unsigned ptr) | |
783 | { | |
784 | return PTR_CACHE(c, k, ptr)->buckets + PTR_BUCKET_NR(c, k, ptr); | |
785 | } | |
786 | ||
787 | /* Btree key macros */ | |
788 | ||
cafe5635 KO |
789 | static inline void bkey_init(struct bkey *k) |
790 | { | |
81ab4190 | 791 | *k = ZERO_KEY; |
cafe5635 KO |
792 | } |
793 | ||
cafe5635 KO |
794 | /* |
795 | * This is used for various on disk data structures - cache_sb, prio_set, bset, | |
796 | * jset: The checksum is _always_ the first 8 bytes of these structs | |
797 | */ | |
798 | #define csum_set(i) \ | |
169ef1cf | 799 | bch_crc64(((void *) (i)) + sizeof(uint64_t), \ |
cafe5635 KO |
800 | ((void *) end(i)) - (((void *) (i)) + sizeof(uint64_t))) |
801 | ||
802 | /* Error handling macros */ | |
803 | ||
804 | #define btree_bug(b, ...) \ | |
805 | do { \ | |
806 | if (bch_cache_set_error((b)->c, __VA_ARGS__)) \ | |
807 | dump_stack(); \ | |
808 | } while (0) | |
809 | ||
810 | #define cache_bug(c, ...) \ | |
811 | do { \ | |
812 | if (bch_cache_set_error(c, __VA_ARGS__)) \ | |
813 | dump_stack(); \ | |
814 | } while (0) | |
815 | ||
816 | #define btree_bug_on(cond, b, ...) \ | |
817 | do { \ | |
818 | if (cond) \ | |
819 | btree_bug(b, __VA_ARGS__); \ | |
820 | } while (0) | |
821 | ||
822 | #define cache_bug_on(cond, c, ...) \ | |
823 | do { \ | |
824 | if (cond) \ | |
825 | cache_bug(c, __VA_ARGS__); \ | |
826 | } while (0) | |
827 | ||
828 | #define cache_set_err_on(cond, c, ...) \ | |
829 | do { \ | |
830 | if (cond) \ | |
831 | bch_cache_set_error(c, __VA_ARGS__); \ | |
832 | } while (0) | |
833 | ||
834 | /* Looping macros */ | |
835 | ||
836 | #define for_each_cache(ca, cs, iter) \ | |
837 | for (iter = 0; ca = cs->cache[iter], iter < (cs)->sb.nr_in_set; iter++) | |
838 | ||
839 | #define for_each_bucket(b, ca) \ | |
840 | for (b = (ca)->buckets + (ca)->sb.first_bucket; \ | |
841 | b < (ca)->buckets + (ca)->sb.nbuckets; b++) | |
842 | ||
cafe5635 KO |
843 | static inline void cached_dev_put(struct cached_dev *dc) |
844 | { | |
845 | if (atomic_dec_and_test(&dc->count)) | |
846 | schedule_work(&dc->detach); | |
847 | } | |
848 | ||
849 | static inline bool cached_dev_get(struct cached_dev *dc) | |
850 | { | |
851 | if (!atomic_inc_not_zero(&dc->count)) | |
852 | return false; | |
853 | ||
854 | /* Paired with the mb in cached_dev_attach */ | |
855 | smp_mb__after_atomic_inc(); | |
856 | return true; | |
857 | } | |
858 | ||
859 | /* | |
860 | * bucket_gc_gen() returns the difference between the bucket's current gen and | |
861 | * the oldest gen of any pointer into that bucket in the btree (last_gc). | |
862 | * | |
863 | * bucket_disk_gen() returns the difference between the current gen and the gen | |
864 | * on disk; they're both used to make sure gens don't wrap around. | |
865 | */ | |
866 | ||
867 | static inline uint8_t bucket_gc_gen(struct bucket *b) | |
868 | { | |
869 | return b->gen - b->last_gc; | |
870 | } | |
871 | ||
872 | static inline uint8_t bucket_disk_gen(struct bucket *b) | |
873 | { | |
874 | return b->gen - b->disk_gen; | |
875 | } | |
876 | ||
877 | #define BUCKET_GC_GEN_MAX 96U | |
878 | #define BUCKET_DISK_GEN_MAX 64U | |
879 | ||
880 | #define kobj_attribute_write(n, fn) \ | |
881 | static struct kobj_attribute ksysfs_##n = __ATTR(n, S_IWUSR, NULL, fn) | |
882 | ||
883 | #define kobj_attribute_rw(n, show, store) \ | |
884 | static struct kobj_attribute ksysfs_##n = \ | |
885 | __ATTR(n, S_IWUSR|S_IRUSR, show, store) | |
886 | ||
119ba0f8 KO |
887 | static inline void wake_up_allocators(struct cache_set *c) |
888 | { | |
889 | struct cache *ca; | |
890 | unsigned i; | |
891 | ||
892 | for_each_cache(ca, c, i) | |
893 | wake_up_process(ca->alloc_thread); | |
894 | } | |
895 | ||
cafe5635 KO |
896 | /* Forward declarations */ |
897 | ||
cafe5635 KO |
898 | void bch_count_io_errors(struct cache *, int, const char *); |
899 | void bch_bbio_count_io_errors(struct cache_set *, struct bio *, | |
900 | int, const char *); | |
901 | void bch_bbio_endio(struct cache_set *, struct bio *, int, const char *); | |
902 | void bch_bbio_free(struct bio *, struct cache_set *); | |
903 | struct bio *bch_bbio_alloc(struct cache_set *); | |
904 | ||
905 | struct bio *bch_bio_split(struct bio *, int, gfp_t, struct bio_set *); | |
906 | void bch_generic_make_request(struct bio *, struct bio_split_pool *); | |
907 | void __bch_submit_bbio(struct bio *, struct cache_set *); | |
908 | void bch_submit_bbio(struct bio *, struct cache_set *, struct bkey *, unsigned); | |
909 | ||
910 | uint8_t bch_inc_gen(struct cache *, struct bucket *); | |
911 | void bch_rescale_priorities(struct cache_set *, int); | |
912 | bool bch_bucket_add_unused(struct cache *, struct bucket *); | |
cafe5635 | 913 | |
35fcd848 | 914 | long bch_bucket_alloc(struct cache *, unsigned, bool); |
cafe5635 KO |
915 | void bch_bucket_free(struct cache_set *, struct bkey *); |
916 | ||
917 | int __bch_bucket_alloc_set(struct cache_set *, unsigned, | |
35fcd848 | 918 | struct bkey *, int, bool); |
cafe5635 | 919 | int bch_bucket_alloc_set(struct cache_set *, unsigned, |
35fcd848 | 920 | struct bkey *, int, bool); |
2599b53b KO |
921 | bool bch_alloc_sectors(struct cache_set *, struct bkey *, unsigned, |
922 | unsigned, unsigned, bool); | |
cafe5635 KO |
923 | |
924 | __printf(2, 3) | |
925 | bool bch_cache_set_error(struct cache_set *, const char *, ...); | |
926 | ||
927 | void bch_prio_write(struct cache *); | |
928 | void bch_write_bdev_super(struct cached_dev *, struct closure *); | |
929 | ||
72a44517 | 930 | extern struct workqueue_struct *bcache_wq; |
cafe5635 KO |
931 | extern const char * const bch_cache_modes[]; |
932 | extern struct mutex bch_register_lock; | |
933 | extern struct list_head bch_cache_sets; | |
934 | ||
935 | extern struct kobj_type bch_cached_dev_ktype; | |
936 | extern struct kobj_type bch_flash_dev_ktype; | |
937 | extern struct kobj_type bch_cache_set_ktype; | |
938 | extern struct kobj_type bch_cache_set_internal_ktype; | |
939 | extern struct kobj_type bch_cache_ktype; | |
940 | ||
941 | void bch_cached_dev_release(struct kobject *); | |
942 | void bch_flash_dev_release(struct kobject *); | |
943 | void bch_cache_set_release(struct kobject *); | |
944 | void bch_cache_release(struct kobject *); | |
945 | ||
946 | int bch_uuid_write(struct cache_set *); | |
947 | void bcache_write_super(struct cache_set *); | |
948 | ||
949 | int bch_flash_dev_create(struct cache_set *c, uint64_t size); | |
950 | ||
951 | int bch_cached_dev_attach(struct cached_dev *, struct cache_set *); | |
952 | void bch_cached_dev_detach(struct cached_dev *); | |
953 | void bch_cached_dev_run(struct cached_dev *); | |
954 | void bcache_device_stop(struct bcache_device *); | |
955 | ||
956 | void bch_cache_set_unregister(struct cache_set *); | |
957 | void bch_cache_set_stop(struct cache_set *); | |
958 | ||
959 | struct cache_set *bch_cache_set_alloc(struct cache_sb *); | |
960 | void bch_btree_cache_free(struct cache_set *); | |
961 | int bch_btree_cache_alloc(struct cache_set *); | |
cafe5635 | 962 | void bch_moving_init_cache_set(struct cache_set *); |
2599b53b KO |
963 | int bch_open_buckets_alloc(struct cache_set *); |
964 | void bch_open_buckets_free(struct cache_set *); | |
cafe5635 | 965 | |
119ba0f8 | 966 | int bch_cache_allocator_start(struct cache *ca); |
cafe5635 KO |
967 | int bch_cache_allocator_init(struct cache *ca); |
968 | ||
969 | void bch_debug_exit(void); | |
970 | int bch_debug_init(struct kobject *); | |
cafe5635 KO |
971 | void bch_request_exit(void); |
972 | int bch_request_init(void); | |
973 | void bch_btree_exit(void); | |
974 | int bch_btree_init(void); | |
975 | ||
976 | #endif /* _BCACHE_H */ |