1 /* SPDX-License-Identifier: GPL-2.0 */
6 * SOME HIGH LEVEL CODE DOCUMENTATION:
8 * Bcache mostly works with cache sets, cache devices, and backing devices.
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.
15 * Multiple cache devices is intended to give us the ability to mirror dirty
16 * cached data and metadata, without mirroring clean cached data.
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.
24 * A cache set can have multiple (many) backing devices attached to it.
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.
32 * Flash only volumes work but they're not production ready because the moving
33 * garbage collector needs more work. More on that later.
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
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+
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).
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.
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
62 * Bcache is entirely COW - we never write twice to a bucket, even buckets that
63 * contain metadata (including btree nodes).
67 * Bcache is in large part design around the btree.
69 * At a high level, the btree is just an index of key -> ptr tuples.
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).
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.
80 * Pointers contain the cache device id, the offset on that device, and an 8 bit
81 * generation number. More on the gen later.
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
87 * Updates are fairly well abstracted, though. There are two different ways of
88 * updating the btree; insert and replace.
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.
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.
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.
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.
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.
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.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
119 * btree implementation.
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.
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
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.
137 * GARBAGE COLLECTION:
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.
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.
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.
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
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.
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
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()).
180 #define pr_fmt(fmt) "bcachefs: %s() " fmt "\n", __func__
182 #include <linux/bug.h>
183 #include <linux/bio.h>
184 #include <linux/closure.h>
185 #include <linux/kobject.h>
186 #include <linux/list.h>
187 #include <linux/math64.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>
199 #include "bcachefs_format.h"
204 #include <linux/dynamic_fault.h>
206 #define bch2_fs_init_fault(name) \
207 dynamic_fault("bcachefs:bch_fs_init:" name)
208 #define bch2_meta_read_fault(name) \
209 dynamic_fault("bcachefs:meta:read:" name)
210 #define bch2_meta_write_fault(name) \
211 dynamic_fault("bcachefs:meta:write:" name)
214 #define bch2_fmt(_c, fmt) "bcachefs (%s): " fmt "\n", ((_c)->name)
216 #define bch2_fmt(_c, fmt) fmt "\n"
219 #define bch_info(c, fmt, ...) \
220 printk(KERN_INFO bch2_fmt(c, fmt), ##__VA_ARGS__)
221 #define bch_notice(c, fmt, ...) \
222 printk(KERN_NOTICE bch2_fmt(c, fmt), ##__VA_ARGS__)
223 #define bch_warn(c, fmt, ...) \
224 printk(KERN_WARNING bch2_fmt(c, fmt), ##__VA_ARGS__)
225 #define bch_warn_ratelimited(c, fmt, ...) \
226 printk_ratelimited(KERN_WARNING bch2_fmt(c, fmt), ##__VA_ARGS__)
227 #define bch_err(c, fmt, ...) \
228 printk(KERN_ERR bch2_fmt(c, fmt), ##__VA_ARGS__)
229 #define bch_err_ratelimited(c, fmt, ...) \
230 printk_ratelimited(KERN_ERR bch2_fmt(c, fmt), ##__VA_ARGS__)
232 #define bch_verbose(c, fmt, ...) \
234 if ((c)->opts.verbose) \
235 bch_info(c, fmt, ##__VA_ARGS__); \
238 #define pr_verbose_init(opts, fmt, ...) \
240 if (opt_get(opts, verbose)) \
241 pr_info(fmt, ##__VA_ARGS__); \
244 /* Parameters that are useful for debugging, but should always be compiled in: */
245 #define BCH_DEBUG_PARAMS_ALWAYS() \
246 BCH_DEBUG_PARAM(key_merging_disabled, \
247 "Disables merging of extents") \
248 BCH_DEBUG_PARAM(btree_gc_always_rewrite, \
249 "Causes mark and sweep to compact and rewrite every " \
250 "btree node it traverses") \
251 BCH_DEBUG_PARAM(btree_gc_rewrite_disabled, \
252 "Disables rewriting of btree nodes during mark and sweep")\
253 BCH_DEBUG_PARAM(btree_shrinker_disabled, \
254 "Disables the shrinker callback for the btree node cache")
256 /* Parameters that should only be compiled in in debug mode: */
257 #define BCH_DEBUG_PARAMS_DEBUG() \
258 BCH_DEBUG_PARAM(expensive_debug_checks, \
259 "Enables various runtime debugging checks that " \
260 "significantly affect performance") \
261 BCH_DEBUG_PARAM(debug_check_iterators, \
262 "Enables extra verification for btree iterators") \
263 BCH_DEBUG_PARAM(debug_check_bkeys, \
264 "Run bkey_debugcheck (primarily checking GC/allocation "\
265 "information) when iterating over keys") \
266 BCH_DEBUG_PARAM(verify_btree_ondisk, \
267 "Reread btree nodes at various points to verify the " \
268 "mergesort in the read path against modifications " \
270 BCH_DEBUG_PARAM(journal_seq_verify, \
271 "Store the journal sequence number in the version " \
272 "number of every btree key, and verify that btree " \
273 "update ordering is preserved during recovery") \
274 BCH_DEBUG_PARAM(inject_invalid_keys, \
275 "Store the journal sequence number in the version " \
276 "number of every btree key, and verify that btree " \
277 "update ordering is preserved during recovery") \
278 BCH_DEBUG_PARAM(test_alloc_startup, \
279 "Force allocator startup to use the slowpath where it" \
280 "can't find enough free buckets without invalidating" \
282 BCH_DEBUG_PARAM(force_reconstruct_read, \
283 "Force reads to use the reconstruct path, when reading" \
284 "from erasure coded extents") \
285 BCH_DEBUG_PARAM(test_restart_gc, \
286 "Test restarting mark and sweep gc when bucket gens change")
288 #define BCH_DEBUG_PARAMS_ALL() BCH_DEBUG_PARAMS_ALWAYS() BCH_DEBUG_PARAMS_DEBUG()
290 #ifdef CONFIG_BCACHEFS_DEBUG
291 #define BCH_DEBUG_PARAMS() BCH_DEBUG_PARAMS_ALL()
293 #define BCH_DEBUG_PARAMS() BCH_DEBUG_PARAMS_ALWAYS()
296 #define BCH_TIME_STATS() \
297 x(btree_node_mem_alloc) \
298 x(btree_node_split) \
302 x(btree_lock_contended_read) \
303 x(btree_lock_contended_intent) \
304 x(btree_lock_contended_write) \
310 x(journal_flush_seq) \
312 x(blocked_allocate) \
313 x(blocked_allocate_open_bucket)
315 enum bch_time_stats {
316 #define x(name) BCH_TIME_##name,
322 #include "alloc_types.h"
323 #include "btree_types.h"
324 #include "buckets_types.h"
325 #include "clock_types.h"
326 #include "ec_types.h"
327 #include "journal_types.h"
328 #include "keylist_types.h"
329 #include "quota_types.h"
330 #include "rebalance_types.h"
331 #include "replicas_types.h"
332 #include "super_types.h"
334 /* Number of nodes btree coalesce will try to coalesce at once */
335 #define GC_MERGE_NODES 4U
337 /* Maximum number of nodes we might need to allocate atomically: */
338 #define BTREE_RESERVE_MAX (BTREE_MAX_DEPTH + (BTREE_MAX_DEPTH - 1))
340 /* Size of the freelist we allocate btree nodes from: */
341 #define BTREE_NODE_RESERVE BTREE_RESERVE_MAX
343 #define BTREE_NODE_OPEN_BUCKET_RESERVE (BTREE_RESERVE_MAX * BCH_REPLICAS_MAX)
348 GC_PHASE_NOT_RUNNING,
353 GC_PHASE_BTREE_EXTENTS,
354 GC_PHASE_BTREE_INODES,
355 GC_PHASE_BTREE_DIRENTS,
356 GC_PHASE_BTREE_XATTRS,
357 GC_PHASE_BTREE_ALLOC,
358 GC_PHASE_BTREE_QUOTAS,
359 GC_PHASE_BTREE_REFLINK,
361 GC_PHASE_PENDING_DELETE,
372 u64 sectors[2][BCH_DATA_NR];
377 struct percpu_ref ref;
378 struct completion ref_completion;
379 struct percpu_ref io_ref;
380 struct completion io_ref_completion;
386 * Cached version of this device's member info from superblock
387 * Committed by bch2_write_super() -> bch_fs_mi_update()
389 struct bch_member_cpu mi;
391 char name[BDEVNAME_SIZE];
393 struct bch_sb_handle disk_sb;
394 struct bch_sb *sb_read_scratch;
397 struct bch_devs_mask self;
399 /* biosets used in cloned bios for writing multiple replicas */
400 struct bio_set replica_set;
404 * Per-bucket arrays are protected by c->mark_lock, bucket_lock and
405 * gc_lock, for device resize - holding any is sufficient for access:
406 * Or rcu_read_lock(), but only for ptr_stale():
408 struct bucket_array __rcu *buckets[2];
409 unsigned long *buckets_nouse;
410 struct rw_semaphore bucket_lock;
412 struct bch_dev_usage __percpu *usage[2];
415 struct task_struct __rcu *alloc_thread;
418 * free: Buckets that are ready to be used
420 * free_inc: Incoming buckets - these are buckets that currently have
421 * cached data in them, and we can't reuse them until after we write
422 * their new gen to disk. After prio_write() finishes writing the new
423 * gens/prios, they'll be moved to the free list (and possibly discarded
426 alloc_fifo free[RESERVE_NR];
429 u8 open_buckets_partial[OPEN_BUCKETS_COUNT];
430 unsigned open_buckets_partial_nr;
432 size_t fifo_last_bucket;
434 /* last calculated minimum prio */
435 u16 max_last_bucket_io[2];
437 size_t inc_gen_needs_gc;
438 size_t inc_gen_really_needs_gc;
441 * XXX: this should be an enum for allocator state, so as to include
448 ALLOCATOR_BLOCKED_FULL,
451 alloc_heap alloc_heap;
454 struct task_struct *copygc_thread;
455 copygc_heap copygc_heap;
456 struct bch_pd_controller copygc_pd;
457 struct write_point copygc_write_point;
458 u64 copygc_threshold;
460 atomic64_t rebalance_work;
462 struct journal_device journal;
464 struct work_struct io_error_work;
466 /* The rest of this all shows up in sysfs */
467 atomic64_t cur_latency[2];
468 struct time_stats io_latency[2];
470 #define CONGESTED_MAX 1024
474 struct io_count __percpu *io_done;
479 BCH_FS_ALLOC_READ_DONE,
480 BCH_FS_ALLOCATOR_STARTED,
481 BCH_FS_ALLOCATOR_RUNNING,
482 BCH_FS_INITIAL_GC_DONE,
490 BCH_FS_WRITE_DISABLE_COMPLETE,
499 BCH_FS_ALLOC_WRITTEN,
500 BCH_FS_REBUILD_REPLICAS,
501 BCH_FS_HOLD_BTREE_WRITES,
506 struct dentry *btree;
507 struct dentry *btree_format;
508 struct dentry *failed;
512 u64 sectors_available;
515 struct journal_seq_blacklist_table {
517 struct journal_seq_blacklist_table_entry {
527 struct list_head list;
529 struct kobject internal;
530 struct kobject opts_dir;
531 struct kobject time_stats;
535 struct device *chardev;
536 struct super_block *vfs_sb;
539 /* ro/rw, add/remove devices: */
540 struct mutex state_lock;
542 /* Counts outstanding writes, for clean transition to read-only */
543 struct percpu_ref writes;
544 struct work_struct read_only_work;
546 struct bch_dev __rcu *devs[BCH_SB_MEMBERS_MAX];
548 struct bch_replicas_cpu replicas;
549 struct bch_replicas_cpu replicas_gc;
550 struct mutex replicas_gc_lock;
552 struct journal_entry_res replicas_journal_res;
554 struct bch_disk_groups_cpu __rcu *disk_groups;
556 struct bch_opts opts;
558 /* Updated by bch2_sb_update():*/
564 u16 encoded_extent_max;
578 struct bch_sb_handle disk_sb;
580 unsigned short block_bits; /* ilog2(block_size) */
582 u16 btree_foreground_merge_threshold;
584 struct closure sb_write;
585 struct mutex sb_lock;
588 struct bio_set btree_bio;
590 struct btree_root btree_roots[BTREE_ID_NR];
591 bool btree_roots_dirty;
592 struct mutex btree_root_lock;
594 struct btree_cache btree_cache;
596 mempool_t btree_reserve_pool;
599 * Cache of allocated btree nodes - if we allocate a btree node and
600 * don't use it, if we free it that space can't be reused until going
601 * _all_ the way through the allocator (which exposes us to a livelock
602 * when allocating btree reserves fail halfway through) - instead, we
603 * can stick them here:
605 struct btree_alloc btree_reserve_cache[BTREE_NODE_RESERVE * 2];
606 unsigned btree_reserve_cache_nr;
607 struct mutex btree_reserve_cache_lock;
609 mempool_t btree_interior_update_pool;
610 struct list_head btree_interior_update_list;
611 struct mutex btree_interior_update_lock;
612 struct closure_waitlist btree_interior_update_wait;
614 mempool_t btree_iters_pool;
616 struct workqueue_struct *wq;
617 /* copygc needs its own workqueue for index updates.. */
618 struct workqueue_struct *copygc_wq;
619 struct workqueue_struct *journal_reclaim_wq;
622 struct delayed_work pd_controllers_update;
623 unsigned pd_controllers_update_seconds;
625 struct bch_devs_mask rw_devs[BCH_DATA_NR];
627 u64 capacity; /* sectors */
630 * When capacity _decreases_ (due to a disk being removed), we
631 * increment capacity_gen - this invalidates outstanding reservations
632 * and forces them to be revalidated
635 unsigned bucket_size_max;
637 atomic64_t sectors_available;
639 struct bch_fs_pcpu __percpu *pcpu;
641 struct percpu_rw_semaphore mark_lock;
643 seqcount_t usage_lock;
644 struct bch_fs_usage *usage_base;
645 struct bch_fs_usage __percpu *usage[2];
646 struct bch_fs_usage __percpu *usage_gc;
648 /* single element mempool: */
649 struct mutex usage_scratch_lock;
650 struct bch_fs_usage *usage_scratch;
653 * When we invalidate buckets, we use both the priority and the amount
654 * of good data to determine which buckets to reuse first - to weight
655 * those together consistently we keep track of the smallest nonzero
656 * priority of any bucket.
658 struct bucket_clock bucket_clock[2];
660 struct io_clock io_clock[2];
662 /* JOURNAL SEQ BLACKLIST */
663 struct journal_seq_blacklist_table *
664 journal_seq_blacklist_table;
665 struct work_struct journal_seq_blacklist_gc_work;
668 spinlock_t freelist_lock;
669 struct closure_waitlist freelist_wait;
670 u64 blocked_allocate;
671 u64 blocked_allocate_open_bucket;
672 u8 open_buckets_freelist;
673 u8 open_buckets_nr_free;
674 struct closure_waitlist open_buckets_wait;
675 struct open_bucket open_buckets[OPEN_BUCKETS_COUNT];
677 struct write_point btree_write_point;
678 struct write_point rebalance_write_point;
680 struct write_point write_points[WRITE_POINT_MAX];
681 struct hlist_head write_points_hash[WRITE_POINT_HASH_NR];
682 struct mutex write_points_hash_lock;
683 unsigned write_points_nr;
685 /* GARBAGE COLLECTION */
686 struct task_struct *gc_thread;
688 unsigned long gc_count;
691 * Tracks GC's progress - everything in the range [ZERO_KEY..gc_cur_pos]
692 * has been marked by GC.
694 * gc_cur_phase is a superset of btree_ids (BTREE_ID_EXTENTS etc.)
696 * Protected by gc_pos_lock. Only written to by GC thread, so GC thread
697 * can read without a lock.
699 seqcount_t gc_pos_lock;
700 struct gc_pos gc_pos;
703 * The allocation code needs gc_mark in struct bucket to be correct, but
704 * it's not while a gc is in progress.
706 struct rw_semaphore gc_lock;
709 struct bio_set bio_read;
710 struct bio_set bio_read_split;
711 struct bio_set bio_write;
712 struct mutex bio_bounce_pages_lock;
713 mempool_t bio_bounce_pages;
714 struct rhashtable promote_table;
716 mempool_t compression_bounce[2];
717 mempool_t compress_workspace[BCH_COMPRESSION_NR];
718 mempool_t decompress_workspace;
719 ZSTD_parameters zstd_params;
721 struct crypto_shash *sha256;
722 struct crypto_sync_skcipher *chacha20;
723 struct crypto_shash *poly1305;
725 atomic64_t key_version;
727 mempool_t large_bkey_pool;
730 struct bch_fs_rebalance rebalance;
733 GENRADIX(struct stripe) stripes[2];
734 struct mutex ec_stripe_create_lock;
736 ec_stripes_heap ec_stripes_heap;
737 spinlock_t ec_stripes_heap_lock;
740 struct list_head ec_new_stripe_list;
741 struct mutex ec_new_stripe_lock;
744 struct bio_set ec_bioset;
746 struct work_struct ec_stripe_delete_work;
747 struct llist_head ec_stripe_delete_list;
752 /* VFS IO PATH - fs-io.c */
753 struct bio_set writepage_bioset;
754 struct bio_set dio_write_bioset;
755 struct bio_set dio_read_bioset;
757 struct bio_list btree_write_error_list;
758 struct work_struct btree_write_error_work;
759 spinlock_t btree_write_error_lock;
762 struct list_head fsck_errors;
763 struct mutex fsck_error_lock;
767 struct bch_memquota_type quotas[QTYP_NR];
770 struct dentry *debug;
771 struct btree_debug btree_debug[BTREE_ID_NR];
772 #ifdef CONFIG_BCACHEFS_DEBUG
773 struct btree *verify_data;
774 struct btree_node *verify_ondisk;
775 struct mutex verify_lock;
778 u64 unused_inode_hint;
781 * A btree node on disk could have too many bsets for an iterator to fit
782 * on the stack - have to dynamically allocate them
786 mempool_t btree_bounce_pool;
788 struct journal journal;
790 u64 last_bucket_seq_cleanup;
792 /* The rest of this all shows up in sysfs */
793 atomic_long_t read_realloc_races;
794 atomic_long_t extent_migrate_done;
795 atomic_long_t extent_migrate_raced;
797 unsigned btree_gc_periodic:1;
798 unsigned copy_gc_enabled:1;
799 bool promote_whole_extents;
801 #define BCH_DEBUG_PARAM(name, description) bool name;
802 BCH_DEBUG_PARAMS_ALL()
803 #undef BCH_DEBUG_PARAM
805 struct time_stats times[BCH_TIME_STAT_NR];
808 static inline void bch2_set_ra_pages(struct bch_fs *c, unsigned ra_pages)
810 #ifndef NO_BCACHEFS_FS
812 c->vfs_sb->s_bdi->ra_pages = ra_pages;
816 static inline unsigned bucket_bytes(const struct bch_dev *ca)
818 return ca->mi.bucket_size << 9;
821 static inline unsigned block_bytes(const struct bch_fs *c)
823 return c->opts.block_size << 9;
826 static inline struct timespec64 bch2_time_to_timespec(struct bch_fs *c, u64 time)
828 return ns_to_timespec64(time * c->sb.time_precision + c->sb.time_base_lo);
831 static inline s64 timespec_to_bch2_time(struct bch_fs *c, struct timespec64 ts)
833 s64 ns = timespec64_to_ns(&ts) - c->sb.time_base_lo;
835 if (c->sb.time_precision == 1)
838 return div_s64(ns, c->sb.time_precision);
841 static inline s64 bch2_current_time(struct bch_fs *c)
843 struct timespec64 now;
845 ktime_get_coarse_real_ts64(&now);
846 return timespec_to_bch2_time(c, now);
849 static inline bool bch2_dev_exists2(const struct bch_fs *c, unsigned dev)
851 return dev < c->sb.nr_devices && c->devs[dev];
854 #endif /* _BCACHEFS_H */