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_base2_nbits(struct printbuf *out, u64 v, unsigned nr_bits)
247 prt_char(out, '0' + ((v >> --nr_bits) & 1));
250 void bch2_prt_u64_base2(struct printbuf *out, u64 v)
252 bch2_prt_u64_base2_nbits(out, v, fls64(v) ?: 1);
255 void bch2_print_string_as_lines(const char *prefix, const char *lines)
260 printk("%s (null)\n", prefix);
266 p = strchrnul(lines, '\n');
267 printk("%s%.*s\n", prefix, (int) (p - lines), lines);
275 int bch2_save_backtrace(bch_stacktrace *stack, struct task_struct *task, unsigned skipnr,
278 #ifdef CONFIG_STACKTRACE
279 unsigned nr_entries = 0;
282 int ret = darray_make_room_gfp(stack, 32, gfp);
286 if (!down_read_trylock(&task->signal->exec_update_lock))
290 nr_entries = stack_trace_save_tsk(task, stack->data, stack->size, skipnr + 1);
291 } while (nr_entries == stack->size &&
292 !(ret = darray_make_room(stack, stack->size * 2)));
294 stack->nr = nr_entries;
295 up_read(&task->signal->exec_update_lock);
303 void bch2_prt_backtrace(struct printbuf *out, bch_stacktrace *stack)
305 darray_for_each(*stack, i) {
306 prt_printf(out, "[<0>] %pB", (void *) *i);
311 int bch2_prt_task_backtrace(struct printbuf *out, struct task_struct *task, unsigned skipnr, gfp_t gfp)
313 bch_stacktrace stack = { 0 };
314 int ret = bch2_save_backtrace(&stack, task, skipnr + 1, gfp);
316 bch2_prt_backtrace(out, &stack);
323 void bch2_prt_datetime(struct printbuf *out, time64_t sec)
332 void bch2_prt_datetime(struct printbuf *out, time64_t sec)
335 snprintf(buf, sizeof(buf), "%ptT", &sec);
340 static const struct time_unit {
345 { "us", NSEC_PER_USEC },
346 { "ms", NSEC_PER_MSEC },
347 { "s", NSEC_PER_SEC },
348 { "m", (u64) NSEC_PER_SEC * 60},
349 { "h", (u64) NSEC_PER_SEC * 3600},
353 static const struct time_unit *pick_time_units(u64 ns)
355 const struct time_unit *u;
358 u + 1 < time_units + ARRAY_SIZE(time_units) &&
359 ns >= u[1].nsecs << 1;
366 void bch2_pr_time_units(struct printbuf *out, u64 ns)
368 const struct time_unit *u = pick_time_units(ns);
370 prt_printf(out, "%llu %s", div_u64(ns, u->nsecs), u->name);
375 #ifndef CONFIG_BCACHEFS_NO_LATENCY_ACCT
376 static void bch2_quantiles_update(struct bch2_quantiles *q, u64 v)
380 while (i < ARRAY_SIZE(q->entries)) {
381 struct bch2_quantile_entry *e = q->entries + i;
383 if (unlikely(!e->step)) {
385 e->step = max_t(unsigned, v / 2, 1024);
386 } else if (e->m > v) {
387 e->m = e->m >= e->step
390 } else if (e->m < v) {
391 e->m = e->m + e->step > e->m
396 if ((e->m > v ? e->m - v : v - e->m) < e->step)
397 e->step = max_t(unsigned, e->step / 2, 1);
402 i = eytzinger0_child(i, v > e->m);
406 static inline void bch2_time_stats_update_one(struct bch2_time_stats *stats,
411 if (time_after64(end, start)) {
412 duration = end - start;
413 mean_and_variance_update(&stats->duration_stats, duration);
414 mean_and_variance_weighted_update(&stats->duration_stats_weighted, duration);
415 stats->max_duration = max(stats->max_duration, duration);
416 stats->min_duration = min(stats->min_duration, duration);
417 stats->total_duration += duration;
418 bch2_quantiles_update(&stats->quantiles, duration);
421 if (time_after64(end, stats->last_event)) {
422 freq = end - stats->last_event;
423 mean_and_variance_update(&stats->freq_stats, freq);
424 mean_and_variance_weighted_update(&stats->freq_stats_weighted, freq);
425 stats->max_freq = max(stats->max_freq, freq);
426 stats->min_freq = min(stats->min_freq, freq);
427 stats->last_event = end;
431 static void __bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
432 struct bch2_time_stat_buffer *b)
434 for (struct bch2_time_stat_buffer_entry *i = b->entries;
435 i < b->entries + ARRAY_SIZE(b->entries);
437 bch2_time_stats_update_one(stats, i->start, i->end);
441 static noinline void bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
442 struct bch2_time_stat_buffer *b)
446 spin_lock_irqsave(&stats->lock, flags);
447 __bch2_time_stats_clear_buffer(stats, b);
448 spin_unlock_irqrestore(&stats->lock, flags);
451 void __bch2_time_stats_update(struct bch2_time_stats *stats, u64 start, u64 end)
455 WARN_ONCE(!stats->duration_stats_weighted.weight ||
456 !stats->freq_stats_weighted.weight,
457 "uninitialized time_stats");
459 if (!stats->buffer) {
460 spin_lock_irqsave(&stats->lock, flags);
461 bch2_time_stats_update_one(stats, start, end);
463 if (mean_and_variance_weighted_get_mean(stats->freq_stats_weighted) < 32 &&
464 stats->duration_stats.n > 1024)
466 alloc_percpu_gfp(struct bch2_time_stat_buffer,
468 spin_unlock_irqrestore(&stats->lock, flags);
470 struct bch2_time_stat_buffer *b;
473 b = this_cpu_ptr(stats->buffer);
475 BUG_ON(b->nr >= ARRAY_SIZE(b->entries));
476 b->entries[b->nr++] = (struct bch2_time_stat_buffer_entry) {
481 if (unlikely(b->nr == ARRAY_SIZE(b->entries)))
482 bch2_time_stats_clear_buffer(stats, b);
487 static void bch2_pr_time_units_aligned(struct printbuf *out, u64 ns)
489 const struct time_unit *u = pick_time_units(ns);
491 prt_printf(out, "%llu ", div64_u64(ns, u->nsecs));
493 prt_printf(out, "%s", u->name);
496 static inline void pr_name_and_units(struct printbuf *out, const char *name, u64 ns)
500 bch2_pr_time_units_aligned(out, ns);
504 #define TABSTOP_SIZE 12
506 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats)
508 const struct time_unit *u;
509 s64 f_mean = 0, d_mean = 0;
510 u64 q, last_q = 0, f_stddev = 0, d_stddev = 0;
516 spin_lock_irq(&stats->lock);
517 for_each_possible_cpu(cpu)
518 __bch2_time_stats_clear_buffer(stats, per_cpu_ptr(stats->buffer, cpu));
519 spin_unlock_irq(&stats->lock);
523 * avoid divide by zero
525 if (stats->freq_stats.n) {
526 f_mean = mean_and_variance_get_mean(stats->freq_stats);
527 f_stddev = mean_and_variance_get_stddev(stats->freq_stats);
528 d_mean = mean_and_variance_get_mean(stats->duration_stats);
529 d_stddev = mean_and_variance_get_stddev(stats->duration_stats);
532 printbuf_tabstop_push(out, out->indent + TABSTOP_SIZE);
533 prt_printf(out, "count:");
535 prt_printf(out, "%llu ",
536 stats->duration_stats.n);
537 printbuf_tabstop_pop(out);
540 printbuf_tabstops_reset(out);
542 printbuf_tabstop_push(out, out->indent + 20);
543 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
544 printbuf_tabstop_push(out, 0);
545 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
548 prt_printf(out, "since mount");
551 prt_printf(out, "recent");
555 printbuf_tabstops_reset(out);
556 printbuf_tabstop_push(out, out->indent + 20);
557 printbuf_tabstop_push(out, TABSTOP_SIZE);
558 printbuf_tabstop_push(out, 2);
559 printbuf_tabstop_push(out, TABSTOP_SIZE);
561 prt_printf(out, "duration of events");
563 printbuf_indent_add(out, 2);
565 pr_name_and_units(out, "min:", stats->min_duration);
566 pr_name_and_units(out, "max:", stats->max_duration);
567 pr_name_and_units(out, "total:", stats->total_duration);
569 prt_printf(out, "mean:");
571 bch2_pr_time_units_aligned(out, d_mean);
573 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->duration_stats_weighted));
576 prt_printf(out, "stddev:");
578 bch2_pr_time_units_aligned(out, d_stddev);
580 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->duration_stats_weighted));
582 printbuf_indent_sub(out, 2);
585 prt_printf(out, "time between events");
587 printbuf_indent_add(out, 2);
589 pr_name_and_units(out, "min:", stats->min_freq);
590 pr_name_and_units(out, "max:", stats->max_freq);
592 prt_printf(out, "mean:");
594 bch2_pr_time_units_aligned(out, f_mean);
596 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->freq_stats_weighted));
599 prt_printf(out, "stddev:");
601 bch2_pr_time_units_aligned(out, f_stddev);
603 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->freq_stats_weighted));
605 printbuf_indent_sub(out, 2);
608 printbuf_tabstops_reset(out);
610 i = eytzinger0_first(NR_QUANTILES);
611 u = pick_time_units(stats->quantiles.entries[i].m);
613 prt_printf(out, "quantiles (%s):\t", u->name);
614 eytzinger0_for_each(i, NR_QUANTILES) {
615 bool is_last = eytzinger0_next(i, NR_QUANTILES) == -1;
617 q = max(stats->quantiles.entries[i].m, last_q);
618 prt_printf(out, "%llu ",
619 div_u64(q, u->nsecs));
626 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats) {}
629 void bch2_time_stats_exit(struct bch2_time_stats *stats)
631 free_percpu(stats->buffer);
634 void bch2_time_stats_init(struct bch2_time_stats *stats)
636 memset(stats, 0, sizeof(*stats));
637 stats->duration_stats_weighted.weight = 8;
638 stats->freq_stats_weighted.weight = 8;
639 stats->min_duration = U64_MAX;
640 stats->min_freq = U64_MAX;
641 spin_lock_init(&stats->lock);
647 * bch2_ratelimit_delay() - return how long to delay until the next time to do
649 * @d: the struct bch_ratelimit to update
650 * Returns: the amount of time to delay by, in jiffies
652 u64 bch2_ratelimit_delay(struct bch_ratelimit *d)
654 u64 now = local_clock();
656 return time_after64(d->next, now)
657 ? nsecs_to_jiffies(d->next - now)
662 * bch2_ratelimit_increment() - increment @d by the amount of work done
663 * @d: the struct bch_ratelimit to update
664 * @done: the amount of work done, in arbitrary units
666 void bch2_ratelimit_increment(struct bch_ratelimit *d, u64 done)
668 u64 now = local_clock();
670 d->next += div_u64(done * NSEC_PER_SEC, d->rate);
672 if (time_before64(now + NSEC_PER_SEC, d->next))
673 d->next = now + NSEC_PER_SEC;
675 if (time_after64(now - NSEC_PER_SEC * 2, d->next))
676 d->next = now - NSEC_PER_SEC * 2;
682 * Updates pd_controller. Attempts to scale inputed values to units per second.
683 * @target: desired value
684 * @actual: current value
686 * @sign: 1 or -1; 1 if increasing the rate makes actual go up, -1 if increasing
687 * it makes actual go down.
689 void bch2_pd_controller_update(struct bch_pd_controller *pd,
690 s64 target, s64 actual, int sign)
692 s64 proportional, derivative, change;
694 unsigned long seconds_since_update = (jiffies - pd->last_update) / HZ;
696 if (seconds_since_update == 0)
699 pd->last_update = jiffies;
701 proportional = actual - target;
702 proportional *= seconds_since_update;
703 proportional = div_s64(proportional, pd->p_term_inverse);
705 derivative = actual - pd->last_actual;
706 derivative = div_s64(derivative, seconds_since_update);
707 derivative = ewma_add(pd->smoothed_derivative, derivative,
708 (pd->d_term / seconds_since_update) ?: 1);
709 derivative = derivative * pd->d_term;
710 derivative = div_s64(derivative, pd->p_term_inverse);
712 change = proportional + derivative;
714 /* Don't increase rate if not keeping up */
717 time_after64(local_clock(),
718 pd->rate.next + NSEC_PER_MSEC))
721 change *= (sign * -1);
723 pd->rate.rate = clamp_t(s64, (s64) pd->rate.rate + change,
726 pd->last_actual = actual;
727 pd->last_derivative = derivative;
728 pd->last_proportional = proportional;
729 pd->last_change = change;
730 pd->last_target = target;
733 void bch2_pd_controller_init(struct bch_pd_controller *pd)
735 pd->rate.rate = 1024;
736 pd->last_update = jiffies;
737 pd->p_term_inverse = 6000;
739 pd->d_smooth = pd->d_term;
740 pd->backpressure = 1;
743 void bch2_pd_controller_debug_to_text(struct printbuf *out, struct bch_pd_controller *pd)
745 if (!out->nr_tabstops)
746 printbuf_tabstop_push(out, 20);
748 prt_printf(out, "rate:");
750 prt_human_readable_s64(out, pd->rate.rate);
753 prt_printf(out, "target:");
755 prt_human_readable_u64(out, pd->last_target);
758 prt_printf(out, "actual:");
760 prt_human_readable_u64(out, pd->last_actual);
763 prt_printf(out, "proportional:");
765 prt_human_readable_s64(out, pd->last_proportional);
768 prt_printf(out, "derivative:");
770 prt_human_readable_s64(out, pd->last_derivative);
773 prt_printf(out, "change:");
775 prt_human_readable_s64(out, pd->last_change);
778 prt_printf(out, "next io:");
780 prt_printf(out, "%llims", div64_s64(pd->rate.next - local_clock(), NSEC_PER_MSEC));
786 void bch2_bio_map(struct bio *bio, void *base, size_t size)
789 struct page *page = is_vmalloc_addr(base)
790 ? vmalloc_to_page(base)
791 : virt_to_page(base);
792 unsigned offset = offset_in_page(base);
793 unsigned len = min_t(size_t, PAGE_SIZE - offset, size);
795 BUG_ON(!bio_add_page(bio, page, len, offset));
801 int bch2_bio_alloc_pages(struct bio *bio, size_t size, gfp_t gfp_mask)
804 struct page *page = alloc_pages(gfp_mask, 0);
805 unsigned len = min_t(size_t, PAGE_SIZE, size);
810 if (unlikely(!bio_add_page(bio, page, len, 0))) {
821 size_t bch2_rand_range(size_t max)
829 rand = get_random_long();
830 rand &= roundup_pow_of_two(max) - 1;
831 } while (rand >= max);
836 void memcpy_to_bio(struct bio *dst, struct bvec_iter dst_iter, const void *src)
839 struct bvec_iter iter;
841 __bio_for_each_segment(bv, dst, iter, dst_iter) {
842 void *dstp = kmap_local_page(bv.bv_page);
844 memcpy(dstp + bv.bv_offset, src, bv.bv_len);
851 void memcpy_from_bio(void *dst, struct bio *src, struct bvec_iter src_iter)
854 struct bvec_iter iter;
856 __bio_for_each_segment(bv, src, iter, src_iter) {
857 void *srcp = kmap_local_page(bv.bv_page);
859 memcpy(dst, srcp + bv.bv_offset, bv.bv_len);
866 static int alignment_ok(const void *base, size_t align)
868 return IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) ||
869 ((unsigned long)base & (align - 1)) == 0;
872 static void u32_swap(void *a, void *b, size_t size)
875 *(u32 *)a = *(u32 *)b;
879 static void u64_swap(void *a, void *b, size_t size)
882 *(u64 *)a = *(u64 *)b;
886 static void generic_swap(void *a, void *b, size_t size)
892 *(char *)a++ = *(char *)b;
894 } while (--size > 0);
897 static inline int do_cmp(void *base, size_t n, size_t size,
898 int (*cmp_func)(const void *, const void *, size_t),
901 return cmp_func(base + inorder_to_eytzinger0(l, n) * size,
902 base + inorder_to_eytzinger0(r, n) * size,
906 static inline void do_swap(void *base, size_t n, size_t size,
907 void (*swap_func)(void *, void *, size_t),
910 swap_func(base + inorder_to_eytzinger0(l, n) * size,
911 base + inorder_to_eytzinger0(r, n) * size,
915 void eytzinger0_sort(void *base, size_t n, size_t size,
916 int (*cmp_func)(const void *, const void *, size_t),
917 void (*swap_func)(void *, void *, size_t))
922 if (size == 4 && alignment_ok(base, 4))
923 swap_func = u32_swap;
924 else if (size == 8 && alignment_ok(base, 8))
925 swap_func = u64_swap;
927 swap_func = generic_swap;
931 for (i = n / 2 - 1; i >= 0; --i) {
932 for (r = i; r * 2 + 1 < n; r = c) {
936 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
939 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
942 do_swap(base, n, size, swap_func, r, c);
947 for (i = n - 1; i > 0; --i) {
948 do_swap(base, n, size, swap_func, 0, i);
950 for (r = 0; r * 2 + 1 < i; r = c) {
954 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
957 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
960 do_swap(base, n, size, swap_func, r, c);
965 void sort_cmp_size(void *base, size_t num, size_t size,
966 int (*cmp_func)(const void *, const void *, size_t),
967 void (*swap_func)(void *, void *, size_t size))
969 /* pre-scale counters for performance */
970 int i = (num/2 - 1) * size, n = num * size, c, r;
973 if (size == 4 && alignment_ok(base, 4))
974 swap_func = u32_swap;
975 else if (size == 8 && alignment_ok(base, 8))
976 swap_func = u64_swap;
978 swap_func = generic_swap;
982 for ( ; i >= 0; i -= size) {
983 for (r = i; r * 2 + size < n; r = c) {
986 cmp_func(base + c, base + c + size, size) < 0)
988 if (cmp_func(base + r, base + c, size) >= 0)
990 swap_func(base + r, base + c, size);
995 for (i = n - size; i > 0; i -= size) {
996 swap_func(base, base + i, size);
997 for (r = 0; r * 2 + size < i; r = c) {
1000 cmp_func(base + c, base + c + size, size) < 0)
1002 if (cmp_func(base + r, base + c, size) >= 0)
1004 swap_func(base + r, base + c, size);
1009 static void mempool_free_vp(void *element, void *pool_data)
1011 size_t size = (size_t) pool_data;
1013 vpfree(element, size);
1016 static void *mempool_alloc_vp(gfp_t gfp_mask, void *pool_data)
1018 size_t size = (size_t) pool_data;
1020 return vpmalloc(size, gfp_mask);
1023 int mempool_init_kvpmalloc_pool(mempool_t *pool, int min_nr, size_t size)
1025 return size < PAGE_SIZE
1026 ? mempool_init_kmalloc_pool(pool, min_nr, size)
1027 : mempool_init(pool, min_nr, mempool_alloc_vp,
1028 mempool_free_vp, (void *) size);
1032 void eytzinger1_test(void)
1034 unsigned inorder, eytz, size;
1036 pr_info("1 based eytzinger test:");
1041 unsigned extra = eytzinger1_extra(size);
1044 pr_info("tree size %u", size);
1046 BUG_ON(eytzinger1_prev(0, size) != eytzinger1_last(size));
1047 BUG_ON(eytzinger1_next(0, size) != eytzinger1_first(size));
1049 BUG_ON(eytzinger1_prev(eytzinger1_first(size), size) != 0);
1050 BUG_ON(eytzinger1_next(eytzinger1_last(size), size) != 0);
1053 eytzinger1_for_each(eytz, size) {
1054 BUG_ON(__inorder_to_eytzinger1(inorder, size, extra) != eytz);
1055 BUG_ON(__eytzinger1_to_inorder(eytz, size, extra) != inorder);
1056 BUG_ON(eytz != eytzinger1_last(size) &&
1057 eytzinger1_prev(eytzinger1_next(eytz, size), size) != eytz);
1064 void eytzinger0_test(void)
1067 unsigned inorder, eytz, size;
1069 pr_info("0 based eytzinger test:");
1074 unsigned extra = eytzinger0_extra(size);
1077 pr_info("tree size %u", size);
1079 BUG_ON(eytzinger0_prev(-1, size) != eytzinger0_last(size));
1080 BUG_ON(eytzinger0_next(-1, size) != eytzinger0_first(size));
1082 BUG_ON(eytzinger0_prev(eytzinger0_first(size), size) != -1);
1083 BUG_ON(eytzinger0_next(eytzinger0_last(size), size) != -1);
1086 eytzinger0_for_each(eytz, size) {
1087 BUG_ON(__inorder_to_eytzinger0(inorder, size, extra) != eytz);
1088 BUG_ON(__eytzinger0_to_inorder(eytz, size, extra) != inorder);
1089 BUG_ON(eytz != eytzinger0_last(size) &&
1090 eytzinger0_prev(eytzinger0_next(eytz, size), size) != eytz);
1097 static inline int cmp_u16(const void *_l, const void *_r, size_t size)
1099 const u16 *l = _l, *r = _r;
1101 return (*l > *r) - (*r - *l);
1104 static void eytzinger0_find_test_val(u16 *test_array, unsigned nr, u16 search)
1106 int i, c1 = -1, c2 = -1;
1109 r = eytzinger0_find_le(test_array, nr,
1110 sizeof(test_array[0]),
1115 for (i = 0; i < nr; i++)
1116 if (test_array[i] <= search && test_array[i] > c2)
1120 eytzinger0_for_each(i, nr)
1121 pr_info("[%3u] = %12u", i, test_array[i]);
1122 pr_info("find_le(%2u) -> [%2zi] = %2i should be %2i",
1127 void eytzinger0_find_test(void)
1129 unsigned i, nr, allocated = 1 << 12;
1130 u16 *test_array = kmalloc_array(allocated, sizeof(test_array[0]), GFP_KERNEL);
1132 for (nr = 1; nr < allocated; nr++) {
1133 pr_info("testing %u elems", nr);
1135 get_random_bytes(test_array, nr * sizeof(test_array[0]));
1136 eytzinger0_sort(test_array, nr, sizeof(test_array[0]), cmp_u16, NULL);
1138 /* verify array is sorted correctly: */
1139 eytzinger0_for_each(i, nr)
1140 BUG_ON(i != eytzinger0_last(nr) &&
1141 test_array[i] > test_array[eytzinger0_next(i, nr)]);
1143 for (i = 0; i < U16_MAX; i += 1 << 12)
1144 eytzinger0_find_test_val(test_array, nr, i);
1146 for (i = 0; i < nr; i++) {
1147 eytzinger0_find_test_val(test_array, nr, test_array[i] - 1);
1148 eytzinger0_find_test_val(test_array, nr, test_array[i]);
1149 eytzinger0_find_test_val(test_array, nr, test_array[i] + 1);
1158 * Accumulate percpu counters onto one cpu's copy - only valid when access
1159 * against any percpu counter is guarded against
1161 u64 *bch2_acc_percpu_u64s(u64 __percpu *p, unsigned nr)
1166 /* access to pcpu vars has to be blocked by other locking */
1168 ret = this_cpu_ptr(p);
1171 for_each_possible_cpu(cpu) {
1172 u64 *i = per_cpu_ptr(p, cpu);
1175 acc_u64s(ret, i, nr);
1176 memset(i, 0, nr * sizeof(u64));
1183 void bch2_darray_str_exit(darray_str *d)
1185 darray_for_each(*d, i)
1190 int bch2_split_devs(const char *_dev_name, darray_str *ret)
1194 char *dev_name, *s, *orig;
1196 dev_name = orig = kstrdup(_dev_name, GFP_KERNEL);
1200 while ((s = strsep(&dev_name, ":"))) {
1201 char *p = kstrdup(s, GFP_KERNEL);
1205 if (darray_push(ret, p)) {
1214 bch2_darray_str_exit(ret);