Commit | Line | Data |
---|---|---|
1c6fdbd8 KO |
1 | /* SPDX-License-Identifier: GPL-2.0 */ |
2 | #ifndef _BCACHEFS_H | |
3 | #define _BCACHEFS_H | |
4 | ||
5 | /* | |
6 | * SOME HIGH LEVEL CODE DOCUMENTATION: | |
7 | * | |
8 | * Bcache mostly works with cache sets, cache devices, and backing devices. | |
9 | * | |
10 | * Support for multiple cache devices hasn't quite been finished off yet, but | |
11 | * it's about 95% plumbed through. A cache set and its cache devices is sort of | |
12 | * like a md raid array and its component devices. Most of the code doesn't care | |
13 | * about individual cache devices, the main abstraction is the cache set. | |
14 | * | |
15 | * Multiple cache devices is intended to give us the ability to mirror dirty | |
16 | * cached data and metadata, without mirroring clean cached data. | |
17 | * | |
18 | * Backing devices are different, in that they have a lifetime independent of a | |
19 | * cache set. When you register a newly formatted backing device it'll come up | |
20 | * in passthrough mode, and then you can attach and detach a backing device from | |
21 | * a cache set at runtime - while it's mounted and in use. Detaching implicitly | |
22 | * invalidates any cached data for that backing device. | |
23 | * | |
24 | * A cache set can have multiple (many) backing devices attached to it. | |
25 | * | |
26 | * There's also flash only volumes - this is the reason for the distinction | |
27 | * between struct cached_dev and struct bcache_device. A flash only volume | |
28 | * works much like a bcache device that has a backing device, except the | |
29 | * "cached" data is always dirty. The end result is that we get thin | |
30 | * provisioning with very little additional code. | |
31 | * | |
32 | * Flash only volumes work but they're not production ready because the moving | |
33 | * garbage collector needs more work. More on that later. | |
34 | * | |
35 | * BUCKETS/ALLOCATION: | |
36 | * | |
37 | * Bcache is primarily designed for caching, which means that in normal | |
38 | * operation all of our available space will be allocated. Thus, we need an | |
39 | * efficient way of deleting things from the cache so we can write new things to | |
40 | * it. | |
41 | * | |
42 | * To do this, we first divide the cache device up into buckets. A bucket is the | |
43 | * unit of allocation; they're typically around 1 mb - anywhere from 128k to 2M+ | |
44 | * works efficiently. | |
45 | * | |
46 | * Each bucket has a 16 bit priority, and an 8 bit generation associated with | |
47 | * it. The gens and priorities for all the buckets are stored contiguously and | |
48 | * packed on disk (in a linked list of buckets - aside from the superblock, all | |
49 | * of bcache's metadata is stored in buckets). | |
50 | * | |
51 | * The priority is used to implement an LRU. We reset a bucket's priority when | |
52 | * we allocate it or on cache it, and every so often we decrement the priority | |
53 | * of each bucket. It could be used to implement something more sophisticated, | |
54 | * if anyone ever gets around to it. | |
55 | * | |
56 | * The generation is used for invalidating buckets. Each pointer also has an 8 | |
57 | * bit generation embedded in it; for a pointer to be considered valid, its gen | |
58 | * must match the gen of the bucket it points into. Thus, to reuse a bucket all | |
59 | * we have to do is increment its gen (and write its new gen to disk; we batch | |
60 | * this up). | |
61 | * | |
62 | * Bcache is entirely COW - we never write twice to a bucket, even buckets that | |
63 | * contain metadata (including btree nodes). | |
64 | * | |
65 | * THE BTREE: | |
66 | * | |
67 | * Bcache is in large part design around the btree. | |
68 | * | |
69 | * At a high level, the btree is just an index of key -> ptr tuples. | |
70 | * | |
71 | * Keys represent extents, and thus have a size field. Keys also have a variable | |
72 | * number of pointers attached to them (potentially zero, which is handy for | |
73 | * invalidating the cache). | |
74 | * | |
75 | * The key itself is an inode:offset pair. The inode number corresponds to a | |
76 | * backing device or a flash only volume. The offset is the ending offset of the | |
77 | * extent within the inode - not the starting offset; this makes lookups | |
78 | * slightly more convenient. | |
79 | * | |
80 | * Pointers contain the cache device id, the offset on that device, and an 8 bit | |
81 | * generation number. More on the gen later. | |
82 | * | |
83 | * Index lookups are not fully abstracted - cache lookups in particular are | |
84 | * still somewhat mixed in with the btree code, but things are headed in that | |
85 | * direction. | |
86 | * | |
87 | * Updates are fairly well abstracted, though. There are two different ways of | |
88 | * updating the btree; insert and replace. | |
89 | * | |
90 | * BTREE_INSERT will just take a list of keys and insert them into the btree - | |
91 | * overwriting (possibly only partially) any extents they overlap with. This is | |
92 | * used to update the index after a write. | |
93 | * | |
94 | * BTREE_REPLACE is really cmpxchg(); it inserts a key into the btree iff it is | |
95 | * overwriting a key that matches another given key. This is used for inserting | |
96 | * data into the cache after a cache miss, and for background writeback, and for | |
97 | * the moving garbage collector. | |
98 | * | |
99 | * There is no "delete" operation; deleting things from the index is | |
100 | * accomplished by either by invalidating pointers (by incrementing a bucket's | |
101 | * gen) or by inserting a key with 0 pointers - which will overwrite anything | |
102 | * previously present at that location in the index. | |
103 | * | |
104 | * This means that there are always stale/invalid keys in the btree. They're | |
105 | * filtered out by the code that iterates through a btree node, and removed when | |
106 | * a btree node is rewritten. | |
107 | * | |
108 | * BTREE NODES: | |
109 | * | |
110 | * Our unit of allocation is a bucket, and we we can't arbitrarily allocate and | |
111 | * free smaller than a bucket - so, that's how big our btree nodes are. | |
112 | * | |
113 | * (If buckets are really big we'll only use part of the bucket for a btree node | |
114 | * - no less than 1/4th - but a bucket still contains no more than a single | |
115 | * btree node. I'd actually like to change this, but for now we rely on the | |
116 | * bucket's gen for deleting btree nodes when we rewrite/split a node.) | |
117 | * | |
118 | * Anyways, btree nodes are big - big enough to be inefficient with a textbook | |
119 | * btree implementation. | |
120 | * | |
121 | * The way this is solved is that btree nodes are internally log structured; we | |
122 | * can append new keys to an existing btree node without rewriting it. This | |
123 | * means each set of keys we write is sorted, but the node is not. | |
124 | * | |
125 | * We maintain this log structure in memory - keeping 1Mb of keys sorted would | |
126 | * be expensive, and we have to distinguish between the keys we have written and | |
127 | * the keys we haven't. So to do a lookup in a btree node, we have to search | |
128 | * each sorted set. But we do merge written sets together lazily, so the cost of | |
129 | * these extra searches is quite low (normally most of the keys in a btree node | |
130 | * will be in one big set, and then there'll be one or two sets that are much | |
131 | * smaller). | |
132 | * | |
133 | * This log structure makes bcache's btree more of a hybrid between a | |
134 | * conventional btree and a compacting data structure, with some of the | |
135 | * advantages of both. | |
136 | * | |
137 | * GARBAGE COLLECTION: | |
138 | * | |
139 | * We can't just invalidate any bucket - it might contain dirty data or | |
140 | * metadata. If it once contained dirty data, other writes might overwrite it | |
141 | * later, leaving no valid pointers into that bucket in the index. | |
142 | * | |
143 | * Thus, the primary purpose of garbage collection is to find buckets to reuse. | |
144 | * It also counts how much valid data it each bucket currently contains, so that | |
145 | * allocation can reuse buckets sooner when they've been mostly overwritten. | |
146 | * | |
147 | * It also does some things that are really internal to the btree | |
148 | * implementation. If a btree node contains pointers that are stale by more than | |
149 | * some threshold, it rewrites the btree node to avoid the bucket's generation | |
150 | * wrapping around. It also merges adjacent btree nodes if they're empty enough. | |
151 | * | |
152 | * THE JOURNAL: | |
153 | * | |
154 | * Bcache's journal is not necessary for consistency; we always strictly | |
155 | * order metadata writes so that the btree and everything else is consistent on | |
156 | * disk in the event of an unclean shutdown, and in fact bcache had writeback | |
157 | * caching (with recovery from unclean shutdown) before journalling was | |
158 | * implemented. | |
159 | * | |
160 | * Rather, the journal is purely a performance optimization; we can't complete a | |
161 | * write until we've updated the index on disk, otherwise the cache would be | |
162 | * inconsistent in the event of an unclean shutdown. This means that without the | |
163 | * journal, on random write workloads we constantly have to update all the leaf | |
164 | * nodes in the btree, and those writes will be mostly empty (appending at most | |
165 | * a few keys each) - highly inefficient in terms of amount of metadata writes, | |
166 | * and it puts more strain on the various btree resorting/compacting code. | |
167 | * | |
168 | * The journal is just a log of keys we've inserted; on startup we just reinsert | |
169 | * all the keys in the open journal entries. That means that when we're updating | |
170 | * a node in the btree, we can wait until a 4k block of keys fills up before | |
171 | * writing them out. | |
172 | * | |
173 | * For simplicity, we only journal updates to leaf nodes; updates to parent | |
174 | * nodes are rare enough (since our leaf nodes are huge) that it wasn't worth | |
175 | * the complexity to deal with journalling them (in particular, journal replay) | |
176 | * - updates to non leaf nodes just happen synchronously (see btree_split()). | |
177 | */ | |
178 | ||
179 | #undef pr_fmt | |
180 | #define pr_fmt(fmt) "bcachefs: %s() " fmt "\n", __func__ | |
181 | ||
182 | #include <linux/backing-dev-defs.h> | |
183 | #include <linux/bug.h> | |
184 | #include <linux/bio.h> | |
185 | #include <linux/closure.h> | |
186 | #include <linux/kobject.h> | |
187 | #include <linux/list.h> | |
188 | #include <linux/mutex.h> | |
189 | #include <linux/percpu-refcount.h> | |
190 | #include <linux/percpu-rwsem.h> | |
191 | #include <linux/rhashtable.h> | |
192 | #include <linux/rwsem.h> | |
193 | #include <linux/seqlock.h> | |
194 | #include <linux/shrinker.h> | |
195 | #include <linux/types.h> | |
196 | #include <linux/workqueue.h> | |
197 | #include <linux/zstd.h> | |
198 | ||
199 | #include "bcachefs_format.h" | |
200 | #include "fifo.h" | |
201 | #include "opts.h" | |
202 | #include "util.h" | |
203 | ||
204 | #define dynamic_fault(...) 0 | |
205 | #define race_fault(...) 0 | |
206 | ||
cd575ddf | 207 | #define bch2_fs_init_fault(name) \ |
1c6fdbd8 KO |
208 | dynamic_fault("bcachefs:bch_fs_init:" name) |
209 | #define bch2_meta_read_fault(name) \ | |
210 | dynamic_fault("bcachefs:meta:read:" name) | |
211 | #define bch2_meta_write_fault(name) \ | |
212 | dynamic_fault("bcachefs:meta:write:" name) | |
213 | ||
214 | #ifdef __KERNEL__ | |
215 | #define bch2_fmt(_c, fmt) "bcachefs (%s): " fmt "\n", ((_c)->name) | |
216 | #else | |
217 | #define bch2_fmt(_c, fmt) fmt "\n" | |
218 | #endif | |
219 | ||
220 | #define bch_info(c, fmt, ...) \ | |
221 | printk(KERN_INFO bch2_fmt(c, fmt), ##__VA_ARGS__) | |
222 | #define bch_notice(c, fmt, ...) \ | |
223 | printk(KERN_NOTICE bch2_fmt(c, fmt), ##__VA_ARGS__) | |
224 | #define bch_warn(c, fmt, ...) \ | |
225 | printk(KERN_WARNING bch2_fmt(c, fmt), ##__VA_ARGS__) | |
226 | #define bch_err(c, fmt, ...) \ | |
227 | printk(KERN_ERR bch2_fmt(c, fmt), ##__VA_ARGS__) | |
dfe9bfb3 KO |
228 | #define bch_err_ratelimited(c, fmt, ...) \ |
229 | printk_ratelimited(KERN_ERR bch2_fmt(c, fmt), ##__VA_ARGS__) | |
1c6fdbd8 KO |
230 | |
231 | #define bch_verbose(c, fmt, ...) \ | |
232 | do { \ | |
233 | if ((c)->opts.verbose_recovery) \ | |
234 | bch_info(c, fmt, ##__VA_ARGS__); \ | |
235 | } while (0) | |
236 | ||
237 | #define pr_verbose_init(opts, fmt, ...) \ | |
238 | do { \ | |
239 | if (opt_get(opts, verbose_init)) \ | |
240 | pr_info(fmt, ##__VA_ARGS__); \ | |
241 | } while (0) | |
242 | ||
243 | /* Parameters that are useful for debugging, but should always be compiled in: */ | |
244 | #define BCH_DEBUG_PARAMS_ALWAYS() \ | |
245 | BCH_DEBUG_PARAM(key_merging_disabled, \ | |
246 | "Disables merging of extents") \ | |
247 | BCH_DEBUG_PARAM(btree_gc_always_rewrite, \ | |
248 | "Causes mark and sweep to compact and rewrite every " \ | |
249 | "btree node it traverses") \ | |
250 | BCH_DEBUG_PARAM(btree_gc_rewrite_disabled, \ | |
251 | "Disables rewriting of btree nodes during mark and sweep")\ | |
252 | BCH_DEBUG_PARAM(btree_shrinker_disabled, \ | |
253 | "Disables the shrinker callback for the btree node cache") | |
254 | ||
255 | /* Parameters that should only be compiled in in debug mode: */ | |
256 | #define BCH_DEBUG_PARAMS_DEBUG() \ | |
257 | BCH_DEBUG_PARAM(expensive_debug_checks, \ | |
258 | "Enables various runtime debugging checks that " \ | |
259 | "significantly affect performance") \ | |
260 | BCH_DEBUG_PARAM(debug_check_bkeys, \ | |
261 | "Run bkey_debugcheck (primarily checking GC/allocation "\ | |
262 | "information) when iterating over keys") \ | |
263 | BCH_DEBUG_PARAM(verify_btree_ondisk, \ | |
264 | "Reread btree nodes at various points to verify the " \ | |
265 | "mergesort in the read path against modifications " \ | |
266 | "done in memory") \ | |
267 | BCH_DEBUG_PARAM(journal_seq_verify, \ | |
268 | "Store the journal sequence number in the version " \ | |
269 | "number of every btree key, and verify that btree " \ | |
270 | "update ordering is preserved during recovery") \ | |
271 | BCH_DEBUG_PARAM(inject_invalid_keys, \ | |
272 | "Store the journal sequence number in the version " \ | |
273 | "number of every btree key, and verify that btree " \ | |
274 | "update ordering is preserved during recovery") \ | |
b29e197a KO |
275 | BCH_DEBUG_PARAM(test_alloc_startup, \ |
276 | "Force allocator startup to use the slowpath where it" \ | |
277 | "can't find enough free buckets without invalidating" \ | |
cd575ddf KO |
278 | "cached data") \ |
279 | BCH_DEBUG_PARAM(force_reconstruct_read, \ | |
280 | "Force reads to use the reconstruct path, when reading" \ | |
281 | "from erasure coded extents") | |
1c6fdbd8 KO |
282 | |
283 | #define BCH_DEBUG_PARAMS_ALL() BCH_DEBUG_PARAMS_ALWAYS() BCH_DEBUG_PARAMS_DEBUG() | |
284 | ||
285 | #ifdef CONFIG_BCACHEFS_DEBUG | |
286 | #define BCH_DEBUG_PARAMS() BCH_DEBUG_PARAMS_ALL() | |
287 | #else | |
288 | #define BCH_DEBUG_PARAMS() BCH_DEBUG_PARAMS_ALWAYS() | |
289 | #endif | |
290 | ||
291 | #define BCH_TIME_STATS() \ | |
292 | x(btree_node_mem_alloc) \ | |
293 | x(btree_gc) \ | |
294 | x(btree_split) \ | |
295 | x(btree_sort) \ | |
296 | x(btree_read) \ | |
297 | x(btree_lock_contended_read) \ | |
298 | x(btree_lock_contended_intent) \ | |
299 | x(btree_lock_contended_write) \ | |
300 | x(data_write) \ | |
301 | x(data_read) \ | |
302 | x(data_promote) \ | |
303 | x(journal_write) \ | |
304 | x(journal_delay) \ | |
305 | x(journal_blocked) \ | |
306 | x(journal_flush_seq) | |
307 | ||
308 | enum bch_time_stats { | |
309 | #define x(name) BCH_TIME_##name, | |
310 | BCH_TIME_STATS() | |
311 | #undef x | |
312 | BCH_TIME_STAT_NR | |
313 | }; | |
314 | ||
315 | #include "alloc_types.h" | |
316 | #include "btree_types.h" | |
317 | #include "buckets_types.h" | |
318 | #include "clock_types.h" | |
cd575ddf | 319 | #include "ec_types.h" |
1c6fdbd8 KO |
320 | #include "journal_types.h" |
321 | #include "keylist_types.h" | |
322 | #include "quota_types.h" | |
323 | #include "rebalance_types.h" | |
7a920560 | 324 | #include "replicas_types.h" |
1c6fdbd8 KO |
325 | #include "super_types.h" |
326 | ||
327 | /* Number of nodes btree coalesce will try to coalesce at once */ | |
328 | #define GC_MERGE_NODES 4U | |
329 | ||
330 | /* Maximum number of nodes we might need to allocate atomically: */ | |
331 | #define BTREE_RESERVE_MAX (BTREE_MAX_DEPTH + (BTREE_MAX_DEPTH - 1)) | |
332 | ||
333 | /* Size of the freelist we allocate btree nodes from: */ | |
8b335bae | 334 | #define BTREE_NODE_RESERVE BTREE_RESERVE_MAX |
1c6fdbd8 KO |
335 | |
336 | struct btree; | |
337 | ||
338 | enum gc_phase { | |
dfe9bfb3 | 339 | GC_PHASE_NOT_RUNNING, |
1c6fdbd8 KO |
340 | GC_PHASE_START, |
341 | GC_PHASE_SB, | |
342 | ||
cd575ddf KO |
343 | GC_PHASE_BTREE_EC, |
344 | GC_PHASE_BTREE_EXTENTS, | |
345 | GC_PHASE_BTREE_INODES, | |
346 | GC_PHASE_BTREE_DIRENTS, | |
347 | GC_PHASE_BTREE_XATTRS, | |
348 | GC_PHASE_BTREE_ALLOC, | |
349 | GC_PHASE_BTREE_QUOTAS, | |
1c6fdbd8 KO |
350 | |
351 | GC_PHASE_PENDING_DELETE, | |
352 | GC_PHASE_ALLOC, | |
1c6fdbd8 KO |
353 | }; |
354 | ||
355 | struct gc_pos { | |
356 | enum gc_phase phase; | |
357 | struct bpos pos; | |
358 | unsigned level; | |
359 | }; | |
360 | ||
361 | struct io_count { | |
362 | u64 sectors[2][BCH_DATA_NR]; | |
363 | }; | |
364 | ||
365 | struct bch_dev { | |
366 | struct kobject kobj; | |
367 | struct percpu_ref ref; | |
368 | struct completion ref_completion; | |
369 | struct percpu_ref io_ref; | |
370 | struct completion io_ref_completion; | |
371 | ||
372 | struct bch_fs *fs; | |
373 | ||
374 | u8 dev_idx; | |
375 | /* | |
376 | * Cached version of this device's member info from superblock | |
377 | * Committed by bch2_write_super() -> bch_fs_mi_update() | |
378 | */ | |
379 | struct bch_member_cpu mi; | |
380 | __uuid_t uuid; | |
381 | char name[BDEVNAME_SIZE]; | |
382 | ||
383 | struct bch_sb_handle disk_sb; | |
384 | int sb_write_error; | |
385 | ||
386 | struct bch_devs_mask self; | |
387 | ||
388 | /* biosets used in cloned bios for writing multiple replicas */ | |
389 | struct bio_set replica_set; | |
390 | ||
391 | /* | |
392 | * Buckets: | |
9166b41d | 393 | * Per-bucket arrays are protected by c->mark_lock, bucket_lock and |
1c6fdbd8 KO |
394 | * gc_lock, for device resize - holding any is sufficient for access: |
395 | * Or rcu_read_lock(), but only for ptr_stale(): | |
396 | */ | |
9ca53b55 | 397 | struct bucket_array __rcu *buckets[2]; |
8eb7f3ee | 398 | unsigned long *buckets_nouse; |
61274e9d | 399 | unsigned long *buckets_written; |
1c6fdbd8 KO |
400 | /* most out of date gen in the btree */ |
401 | u8 *oldest_gens; | |
402 | struct rw_semaphore bucket_lock; | |
403 | ||
9ca53b55 | 404 | struct bch_dev_usage __percpu *usage[2]; |
1c6fdbd8 KO |
405 | |
406 | /* Allocator: */ | |
407 | struct task_struct __rcu *alloc_thread; | |
408 | ||
409 | /* | |
410 | * free: Buckets that are ready to be used | |
411 | * | |
412 | * free_inc: Incoming buckets - these are buckets that currently have | |
413 | * cached data in them, and we can't reuse them until after we write | |
414 | * their new gen to disk. After prio_write() finishes writing the new | |
415 | * gens/prios, they'll be moved to the free list (and possibly discarded | |
416 | * in the process) | |
417 | */ | |
418 | alloc_fifo free[RESERVE_NR]; | |
419 | alloc_fifo free_inc; | |
420 | spinlock_t freelist_lock; | |
1c6fdbd8 KO |
421 | |
422 | u8 open_buckets_partial[OPEN_BUCKETS_COUNT]; | |
423 | unsigned open_buckets_partial_nr; | |
424 | ||
425 | size_t fifo_last_bucket; | |
426 | ||
427 | /* last calculated minimum prio */ | |
428 | u16 max_last_bucket_io[2]; | |
429 | ||
1c6fdbd8 KO |
430 | size_t inc_gen_needs_gc; |
431 | size_t inc_gen_really_needs_gc; | |
1c6fdbd8 KO |
432 | bool allocator_blocked; |
433 | ||
434 | alloc_heap alloc_heap; | |
435 | ||
436 | /* Copying GC: */ | |
437 | struct task_struct *copygc_thread; | |
438 | copygc_heap copygc_heap; | |
439 | struct bch_pd_controller copygc_pd; | |
440 | struct write_point copygc_write_point; | |
a9bec520 | 441 | u64 copygc_threshold; |
1c6fdbd8 KO |
442 | |
443 | atomic64_t rebalance_work; | |
444 | ||
445 | struct journal_device journal; | |
446 | ||
447 | struct work_struct io_error_work; | |
448 | ||
449 | /* The rest of this all shows up in sysfs */ | |
450 | atomic64_t cur_latency[2]; | |
451 | struct bch2_time_stats io_latency[2]; | |
452 | ||
453 | #define CONGESTED_MAX 1024 | |
454 | atomic_t congested; | |
455 | u64 congested_last; | |
456 | ||
457 | struct io_count __percpu *io_done; | |
458 | }; | |
459 | ||
460 | /* | |
461 | * Flag bits for what phase of startup/shutdown the cache set is at, how we're | |
462 | * shutting down, etc.: | |
463 | * | |
464 | * BCH_FS_UNREGISTERING means we're not just shutting down, we're detaching | |
465 | * all the backing devices first (their cached data gets invalidated, and they | |
466 | * won't automatically reattach). | |
467 | */ | |
468 | enum { | |
469 | /* startup: */ | |
470 | BCH_FS_ALLOC_READ_DONE, | |
471 | BCH_FS_ALLOCATOR_STARTED, | |
472 | BCH_FS_INITIAL_GC_DONE, | |
473 | BCH_FS_FSCK_DONE, | |
474 | BCH_FS_STARTED, | |
475 | ||
476 | /* shutdown: */ | |
477 | BCH_FS_EMERGENCY_RO, | |
478 | BCH_FS_WRITE_DISABLE_COMPLETE, | |
479 | ||
480 | /* errors: */ | |
481 | BCH_FS_ERROR, | |
1c6fdbd8 KO |
482 | |
483 | /* misc: */ | |
484 | BCH_FS_BDEV_MOUNTED, | |
485 | BCH_FS_FSCK_FIXED_ERRORS, | |
88c07f73 | 486 | BCH_FS_FSCK_UNFIXED_ERRORS, |
1c6fdbd8 KO |
487 | BCH_FS_FIXED_GENS, |
488 | BCH_FS_REBUILD_REPLICAS, | |
489 | BCH_FS_HOLD_BTREE_WRITES, | |
490 | }; | |
491 | ||
492 | struct btree_debug { | |
493 | unsigned id; | |
494 | struct dentry *btree; | |
495 | struct dentry *btree_format; | |
496 | struct dentry *failed; | |
497 | }; | |
498 | ||
499 | enum bch_fs_state { | |
500 | BCH_FS_STARTING = 0, | |
501 | BCH_FS_STOPPING, | |
502 | BCH_FS_RO, | |
503 | BCH_FS_RW, | |
504 | }; | |
505 | ||
5663a415 KO |
506 | struct bch_fs_pcpu { |
507 | u64 sectors_available; | |
508 | }; | |
509 | ||
1c6fdbd8 KO |
510 | struct bch_fs { |
511 | struct closure cl; | |
512 | ||
513 | struct list_head list; | |
514 | struct kobject kobj; | |
515 | struct kobject internal; | |
516 | struct kobject opts_dir; | |
517 | struct kobject time_stats; | |
518 | unsigned long flags; | |
519 | ||
520 | int minor; | |
521 | struct device *chardev; | |
522 | struct super_block *vfs_sb; | |
523 | char name[40]; | |
524 | ||
525 | /* ro/rw, add/remove devices: */ | |
526 | struct mutex state_lock; | |
527 | enum bch_fs_state state; | |
528 | ||
529 | /* Counts outstanding writes, for clean transition to read-only */ | |
530 | struct percpu_ref writes; | |
531 | struct work_struct read_only_work; | |
532 | ||
533 | struct bch_dev __rcu *devs[BCH_SB_MEMBERS_MAX]; | |
534 | ||
73e6ab95 KO |
535 | struct bch_replicas_cpu replicas; |
536 | struct bch_replicas_cpu replicas_gc; | |
1c6fdbd8 KO |
537 | struct mutex replicas_gc_lock; |
538 | ||
539 | struct bch_disk_groups_cpu __rcu *disk_groups; | |
540 | ||
541 | struct bch_opts opts; | |
542 | ||
543 | /* Updated by bch2_sb_update():*/ | |
544 | struct { | |
545 | __uuid_t uuid; | |
546 | __uuid_t user_uuid; | |
547 | ||
26609b61 | 548 | u16 version; |
1c6fdbd8 KO |
549 | u16 encoded_extent_max; |
550 | ||
551 | u8 nr_devices; | |
552 | u8 clean; | |
553 | ||
554 | u8 encryption_type; | |
555 | ||
556 | u64 time_base_lo; | |
557 | u32 time_base_hi; | |
558 | u32 time_precision; | |
559 | u64 features; | |
560 | } sb; | |
561 | ||
562 | struct bch_sb_handle disk_sb; | |
563 | ||
564 | unsigned short block_bits; /* ilog2(block_size) */ | |
565 | ||
566 | u16 btree_foreground_merge_threshold; | |
567 | ||
568 | struct closure sb_write; | |
569 | struct mutex sb_lock; | |
570 | ||
571 | /* BTREE CACHE */ | |
572 | struct bio_set btree_bio; | |
573 | ||
574 | struct btree_root btree_roots[BTREE_ID_NR]; | |
575 | bool btree_roots_dirty; | |
576 | struct mutex btree_root_lock; | |
577 | ||
578 | struct btree_cache btree_cache; | |
579 | ||
580 | mempool_t btree_reserve_pool; | |
581 | ||
582 | /* | |
583 | * Cache of allocated btree nodes - if we allocate a btree node and | |
584 | * don't use it, if we free it that space can't be reused until going | |
585 | * _all_ the way through the allocator (which exposes us to a livelock | |
586 | * when allocating btree reserves fail halfway through) - instead, we | |
587 | * can stick them here: | |
588 | */ | |
589 | struct btree_alloc btree_reserve_cache[BTREE_NODE_RESERVE * 2]; | |
590 | unsigned btree_reserve_cache_nr; | |
591 | struct mutex btree_reserve_cache_lock; | |
592 | ||
593 | mempool_t btree_interior_update_pool; | |
594 | struct list_head btree_interior_update_list; | |
595 | struct mutex btree_interior_update_lock; | |
596 | struct closure_waitlist btree_interior_update_wait; | |
597 | ||
581edb63 KO |
598 | mempool_t btree_iters_pool; |
599 | ||
1c6fdbd8 KO |
600 | struct workqueue_struct *wq; |
601 | /* copygc needs its own workqueue for index updates.. */ | |
602 | struct workqueue_struct *copygc_wq; | |
603 | ||
604 | /* ALLOCATION */ | |
605 | struct delayed_work pd_controllers_update; | |
606 | unsigned pd_controllers_update_seconds; | |
607 | ||
608 | struct bch_devs_mask rw_devs[BCH_DATA_NR]; | |
609 | ||
610 | u64 capacity; /* sectors */ | |
611 | ||
612 | /* | |
613 | * When capacity _decreases_ (due to a disk being removed), we | |
614 | * increment capacity_gen - this invalidates outstanding reservations | |
615 | * and forces them to be revalidated | |
616 | */ | |
617 | u32 capacity_gen; | |
b092dadd | 618 | unsigned bucket_size_max; |
1c6fdbd8 KO |
619 | |
620 | atomic64_t sectors_available; | |
621 | ||
5663a415 KO |
622 | struct bch_fs_pcpu __percpu *pcpu; |
623 | ||
624 | struct bch_fs_usage __percpu *usage[2]; | |
9ca53b55 | 625 | |
5663a415 | 626 | struct percpu_rw_semaphore mark_lock; |
1c6fdbd8 | 627 | |
1c6fdbd8 KO |
628 | /* |
629 | * When we invalidate buckets, we use both the priority and the amount | |
630 | * of good data to determine which buckets to reuse first - to weight | |
631 | * those together consistently we keep track of the smallest nonzero | |
632 | * priority of any bucket. | |
633 | */ | |
634 | struct bucket_clock bucket_clock[2]; | |
635 | ||
636 | struct io_clock io_clock[2]; | |
637 | ||
638 | /* ALLOCATOR */ | |
639 | spinlock_t freelist_lock; | |
90541a74 | 640 | struct closure_waitlist freelist_wait; |
1c6fdbd8 KO |
641 | u8 open_buckets_freelist; |
642 | u8 open_buckets_nr_free; | |
643 | struct closure_waitlist open_buckets_wait; | |
644 | struct open_bucket open_buckets[OPEN_BUCKETS_COUNT]; | |
645 | ||
646 | struct write_point btree_write_point; | |
647 | struct write_point rebalance_write_point; | |
648 | ||
b092dadd KO |
649 | struct write_point write_points[WRITE_POINT_MAX]; |
650 | struct hlist_head write_points_hash[WRITE_POINT_HASH_NR]; | |
1c6fdbd8 | 651 | struct mutex write_points_hash_lock; |
b092dadd | 652 | unsigned write_points_nr; |
1c6fdbd8 KO |
653 | |
654 | /* GARBAGE COLLECTION */ | |
655 | struct task_struct *gc_thread; | |
656 | atomic_t kick_gc; | |
657 | unsigned long gc_count; | |
658 | ||
659 | /* | |
660 | * Tracks GC's progress - everything in the range [ZERO_KEY..gc_cur_pos] | |
661 | * has been marked by GC. | |
662 | * | |
663 | * gc_cur_phase is a superset of btree_ids (BTREE_ID_EXTENTS etc.) | |
664 | * | |
1c6fdbd8 KO |
665 | * Protected by gc_pos_lock. Only written to by GC thread, so GC thread |
666 | * can read without a lock. | |
667 | */ | |
668 | seqcount_t gc_pos_lock; | |
669 | struct gc_pos gc_pos; | |
670 | ||
671 | /* | |
672 | * The allocation code needs gc_mark in struct bucket to be correct, but | |
673 | * it's not while a gc is in progress. | |
674 | */ | |
675 | struct rw_semaphore gc_lock; | |
676 | ||
677 | /* IO PATH */ | |
678 | struct bio_set bio_read; | |
679 | struct bio_set bio_read_split; | |
680 | struct bio_set bio_write; | |
681 | struct mutex bio_bounce_pages_lock; | |
682 | mempool_t bio_bounce_pages; | |
683 | struct rhashtable promote_table; | |
684 | ||
685 | mempool_t compression_bounce[2]; | |
686 | mempool_t compress_workspace[BCH_COMPRESSION_NR]; | |
687 | mempool_t decompress_workspace; | |
688 | ZSTD_parameters zstd_params; | |
689 | ||
690 | struct crypto_shash *sha256; | |
691 | struct crypto_sync_skcipher *chacha20; | |
692 | struct crypto_shash *poly1305; | |
693 | ||
694 | atomic64_t key_version; | |
695 | ||
696 | /* REBALANCE */ | |
697 | struct bch_fs_rebalance rebalance; | |
698 | ||
dfe9bfb3 KO |
699 | /* STRIPES: */ |
700 | GENRADIX(struct stripe) stripes[2]; | |
701 | struct mutex ec_stripe_create_lock; | |
cd575ddf KO |
702 | |
703 | ec_stripes_heap ec_stripes_heap; | |
704 | spinlock_t ec_stripes_heap_lock; | |
705 | ||
dfe9bfb3 KO |
706 | /* ERASURE CODING */ |
707 | struct list_head ec_new_stripe_list; | |
708 | struct mutex ec_new_stripe_lock; | |
709 | ||
cd575ddf KO |
710 | struct bio_set ec_bioset; |
711 | ||
712 | struct work_struct ec_stripe_delete_work; | |
713 | struct llist_head ec_stripe_delete_list; | |
714 | ||
1c6fdbd8 KO |
715 | /* VFS IO PATH - fs-io.c */ |
716 | struct bio_set writepage_bioset; | |
717 | struct bio_set dio_write_bioset; | |
718 | struct bio_set dio_read_bioset; | |
719 | ||
720 | struct bio_list btree_write_error_list; | |
721 | struct work_struct btree_write_error_work; | |
722 | spinlock_t btree_write_error_lock; | |
723 | ||
724 | /* ERRORS */ | |
725 | struct list_head fsck_errors; | |
726 | struct mutex fsck_error_lock; | |
727 | bool fsck_alloc_err; | |
728 | ||
1c6fdbd8 KO |
729 | /* QUOTAS */ |
730 | struct bch_memquota_type quotas[QTYP_NR]; | |
731 | ||
732 | /* DEBUG JUNK */ | |
733 | struct dentry *debug; | |
734 | struct btree_debug btree_debug[BTREE_ID_NR]; | |
735 | #ifdef CONFIG_BCACHEFS_DEBUG | |
736 | struct btree *verify_data; | |
737 | struct btree_node *verify_ondisk; | |
738 | struct mutex verify_lock; | |
739 | #endif | |
740 | ||
741 | u64 unused_inode_hint; | |
742 | ||
743 | /* | |
744 | * A btree node on disk could have too many bsets for an iterator to fit | |
745 | * on the stack - have to dynamically allocate them | |
746 | */ | |
747 | mempool_t fill_iter; | |
748 | ||
749 | mempool_t btree_bounce_pool; | |
750 | ||
751 | struct journal journal; | |
752 | ||
c6923995 | 753 | u64 last_bucket_seq_cleanup; |
1c6fdbd8 KO |
754 | |
755 | /* The rest of this all shows up in sysfs */ | |
756 | atomic_long_t read_realloc_races; | |
757 | atomic_long_t extent_migrate_done; | |
758 | atomic_long_t extent_migrate_raced; | |
759 | ||
760 | unsigned btree_gc_periodic:1; | |
761 | unsigned copy_gc_enabled:1; | |
762 | bool promote_whole_extents; | |
763 | ||
764 | #define BCH_DEBUG_PARAM(name, description) bool name; | |
765 | BCH_DEBUG_PARAMS_ALL() | |
766 | #undef BCH_DEBUG_PARAM | |
767 | ||
768 | struct bch2_time_stats times[BCH_TIME_STAT_NR]; | |
769 | }; | |
770 | ||
771 | static inline void bch2_set_ra_pages(struct bch_fs *c, unsigned ra_pages) | |
772 | { | |
773 | #ifndef NO_BCACHEFS_FS | |
774 | if (c->vfs_sb) | |
775 | c->vfs_sb->s_bdi->ra_pages = ra_pages; | |
776 | #endif | |
777 | } | |
778 | ||
779 | static inline bool bch2_fs_running(struct bch_fs *c) | |
780 | { | |
781 | return c->state == BCH_FS_RO || c->state == BCH_FS_RW; | |
782 | } | |
783 | ||
784 | static inline unsigned bucket_bytes(const struct bch_dev *ca) | |
785 | { | |
786 | return ca->mi.bucket_size << 9; | |
787 | } | |
788 | ||
789 | static inline unsigned block_bytes(const struct bch_fs *c) | |
790 | { | |
791 | return c->opts.block_size << 9; | |
792 | } | |
793 | ||
794 | static inline struct timespec64 bch2_time_to_timespec(struct bch_fs *c, u64 time) | |
795 | { | |
796 | return ns_to_timespec64(time * c->sb.time_precision + c->sb.time_base_lo); | |
797 | } | |
798 | ||
799 | static inline s64 timespec_to_bch2_time(struct bch_fs *c, struct timespec64 ts) | |
800 | { | |
801 | s64 ns = timespec64_to_ns(&ts) - c->sb.time_base_lo; | |
802 | ||
803 | if (c->sb.time_precision == 1) | |
804 | return ns; | |
805 | ||
806 | return div_s64(ns, c->sb.time_precision); | |
807 | } | |
808 | ||
809 | static inline s64 bch2_current_time(struct bch_fs *c) | |
810 | { | |
811 | struct timespec64 now; | |
812 | ||
813 | ktime_get_real_ts64(&now); | |
814 | return timespec_to_bch2_time(c, now); | |
815 | } | |
816 | ||
817 | #endif /* _BCACHEFS_H */ |