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>
25 #include <linux/mean_and_variance.h>
27 #include "eytzinger.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)
328 void bch2_prt_datetime(struct printbuf *out, time64_t sec)
331 snprintf(buf, sizeof(buf), "%ptT", &sec);
336 static const struct time_unit {
341 { "us", NSEC_PER_USEC },
342 { "ms", NSEC_PER_MSEC },
343 { "s", NSEC_PER_SEC },
344 { "m", (u64) NSEC_PER_SEC * 60},
345 { "h", (u64) NSEC_PER_SEC * 3600},
349 static const struct time_unit *pick_time_units(u64 ns)
351 const struct time_unit *u;
354 u + 1 < time_units + ARRAY_SIZE(time_units) &&
355 ns >= u[1].nsecs << 1;
362 void bch2_pr_time_units(struct printbuf *out, u64 ns)
364 const struct time_unit *u = pick_time_units(ns);
366 prt_printf(out, "%llu %s", div_u64(ns, u->nsecs), u->name);
371 #ifndef CONFIG_BCACHEFS_NO_LATENCY_ACCT
372 static void bch2_quantiles_update(struct bch2_quantiles *q, u64 v)
376 while (i < ARRAY_SIZE(q->entries)) {
377 struct bch2_quantile_entry *e = q->entries + i;
379 if (unlikely(!e->step)) {
381 e->step = max_t(unsigned, v / 2, 1024);
382 } else if (e->m > v) {
383 e->m = e->m >= e->step
386 } else if (e->m < v) {
387 e->m = e->m + e->step > e->m
392 if ((e->m > v ? e->m - v : v - e->m) < e->step)
393 e->step = max_t(unsigned, e->step / 2, 1);
398 i = eytzinger0_child(i, v > e->m);
402 static inline void bch2_time_stats_update_one(struct bch2_time_stats *stats,
407 if (time_after64(end, start)) {
408 duration = end - start;
409 mean_and_variance_update(&stats->duration_stats, duration);
410 mean_and_variance_weighted_update(&stats->duration_stats_weighted, duration);
411 stats->max_duration = max(stats->max_duration, duration);
412 stats->min_duration = min(stats->min_duration, duration);
413 stats->total_duration += duration;
414 bch2_quantiles_update(&stats->quantiles, duration);
417 if (time_after64(end, stats->last_event)) {
418 freq = end - stats->last_event;
419 mean_and_variance_update(&stats->freq_stats, freq);
420 mean_and_variance_weighted_update(&stats->freq_stats_weighted, freq);
421 stats->max_freq = max(stats->max_freq, freq);
422 stats->min_freq = min(stats->min_freq, freq);
423 stats->last_event = end;
427 static void __bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
428 struct bch2_time_stat_buffer *b)
430 for (struct bch2_time_stat_buffer_entry *i = b->entries;
431 i < b->entries + ARRAY_SIZE(b->entries);
433 bch2_time_stats_update_one(stats, i->start, i->end);
437 static noinline void bch2_time_stats_clear_buffer(struct bch2_time_stats *stats,
438 struct bch2_time_stat_buffer *b)
442 spin_lock_irqsave(&stats->lock, flags);
443 __bch2_time_stats_clear_buffer(stats, b);
444 spin_unlock_irqrestore(&stats->lock, flags);
447 void __bch2_time_stats_update(struct bch2_time_stats *stats, u64 start, u64 end)
451 WARN_RATELIMIT(!stats->min_duration || !stats->min_freq,
452 "time_stats: min_duration = %llu, min_freq = %llu",
453 stats->min_duration, stats->min_freq);
455 if (!stats->buffer) {
456 spin_lock_irqsave(&stats->lock, flags);
457 bch2_time_stats_update_one(stats, start, end);
459 if (mean_and_variance_weighted_get_mean(stats->freq_stats_weighted) < 32 &&
460 stats->duration_stats.n > 1024)
462 alloc_percpu_gfp(struct bch2_time_stat_buffer,
464 spin_unlock_irqrestore(&stats->lock, flags);
466 struct bch2_time_stat_buffer *b;
469 b = this_cpu_ptr(stats->buffer);
471 BUG_ON(b->nr >= ARRAY_SIZE(b->entries));
472 b->entries[b->nr++] = (struct bch2_time_stat_buffer_entry) {
477 if (unlikely(b->nr == ARRAY_SIZE(b->entries)))
478 bch2_time_stats_clear_buffer(stats, b);
483 static void bch2_pr_time_units_aligned(struct printbuf *out, u64 ns)
485 const struct time_unit *u = pick_time_units(ns);
487 prt_printf(out, "%llu ", div64_u64(ns, u->nsecs));
489 prt_printf(out, "%s", u->name);
492 static inline void pr_name_and_units(struct printbuf *out, const char *name, u64 ns)
496 bch2_pr_time_units_aligned(out, ns);
500 #define TABSTOP_SIZE 12
502 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats)
504 const struct time_unit *u;
505 s64 f_mean = 0, d_mean = 0;
506 u64 q, last_q = 0, f_stddev = 0, d_stddev = 0;
512 spin_lock_irq(&stats->lock);
513 for_each_possible_cpu(cpu)
514 __bch2_time_stats_clear_buffer(stats, per_cpu_ptr(stats->buffer, cpu));
515 spin_unlock_irq(&stats->lock);
519 * avoid divide by zero
521 if (stats->freq_stats.n) {
522 f_mean = mean_and_variance_get_mean(stats->freq_stats);
523 f_stddev = mean_and_variance_get_stddev(stats->freq_stats);
524 d_mean = mean_and_variance_get_mean(stats->duration_stats);
525 d_stddev = mean_and_variance_get_stddev(stats->duration_stats);
528 printbuf_tabstop_push(out, out->indent + TABSTOP_SIZE);
529 prt_printf(out, "count:");
531 prt_printf(out, "%llu ",
532 stats->duration_stats.n);
533 printbuf_tabstop_pop(out);
536 printbuf_tabstops_reset(out);
538 printbuf_tabstop_push(out, out->indent + 20);
539 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
540 printbuf_tabstop_push(out, 0);
541 printbuf_tabstop_push(out, TABSTOP_SIZE + 2);
544 prt_printf(out, "since mount");
547 prt_printf(out, "recent");
551 printbuf_tabstops_reset(out);
552 printbuf_tabstop_push(out, out->indent + 20);
553 printbuf_tabstop_push(out, TABSTOP_SIZE);
554 printbuf_tabstop_push(out, 2);
555 printbuf_tabstop_push(out, TABSTOP_SIZE);
557 prt_printf(out, "duration of events");
559 printbuf_indent_add(out, 2);
561 pr_name_and_units(out, "min:", stats->min_duration);
562 pr_name_and_units(out, "max:", stats->max_duration);
563 pr_name_and_units(out, "total:", stats->total_duration);
565 prt_printf(out, "mean:");
567 bch2_pr_time_units_aligned(out, d_mean);
569 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->duration_stats_weighted));
572 prt_printf(out, "stddev:");
574 bch2_pr_time_units_aligned(out, d_stddev);
576 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->duration_stats_weighted));
578 printbuf_indent_sub(out, 2);
581 prt_printf(out, "time between events");
583 printbuf_indent_add(out, 2);
585 pr_name_and_units(out, "min:", stats->min_freq);
586 pr_name_and_units(out, "max:", stats->max_freq);
588 prt_printf(out, "mean:");
590 bch2_pr_time_units_aligned(out, f_mean);
592 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_mean(stats->freq_stats_weighted));
595 prt_printf(out, "stddev:");
597 bch2_pr_time_units_aligned(out, f_stddev);
599 bch2_pr_time_units_aligned(out, mean_and_variance_weighted_get_stddev(stats->freq_stats_weighted));
601 printbuf_indent_sub(out, 2);
604 printbuf_tabstops_reset(out);
606 i = eytzinger0_first(NR_QUANTILES);
607 u = pick_time_units(stats->quantiles.entries[i].m);
609 prt_printf(out, "quantiles (%s):\t", u->name);
610 eytzinger0_for_each(i, NR_QUANTILES) {
611 bool is_last = eytzinger0_next(i, NR_QUANTILES) == -1;
613 q = max(stats->quantiles.entries[i].m, last_q);
614 prt_printf(out, "%llu ",
615 div_u64(q, u->nsecs));
622 void bch2_time_stats_to_text(struct printbuf *out, struct bch2_time_stats *stats) {}
625 void bch2_time_stats_exit(struct bch2_time_stats *stats)
627 free_percpu(stats->buffer);
630 void bch2_time_stats_init(struct bch2_time_stats *stats)
632 memset(stats, 0, sizeof(*stats));
633 stats->duration_stats_weighted.weight = 8;
634 stats->freq_stats_weighted.weight = 8;
635 stats->min_duration = U64_MAX;
636 stats->min_freq = U64_MAX;
637 spin_lock_init(&stats->lock);
643 * bch2_ratelimit_delay() - return how long to delay until the next time to do
645 * @d: the struct bch_ratelimit to update
646 * Returns: the amount of time to delay by, in jiffies
648 u64 bch2_ratelimit_delay(struct bch_ratelimit *d)
650 u64 now = local_clock();
652 return time_after64(d->next, now)
653 ? nsecs_to_jiffies(d->next - now)
658 * bch2_ratelimit_increment() - increment @d by the amount of work done
659 * @d: the struct bch_ratelimit to update
660 * @done: the amount of work done, in arbitrary units
662 void bch2_ratelimit_increment(struct bch_ratelimit *d, u64 done)
664 u64 now = local_clock();
666 d->next += div_u64(done * NSEC_PER_SEC, d->rate);
668 if (time_before64(now + NSEC_PER_SEC, d->next))
669 d->next = now + NSEC_PER_SEC;
671 if (time_after64(now - NSEC_PER_SEC * 2, d->next))
672 d->next = now - NSEC_PER_SEC * 2;
678 * Updates pd_controller. Attempts to scale inputed values to units per second.
679 * @target: desired value
680 * @actual: current value
682 * @sign: 1 or -1; 1 if increasing the rate makes actual go up, -1 if increasing
683 * it makes actual go down.
685 void bch2_pd_controller_update(struct bch_pd_controller *pd,
686 s64 target, s64 actual, int sign)
688 s64 proportional, derivative, change;
690 unsigned long seconds_since_update = (jiffies - pd->last_update) / HZ;
692 if (seconds_since_update == 0)
695 pd->last_update = jiffies;
697 proportional = actual - target;
698 proportional *= seconds_since_update;
699 proportional = div_s64(proportional, pd->p_term_inverse);
701 derivative = actual - pd->last_actual;
702 derivative = div_s64(derivative, seconds_since_update);
703 derivative = ewma_add(pd->smoothed_derivative, derivative,
704 (pd->d_term / seconds_since_update) ?: 1);
705 derivative = derivative * pd->d_term;
706 derivative = div_s64(derivative, pd->p_term_inverse);
708 change = proportional + derivative;
710 /* Don't increase rate if not keeping up */
713 time_after64(local_clock(),
714 pd->rate.next + NSEC_PER_MSEC))
717 change *= (sign * -1);
719 pd->rate.rate = clamp_t(s64, (s64) pd->rate.rate + change,
722 pd->last_actual = actual;
723 pd->last_derivative = derivative;
724 pd->last_proportional = proportional;
725 pd->last_change = change;
726 pd->last_target = target;
729 void bch2_pd_controller_init(struct bch_pd_controller *pd)
731 pd->rate.rate = 1024;
732 pd->last_update = jiffies;
733 pd->p_term_inverse = 6000;
735 pd->d_smooth = pd->d_term;
736 pd->backpressure = 1;
739 void bch2_pd_controller_debug_to_text(struct printbuf *out, struct bch_pd_controller *pd)
741 if (!out->nr_tabstops)
742 printbuf_tabstop_push(out, 20);
744 prt_printf(out, "rate:");
746 prt_human_readable_s64(out, pd->rate.rate);
749 prt_printf(out, "target:");
751 prt_human_readable_u64(out, pd->last_target);
754 prt_printf(out, "actual:");
756 prt_human_readable_u64(out, pd->last_actual);
759 prt_printf(out, "proportional:");
761 prt_human_readable_s64(out, pd->last_proportional);
764 prt_printf(out, "derivative:");
766 prt_human_readable_s64(out, pd->last_derivative);
769 prt_printf(out, "change:");
771 prt_human_readable_s64(out, pd->last_change);
774 prt_printf(out, "next io:");
776 prt_printf(out, "%llims", div64_s64(pd->rate.next - local_clock(), NSEC_PER_MSEC));
782 void bch2_bio_map(struct bio *bio, void *base, size_t size)
785 struct page *page = is_vmalloc_addr(base)
786 ? vmalloc_to_page(base)
787 : virt_to_page(base);
788 unsigned offset = offset_in_page(base);
789 unsigned len = min_t(size_t, PAGE_SIZE - offset, size);
791 BUG_ON(!bio_add_page(bio, page, len, offset));
797 int bch2_bio_alloc_pages(struct bio *bio, size_t size, gfp_t gfp_mask)
800 struct page *page = alloc_pages(gfp_mask, 0);
801 unsigned len = min_t(size_t, PAGE_SIZE, size);
806 if (unlikely(!bio_add_page(bio, page, len, 0))) {
817 size_t bch2_rand_range(size_t max)
825 rand = get_random_long();
826 rand &= roundup_pow_of_two(max) - 1;
827 } while (rand >= max);
832 void memcpy_to_bio(struct bio *dst, struct bvec_iter dst_iter, const void *src)
835 struct bvec_iter iter;
837 __bio_for_each_segment(bv, dst, iter, dst_iter) {
838 void *dstp = kmap_local_page(bv.bv_page);
840 memcpy(dstp + bv.bv_offset, src, bv.bv_len);
847 void memcpy_from_bio(void *dst, struct bio *src, struct bvec_iter src_iter)
850 struct bvec_iter iter;
852 __bio_for_each_segment(bv, src, iter, src_iter) {
853 void *srcp = kmap_local_page(bv.bv_page);
855 memcpy(dst, srcp + bv.bv_offset, bv.bv_len);
862 static int alignment_ok(const void *base, size_t align)
864 return IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) ||
865 ((unsigned long)base & (align - 1)) == 0;
868 static void u32_swap(void *a, void *b, size_t size)
871 *(u32 *)a = *(u32 *)b;
875 static void u64_swap(void *a, void *b, size_t size)
878 *(u64 *)a = *(u64 *)b;
882 static void generic_swap(void *a, void *b, size_t size)
888 *(char *)a++ = *(char *)b;
890 } while (--size > 0);
893 static inline int do_cmp(void *base, size_t n, size_t size,
894 int (*cmp_func)(const void *, const void *, size_t),
897 return cmp_func(base + inorder_to_eytzinger0(l, n) * size,
898 base + inorder_to_eytzinger0(r, n) * size,
902 static inline void do_swap(void *base, size_t n, size_t size,
903 void (*swap_func)(void *, void *, size_t),
906 swap_func(base + inorder_to_eytzinger0(l, n) * size,
907 base + inorder_to_eytzinger0(r, n) * size,
911 void eytzinger0_sort(void *base, size_t n, size_t size,
912 int (*cmp_func)(const void *, const void *, size_t),
913 void (*swap_func)(void *, void *, size_t))
918 if (size == 4 && alignment_ok(base, 4))
919 swap_func = u32_swap;
920 else if (size == 8 && alignment_ok(base, 8))
921 swap_func = u64_swap;
923 swap_func = generic_swap;
927 for (i = n / 2 - 1; i >= 0; --i) {
928 for (r = i; r * 2 + 1 < n; r = c) {
932 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
935 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
938 do_swap(base, n, size, swap_func, r, c);
943 for (i = n - 1; i > 0; --i) {
944 do_swap(base, n, size, swap_func, 0, i);
946 for (r = 0; r * 2 + 1 < i; r = c) {
950 do_cmp(base, n, size, cmp_func, c, c + 1) < 0)
953 if (do_cmp(base, n, size, cmp_func, r, c) >= 0)
956 do_swap(base, n, size, swap_func, r, c);
961 void sort_cmp_size(void *base, size_t num, size_t size,
962 int (*cmp_func)(const void *, const void *, size_t),
963 void (*swap_func)(void *, void *, size_t size))
965 /* pre-scale counters for performance */
966 int i = (num/2 - 1) * size, n = num * size, c, r;
969 if (size == 4 && alignment_ok(base, 4))
970 swap_func = u32_swap;
971 else if (size == 8 && alignment_ok(base, 8))
972 swap_func = u64_swap;
974 swap_func = generic_swap;
978 for ( ; i >= 0; i -= size) {
979 for (r = i; r * 2 + size < n; r = c) {
982 cmp_func(base + c, base + c + size, size) < 0)
984 if (cmp_func(base + r, base + c, size) >= 0)
986 swap_func(base + r, base + c, size);
991 for (i = n - size; i > 0; i -= size) {
992 swap_func(base, base + i, size);
993 for (r = 0; r * 2 + size < i; r = c) {
996 cmp_func(base + c, base + c + size, size) < 0)
998 if (cmp_func(base + r, base + c, size) >= 0)
1000 swap_func(base + r, base + c, size);
1005 static void mempool_free_vp(void *element, void *pool_data)
1007 size_t size = (size_t) pool_data;
1009 vpfree(element, size);
1012 static void *mempool_alloc_vp(gfp_t gfp_mask, void *pool_data)
1014 size_t size = (size_t) pool_data;
1016 return vpmalloc(size, gfp_mask);
1019 int mempool_init_kvpmalloc_pool(mempool_t *pool, int min_nr, size_t size)
1021 return size < PAGE_SIZE
1022 ? mempool_init_kmalloc_pool(pool, min_nr, size)
1023 : mempool_init(pool, min_nr, mempool_alloc_vp,
1024 mempool_free_vp, (void *) size);
1028 void eytzinger1_test(void)
1030 unsigned inorder, eytz, size;
1032 pr_info("1 based eytzinger test:");
1037 unsigned extra = eytzinger1_extra(size);
1040 pr_info("tree size %u", size);
1042 BUG_ON(eytzinger1_prev(0, size) != eytzinger1_last(size));
1043 BUG_ON(eytzinger1_next(0, size) != eytzinger1_first(size));
1045 BUG_ON(eytzinger1_prev(eytzinger1_first(size), size) != 0);
1046 BUG_ON(eytzinger1_next(eytzinger1_last(size), size) != 0);
1049 eytzinger1_for_each(eytz, size) {
1050 BUG_ON(__inorder_to_eytzinger1(inorder, size, extra) != eytz);
1051 BUG_ON(__eytzinger1_to_inorder(eytz, size, extra) != inorder);
1052 BUG_ON(eytz != eytzinger1_last(size) &&
1053 eytzinger1_prev(eytzinger1_next(eytz, size), size) != eytz);
1060 void eytzinger0_test(void)
1063 unsigned inorder, eytz, size;
1065 pr_info("0 based eytzinger test:");
1070 unsigned extra = eytzinger0_extra(size);
1073 pr_info("tree size %u", size);
1075 BUG_ON(eytzinger0_prev(-1, size) != eytzinger0_last(size));
1076 BUG_ON(eytzinger0_next(-1, size) != eytzinger0_first(size));
1078 BUG_ON(eytzinger0_prev(eytzinger0_first(size), size) != -1);
1079 BUG_ON(eytzinger0_next(eytzinger0_last(size), size) != -1);
1082 eytzinger0_for_each(eytz, size) {
1083 BUG_ON(__inorder_to_eytzinger0(inorder, size, extra) != eytz);
1084 BUG_ON(__eytzinger0_to_inorder(eytz, size, extra) != inorder);
1085 BUG_ON(eytz != eytzinger0_last(size) &&
1086 eytzinger0_prev(eytzinger0_next(eytz, size), size) != eytz);
1093 static inline int cmp_u16(const void *_l, const void *_r, size_t size)
1095 const u16 *l = _l, *r = _r;
1097 return (*l > *r) - (*r - *l);
1100 static void eytzinger0_find_test_val(u16 *test_array, unsigned nr, u16 search)
1102 int i, c1 = -1, c2 = -1;
1105 r = eytzinger0_find_le(test_array, nr,
1106 sizeof(test_array[0]),
1111 for (i = 0; i < nr; i++)
1112 if (test_array[i] <= search && test_array[i] > c2)
1116 eytzinger0_for_each(i, nr)
1117 pr_info("[%3u] = %12u", i, test_array[i]);
1118 pr_info("find_le(%2u) -> [%2zi] = %2i should be %2i",
1123 void eytzinger0_find_test(void)
1125 unsigned i, nr, allocated = 1 << 12;
1126 u16 *test_array = kmalloc_array(allocated, sizeof(test_array[0]), GFP_KERNEL);
1128 for (nr = 1; nr < allocated; nr++) {
1129 pr_info("testing %u elems", nr);
1131 get_random_bytes(test_array, nr * sizeof(test_array[0]));
1132 eytzinger0_sort(test_array, nr, sizeof(test_array[0]), cmp_u16, NULL);
1134 /* verify array is sorted correctly: */
1135 eytzinger0_for_each(i, nr)
1136 BUG_ON(i != eytzinger0_last(nr) &&
1137 test_array[i] > test_array[eytzinger0_next(i, nr)]);
1139 for (i = 0; i < U16_MAX; i += 1 << 12)
1140 eytzinger0_find_test_val(test_array, nr, i);
1142 for (i = 0; i < nr; i++) {
1143 eytzinger0_find_test_val(test_array, nr, test_array[i] - 1);
1144 eytzinger0_find_test_val(test_array, nr, test_array[i]);
1145 eytzinger0_find_test_val(test_array, nr, test_array[i] + 1);
1154 * Accumulate percpu counters onto one cpu's copy - only valid when access
1155 * against any percpu counter is guarded against
1157 u64 *bch2_acc_percpu_u64s(u64 __percpu *p, unsigned nr)
1162 /* access to pcpu vars has to be blocked by other locking */
1164 ret = this_cpu_ptr(p);
1167 for_each_possible_cpu(cpu) {
1168 u64 *i = per_cpu_ptr(p, cpu);
1171 acc_u64s(ret, i, nr);
1172 memset(i, 0, nr * sizeof(u64));