1 // SPDX-License-Identifier: GPL-2.0
3 * random utiility code, for bcache but in theory not specific to bcache
5 * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
6 * Copyright 2012 Google, Inc.
10 #include <linux/blkdev.h>
11 #include <linux/console.h>
12 #include <linux/ctype.h>
13 #include <linux/debugfs.h>
14 #include <linux/freezer.h>
15 #include <linux/kthread.h>
16 #include <linux/log2.h>
17 #include <linux/math64.h>
18 #include <linux/percpu.h>
19 #include <linux/preempt.h>
20 #include <linux/random.h>
21 #include <linux/seq_file.h>
22 #include <linux/string.h>
23 #include <linux/types.h>
24 #include <linux/sched/clock.h>
26 #include "eytzinger.h"
27 #include "mean_and_variance.h"
30 static const char si_units[] = "?kMGTPEZY";
32 /* string_get_size units: */
33 static const char *const units_2[] = {
34 "B", "KiB", "MiB", "GiB", "TiB", "PiB", "EiB", "ZiB", "YiB"
36 static const char *const units_10[] = {
37 "B", "kB", "MB", "GB", "TB", "PB", "EB", "ZB", "YB"
40 static int parse_u64(const char *cp, u64 *res)
42 const char *start = cp;
52 if (v > U64_MAX - (*cp - '0'))
56 } while (isdigit(*cp));
62 static int bch2_pow(u64 n, u64 p, u64 *res)
67 if (*res > div_u64(U64_MAX, n))
74 static int parse_unit_suffix(const char *cp, u64 *res)
76 const char *start = cp;
84 for (u = 1; u < strlen(si_units); u++)
85 if (*cp == si_units[u]) {
90 for (u = 0; u < ARRAY_SIZE(units_2); u++)
91 if (!strncmp(cp, units_2[u], strlen(units_2[u]))) {
92 cp += strlen(units_2[u]);
96 for (u = 0; u < ARRAY_SIZE(units_10); u++)
97 if (!strncmp(cp, units_10[u], strlen(units_10[u]))) {
98 cp += strlen(units_10[u]);
106 ret = bch2_pow(base, u, res);
113 #define parse_or_ret(cp, _f) \
121 static int __bch2_strtou64_h(const char *cp, u64 *res)
123 const char *start = cp;
124 u64 v = 0, b, f_n = 0, f_d = 1;
127 parse_or_ret(cp, parse_u64(cp, &v));
131 ret = parse_u64(cp, &f_n);
136 ret = bch2_pow(10, ret, &f_d);
141 parse_or_ret(cp, parse_unit_suffix(cp, &b));
143 if (v > div_u64(U64_MAX, b))
147 if (f_n > div_u64(U64_MAX, b))
150 f_n = div_u64(f_n * b, f_d);
159 static int __bch2_strtoh(const char *cp, u64 *res,
160 u64 t_max, bool t_signed)
162 bool positive = *cp != '-';
165 if (*cp == '+' || *cp == '-')
168 parse_or_ret(cp, __bch2_strtou64_h(cp, &v));
191 #define STRTO_H(name, type) \
192 int bch2_ ## name ## _h(const char *cp, type *res) \
195 int ret = __bch2_strtoh(cp, &v, ANYSINT_MAX(type), \
196 ANYSINT_MAX(type) != ((type) ~0ULL)); \
201 STRTO_H(strtoint, int)
202 STRTO_H(strtouint, unsigned int)
203 STRTO_H(strtoll, long long)
204 STRTO_H(strtoull, unsigned long long)
205 STRTO_H(strtou64, u64)
207 u64 bch2_read_flag_list(char *opt, const char * const list[])
210 char *p, *s, *d = kstrdup(opt, GFP_KERNEL);
217 while ((p = strsep(&s, ","))) {
218 int flag = match_string(list, -1, p);
233 bool bch2_is_zero(const void *_p, size_t n)
238 for (i = 0; i < n; i++)
244 void bch2_prt_u64_binary(struct printbuf *out, u64 v, unsigned nr_bits)
247 prt_char(out, '0' + ((v >> --nr_bits) & 1));
250 void bch2_print_string_as_lines(const char *prefix, const char *lines)
255 printk("%s (null)\n", prefix);
261 p = strchrnul(lines, '\n');
262 printk("%s%.*s\n", prefix, (int) (p - lines), lines);
270 int bch2_save_backtrace(bch_stacktrace *stack, struct task_struct *task)
272 #ifdef CONFIG_STACKTRACE
273 unsigned nr_entries = 0;
277 ret = darray_make_room(stack, 32);
281 if (!down_read_trylock(&task->signal->exec_update_lock))
285 nr_entries = stack_trace_save_tsk(task, stack->data, stack->size, 0);
286 } while (nr_entries == stack->size &&
287 !(ret = darray_make_room(stack, stack->size * 2)));
289 stack->nr = nr_entries;
290 up_read(&task->signal->exec_update_lock);
298 void bch2_prt_backtrace(struct printbuf *out, bch_stacktrace *stack)
302 darray_for_each(*stack, i) {
303 prt_printf(out, "[<0>] %pB", (void *) *i);
308 int bch2_prt_task_backtrace(struct printbuf *out, struct task_struct *task)
310 bch_stacktrace stack = { 0 };
311 int ret = bch2_save_backtrace(&stack, task);
313 bch2_prt_backtrace(out, &stack);
320 void bch2_prt_datetime(struct printbuf *out, time64_t sec)
329 void bch2_prt_datetime(struct printbuf *out, time64_t sec)
332 snprintf(buf, sizeof(buf), "%ptT", &sec);
337 static const struct time_unit {
342 { "us", NSEC_PER_USEC },
343 { "ms", NSEC_PER_MSEC },
344 { "s", NSEC_PER_SEC },
345 { "m", (u64) NSEC_PER_SEC * 60},
346 { "h", (u64) NSEC_PER_SEC * 3600},
350 static const struct time_unit *pick_time_units(u64 ns)
352 const struct time_unit *u;
355 u + 1 < time_units + ARRAY_SIZE(time_units) &&
356 ns >= u[1].nsecs << 1;
363 void bch2_pr_time_units(struct printbuf *out, u64 ns)
365 const struct time_unit *u = pick_time_units(ns);
367 prt_printf(out, "%llu %s", div_u64(ns, u->nsecs), u->name);
372 #ifndef CONFIG_BCACHEFS_NO_LATENCY_ACCT
373 static void bch2_quantiles_update(struct bch2_quantiles *q, u64 v)
377 while (i < ARRAY_SIZE(q->entries)) {
378 struct bch2_quantile_entry *e = q->entries + i;
380 if (unlikely(!e->step)) {
382 e->step = max_t(unsigned, v / 2, 1024);
383 } else if (e->m > v) {
384 e->m = e->m >= e->step
387 } else if (e->m < v) {
388 e->m = e->m + e->step > e->m
393 if ((e->m > v ? e->m - v : v - e->m) < e->step)
394 e->step = max_t(unsigned, e->step / 2, 1);
399 i = eytzinger0_child(i, v > e->m);
403 static inline void bch2_time_stats_update_one(struct bch2_time_stats *stats,
408 if (time_after64(end, start)) {
409 duration = end - start;
410 mean_and_variance_update(&stats->duration_stats, duration);
411 mean_and_variance_weighted_update(&stats->duration_stats_weighted, duration);
412 stats->max_duration = max(stats->max_duration, duration);
413 stats->min_duration = min(stats->min_duration, duration);
414 stats->total_duration += duration;
415 bch2_quantiles_update(&stats->quantiles, duration);
418 if (time_after64(end, stats->last_event)) {
419 freq = end - stats->last_event;
420 mean_and_variance_update(&stats->freq_stats, freq);
421 mean_and_variance_weighted_update(&stats->freq_stats_weighted, freq);
422 stats->max_freq = max(stats->max_freq, freq);
423 stats->min_freq = min(stats->min_freq, freq);
424 stats->last_event = end;
428 static void __bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
429 struct bch2_time_stat_buffer *b)
431 for (struct bch2_time_stat_buffer_entry *i = b->entries;
432 i < b->entries + ARRAY_SIZE(b->entries);
434 bch2_time_stats_update_one(stats, i->start, i->end);
438 static noinline void bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
439 struct bch2_time_stat_buffer *b)
443 spin_lock_irqsave(&stats->lock, flags);
444 __bch2_time_stats_clear_buffer(stats, b);
445 spin_unlock_irqrestore(&stats->lock, flags);
448 void __bch2_time_stats_update(struct bch2_time_stats *stats, u64 start, u64 end)
452 WARN_RATELIMIT(!stats->min_duration || !stats->min_freq,
453 "time_stats: min_duration = %llu, min_freq = %llu",
454 stats->min_duration, stats->min_freq);
456 if (!stats->buffer) {
457 spin_lock_irqsave(&stats->lock, flags);
458 bch2_time_stats_update_one(stats, start, end);
460 if (mean_and_variance_weighted_get_mean(stats->freq_stats_weighted) < 32 &&
461 stats->duration_stats.n > 1024)
463 alloc_percpu_gfp(struct bch2_time_stat_buffer,
465 spin_unlock_irqrestore(&stats->lock, flags);
467 struct bch2_time_stat_buffer *b;
470 b = this_cpu_ptr(stats->buffer);
472 BUG_ON(b->nr >= ARRAY_SIZE(b->entries));
473 b->entries[b->nr++] = (struct bch2_time_stat_buffer_entry) {
478 if (unlikely(b->nr == ARRAY_SIZE(b->entries)))
479 bch2_time_stats_clear_buffer(stats, b);
484 static void bch2_pr_time_units_aligned(struct printbuf *out, u64 ns)
486 const struct time_unit *u = pick_time_units(ns);
488 prt_printf(out, "%llu ", div64_u64(ns, u->nsecs));
490 prt_printf(out, "%s", u->name);
493 static inline void pr_name_and_units(struct printbuf *out, const char *name, u64 ns)
497 bch2_pr_time_units_aligned(out, ns);
501 #define TABSTOP_SIZE 12
503 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats)
505 const struct time_unit *u;
506 s64 f_mean = 0, d_mean = 0;
507 u64 q, last_q = 0, f_stddev = 0, d_stddev = 0;
513 spin_lock_irq(&stats->lock);
514 for_each_possible_cpu(cpu)
515 __bch2_time_stats_clear_buffer(stats, per_cpu_ptr(stats->buffer, cpu));
516 spin_unlock_irq(&stats->lock);
520 * avoid divide by zero
522 if (stats->freq_stats.n) {
523 f_mean = mean_and_variance_get_mean(stats->freq_stats);
524 f_stddev = mean_and_variance_get_stddev(stats->freq_stats);
525 d_mean = mean_and_variance_get_mean(stats->duration_stats);
526 d_stddev = mean_and_variance_get_stddev(stats->duration_stats);
529 printbuf_tabstop_push(out, out->indent + TABSTOP_SIZE);
530 prt_printf(out, "count:");
532 prt_printf(out, "%llu ",
533 stats->duration_stats.n);
534 printbuf_tabstop_pop(out);
537 printbuf_tabstops_reset(out);
539 printbuf_tabstop_push(out, out->indent + 20);
540 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
541 printbuf_tabstop_push(out, 0);
542 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
545 prt_printf(out, "since mount");
548 prt_printf(out, "recent");
552 printbuf_tabstops_reset(out);
553 printbuf_tabstop_push(out, out->indent + 20);
554 printbuf_tabstop_push(out, TABSTOP_SIZE);
555 printbuf_tabstop_push(out, 2);
556 printbuf_tabstop_push(out, TABSTOP_SIZE);
558 prt_printf(out, "duration of events");
560 printbuf_indent_add(out, 2);
562 pr_name_and_units(out, "min:", stats->min_duration);
563 pr_name_and_units(out, "max:", stats->max_duration);
564 pr_name_and_units(out, "total:", stats->total_duration);
566 prt_printf(out, "mean:");
568 bch2_pr_time_units_aligned(out, d_mean);
570 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->duration_stats_weighted));
573 prt_printf(out, "stddev:");
575 bch2_pr_time_units_aligned(out, d_stddev);
577 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->duration_stats_weighted));
579 printbuf_indent_sub(out, 2);
582 prt_printf(out, "time between events");
584 printbuf_indent_add(out, 2);
586 pr_name_and_units(out, "min:", stats->min_freq);
587 pr_name_and_units(out, "max:", stats->max_freq);
589 prt_printf(out, "mean:");
591 bch2_pr_time_units_aligned(out, f_mean);
593 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->freq_stats_weighted));
596 prt_printf(out, "stddev:");
598 bch2_pr_time_units_aligned(out, f_stddev);
600 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->freq_stats_weighted));
602 printbuf_indent_sub(out, 2);
605 printbuf_tabstops_reset(out);
607 i = eytzinger0_first(NR_QUANTILES);
608 u = pick_time_units(stats->quantiles.entries[i].m);
610 prt_printf(out, "quantiles (%s):\t", u->name);
611 eytzinger0_for_each(i, NR_QUANTILES) {
612 bool is_last = eytzinger0_next(i, NR_QUANTILES) == -1;
614 q = max(stats->quantiles.entries[i].m, last_q);
615 prt_printf(out, "%llu ",
616 div_u64(q, u->nsecs));
623 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats) {}
626 void bch2_time_stats_exit(struct bch2_time_stats *stats)
628 free_percpu(stats->buffer);
631 void bch2_time_stats_init(struct bch2_time_stats *stats)
633 memset(stats, 0, sizeof(*stats));
634 stats->duration_stats_weighted.weight = 8;
635 stats->freq_stats_weighted.weight = 8;
636 stats->min_duration = U64_MAX;
637 stats->min_freq = U64_MAX;
638 spin_lock_init(&stats->lock);
644 * bch2_ratelimit_delay() - return how long to delay until the next time to do
646 * @d: the struct bch_ratelimit to update
647 * Returns: the amount of time to delay by, in jiffies
649 u64 bch2_ratelimit_delay(struct bch_ratelimit *d)
651 u64 now = local_clock();
653 return time_after64(d->next, now)
654 ? nsecs_to_jiffies(d->next - now)
659 * bch2_ratelimit_increment() - increment @d by the amount of work done
660 * @d: the struct bch_ratelimit to update
661 * @done: the amount of work done, in arbitrary units
663 void bch2_ratelimit_increment(struct bch_ratelimit *d, u64 done)
665 u64 now = local_clock();
667 d->next += div_u64(done * NSEC_PER_SEC, d->rate);
669 if (time_before64(now + NSEC_PER_SEC, d->next))
670 d->next = now + NSEC_PER_SEC;
672 if (time_after64(now - NSEC_PER_SEC * 2, d->next))
673 d->next = now - NSEC_PER_SEC * 2;
679 * Updates pd_controller. Attempts to scale inputed values to units per second.
680 * @target: desired value
681 * @actual: current value
683 * @sign: 1 or -1; 1 if increasing the rate makes actual go up, -1 if increasing
684 * it makes actual go down.
686 void bch2_pd_controller_update(struct bch_pd_controller *pd,
687 s64 target, s64 actual, int sign)
689 s64 proportional, derivative, change;
691 unsigned long seconds_since_update = (jiffies - pd->last_update) / HZ;
693 if (seconds_since_update == 0)
696 pd->last_update = jiffies;
698 proportional = actual - target;
699 proportional *= seconds_since_update;
700 proportional = div_s64(proportional, pd->p_term_inverse);
702 derivative = actual - pd->last_actual;
703 derivative = div_s64(derivative, seconds_since_update);
704 derivative = ewma_add(pd->smoothed_derivative, derivative,
705 (pd->d_term / seconds_since_update) ?: 1);
706 derivative = derivative * pd->d_term;
707 derivative = div_s64(derivative, pd->p_term_inverse);
709 change = proportional + derivative;
711 /* Don't increase rate if not keeping up */
714 time_after64(local_clock(),
715 pd->rate.next + NSEC_PER_MSEC))
718 change *= (sign * -1);
720 pd->rate.rate = clamp_t(s64, (s64) pd->rate.rate + change,
723 pd->last_actual = actual;
724 pd->last_derivative = derivative;
725 pd->last_proportional = proportional;
726 pd->last_change = change;
727 pd->last_target = target;
730 void bch2_pd_controller_init(struct bch_pd_controller *pd)
732 pd->rate.rate = 1024;
733 pd->last_update = jiffies;
734 pd->p_term_inverse = 6000;
736 pd->d_smooth = pd->d_term;
737 pd->backpressure = 1;
740 void bch2_pd_controller_debug_to_text(struct printbuf *out, struct bch_pd_controller *pd)
742 if (!out->nr_tabstops)
743 printbuf_tabstop_push(out, 20);
745 prt_printf(out, "rate:");
747 prt_human_readable_s64(out, pd->rate.rate);
750 prt_printf(out, "target:");
752 prt_human_readable_u64(out, pd->last_target);
755 prt_printf(out, "actual:");
757 prt_human_readable_u64(out, pd->last_actual);
760 prt_printf(out, "proportional:");
762 prt_human_readable_s64(out, pd->last_proportional);
765 prt_printf(out, "derivative:");
767 prt_human_readable_s64(out, pd->last_derivative);
770 prt_printf(out, "change:");
772 prt_human_readable_s64(out, pd->last_change);
775 prt_printf(out, "next io:");
777 prt_printf(out, "%llims", div64_s64(pd->rate.next - local_clock(), NSEC_PER_MSEC));
783 void bch2_bio_map(struct bio *bio, void *base, size_t size)
786 struct page *page = is_vmalloc_addr(base)
787 ? vmalloc_to_page(base)
788 : virt_to_page(base);
789 unsigned offset = offset_in_page(base);
790 unsigned len = min_t(size_t, PAGE_SIZE - offset, size);
792 BUG_ON(!bio_add_page(bio, page, len, offset));
798 int bch2_bio_alloc_pages(struct bio *bio, size_t size, gfp_t gfp_mask)
801 struct page *page = alloc_pages(gfp_mask, 0);
802 unsigned len = min_t(size_t, PAGE_SIZE, size);
807 if (unlikely(!bio_add_page(bio, page, len, 0))) {
818 size_t bch2_rand_range(size_t max)
826 rand = get_random_long();
827 rand &= roundup_pow_of_two(max) - 1;
828 } while (rand >= max);
833 void memcpy_to_bio(struct bio *dst, struct bvec_iter dst_iter, const void *src)
836 struct bvec_iter iter;
838 __bio_for_each_segment(bv, dst, iter, dst_iter) {
839 void *dstp = kmap_local_page(bv.bv_page);
841 memcpy(dstp + bv.bv_offset, src, bv.bv_len);
848 void memcpy_from_bio(void *dst, struct bio *src, struct bvec_iter src_iter)
851 struct bvec_iter iter;
853 __bio_for_each_segment(bv, src, iter, src_iter) {
854 void *srcp = kmap_local_page(bv.bv_page);
856 memcpy(dst, srcp + bv.bv_offset, bv.bv_len);
863 static int alignment_ok(const void *base, size_t align)
865 return IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) ||
866 ((unsigned long)base & (align - 1)) == 0;
869 static void u32_swap(void *a, void *b, size_t size)
872 *(u32 *)a = *(u32 *)b;
876 static void u64_swap(void *a, void *b, size_t size)
879 *(u64 *)a = *(u64 *)b;
883 static void generic_swap(void *a, void *b, size_t size)
889 *(char *)a++ = *(char *)b;
891 } while (--size > 0);
894 static inline int do_cmp(void *base, size_t n, size_t size,
895 int (*cmp_func)(const void *, const void *, size_t),
898 return cmp_func(base + inorder_to_eytzinger0(l, n) * size,
899 base + inorder_to_eytzinger0(r, n) * size,
903 static inline void do_swap(void *base, size_t n, size_t size,
904 void (*swap_func)(void *, void *, size_t),
907 swap_func(base + inorder_to_eytzinger0(l, n) * size,
908 base + inorder_to_eytzinger0(r, n) * size,
912 void eytzinger0_sort(void *base, size_t n, size_t size,
913 int (*cmp_func)(const void *, const void *, size_t),
914 void (*swap_func)(void *, void *, size_t))
919 if (size == 4 && alignment_ok(base, 4))
920 swap_func = u32_swap;
921 else if (size == 8 && alignment_ok(base, 8))
922 swap_func = u64_swap;
924 swap_func = generic_swap;
928 for (i = n / 2 - 1; i >= 0; --i) {
929 for (r = i; r * 2 + 1 < n; r = c) {
933 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
936 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
939 do_swap(base, n, size, swap_func, r, c);
944 for (i = n - 1; i > 0; --i) {
945 do_swap(base, n, size, swap_func, 0, i);
947 for (r = 0; r * 2 + 1 < i; r = c) {
951 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
954 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
957 do_swap(base, n, size, swap_func, r, c);
962 void sort_cmp_size(void *base, size_t num, size_t size,
963 int (*cmp_func)(const void *, const void *, size_t),
964 void (*swap_func)(void *, void *, size_t size))
966 /* pre-scale counters for performance */
967 int i = (num/2 - 1) * size, n = num * size, c, r;
970 if (size == 4 && alignment_ok(base, 4))
971 swap_func = u32_swap;
972 else if (size == 8 && alignment_ok(base, 8))
973 swap_func = u64_swap;
975 swap_func = generic_swap;
979 for ( ; i >= 0; i -= size) {
980 for (r = i; r * 2 + size < n; r = c) {
983 cmp_func(base + c, base + c + size, size) < 0)
985 if (cmp_func(base + r, base + c, size) >= 0)
987 swap_func(base + r, base + c, size);
992 for (i = n - size; i > 0; i -= size) {
993 swap_func(base, base + i, size);
994 for (r = 0; r * 2 + size < i; r = c) {
997 cmp_func(base + c, base + c + size, size) < 0)
999 if (cmp_func(base + r, base + c, size) >= 0)
1001 swap_func(base + r, base + c, size);
1006 static void mempool_free_vp(void *element, void *pool_data)
1008 size_t size = (size_t) pool_data;
1010 vpfree(element, size);
1013 static void *mempool_alloc_vp(gfp_t gfp_mask, void *pool_data)
1015 size_t size = (size_t) pool_data;
1017 return vpmalloc(size, gfp_mask);
1020 int mempool_init_kvpmalloc_pool(mempool_t *pool, int min_nr, size_t size)
1022 return size < PAGE_SIZE
1023 ? mempool_init_kmalloc_pool(pool, min_nr, size)
1024 : mempool_init(pool, min_nr, mempool_alloc_vp,
1025 mempool_free_vp, (void *) size);
1029 void eytzinger1_test(void)
1031 unsigned inorder, eytz, size;
1033 pr_info("1 based eytzinger test:");
1038 unsigned extra = eytzinger1_extra(size);
1041 pr_info("tree size %u", size);
1043 BUG_ON(eytzinger1_prev(0, size) != eytzinger1_last(size));
1044 BUG_ON(eytzinger1_next(0, size) != eytzinger1_first(size));
1046 BUG_ON(eytzinger1_prev(eytzinger1_first(size), size) != 0);
1047 BUG_ON(eytzinger1_next(eytzinger1_last(size), size) != 0);
1050 eytzinger1_for_each(eytz, size) {
1051 BUG_ON(__inorder_to_eytzinger1(inorder, size, extra) != eytz);
1052 BUG_ON(__eytzinger1_to_inorder(eytz, size, extra) != inorder);
1053 BUG_ON(eytz != eytzinger1_last(size) &&
1054 eytzinger1_prev(eytzinger1_next(eytz, size), size) != eytz);
1061 void eytzinger0_test(void)
1064 unsigned inorder, eytz, size;
1066 pr_info("0 based eytzinger test:");
1071 unsigned extra = eytzinger0_extra(size);
1074 pr_info("tree size %u", size);
1076 BUG_ON(eytzinger0_prev(-1, size) != eytzinger0_last(size));
1077 BUG_ON(eytzinger0_next(-1, size) != eytzinger0_first(size));
1079 BUG_ON(eytzinger0_prev(eytzinger0_first(size), size) != -1);
1080 BUG_ON(eytzinger0_next(eytzinger0_last(size), size) != -1);
1083 eytzinger0_for_each(eytz, size) {
1084 BUG_ON(__inorder_to_eytzinger0(inorder, size, extra) != eytz);
1085 BUG_ON(__eytzinger0_to_inorder(eytz, size, extra) != inorder);
1086 BUG_ON(eytz != eytzinger0_last(size) &&
1087 eytzinger0_prev(eytzinger0_next(eytz, size), size) != eytz);
1094 static inline int cmp_u16(const void *_l, const void *_r, size_t size)
1096 const u16 *l = _l, *r = _r;
1098 return (*l > *r) - (*r - *l);
1101 static void eytzinger0_find_test_val(u16 *test_array, unsigned nr, u16 search)
1103 int i, c1 = -1, c2 = -1;
1106 r = eytzinger0_find_le(test_array, nr,
1107 sizeof(test_array[0]),
1112 for (i = 0; i < nr; i++)
1113 if (test_array[i] <= search && test_array[i] > c2)
1117 eytzinger0_for_each(i, nr)
1118 pr_info("[%3u] = %12u", i, test_array[i]);
1119 pr_info("find_le(%2u) -> [%2zi] = %2i should be %2i",
1124 void eytzinger0_find_test(void)
1126 unsigned i, nr, allocated = 1 << 12;
1127 u16 *test_array = kmalloc_array(allocated, sizeof(test_array[0]), GFP_KERNEL);
1129 for (nr = 1; nr < allocated; nr++) {
1130 pr_info("testing %u elems", nr);
1132 get_random_bytes(test_array, nr * sizeof(test_array[0]));
1133 eytzinger0_sort(test_array, nr, sizeof(test_array[0]), cmp_u16, NULL);
1135 /* verify array is sorted correctly: */
1136 eytzinger0_for_each(i, nr)
1137 BUG_ON(i != eytzinger0_last(nr) &&
1138 test_array[i] > test_array[eytzinger0_next(i, nr)]);
1140 for (i = 0; i < U16_MAX; i += 1 << 12)
1141 eytzinger0_find_test_val(test_array, nr, i);
1143 for (i = 0; i < nr; i++) {
1144 eytzinger0_find_test_val(test_array, nr, test_array[i] - 1);
1145 eytzinger0_find_test_val(test_array, nr, test_array[i]);
1146 eytzinger0_find_test_val(test_array, nr, test_array[i] + 1);
1155 * Accumulate percpu counters onto one cpu's copy - only valid when access
1156 * against any percpu counter is guarded against
1158 u64 *bch2_acc_percpu_u64s(u64 __percpu *p, unsigned nr)
1163 /* access to pcpu vars has to be blocked by other locking */
1165 ret = this_cpu_ptr(p);
1168 for_each_possible_cpu(cpu) {
1169 u64 *i = per_cpu_ptr(p, cpu);
1172 acc_u64s(ret, i, nr);
1173 memset(i, 0, nr * sizeof(u64));