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_gfp(stack, stack->size * 2, gfp)));
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 (stats->last_event && 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);
429 stats->last_event = end;
432 static void __bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
433 struct bch2_time_stat_buffer *b)
435 for (struct bch2_time_stat_buffer_entry *i = b->entries;
436 i < b->entries + ARRAY_SIZE(b->entries);
438 bch2_time_stats_update_one(stats, i->start, i->end);
442 static noinline void bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
443 struct bch2_time_stat_buffer *b)
447 spin_lock_irqsave(&stats->lock, flags);
448 __bch2_time_stats_clear_buffer(stats, b);
449 spin_unlock_irqrestore(&stats->lock, flags);
452 void __bch2_time_stats_update(struct bch2_time_stats *stats, u64 start, u64 end)
456 WARN_ONCE(!stats->duration_stats_weighted.weight ||
457 !stats->freq_stats_weighted.weight,
458 "uninitialized time_stats");
460 if (!stats->buffer) {
461 spin_lock_irqsave(&stats->lock, flags);
462 bch2_time_stats_update_one(stats, start, end);
464 if (mean_and_variance_weighted_get_mean(stats->freq_stats_weighted) < 32 &&
465 stats->duration_stats.n > 1024)
467 alloc_percpu_gfp(struct bch2_time_stat_buffer,
469 spin_unlock_irqrestore(&stats->lock, flags);
471 struct bch2_time_stat_buffer *b;
474 b = this_cpu_ptr(stats->buffer);
476 BUG_ON(b->nr >= ARRAY_SIZE(b->entries));
477 b->entries[b->nr++] = (struct bch2_time_stat_buffer_entry) {
482 if (unlikely(b->nr == ARRAY_SIZE(b->entries)))
483 bch2_time_stats_clear_buffer(stats, b);
488 static void bch2_pr_time_units_aligned(struct printbuf *out, u64 ns)
490 const struct time_unit *u = pick_time_units(ns);
492 prt_printf(out, "%llu ", div64_u64(ns, u->nsecs));
494 prt_printf(out, "%s", u->name);
497 static inline void pr_name_and_units(struct printbuf *out, const char *name, u64 ns)
501 bch2_pr_time_units_aligned(out, ns);
505 #define TABSTOP_SIZE 12
507 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats)
509 const struct time_unit *u;
510 s64 f_mean = 0, d_mean = 0;
511 u64 q, last_q = 0, f_stddev = 0, d_stddev = 0;
517 spin_lock_irq(&stats->lock);
518 for_each_possible_cpu(cpu)
519 __bch2_time_stats_clear_buffer(stats, per_cpu_ptr(stats->buffer, cpu));
520 spin_unlock_irq(&stats->lock);
524 * avoid divide by zero
526 if (stats->freq_stats.n) {
527 f_mean = mean_and_variance_get_mean(stats->freq_stats);
528 f_stddev = mean_and_variance_get_stddev(stats->freq_stats);
529 d_mean = mean_and_variance_get_mean(stats->duration_stats);
530 d_stddev = mean_and_variance_get_stddev(stats->duration_stats);
533 printbuf_tabstop_push(out, out->indent + TABSTOP_SIZE);
534 prt_printf(out, "count:");
536 prt_printf(out, "%llu ",
537 stats->duration_stats.n);
538 printbuf_tabstop_pop(out);
541 printbuf_tabstops_reset(out);
543 printbuf_tabstop_push(out, out->indent + 20);
544 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
545 printbuf_tabstop_push(out, 0);
546 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
549 prt_printf(out, "since mount");
552 prt_printf(out, "recent");
556 printbuf_tabstops_reset(out);
557 printbuf_tabstop_push(out, out->indent + 20);
558 printbuf_tabstop_push(out, TABSTOP_SIZE);
559 printbuf_tabstop_push(out, 2);
560 printbuf_tabstop_push(out, TABSTOP_SIZE);
562 prt_printf(out, "duration of events");
564 printbuf_indent_add(out, 2);
566 pr_name_and_units(out, "min:", stats->min_duration);
567 pr_name_and_units(out, "max:", stats->max_duration);
568 pr_name_and_units(out, "total:", stats->total_duration);
570 prt_printf(out, "mean:");
572 bch2_pr_time_units_aligned(out, d_mean);
574 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->duration_stats_weighted));
577 prt_printf(out, "stddev:");
579 bch2_pr_time_units_aligned(out, d_stddev);
581 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->duration_stats_weighted));
583 printbuf_indent_sub(out, 2);
586 prt_printf(out, "time between events");
588 printbuf_indent_add(out, 2);
590 pr_name_and_units(out, "min:", stats->min_freq);
591 pr_name_and_units(out, "max:", stats->max_freq);
593 prt_printf(out, "mean:");
595 bch2_pr_time_units_aligned(out, f_mean);
597 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->freq_stats_weighted));
600 prt_printf(out, "stddev:");
602 bch2_pr_time_units_aligned(out, f_stddev);
604 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->freq_stats_weighted));
606 printbuf_indent_sub(out, 2);
609 printbuf_tabstops_reset(out);
611 i = eytzinger0_first(NR_QUANTILES);
612 u = pick_time_units(stats->quantiles.entries[i].m);
614 prt_printf(out, "quantiles (%s):\t", u->name);
615 eytzinger0_for_each(i, NR_QUANTILES) {
616 bool is_last = eytzinger0_next(i, NR_QUANTILES) == -1;
618 q = max(stats->quantiles.entries[i].m, last_q);
619 prt_printf(out, "%llu ",
620 div_u64(q, u->nsecs));
627 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats) {}
630 void bch2_time_stats_exit(struct bch2_time_stats *stats)
632 free_percpu(stats->buffer);
635 void bch2_time_stats_init(struct bch2_time_stats *stats)
637 memset(stats, 0, sizeof(*stats));
638 stats->duration_stats_weighted.weight = 8;
639 stats->freq_stats_weighted.weight = 8;
640 stats->min_duration = U64_MAX;
641 stats->min_freq = U64_MAX;
642 spin_lock_init(&stats->lock);
648 * bch2_ratelimit_delay() - return how long to delay until the next time to do
650 * @d: the struct bch_ratelimit to update
651 * Returns: the amount of time to delay by, in jiffies
653 u64 bch2_ratelimit_delay(struct bch_ratelimit *d)
655 u64 now = local_clock();
657 return time_after64(d->next, now)
658 ? nsecs_to_jiffies(d->next - now)
663 * bch2_ratelimit_increment() - increment @d by the amount of work done
664 * @d: the struct bch_ratelimit to update
665 * @done: the amount of work done, in arbitrary units
667 void bch2_ratelimit_increment(struct bch_ratelimit *d, u64 done)
669 u64 now = local_clock();
671 d->next += div_u64(done * NSEC_PER_SEC, d->rate);
673 if (time_before64(now + NSEC_PER_SEC, d->next))
674 d->next = now + NSEC_PER_SEC;
676 if (time_after64(now - NSEC_PER_SEC * 2, d->next))
677 d->next = now - NSEC_PER_SEC * 2;
683 * Updates pd_controller. Attempts to scale inputed values to units per second.
684 * @target: desired value
685 * @actual: current value
687 * @sign: 1 or -1; 1 if increasing the rate makes actual go up, -1 if increasing
688 * it makes actual go down.
690 void bch2_pd_controller_update(struct bch_pd_controller *pd,
691 s64 target, s64 actual, int sign)
693 s64 proportional, derivative, change;
695 unsigned long seconds_since_update = (jiffies - pd->last_update) / HZ;
697 if (seconds_since_update == 0)
700 pd->last_update = jiffies;
702 proportional = actual - target;
703 proportional *= seconds_since_update;
704 proportional = div_s64(proportional, pd->p_term_inverse);
706 derivative = actual - pd->last_actual;
707 derivative = div_s64(derivative, seconds_since_update);
708 derivative = ewma_add(pd->smoothed_derivative, derivative,
709 (pd->d_term / seconds_since_update) ?: 1);
710 derivative = derivative * pd->d_term;
711 derivative = div_s64(derivative, pd->p_term_inverse);
713 change = proportional + derivative;
715 /* Don't increase rate if not keeping up */
718 time_after64(local_clock(),
719 pd->rate.next + NSEC_PER_MSEC))
722 change *= (sign * -1);
724 pd->rate.rate = clamp_t(s64, (s64) pd->rate.rate + change,
727 pd->last_actual = actual;
728 pd->last_derivative = derivative;
729 pd->last_proportional = proportional;
730 pd->last_change = change;
731 pd->last_target = target;
734 void bch2_pd_controller_init(struct bch_pd_controller *pd)
736 pd->rate.rate = 1024;
737 pd->last_update = jiffies;
738 pd->p_term_inverse = 6000;
740 pd->d_smooth = pd->d_term;
741 pd->backpressure = 1;
744 void bch2_pd_controller_debug_to_text(struct printbuf *out, struct bch_pd_controller *pd)
746 if (!out->nr_tabstops)
747 printbuf_tabstop_push(out, 20);
749 prt_printf(out, "rate:");
751 prt_human_readable_s64(out, pd->rate.rate);
754 prt_printf(out, "target:");
756 prt_human_readable_u64(out, pd->last_target);
759 prt_printf(out, "actual:");
761 prt_human_readable_u64(out, pd->last_actual);
764 prt_printf(out, "proportional:");
766 prt_human_readable_s64(out, pd->last_proportional);
769 prt_printf(out, "derivative:");
771 prt_human_readable_s64(out, pd->last_derivative);
774 prt_printf(out, "change:");
776 prt_human_readable_s64(out, pd->last_change);
779 prt_printf(out, "next io:");
781 prt_printf(out, "%llims", div64_s64(pd->rate.next - local_clock(), NSEC_PER_MSEC));
787 void bch2_bio_map(struct bio *bio, void *base, size_t size)
790 struct page *page = is_vmalloc_addr(base)
791 ? vmalloc_to_page(base)
792 : virt_to_page(base);
793 unsigned offset = offset_in_page(base);
794 unsigned len = min_t(size_t, PAGE_SIZE - offset, size);
796 BUG_ON(!bio_add_page(bio, page, len, offset));
802 int bch2_bio_alloc_pages(struct bio *bio, size_t size, gfp_t gfp_mask)
805 struct page *page = alloc_pages(gfp_mask, 0);
806 unsigned len = min_t(size_t, PAGE_SIZE, size);
811 if (unlikely(!bio_add_page(bio, page, len, 0))) {
822 size_t bch2_rand_range(size_t max)
830 rand = get_random_long();
831 rand &= roundup_pow_of_two(max) - 1;
832 } while (rand >= max);
837 void memcpy_to_bio(struct bio *dst, struct bvec_iter dst_iter, const void *src)
840 struct bvec_iter iter;
842 __bio_for_each_segment(bv, dst, iter, dst_iter) {
843 void *dstp = kmap_local_page(bv.bv_page);
845 memcpy(dstp + bv.bv_offset, src, bv.bv_len);
852 void memcpy_from_bio(void *dst, struct bio *src, struct bvec_iter src_iter)
855 struct bvec_iter iter;
857 __bio_for_each_segment(bv, src, iter, src_iter) {
858 void *srcp = kmap_local_page(bv.bv_page);
860 memcpy(dst, srcp + bv.bv_offset, bv.bv_len);
867 static int alignment_ok(const void *base, size_t align)
869 return IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) ||
870 ((unsigned long)base & (align - 1)) == 0;
873 static void u32_swap(void *a, void *b, size_t size)
876 *(u32 *)a = *(u32 *)b;
880 static void u64_swap(void *a, void *b, size_t size)
883 *(u64 *)a = *(u64 *)b;
887 static void generic_swap(void *a, void *b, size_t size)
893 *(char *)a++ = *(char *)b;
895 } while (--size > 0);
898 static inline int do_cmp(void *base, size_t n, size_t size,
899 int (*cmp_func)(const void *, const void *, size_t),
902 return cmp_func(base + inorder_to_eytzinger0(l, n) * size,
903 base + inorder_to_eytzinger0(r, n) * size,
907 static inline void do_swap(void *base, size_t n, size_t size,
908 void (*swap_func)(void *, void *, size_t),
911 swap_func(base + inorder_to_eytzinger0(l, n) * size,
912 base + inorder_to_eytzinger0(r, n) * size,
916 void eytzinger0_sort(void *base, size_t n, size_t size,
917 int (*cmp_func)(const void *, const void *, size_t),
918 void (*swap_func)(void *, void *, size_t))
923 if (size == 4 && alignment_ok(base, 4))
924 swap_func = u32_swap;
925 else if (size == 8 && alignment_ok(base, 8))
926 swap_func = u64_swap;
928 swap_func = generic_swap;
932 for (i = n / 2 - 1; i >= 0; --i) {
933 for (r = i; r * 2 + 1 < n; r = c) {
937 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
940 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
943 do_swap(base, n, size, swap_func, r, c);
948 for (i = n - 1; i > 0; --i) {
949 do_swap(base, n, size, swap_func, 0, i);
951 for (r = 0; r * 2 + 1 < i; r = c) {
955 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
958 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
961 do_swap(base, n, size, swap_func, r, c);
966 void sort_cmp_size(void *base, size_t num, size_t size,
967 int (*cmp_func)(const void *, const void *, size_t),
968 void (*swap_func)(void *, void *, size_t size))
970 /* pre-scale counters for performance */
971 int i = (num/2 - 1) * size, n = num * size, c, r;
974 if (size == 4 && alignment_ok(base, 4))
975 swap_func = u32_swap;
976 else if (size == 8 && alignment_ok(base, 8))
977 swap_func = u64_swap;
979 swap_func = generic_swap;
983 for ( ; i >= 0; i -= size) {
984 for (r = i; r * 2 + size < n; r = c) {
987 cmp_func(base + c, base + c + size, size) < 0)
989 if (cmp_func(base + r, base + c, size) >= 0)
991 swap_func(base + r, base + c, size);
996 for (i = n - size; i > 0; i -= size) {
997 swap_func(base, base + i, size);
998 for (r = 0; r * 2 + size < i; r = c) {
1001 cmp_func(base + c, base + c + size, size) < 0)
1003 if (cmp_func(base + r, base + c, size) >= 0)
1005 swap_func(base + r, base + c, size);
1010 static void mempool_free_vp(void *element, void *pool_data)
1012 size_t size = (size_t) pool_data;
1014 vpfree(element, size);
1017 static void *mempool_alloc_vp(gfp_t gfp_mask, void *pool_data)
1019 size_t size = (size_t) pool_data;
1021 return vpmalloc(size, gfp_mask);
1024 int mempool_init_kvpmalloc_pool(mempool_t *pool, int min_nr, size_t size)
1026 return size < PAGE_SIZE
1027 ? mempool_init_kmalloc_pool(pool, min_nr, size)
1028 : mempool_init(pool, min_nr, mempool_alloc_vp,
1029 mempool_free_vp, (void *) size);
1033 void eytzinger1_test(void)
1035 unsigned inorder, eytz, size;
1037 pr_info("1 based eytzinger test:");
1042 unsigned extra = eytzinger1_extra(size);
1045 pr_info("tree size %u", size);
1047 BUG_ON(eytzinger1_prev(0, size) != eytzinger1_last(size));
1048 BUG_ON(eytzinger1_next(0, size) != eytzinger1_first(size));
1050 BUG_ON(eytzinger1_prev(eytzinger1_first(size), size) != 0);
1051 BUG_ON(eytzinger1_next(eytzinger1_last(size), size) != 0);
1054 eytzinger1_for_each(eytz, size) {
1055 BUG_ON(__inorder_to_eytzinger1(inorder, size, extra) != eytz);
1056 BUG_ON(__eytzinger1_to_inorder(eytz, size, extra) != inorder);
1057 BUG_ON(eytz != eytzinger1_last(size) &&
1058 eytzinger1_prev(eytzinger1_next(eytz, size), size) != eytz);
1065 void eytzinger0_test(void)
1068 unsigned inorder, eytz, size;
1070 pr_info("0 based eytzinger test:");
1075 unsigned extra = eytzinger0_extra(size);
1078 pr_info("tree size %u", size);
1080 BUG_ON(eytzinger0_prev(-1, size) != eytzinger0_last(size));
1081 BUG_ON(eytzinger0_next(-1, size) != eytzinger0_first(size));
1083 BUG_ON(eytzinger0_prev(eytzinger0_first(size), size) != -1);
1084 BUG_ON(eytzinger0_next(eytzinger0_last(size), size) != -1);
1087 eytzinger0_for_each(eytz, size) {
1088 BUG_ON(__inorder_to_eytzinger0(inorder, size, extra) != eytz);
1089 BUG_ON(__eytzinger0_to_inorder(eytz, size, extra) != inorder);
1090 BUG_ON(eytz != eytzinger0_last(size) &&
1091 eytzinger0_prev(eytzinger0_next(eytz, size), size) != eytz);
1098 static inline int cmp_u16(const void *_l, const void *_r, size_t size)
1100 const u16 *l = _l, *r = _r;
1102 return (*l > *r) - (*r - *l);
1105 static void eytzinger0_find_test_val(u16 *test_array, unsigned nr, u16 search)
1107 int i, c1 = -1, c2 = -1;
1110 r = eytzinger0_find_le(test_array, nr,
1111 sizeof(test_array[0]),
1116 for (i = 0; i < nr; i++)
1117 if (test_array[i] <= search && test_array[i] > c2)
1121 eytzinger0_for_each(i, nr)
1122 pr_info("[%3u] = %12u", i, test_array[i]);
1123 pr_info("find_le(%2u) -> [%2zi] = %2i should be %2i",
1128 void eytzinger0_find_test(void)
1130 unsigned i, nr, allocated = 1 << 12;
1131 u16 *test_array = kmalloc_array(allocated, sizeof(test_array[0]), GFP_KERNEL);
1133 for (nr = 1; nr < allocated; nr++) {
1134 pr_info("testing %u elems", nr);
1136 get_random_bytes(test_array, nr * sizeof(test_array[0]));
1137 eytzinger0_sort(test_array, nr, sizeof(test_array[0]), cmp_u16, NULL);
1139 /* verify array is sorted correctly: */
1140 eytzinger0_for_each(i, nr)
1141 BUG_ON(i != eytzinger0_last(nr) &&
1142 test_array[i] > test_array[eytzinger0_next(i, nr)]);
1144 for (i = 0; i < U16_MAX; i += 1 << 12)
1145 eytzinger0_find_test_val(test_array, nr, i);
1147 for (i = 0; i < nr; i++) {
1148 eytzinger0_find_test_val(test_array, nr, test_array[i] - 1);
1149 eytzinger0_find_test_val(test_array, nr, test_array[i]);
1150 eytzinger0_find_test_val(test_array, nr, test_array[i] + 1);
1159 * Accumulate percpu counters onto one cpu's copy - only valid when access
1160 * against any percpu counter is guarded against
1162 u64 *bch2_acc_percpu_u64s(u64 __percpu *p, unsigned nr)
1167 /* access to pcpu vars has to be blocked by other locking */
1169 ret = this_cpu_ptr(p);
1172 for_each_possible_cpu(cpu) {
1173 u64 *i = per_cpu_ptr(p, cpu);
1176 acc_u64s(ret, i, nr);
1177 memset(i, 0, nr * sizeof(u64));
1184 void bch2_darray_str_exit(darray_str *d)
1186 darray_for_each(*d, i)
1191 int bch2_split_devs(const char *_dev_name, darray_str *ret)
1195 char *dev_name, *s, *orig;
1197 dev_name = orig = kstrdup(_dev_name, GFP_KERNEL);
1201 while ((s = strsep(&dev_name, ":"))) {
1202 char *p = kstrdup(s, GFP_KERNEL);
1206 if (darray_push(ret, p)) {
1215 bch2_darray_str_exit(ret);