1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_UTIL_H
3 #define _BCACHEFS_UTIL_H
6 #include <linux/blkdev.h>
7 #include <linux/closure.h>
8 #include <linux/errno.h>
9 #include <linux/freezer.h>
10 #include <linux/kernel.h>
11 #include <linux/sched/clock.h>
12 #include <linux/llist.h>
13 #include <linux/log2.h>
14 #include <linux/percpu.h>
15 #include <linux/preempt.h>
16 #include <linux/ratelimit.h>
17 #include <linux/slab.h>
18 #include <linux/vmalloc.h>
19 #include <linux/workqueue.h>
21 #include "mean_and_variance.h"
27 #ifdef CONFIG_BCACHEFS_DEBUG
28 #define EBUG_ON(cond) BUG_ON(cond)
33 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
34 #define CPU_BIG_ENDIAN 0
35 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
36 #define CPU_BIG_ENDIAN 1
41 #define type_is_exact(_val, _type) \
42 __builtin_types_compatible_p(typeof(_val), _type)
44 #define type_is(_val, _type) \
45 (__builtin_types_compatible_p(typeof(_val), _type) || \
46 __builtin_types_compatible_p(typeof(_val), const _type))
48 /* Userspace doesn't align allocations as nicely as the kernel allocators: */
49 static inline size_t buf_pages(void *p, size_t len)
51 return DIV_ROUND_UP(len +
52 ((unsigned long) p & (PAGE_SIZE - 1)),
56 static inline void vpfree(void *p, size_t size)
58 if (is_vmalloc_addr(p))
61 free_pages((unsigned long) p, get_order(size));
64 static inline void *vpmalloc(size_t size, gfp_t gfp_mask)
66 return (void *) __get_free_pages(gfp_mask|__GFP_NOWARN,
68 __vmalloc(size, gfp_mask);
71 static inline void kvpfree(void *p, size_t size)
79 static inline void *kvpmalloc(size_t size, gfp_t gfp_mask)
81 return size < PAGE_SIZE
82 ? kmalloc(size, gfp_mask)
83 : vpmalloc(size, gfp_mask);
86 int mempool_init_kvpmalloc_pool(mempool_t *, int, size_t);
94 #define DECLARE_HEAP(type, name) HEAP(type) name
96 #define init_heap(heap, _size, gfp) \
99 (heap)->size = (_size); \
100 (heap)->data = kvpmalloc((heap)->size * sizeof((heap)->data[0]),\
104 #define free_heap(heap) \
106 kvpfree((heap)->data, (heap)->size * sizeof((heap)->data[0])); \
107 (heap)->data = NULL; \
110 #define heap_set_backpointer(h, i, _fn) \
112 void (*fn)(typeof(h), size_t) = _fn; \
117 #define heap_swap(h, i, j, set_backpointer) \
119 swap((h)->data[i], (h)->data[j]); \
120 heap_set_backpointer(h, i, set_backpointer); \
121 heap_set_backpointer(h, j, set_backpointer); \
124 #define heap_peek(h) \
126 EBUG_ON(!(h)->used); \
130 #define heap_full(h) ((h)->used == (h)->size)
132 #define heap_sift_down(h, i, cmp, set_backpointer) \
136 for (; _j * 2 + 1 < (h)->used; _j = _c) { \
138 if (_c + 1 < (h)->used && \
139 cmp(h, (h)->data[_c], (h)->data[_c + 1]) >= 0) \
142 if (cmp(h, (h)->data[_c], (h)->data[_j]) >= 0) \
144 heap_swap(h, _c, _j, set_backpointer); \
148 #define heap_sift_up(h, i, cmp, set_backpointer) \
151 size_t p = (i - 1) / 2; \
152 if (cmp(h, (h)->data[i], (h)->data[p]) >= 0) \
154 heap_swap(h, i, p, set_backpointer); \
159 #define __heap_add(h, d, cmp, set_backpointer) \
161 size_t _i = (h)->used++; \
163 heap_set_backpointer(h, _i, set_backpointer); \
165 heap_sift_up(h, _i, cmp, set_backpointer); \
169 #define heap_add(h, d, cmp, set_backpointer) \
171 bool _r = !heap_full(h); \
173 __heap_add(h, d, cmp, set_backpointer); \
177 #define heap_add_or_replace(h, new, cmp, set_backpointer) \
179 if (!heap_add(h, new, cmp, set_backpointer) && \
180 cmp(h, new, heap_peek(h)) >= 0) { \
181 (h)->data[0] = new; \
182 heap_set_backpointer(h, 0, set_backpointer); \
183 heap_sift_down(h, 0, cmp, set_backpointer); \
187 #define heap_del(h, i, cmp, set_backpointer) \
191 BUG_ON(_i >= (h)->used); \
193 if ((_i) < (h)->used) { \
194 heap_swap(h, _i, (h)->used, set_backpointer); \
195 heap_sift_up(h, _i, cmp, set_backpointer); \
196 heap_sift_down(h, _i, cmp, set_backpointer); \
200 #define heap_pop(h, d, cmp, set_backpointer) \
202 bool _r = (h)->used; \
204 (d) = (h)->data[0]; \
205 heap_del(h, 0, cmp, set_backpointer); \
210 #define heap_resort(heap, cmp, set_backpointer) \
213 for (_i = (ssize_t) (heap)->used / 2 - 1; _i >= 0; --_i) \
214 heap_sift_down(heap, _i, cmp, set_backpointer); \
217 #define ANYSINT_MAX(t) \
218 ((((t) 1 << (sizeof(t) * 8 - 2)) - (t) 1) * (t) 2 + (t) 1)
220 #include "printbuf.h"
222 #define prt_vprintf(_out, ...) bch2_prt_vprintf(_out, __VA_ARGS__)
223 #define prt_printf(_out, ...) bch2_prt_printf(_out, __VA_ARGS__)
224 #define printbuf_str(_buf) bch2_printbuf_str(_buf)
225 #define printbuf_exit(_buf) bch2_printbuf_exit(_buf)
227 #define printbuf_tabstops_reset(_buf) bch2_printbuf_tabstops_reset(_buf)
228 #define printbuf_tabstop_pop(_buf) bch2_printbuf_tabstop_pop(_buf)
229 #define printbuf_tabstop_push(_buf, _n) bch2_printbuf_tabstop_push(_buf, _n)
231 #define printbuf_indent_add(_out, _n) bch2_printbuf_indent_add(_out, _n)
232 #define printbuf_indent_sub(_out, _n) bch2_printbuf_indent_sub(_out, _n)
234 #define prt_newline(_out) bch2_prt_newline(_out)
235 #define prt_tab(_out) bch2_prt_tab(_out)
236 #define prt_tab_rjust(_out) bch2_prt_tab_rjust(_out)
238 #define prt_bytes_indented(...) bch2_prt_bytes_indented(__VA_ARGS__)
239 #define prt_u64(_out, _v) prt_printf(_out, "%llu", (u64) (_v))
240 #define prt_human_readable_u64(...) bch2_prt_human_readable_u64(__VA_ARGS__)
241 #define prt_human_readable_s64(...) bch2_prt_human_readable_s64(__VA_ARGS__)
242 #define prt_units_u64(...) bch2_prt_units_u64(__VA_ARGS__)
243 #define prt_units_s64(...) bch2_prt_units_s64(__VA_ARGS__)
244 #define prt_string_option(...) bch2_prt_string_option(__VA_ARGS__)
245 #define prt_bitflags(...) bch2_prt_bitflags(__VA_ARGS__)
247 void bch2_pr_time_units(struct printbuf *, u64);
248 void bch2_prt_datetime(struct printbuf *, time64_t);
251 static inline void uuid_unparse_lower(u8 *uuid, char *out)
253 sprintf(out, "%pUb", uuid);
256 #include <uuid/uuid.h>
259 static inline void pr_uuid(struct printbuf *out, u8 *uuid)
263 uuid_unparse_lower(uuid, uuid_str);
264 prt_printf(out, "%s", uuid_str);
267 int bch2_strtoint_h(const char *, int *);
268 int bch2_strtouint_h(const char *, unsigned int *);
269 int bch2_strtoll_h(const char *, long long *);
270 int bch2_strtoull_h(const char *, unsigned long long *);
271 int bch2_strtou64_h(const char *, u64 *);
273 static inline int bch2_strtol_h(const char *cp, long *res)
275 #if BITS_PER_LONG == 32
276 return bch2_strtoint_h(cp, (int *) res);
278 return bch2_strtoll_h(cp, (long long *) res);
282 static inline int bch2_strtoul_h(const char *cp, long *res)
284 #if BITS_PER_LONG == 32
285 return bch2_strtouint_h(cp, (unsigned int *) res);
287 return bch2_strtoull_h(cp, (unsigned long long *) res);
291 #define strtoi_h(cp, res) \
292 ( type_is(*res, int) ? bch2_strtoint_h(cp, (void *) res)\
293 : type_is(*res, long) ? bch2_strtol_h(cp, (void *) res)\
294 : type_is(*res, long long) ? bch2_strtoll_h(cp, (void *) res)\
295 : type_is(*res, unsigned) ? bch2_strtouint_h(cp, (void *) res)\
296 : type_is(*res, unsigned long) ? bch2_strtoul_h(cp, (void *) res)\
297 : type_is(*res, unsigned long long) ? bch2_strtoull_h(cp, (void *) res)\
300 #define strtoul_safe(cp, var) \
303 int _r = kstrtoul(cp, 10, &_v); \
309 #define strtoul_safe_clamp(cp, var, min, max) \
312 int _r = kstrtoul(cp, 10, &_v); \
314 var = clamp_t(typeof(var), _v, min, max); \
318 #define strtoul_safe_restrict(cp, var, min, max) \
321 int _r = kstrtoul(cp, 10, &_v); \
322 if (!_r && _v >= min && _v <= max) \
329 #define snprint(out, var) \
331 type_is(var, int) ? "%i\n" \
332 : type_is(var, unsigned) ? "%u\n" \
333 : type_is(var, long) ? "%li\n" \
334 : type_is(var, unsigned long) ? "%lu\n" \
335 : type_is(var, s64) ? "%lli\n" \
336 : type_is(var, u64) ? "%llu\n" \
337 : type_is(var, char *) ? "%s\n" \
340 bool bch2_is_zero(const void *, size_t);
342 u64 bch2_read_flag_list(char *, const char * const[]);
344 void bch2_prt_u64_binary(struct printbuf *, u64, unsigned);
346 void bch2_print_string_as_lines(const char *prefix, const char *lines);
348 typedef DARRAY(unsigned long) bch_stacktrace;
349 int bch2_save_backtrace(bch_stacktrace *stack, struct task_struct *);
350 void bch2_prt_backtrace(struct printbuf *, bch_stacktrace *);
351 int bch2_prt_task_backtrace(struct printbuf *, struct task_struct *);
353 #define NR_QUANTILES 15
354 #define QUANTILE_IDX(i) inorder_to_eytzinger0(i, NR_QUANTILES)
355 #define QUANTILE_FIRST eytzinger0_first(NR_QUANTILES)
356 #define QUANTILE_LAST eytzinger0_last(NR_QUANTILES)
358 struct bch2_quantiles {
359 struct bch2_quantile_entry {
362 } entries[NR_QUANTILES];
365 struct bch2_time_stat_buffer {
367 struct bch2_time_stat_buffer_entry {
373 struct bch2_time_stats {
375 /* all fields are in nanoseconds */
382 struct bch2_quantiles quantiles;
384 struct mean_and_variance duration_stats;
385 struct mean_and_variance_weighted duration_stats_weighted;
386 struct mean_and_variance freq_stats;
387 struct mean_and_variance_weighted freq_stats_weighted;
388 struct bch2_time_stat_buffer __percpu *buffer;
391 #ifndef CONFIG_BCACHEFS_NO_LATENCY_ACCT
392 void __bch2_time_stats_update(struct bch2_time_stats *stats, u64, u64);
394 static inline void bch2_time_stats_update(struct bch2_time_stats *stats, u64 start)
396 __bch2_time_stats_update(stats, start, local_clock());
399 static inline bool track_event_change(struct bch2_time_stats *stats,
404 bch2_time_stats_update(stats, *start);
407 *start = local_clock() ?: 1;
415 static inline void __bch2_time_stats_update(struct bch2_time_stats *stats, u64 start, u64 end) {}
416 static inline void bch2_time_stats_update(struct bch2_time_stats *stats, u64 start) {}
417 static inline bool track_event_change(struct bch2_time_stats *stats,
420 bool ret = v && !*start;
426 void bch2_time_stats_to_text(struct printbuf *, struct bch2_time_stats *);
428 void bch2_time_stats_exit(struct bch2_time_stats *);
429 void bch2_time_stats_init(struct bch2_time_stats *);
431 #define ewma_add(ewma, val, weight) \
433 typeof(ewma) _ewma = (ewma); \
434 typeof(weight) _weight = (weight); \
436 (((_ewma << _weight) - _ewma) + (val)) >> _weight; \
439 struct bch_ratelimit {
440 /* Next time we want to do some work, in nanoseconds */
444 * Rate at which we want to do work, in units per nanosecond
445 * The units here correspond to the units passed to
446 * bch2_ratelimit_increment()
451 static inline void bch2_ratelimit_reset(struct bch_ratelimit *d)
453 d->next = local_clock();
456 u64 bch2_ratelimit_delay(struct bch_ratelimit *);
457 void bch2_ratelimit_increment(struct bch_ratelimit *, u64);
459 struct bch_pd_controller {
460 struct bch_ratelimit rate;
461 unsigned long last_update;
464 s64 smoothed_derivative;
466 unsigned p_term_inverse;
470 /* for exporting to sysfs (no effect on behavior) */
472 s64 last_proportional;
477 * If true, the rate will not increase if bch2_ratelimit_delay()
478 * is not being called often enough.
483 void bch2_pd_controller_update(struct bch_pd_controller *, s64, s64, int);
484 void bch2_pd_controller_init(struct bch_pd_controller *);
485 void bch2_pd_controller_debug_to_text(struct printbuf *, struct bch_pd_controller *);
487 #define sysfs_pd_controller_attribute(name) \
488 rw_attribute(name##_rate); \
489 rw_attribute(name##_rate_bytes); \
490 rw_attribute(name##_rate_d_term); \
491 rw_attribute(name##_rate_p_term_inverse); \
492 read_attribute(name##_rate_debug)
494 #define sysfs_pd_controller_files(name) \
495 &sysfs_##name##_rate, \
496 &sysfs_##name##_rate_bytes, \
497 &sysfs_##name##_rate_d_term, \
498 &sysfs_##name##_rate_p_term_inverse, \
499 &sysfs_##name##_rate_debug
501 #define sysfs_pd_controller_show(name, var) \
503 sysfs_hprint(name##_rate, (var)->rate.rate); \
504 sysfs_print(name##_rate_bytes, (var)->rate.rate); \
505 sysfs_print(name##_rate_d_term, (var)->d_term); \
506 sysfs_print(name##_rate_p_term_inverse, (var)->p_term_inverse); \
508 if (attr == &sysfs_##name##_rate_debug) \
509 bch2_pd_controller_debug_to_text(out, var); \
512 #define sysfs_pd_controller_store(name, var) \
514 sysfs_strtoul_clamp(name##_rate, \
515 (var)->rate.rate, 1, UINT_MAX); \
516 sysfs_strtoul_clamp(name##_rate_bytes, \
517 (var)->rate.rate, 1, UINT_MAX); \
518 sysfs_strtoul(name##_rate_d_term, (var)->d_term); \
519 sysfs_strtoul_clamp(name##_rate_p_term_inverse, \
520 (var)->p_term_inverse, 1, INT_MAX); \
523 #define container_of_or_null(ptr, type, member) \
525 typeof(ptr) _ptr = ptr; \
526 _ptr ? container_of(_ptr, type, member) : NULL; \
529 /* Does linear interpolation between powers of two */
530 static inline unsigned fract_exp_two(unsigned x, unsigned fract_bits)
532 unsigned fract = x & ~(~0 << fract_bits);
536 x += (x * fract) >> fract_bits;
541 void bch2_bio_map(struct bio *bio, void *base, size_t);
542 int bch2_bio_alloc_pages(struct bio *, size_t, gfp_t);
544 static inline sector_t bdev_sectors(struct block_device *bdev)
546 return bdev->bd_inode->i_size >> 9;
549 #define closure_bio_submit(bio, cl) \
555 #define kthread_wait(cond) \
560 set_current_state(TASK_INTERRUPTIBLE); \
561 if (kthread_should_stop()) { \
571 set_current_state(TASK_RUNNING); \
575 #define kthread_wait_freezable(cond) \
579 set_current_state(TASK_INTERRUPTIBLE); \
580 if (kthread_should_stop()) { \
591 set_current_state(TASK_RUNNING); \
595 size_t bch2_rand_range(size_t);
597 void memcpy_to_bio(struct bio *, struct bvec_iter, const void *);
598 void memcpy_from_bio(void *, struct bio *, struct bvec_iter);
600 static inline void memcpy_u64s_small(void *dst, const void *src,
610 static inline void __memcpy_u64s(void *dst, const void *src,
616 asm volatile("rep ; movsq"
617 : "=&c" (d0), "=&D" (d1), "=&S" (d2)
618 : "0" (u64s), "1" (dst), "2" (src)
629 static inline void memcpy_u64s(void *dst, const void *src,
632 EBUG_ON(!(dst >= src + u64s * sizeof(u64) ||
633 dst + u64s * sizeof(u64) <= src));
635 __memcpy_u64s(dst, src, u64s);
638 static inline void __memmove_u64s_down(void *dst, const void *src,
641 __memcpy_u64s(dst, src, u64s);
644 static inline void memmove_u64s_down(void *dst, const void *src,
649 __memmove_u64s_down(dst, src, u64s);
652 static inline void __memmove_u64s_down_small(void *dst, const void *src,
655 memcpy_u64s_small(dst, src, u64s);
658 static inline void memmove_u64s_down_small(void *dst, const void *src,
663 __memmove_u64s_down_small(dst, src, u64s);
666 static inline void __memmove_u64s_up_small(void *_dst, const void *_src,
669 u64 *dst = (u64 *) _dst + u64s;
670 u64 *src = (u64 *) _src + u64s;
676 static inline void memmove_u64s_up_small(void *dst, const void *src,
681 __memmove_u64s_up_small(dst, src, u64s);
684 static inline void __memmove_u64s_up(void *_dst, const void *_src,
687 u64 *dst = (u64 *) _dst + u64s - 1;
688 u64 *src = (u64 *) _src + u64s - 1;
693 asm volatile("std ;\n"
696 : "=&c" (d0), "=&D" (d1), "=&S" (d2)
697 : "0" (u64s), "1" (dst), "2" (src)
705 static inline void memmove_u64s_up(void *dst, const void *src,
710 __memmove_u64s_up(dst, src, u64s);
713 static inline void memmove_u64s(void *dst, const void *src,
717 __memmove_u64s_down(dst, src, u64s);
719 __memmove_u64s_up(dst, src, u64s);
722 /* Set the last few bytes up to a u64 boundary given an offset into a buffer. */
723 static inline void memset_u64s_tail(void *s, int c, unsigned bytes)
725 unsigned rem = round_up(bytes, sizeof(u64)) - bytes;
727 memset(s + bytes, c, rem);
730 void sort_cmp_size(void *base, size_t num, size_t size,
731 int (*cmp_func)(const void *, const void *, size_t),
732 void (*swap_func)(void *, void *, size_t));
734 /* just the memmove, doesn't update @_nr */
735 #define __array_insert_item(_array, _nr, _pos) \
736 memmove(&(_array)[(_pos) + 1], \
738 sizeof((_array)[0]) * ((_nr) - (_pos)))
740 #define array_insert_item(_array, _nr, _pos, _new_item) \
742 __array_insert_item(_array, _nr, _pos); \
744 (_array)[(_pos)] = (_new_item); \
747 #define array_remove_items(_array, _nr, _pos, _nr_to_remove) \
749 (_nr) -= (_nr_to_remove); \
750 memmove(&(_array)[(_pos)], \
751 &(_array)[(_pos) + (_nr_to_remove)], \
752 sizeof((_array)[0]) * ((_nr) - (_pos))); \
755 #define array_remove_item(_array, _nr, _pos) \
756 array_remove_items(_array, _nr, _pos, 1)
758 static inline void __move_gap(void *array, size_t element_size,
759 size_t nr, size_t size,
760 size_t old_gap, size_t new_gap)
762 size_t gap_end = old_gap + size - nr;
764 if (new_gap < old_gap) {
765 size_t move = old_gap - new_gap;
767 memmove(array + element_size * (gap_end - move),
768 array + element_size * (old_gap - move),
769 element_size * move);
770 } else if (new_gap > old_gap) {
771 size_t move = new_gap - old_gap;
773 memmove(array + element_size * old_gap,
774 array + element_size * gap_end,
775 element_size * move);
779 /* Move the gap in a gap buffer: */
780 #define move_gap(_array, _nr, _size, _old_gap, _new_gap) \
781 __move_gap(_array, sizeof(_array[0]), _nr, _size, _old_gap, _new_gap)
783 #define bubble_sort(_base, _nr, _cmp) \
786 bool _swapped = true; \
788 for (_last= (ssize_t) (_nr) - 1; _last > 0 && _swapped; --_last) {\
790 for (_i = 0; _i < _last; _i++) \
791 if (_cmp((_base)[_i], (_base)[_i + 1]) > 0) { \
792 swap((_base)[_i], (_base)[_i + 1]); \
798 static inline u64 percpu_u64_get(u64 __percpu *src)
803 for_each_possible_cpu(cpu)
804 ret += *per_cpu_ptr(src, cpu);
808 static inline void percpu_u64_set(u64 __percpu *dst, u64 src)
812 for_each_possible_cpu(cpu)
813 *per_cpu_ptr(dst, cpu) = 0;
814 this_cpu_write(*dst, src);
817 static inline void acc_u64s(u64 *acc, const u64 *src, unsigned nr)
821 for (i = 0; i < nr; i++)
825 static inline void acc_u64s_percpu(u64 *acc, const u64 __percpu *src,
830 for_each_possible_cpu(cpu)
831 acc_u64s(acc, per_cpu_ptr(src, cpu), nr);
834 static inline void percpu_memset(void __percpu *p, int c, size_t bytes)
838 for_each_possible_cpu(cpu)
839 memset(per_cpu_ptr(p, cpu), c, bytes);
842 u64 *bch2_acc_percpu_u64s(u64 __percpu *, unsigned);
844 #define cmp_int(l, r) ((l > r) - (l < r))
846 static inline int u8_cmp(u8 l, u8 r)
848 return cmp_int(l, r);
851 static inline int cmp_le32(__le32 l, __le32 r)
853 return cmp_int(le32_to_cpu(l), le32_to_cpu(r));
856 #include <linux/uuid.h>
858 #endif /* _BCACHEFS_UTIL_H */