git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/util.h

   1 /* SPDX-License-Identifier: GPL-2.0 */
   2 #ifndef _BCACHEFS_UTIL_H
   3 #define _BCACHEFS_UTIL_H
   4
   5 #include <linux/bio.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>
  20
  21 #include "mean_and_variance.h"
  22
  23 #include "darray.h"
  24
  25 struct closure;
  26
  27 #ifdef CONFIG_BCACHEFS_DEBUG
  28 #define EBUG_ON(cond)           BUG_ON(cond)
  29 #else
  30 #define EBUG_ON(cond)
  31 #endif
  32
  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
  37 #endif
  38
  39 /* type hackery */
  40
  41 #define type_is_exact(_val, _type)                                      \
  42         __builtin_types_compatible_p(typeof(_val), _type)
  43
  44 #define type_is(_val, _type)                                            \
  45         (__builtin_types_compatible_p(typeof(_val), _type) ||           \
  46          __builtin_types_compatible_p(typeof(_val), const _type))
  47
  48 /* Userspace doesn't align allocations as nicely as the kernel allocators: */
  49 static inline size_t buf_pages(void *p, size_t len)
  50 {
  51         return DIV_ROUND_UP(len +
  52                             ((unsigned long) p & (PAGE_SIZE - 1)),
  53                             PAGE_SIZE);
  54 }
  55
  56 static inline void vpfree(void *p, size_t size)
  57 {
  58         if (is_vmalloc_addr(p))
  59                 vfree(p);
  60         else
  61                 free_pages((unsigned long) p, get_order(size));
  62 }
  63
  64 static inline void *vpmalloc(size_t size, gfp_t gfp_mask)
  65 {
  66         return (void *) __get_free_pages(gfp_mask|__GFP_NOWARN,
  67                                          get_order(size)) ?:
  68                 __vmalloc(size, gfp_mask);
  69 }
  70
  71 static inline void kvpfree(void *p, size_t size)
  72 {
  73         if (size < PAGE_SIZE)
  74                 kfree(p);
  75         else
  76                 vpfree(p, size);
  77 }
  78
  79 static inline void *kvpmalloc(size_t size, gfp_t gfp_mask)
  80 {
  81         return size < PAGE_SIZE
  82                 ? kmalloc(size, gfp_mask)
  83                 : vpmalloc(size, gfp_mask);
  84 }
  85
  86 int mempool_init_kvpmalloc_pool(mempool_t *, int, size_t);
  87
  88 #define HEAP(type)                                                      \
  89 struct {                                                                \
  90         size_t size, used;                                              \
  91         type *data;                                                     \
  92 }
  93
  94 #define DECLARE_HEAP(type, name) HEAP(type) name
  95
  96 #define init_heap(heap, _size, gfp)                                     \
  97 ({                                                                      \
  98         (heap)->used = 0;                                               \
  99         (heap)->size = (_size);                                         \
 100         (heap)->data = kvpmalloc((heap)->size * sizeof((heap)->data[0]),\
 101                                  (gfp));                                \
 102 })
 103
 104 #define free_heap(heap)                                                 \
 105 do {                                                                    \
 106         kvpfree((heap)->data, (heap)->size * sizeof((heap)->data[0]));  \
 107         (heap)->data = NULL;                                            \
 108 } while (0)
 109
 110 #define heap_set_backpointer(h, i, _fn)                                 \
 111 do {                                                                    \
 112         void (*fn)(typeof(h), size_t) = _fn;                            \
 113         if (fn)                                                         \
 114                 fn(h, i);                                               \
 115 } while (0)
 116
 117 #define heap_swap(h, i, j, set_backpointer)                             \
 118 do {                                                                    \
 119         swap((h)->data[i], (h)->data[j]);                               \
 120         heap_set_backpointer(h, i, set_backpointer);                    \
 121         heap_set_backpointer(h, j, set_backpointer);                    \
 122 } while (0)
 123
 124 #define heap_peek(h)                                                    \
 125 ({                                                                      \
 126         EBUG_ON(!(h)->used);                                            \
 127         (h)->data[0];                                                   \
 128 })
 129
 130 #define heap_full(h)    ((h)->used == (h)->size)
 131
 132 #define heap_sift_down(h, i, cmp, set_backpointer)                      \
 133 do {                                                                    \
 134         size_t _c, _j = i;                                              \
 135                                                                         \
 136         for (; _j * 2 + 1 < (h)->used; _j = _c) {                       \
 137                 _c = _j * 2 + 1;                                        \
 138                 if (_c + 1 < (h)->used &&                               \
 139                     cmp(h, (h)->data[_c], (h)->data[_c + 1]) >= 0)      \
 140                         _c++;                                           \
 141                                                                         \
 142                 if (cmp(h, (h)->data[_c], (h)->data[_j]) >= 0)          \
 143                         break;                                          \
 144                 heap_swap(h, _c, _j, set_backpointer);                  \
 145         }                                                               \
 146 } while (0)
 147
 148 #define heap_sift_up(h, i, cmp, set_backpointer)                        \
 149 do {                                                                    \
 150         while (i) {                                                     \
 151                 size_t p = (i - 1) / 2;                                 \
 152                 if (cmp(h, (h)->data[i], (h)->data[p]) >= 0)            \
 153                         break;                                          \
 154                 heap_swap(h, i, p, set_backpointer);                    \
 155                 i = p;                                                  \
 156         }                                                               \
 157 } while (0)
 158
 159 #define __heap_add(h, d, cmp, set_backpointer)                          \
 160 ({                                                                      \
 161         size_t _i = (h)->used++;                                        \
 162         (h)->data[_i] = d;                                              \
 163         heap_set_backpointer(h, _i, set_backpointer);                   \
 164                                                                         \
 165         heap_sift_up(h, _i, cmp, set_backpointer);                      \
 166         _i;                                                             \
 167 })
 168
 169 #define heap_add(h, d, cmp, set_backpointer)                            \
 170 ({                                                                      \
 171         bool _r = !heap_full(h);                                        \
 172         if (_r)                                                         \
 173                 __heap_add(h, d, cmp, set_backpointer);                 \
 174         _r;                                                             \
 175 })
 176
 177 #define heap_add_or_replace(h, new, cmp, set_backpointer)               \
 178 do {                                                                    \
 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);             \
 184         }                                                               \
 185 } while (0)
 186
 187 #define heap_del(h, i, cmp, set_backpointer)                            \
 188 do {                                                                    \
 189         size_t _i = (i);                                                \
 190                                                                         \
 191         BUG_ON(_i >= (h)->used);                                        \
 192         (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);            \
 197         }                                                               \
 198 } while (0)
 199
 200 #define heap_pop(h, d, cmp, set_backpointer)                            \
 201 ({                                                                      \
 202         bool _r = (h)->used;                                            \
 203         if (_r) {                                                       \
 204                 (d) = (h)->data[0];                                     \
 205                 heap_del(h, 0, cmp, set_backpointer);                   \
 206         }                                                               \
 207         _r;                                                             \
 208 })
 209
 210 #define heap_resort(heap, cmp, set_backpointer)                         \
 211 do {                                                                    \
 212         ssize_t _i;                                                     \
 213         for (_i = (ssize_t) (heap)->used / 2 -  1; _i >= 0; --_i)       \
 214                 heap_sift_down(heap, _i, cmp, set_backpointer);         \
 215 } while (0)
 216
 217 #define ANYSINT_MAX(t)                                                  \
 218         ((((t) 1 << (sizeof(t) * 8 - 2)) - (t) 1) * (t) 2 + (t) 1)
 219
 220 #include "printbuf.h"
 221
 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)
 226
 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)
 230
 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)
 233
 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)
 237
 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__)
 246 #define prt_bitflags_vector(...)        bch2_prt_bitflags_vector(__VA_ARGS__)
 247
 248 void bch2_pr_time_units(struct printbuf *, u64);
 249 void bch2_prt_datetime(struct printbuf *, time64_t);
 250
 251 #ifdef __KERNEL__
 252 static inline void uuid_unparse_lower(u8 *uuid, char *out)
 253 {
 254         sprintf(out, "%pUb", uuid);
 255 }
 256 #else
 257 #include <uuid/uuid.h>
 258 #endif
 259
 260 static inline void pr_uuid(struct printbuf *out, u8 *uuid)
 261 {
 262         char uuid_str[40];
 263
 264         uuid_unparse_lower(uuid, uuid_str);
 265         prt_printf(out, "%s", uuid_str);
 266 }
 267
 268 int bch2_strtoint_h(const char *, int *);
 269 int bch2_strtouint_h(const char *, unsigned int *);
 270 int bch2_strtoll_h(const char *, long long *);
 271 int bch2_strtoull_h(const char *, unsigned long long *);
 272 int bch2_strtou64_h(const char *, u64 *);
 273
 274 static inline int bch2_strtol_h(const char *cp, long *res)
 275 {
 276 #if BITS_PER_LONG == 32
 277         return bch2_strtoint_h(cp, (int *) res);
 278 #else
 279         return bch2_strtoll_h(cp, (long long *) res);
 280 #endif
 281 }
 282
 283 static inline int bch2_strtoul_h(const char *cp, long *res)
 284 {
 285 #if BITS_PER_LONG == 32
 286         return bch2_strtouint_h(cp, (unsigned int *) res);
 287 #else
 288         return bch2_strtoull_h(cp, (unsigned long long *) res);
 289 #endif
 290 }
 291
 292 #define strtoi_h(cp, res)                                               \
 293         ( type_is(*res, int)            ? bch2_strtoint_h(cp, (void *) res)\
 294         : type_is(*res, long)           ? bch2_strtol_h(cp, (void *) res)\
 295         : type_is(*res, long long)      ? bch2_strtoll_h(cp, (void *) res)\
 296         : type_is(*res, unsigned)       ? bch2_strtouint_h(cp, (void *) res)\
 297         : type_is(*res, unsigned long)  ? bch2_strtoul_h(cp, (void *) res)\
 298         : type_is(*res, unsigned long long) ? bch2_strtoull_h(cp, (void *) res)\
 299         : -EINVAL)
 300
 301 #define strtoul_safe(cp, var)                                           \
 302 ({                                                                      \
 303         unsigned long _v;                                               \
 304         int _r = kstrtoul(cp, 10, &_v);                                 \
 305         if (!_r)                                                        \
 306                 var = _v;                                               \
 307         _r;                                                             \
 308 })
 309
 310 #define strtoul_safe_clamp(cp, var, min, max)                           \
 311 ({                                                                      \
 312         unsigned long _v;                                               \
 313         int _r = kstrtoul(cp, 10, &_v);                                 \
 314         if (!_r)                                                        \
 315                 var = clamp_t(typeof(var), _v, min, max);               \
 316         _r;                                                             \
 317 })
 318
 319 #define strtoul_safe_restrict(cp, var, min, max)                        \
 320 ({                                                                      \
 321         unsigned long _v;                                               \
 322         int _r = kstrtoul(cp, 10, &_v);                                 \
 323         if (!_r && _v >= min && _v <= max)                              \
 324                 var = _v;                                               \
 325         else                                                            \
 326                 _r = -EINVAL;                                           \
 327         _r;                                                             \
 328 })
 329
 330 #define snprint(out, var)                                               \
 331         prt_printf(out,                                                 \
 332                    type_is(var, int)            ? "%i\n"                \
 333                  : type_is(var, unsigned)       ? "%u\n"                \
 334                  : type_is(var, long)           ? "%li\n"               \
 335                  : type_is(var, unsigned long)  ? "%lu\n"               \
 336                  : type_is(var, s64)            ? "%lli\n"              \
 337                  : type_is(var, u64)            ? "%llu\n"              \
 338                  : type_is(var, char *)         ? "%s\n"                \
 339                  : "%i\n", var)
 340
 341 bool bch2_is_zero(const void *, size_t);
 342
 343 u64 bch2_read_flag_list(char *, const char * const[]);
 344
 345 void bch2_prt_u64_binary(struct printbuf *, u64, unsigned);
 346
 347 void bch2_print_string_as_lines(const char *prefix, const char *lines);
 348
 349 typedef DARRAY(unsigned long) bch_stacktrace;
 350 int bch2_save_backtrace(bch_stacktrace *stack, struct task_struct *);
 351 void bch2_prt_backtrace(struct printbuf *, bch_stacktrace *);
 352 int bch2_prt_task_backtrace(struct printbuf *, struct task_struct *);
 353
 354 #define NR_QUANTILES    15
 355 #define QUANTILE_IDX(i) inorder_to_eytzinger0(i, NR_QUANTILES)
 356 #define QUANTILE_FIRST  eytzinger0_first(NR_QUANTILES)
 357 #define QUANTILE_LAST   eytzinger0_last(NR_QUANTILES)
 358
 359 struct bch2_quantiles {
 360         struct bch2_quantile_entry {
 361                 u64     m;
 362                 u64     step;
 363         }               entries[NR_QUANTILES];
 364 };
 365
 366 struct bch2_time_stat_buffer {
 367         unsigned        nr;
 368         struct bch2_time_stat_buffer_entry {
 369                 u64     start;
 370                 u64     end;
 371         }               entries[32];
 372 };
 373
 374 struct bch2_time_stats {
 375         spinlock_t      lock;
 376         /* all fields are in nanoseconds */
 377         u64             min_duration;
 378         u64             max_duration;
 379         u64             total_duration;
 380         u64             max_freq;
 381         u64             min_freq;
 382         u64             last_event;
 383         struct bch2_quantiles quantiles;
 384
 385         struct mean_and_variance          duration_stats;
 386         struct mean_and_variance_weighted duration_stats_weighted;
 387         struct mean_and_variance          freq_stats;
 388         struct mean_and_variance_weighted freq_stats_weighted;
 389         struct bch2_time_stat_buffer __percpu *buffer;
 390 };
 391
 392 #ifndef CONFIG_BCACHEFS_NO_LATENCY_ACCT
 393 void __bch2_time_stats_update(struct bch2_time_stats *stats, u64, u64);
 394
 395 static inline void bch2_time_stats_update(struct bch2_time_stats *stats, u64 start)
 396 {
 397         __bch2_time_stats_update(stats, start, local_clock());
 398 }
 399
 400 static inline bool track_event_change(struct bch2_time_stats *stats,
 401                                       u64 *start, bool v)
 402 {
 403         if (v != !!*start) {
 404                 if (!v) {
 405                         bch2_time_stats_update(stats, *start);
 406                         *start = 0;
 407                 } else {
 408                         *start = local_clock() ?: 1;
 409                         return true;
 410                 }
 411         }
 412
 413         return false;
 414 }
 415 #else
 416 static inline void __bch2_time_stats_update(struct bch2_time_stats *stats, u64 start, u64 end) {}
 417 static inline void bch2_time_stats_update(struct bch2_time_stats *stats, u64 start) {}
 418 static inline bool track_event_change(struct bch2_time_stats *stats,
 419                                       u64 *start, bool v)
 420 {
 421         bool ret = v && !*start;
 422         *start = v;
 423         return ret;
 424 }
 425 #endif
 426
 427 void bch2_time_stats_to_text(struct printbuf *, struct bch2_time_stats *);
 428
 429 void bch2_time_stats_exit(struct bch2_time_stats *);
 430 void bch2_time_stats_init(struct bch2_time_stats *);
 431
 432 #define ewma_add(ewma, val, weight)                                     \
 433 ({                                                                      \
 434         typeof(ewma) _ewma = (ewma);                                    \
 435         typeof(weight) _weight = (weight);                              \
 436                                                                         \
 437         (((_ewma << _weight) - _ewma) + (val)) >> _weight;              \
 438 })
 439
 440 struct bch_ratelimit {
 441         /* Next time we want to do some work, in nanoseconds */
 442         u64                     next;
 443
 444         /*
 445          * Rate at which we want to do work, in units per nanosecond
 446          * The units here correspond to the units passed to
 447          * bch2_ratelimit_increment()
 448          */
 449         unsigned                rate;
 450 };
 451
 452 static inline void bch2_ratelimit_reset(struct bch_ratelimit *d)
 453 {
 454         d->next = local_clock();
 455 }
 456
 457 u64 bch2_ratelimit_delay(struct bch_ratelimit *);
 458 void bch2_ratelimit_increment(struct bch_ratelimit *, u64);
 459
 460 struct bch_pd_controller {
 461         struct bch_ratelimit    rate;
 462         unsigned long           last_update;
 463
 464         s64                     last_actual;
 465         s64                     smoothed_derivative;
 466
 467         unsigned                p_term_inverse;
 468         unsigned                d_smooth;
 469         unsigned                d_term;
 470
 471         /* for exporting to sysfs (no effect on behavior) */
 472         s64                     last_derivative;
 473         s64                     last_proportional;
 474         s64                     last_change;
 475         s64                     last_target;
 476
 477         /*
 478          * If true, the rate will not increase if bch2_ratelimit_delay()
 479          * is not being called often enough.
 480          */
 481         bool                    backpressure;
 482 };
 483
 484 void bch2_pd_controller_update(struct bch_pd_controller *, s64, s64, int);
 485 void bch2_pd_controller_init(struct bch_pd_controller *);
 486 void bch2_pd_controller_debug_to_text(struct printbuf *, struct bch_pd_controller *);
 487
 488 #define sysfs_pd_controller_attribute(name)                             \
 489         rw_attribute(name##_rate);                                      \
 490         rw_attribute(name##_rate_bytes);                                \
 491         rw_attribute(name##_rate_d_term);                               \
 492         rw_attribute(name##_rate_p_term_inverse);                       \
 493         read_attribute(name##_rate_debug)
 494
 495 #define sysfs_pd_controller_files(name)                                 \
 496         &sysfs_##name##_rate,                                           \
 497         &sysfs_##name##_rate_bytes,                                     \
 498         &sysfs_##name##_rate_d_term,                                    \
 499         &sysfs_##name##_rate_p_term_inverse,                            \
 500         &sysfs_##name##_rate_debug
 501
 502 #define sysfs_pd_controller_show(name, var)                             \
 503 do {                                                                    \
 504         sysfs_hprint(name##_rate,               (var)->rate.rate);      \
 505         sysfs_print(name##_rate_bytes,          (var)->rate.rate);      \
 506         sysfs_print(name##_rate_d_term,         (var)->d_term);         \
 507         sysfs_print(name##_rate_p_term_inverse, (var)->p_term_inverse); \
 508                                                                         \
 509         if (attr == &sysfs_##name##_rate_debug)                         \
 510                 bch2_pd_controller_debug_to_text(out, var);             \
 511 } while (0)
 512
 513 #define sysfs_pd_controller_store(name, var)                            \
 514 do {                                                                    \
 515         sysfs_strtoul_clamp(name##_rate,                                \
 516                             (var)->rate.rate, 1, UINT_MAX);             \
 517         sysfs_strtoul_clamp(name##_rate_bytes,                          \
 518                             (var)->rate.rate, 1, UINT_MAX);             \
 519         sysfs_strtoul(name##_rate_d_term,       (var)->d_term);         \
 520         sysfs_strtoul_clamp(name##_rate_p_term_inverse,                 \
 521                             (var)->p_term_inverse, 1, INT_MAX);         \
 522 } while (0)
 523
 524 #define container_of_or_null(ptr, type, member)                         \
 525 ({                                                                      \
 526         typeof(ptr) _ptr = ptr;                                         \
 527         _ptr ? container_of(_ptr, type, member) : NULL;                 \
 528 })
 529
 530 /* Does linear interpolation between powers of two */
 531 static inline unsigned fract_exp_two(unsigned x, unsigned fract_bits)
 532 {
 533         unsigned fract = x & ~(~0 << fract_bits);
 534
 535         x >>= fract_bits;
 536         x   = 1 << x;
 537         x  += (x * fract) >> fract_bits;
 538
 539         return x;
 540 }
 541
 542 void bch2_bio_map(struct bio *bio, void *base, size_t);
 543 int bch2_bio_alloc_pages(struct bio *, size_t, gfp_t);
 544
 545 static inline sector_t bdev_sectors(struct block_device *bdev)
 546 {
 547         return bdev->bd_inode->i_size >> 9;
 548 }
 549
 550 #define closure_bio_submit(bio, cl)                                     \
 551 do {                                                                    \
 552         closure_get(cl);                                                \
 553         submit_bio(bio);                                                \
 554 } while (0)
 555
 556 #define kthread_wait(cond)                                              \
 557 ({                                                                      \
 558         int _ret = 0;                                                   \
 559                                                                         \
 560         while (1) {                                                     \
 561                 set_current_state(TASK_INTERRUPTIBLE);                  \
 562                 if (kthread_should_stop()) {                            \
 563                         _ret = -1;                                      \
 564                         break;                                          \
 565                 }                                                       \
 566                                                                         \
 567                 if (cond)                                               \
 568                         break;                                          \
 569                                                                         \
 570                 schedule();                                             \
 571         }                                                               \
 572         set_current_state(TASK_RUNNING);                                \
 573         _ret;                                                           \
 574 })
 575
 576 #define kthread_wait_freezable(cond)                                    \
 577 ({                                                                      \
 578         int _ret = 0;                                                   \
 579         while (1) {                                                     \
 580                 set_current_state(TASK_INTERRUPTIBLE);                  \
 581                 if (kthread_should_stop()) {                            \
 582                         _ret = -1;                                      \
 583                         break;                                          \
 584                 }                                                       \
 585                                                                         \
 586                 if (cond)                                               \
 587                         break;                                          \
 588                                                                         \
 589                 schedule();                                             \
 590                 try_to_freeze();                                        \
 591         }                                                               \
 592         set_current_state(TASK_RUNNING);                                \
 593         _ret;                                                           \
 594 })
 595
 596 size_t bch2_rand_range(size_t);
 597
 598 void memcpy_to_bio(struct bio *, struct bvec_iter, const void *);
 599 void memcpy_from_bio(void *, struct bio *, struct bvec_iter);
 600
 601 static inline void memcpy_u64s_small(void *dst, const void *src,
 602                                      unsigned u64s)
 603 {
 604         u64 *d = dst;
 605         const u64 *s = src;
 606
 607         while (u64s--)
 608                 *d++ = *s++;
 609 }
 610
 611 static inline void __memcpy_u64s(void *dst, const void *src,
 612                                  unsigned u64s)
 613 {
 614 #ifdef CONFIG_X86_64
 615         long d0, d1, d2;
 616
 617         asm volatile("rep ; movsq"
 618                      : "=&c" (d0), "=&D" (d1), "=&S" (d2)
 619                      : "0" (u64s), "1" (dst), "2" (src)
 620                      : "memory");
 621 #else
 622         u64 *d = dst;
 623         const u64 *s = src;
 624
 625         while (u64s--)
 626                 *d++ = *s++;
 627 #endif
 628 }
 629
 630 static inline void memcpy_u64s(void *dst, const void *src,
 631                                unsigned u64s)
 632 {
 633         EBUG_ON(!(dst >= src + u64s * sizeof(u64) ||
 634                  dst + u64s * sizeof(u64) <= src));
 635
 636         __memcpy_u64s(dst, src, u64s);
 637 }
 638
 639 static inline void __memmove_u64s_down(void *dst, const void *src,
 640                                        unsigned u64s)
 641 {
 642         __memcpy_u64s(dst, src, u64s);
 643 }
 644
 645 static inline void memmove_u64s_down(void *dst, const void *src,
 646                                      unsigned u64s)
 647 {
 648         EBUG_ON(dst > src);
 649
 650         __memmove_u64s_down(dst, src, u64s);
 651 }
 652
 653 static inline void __memmove_u64s_down_small(void *dst, const void *src,
 654                                        unsigned u64s)
 655 {
 656         memcpy_u64s_small(dst, src, u64s);
 657 }
 658
 659 static inline void memmove_u64s_down_small(void *dst, const void *src,
 660                                      unsigned u64s)
 661 {
 662         EBUG_ON(dst > src);
 663
 664         __memmove_u64s_down_small(dst, src, u64s);
 665 }
 666
 667 static inline void __memmove_u64s_up_small(void *_dst, const void *_src,
 668                                            unsigned u64s)
 669 {
 670         u64 *dst = (u64 *) _dst + u64s;
 671         u64 *src = (u64 *) _src + u64s;
 672
 673         while (u64s--)
 674                 *--dst = *--src;
 675 }
 676
 677 static inline void memmove_u64s_up_small(void *dst, const void *src,
 678                                          unsigned u64s)
 679 {
 680         EBUG_ON(dst < src);
 681
 682         __memmove_u64s_up_small(dst, src, u64s);
 683 }
 684
 685 static inline void __memmove_u64s_up(void *_dst, const void *_src,
 686                                      unsigned u64s)
 687 {
 688         u64 *dst = (u64 *) _dst + u64s - 1;
 689         u64 *src = (u64 *) _src + u64s - 1;
 690
 691 #ifdef CONFIG_X86_64
 692         long d0, d1, d2;
 693
 694         asm volatile("std ;\n"
 695                      "rep ; movsq\n"
 696                      "cld ;\n"
 697                      : "=&c" (d0), "=&D" (d1), "=&S" (d2)
 698                      : "0" (u64s), "1" (dst), "2" (src)
 699                      : "memory");
 700 #else
 701         while (u64s--)
 702                 *dst-- = *src--;
 703 #endif
 704 }
 705
 706 static inline void memmove_u64s_up(void *dst, const void *src,
 707                                    unsigned u64s)
 708 {
 709         EBUG_ON(dst < src);
 710
 711         __memmove_u64s_up(dst, src, u64s);
 712 }
 713
 714 static inline void memmove_u64s(void *dst, const void *src,
 715                                 unsigned u64s)
 716 {
 717         if (dst < src)
 718                 __memmove_u64s_down(dst, src, u64s);
 719         else
 720                 __memmove_u64s_up(dst, src, u64s);
 721 }
 722
 723 /* Set the last few bytes up to a u64 boundary given an offset into a buffer. */
 724 static inline void memset_u64s_tail(void *s, int c, unsigned bytes)
 725 {
 726         unsigned rem = round_up(bytes, sizeof(u64)) - bytes;
 727
 728         memset(s + bytes, c, rem);
 729 }
 730
 731 void sort_cmp_size(void *base, size_t num, size_t size,
 732           int (*cmp_func)(const void *, const void *, size_t),
 733           void (*swap_func)(void *, void *, size_t));
 734
 735 /* just the memmove, doesn't update @_nr */
 736 #define __array_insert_item(_array, _nr, _pos)                          \
 737         memmove(&(_array)[(_pos) + 1],                                  \
 738                 &(_array)[(_pos)],                                      \
 739                 sizeof((_array)[0]) * ((_nr) - (_pos)))
 740
 741 #define array_insert_item(_array, _nr, _pos, _new_item)                 \
 742 do {                                                                    \
 743         __array_insert_item(_array, _nr, _pos);                         \
 744         (_nr)++;                                                        \
 745         (_array)[(_pos)] = (_new_item);                                 \
 746 } while (0)
 747
 748 #define array_remove_items(_array, _nr, _pos, _nr_to_remove)            \
 749 do {                                                                    \
 750         (_nr) -= (_nr_to_remove);                                       \
 751         memmove(&(_array)[(_pos)],                                      \
 752                 &(_array)[(_pos) + (_nr_to_remove)],                    \
 753                 sizeof((_array)[0]) * ((_nr) - (_pos)));                \
 754 } while (0)
 755
 756 #define array_remove_item(_array, _nr, _pos)                            \
 757         array_remove_items(_array, _nr, _pos, 1)
 758
 759 static inline void __move_gap(void *array, size_t element_size,
 760                               size_t nr, size_t size,
 761                               size_t old_gap, size_t new_gap)
 762 {
 763         size_t gap_end = old_gap + size - nr;
 764
 765         if (new_gap < old_gap) {
 766                 size_t move = old_gap - new_gap;
 767
 768                 memmove(array + element_size * (gap_end - move),
 769                         array + element_size * (old_gap - move),
 770                                 element_size * move);
 771         } else if (new_gap > old_gap) {
 772                 size_t move = new_gap - old_gap;
 773
 774                 memmove(array + element_size * old_gap,
 775                         array + element_size * gap_end,
 776                                 element_size * move);
 777         }
 778 }
 779
 780 /* Move the gap in a gap buffer: */
 781 #define move_gap(_array, _nr, _size, _old_gap, _new_gap)        \
 782         __move_gap(_array, sizeof(_array[0]), _nr, _size, _old_gap, _new_gap)
 783
 784 #define bubble_sort(_base, _nr, _cmp)                                   \
 785 do {                                                                    \
 786         ssize_t _i, _last;                                              \
 787         bool _swapped = true;                                           \
 788                                                                         \
 789         for (_last= (ssize_t) (_nr) - 1; _last > 0 && _swapped; --_last) {\
 790                 _swapped = false;                                       \
 791                 for (_i = 0; _i < _last; _i++)                          \
 792                         if (_cmp((_base)[_i], (_base)[_i + 1]) > 0) {   \
 793                                 swap((_base)[_i], (_base)[_i + 1]);     \
 794                                 _swapped = true;                        \
 795                         }                                               \
 796         }                                                               \
 797 } while (0)
 798
 799 static inline u64 percpu_u64_get(u64 __percpu *src)
 800 {
 801         u64 ret = 0;
 802         int cpu;
 803
 804         for_each_possible_cpu(cpu)
 805                 ret += *per_cpu_ptr(src, cpu);
 806         return ret;
 807 }
 808
 809 static inline void percpu_u64_set(u64 __percpu *dst, u64 src)
 810 {
 811         int cpu;
 812
 813         for_each_possible_cpu(cpu)
 814                 *per_cpu_ptr(dst, cpu) = 0;
 815         this_cpu_write(*dst, src);
 816 }
 817
 818 static inline void acc_u64s(u64 *acc, const u64 *src, unsigned nr)
 819 {
 820         unsigned i;
 821
 822         for (i = 0; i < nr; i++)
 823                 acc[i] += src[i];
 824 }
 825
 826 static inline void acc_u64s_percpu(u64 *acc, const u64 __percpu *src,
 827                                    unsigned nr)
 828 {
 829         int cpu;
 830
 831         for_each_possible_cpu(cpu)
 832                 acc_u64s(acc, per_cpu_ptr(src, cpu), nr);
 833 }
 834
 835 static inline void percpu_memset(void __percpu *p, int c, size_t bytes)
 836 {
 837         int cpu;
 838
 839         for_each_possible_cpu(cpu)
 840                 memset(per_cpu_ptr(p, cpu), c, bytes);
 841 }
 842
 843 u64 *bch2_acc_percpu_u64s(u64 __percpu *, unsigned);
 844
 845 #define cmp_int(l, r)           ((l > r) - (l < r))
 846
 847 static inline int u8_cmp(u8 l, u8 r)
 848 {
 849         return cmp_int(l, r);
 850 }
 851
 852 static inline int cmp_le32(__le32 l, __le32 r)
 853 {
 854         return cmp_int(le32_to_cpu(l), le32_to_cpu(r));
 855 }
 856
 857 #include <linux/uuid.h>
 858
 859 #define QSTR(n) { { { .len = strlen(n) } }, .name = n }
 860
 861 static inline bool qstr_eq(const struct qstr l, const struct qstr r)
 862 {
 863         return l.len == r.len && !memcmp(l.name, r.name, l.len);
 864 }
 865
 866 void bch2_darray_str_exit(darray_str *);
 867 int bch2_split_devs(const char *, darray_str *);
 868
 869 #endif /* _BCACHEFS_UTIL_H */