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

   1 #ifndef _BCACHEFS_UTIL_H
   2 #define _BCACHEFS_UTIL_H
   3
   4 #include <linux/bio.h>
   5 #include <linux/blkdev.h>
   6 #include <linux/closure.h>
   7 #include <linux/errno.h>
   8 #include <linux/freezer.h>
   9 #include <linux/kernel.h>
  10 #include <linux/sched/clock.h>
  11 #include <linux/llist.h>
  12 #include <linux/log2.h>
  13 #include <linux/ratelimit.h>
  14 #include <linux/slab.h>
  15 #include <linux/vmalloc.h>
  16 #include <linux/workqueue.h>
  17
  18 #define PAGE_SECTOR_SHIFT       (PAGE_SHIFT - 9)
  19 #define PAGE_SECTORS            (1UL << PAGE_SECTOR_SHIFT)
  20
  21 struct closure;
  22
  23 #ifdef CONFIG_BCACHEFS_DEBUG
  24
  25 #define EBUG_ON(cond)           BUG_ON(cond)
  26 #define atomic_dec_bug(v)       BUG_ON(atomic_dec_return(v) < 0)
  27 #define atomic_inc_bug(v, i)    BUG_ON(atomic_inc_return(v) <= i)
  28 #define atomic_sub_bug(i, v)    BUG_ON(atomic_sub_return(i, v) < 0)
  29 #define atomic_add_bug(i, v)    BUG_ON(atomic_add_return(i, v) < 0)
  30 #define atomic_long_dec_bug(v)          BUG_ON(atomic_long_dec_return(v) < 0)
  31 #define atomic_long_sub_bug(i, v)       BUG_ON(atomic_long_sub_return(i, v) < 0)
  32 #define atomic64_dec_bug(v)     BUG_ON(atomic64_dec_return(v) < 0)
  33 #define atomic64_inc_bug(v, i)  BUG_ON(atomic64_inc_return(v) <= i)
  34 #define atomic64_sub_bug(i, v)  BUG_ON(atomic64_sub_return(i, v) < 0)
  35 #define atomic64_add_bug(i, v)  BUG_ON(atomic64_add_return(i, v) < 0)
  36
  37 #define memcpy(dst, src, len)                                           \
  38 ({                                                                      \
  39         void *_dst = (dst);                                             \
  40         const void *_src = (src);                                       \
  41         size_t _len = (len);                                            \
  42                                                                         \
  43         BUG_ON(!((void *) (_dst) >= (void *) (_src) + (_len) ||         \
  44                  (void *) (_dst) + (_len) <= (void *) (_src)));         \
  45         memcpy(_dst, _src, _len);                                       \
  46 })
  47
  48 #else /* DEBUG */
  49
  50 #define EBUG_ON(cond)
  51 #define atomic_dec_bug(v)       atomic_dec(v)
  52 #define atomic_inc_bug(v, i)    atomic_inc(v)
  53 #define atomic_sub_bug(i, v)    atomic_sub(i, v)
  54 #define atomic_add_bug(i, v)    atomic_add(i, v)
  55 #define atomic_long_dec_bug(v)          atomic_long_dec(v)
  56 #define atomic_long_sub_bug(i, v)       atomic_long_sub(i, v)
  57 #define atomic64_dec_bug(v)     atomic64_dec(v)
  58 #define atomic64_inc_bug(v, i)  atomic64_inc(v)
  59 #define atomic64_sub_bug(i, v)  atomic64_sub(i, v)
  60 #define atomic64_add_bug(i, v)  atomic64_add(i, v)
  61
  62 #endif
  63
  64 #ifndef __CHECKER__
  65 #define __flatten __attribute__((flatten))
  66 #else
  67 /* sparse doesn't know about attribute((flatten)) */
  68 #define __flatten
  69 #endif
  70
  71 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
  72 #define CPU_BIG_ENDIAN          0
  73 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
  74 #define CPU_BIG_ENDIAN          1
  75 #endif
  76
  77 /* type hackery */
  78
  79 #define type_is_exact(_val, _type)                                      \
  80         __builtin_types_compatible_p(typeof(_val), _type)
  81
  82 #define type_is(_val, _type)                                            \
  83         (__builtin_types_compatible_p(typeof(_val), _type) ||           \
  84          __builtin_types_compatible_p(typeof(_val), const _type))
  85
  86 static inline void vpfree(void *p, size_t size)
  87 {
  88         if (is_vmalloc_addr(p))
  89                 vfree(p);
  90         else
  91                 free_pages((unsigned long) p, get_order(size));
  92 }
  93
  94 static inline void *vpmalloc(size_t size, gfp_t gfp_mask)
  95 {
  96         return (void *) __get_free_pages(gfp_mask|__GFP_NOWARN,
  97                                          get_order(size)) ?:
  98                 __vmalloc(size, gfp_mask, PAGE_KERNEL);
  99 }
 100
 101 static inline void kvpfree(void *p, size_t size)
 102 {
 103         if (size < PAGE_SIZE)
 104                 kfree(p);
 105         else
 106                 vpfree(p, size);
 107 }
 108
 109 static inline void *kvpmalloc(size_t size, gfp_t gfp_mask)
 110 {
 111         return size < PAGE_SIZE
 112                 ? kmalloc(size, gfp_mask)
 113                 : vpmalloc(size, gfp_mask);
 114 }
 115
 116 int mempool_init_kvpmalloc_pool(mempool_t *, int, size_t);
 117
 118 #define HEAP(type)                                                      \
 119 struct {                                                                \
 120         size_t size, used;                                              \
 121         type *data;                                                     \
 122 }
 123
 124 #define DECLARE_HEAP(type, name) HEAP(type) name
 125
 126 #define init_heap(heap, _size, gfp)                                     \
 127 ({                                                                      \
 128         (heap)->used = 0;                                               \
 129         (heap)->size = (_size);                                         \
 130         (heap)->data = kvpmalloc((heap)->size * sizeof((heap)->data[0]),\
 131                                  (gfp));                                \
 132 })
 133
 134 #define free_heap(heap)                                                 \
 135 do {                                                                    \
 136         kvpfree((heap)->data, (heap)->size * sizeof((heap)->data[0]));  \
 137         (heap)->data = NULL;                                            \
 138 } while (0)
 139
 140 #define heap_swap(h, i, j)      swap((h)->data[i], (h)->data[j])
 141
 142 #define heap_peek(h)                                                    \
 143 ({                                                                      \
 144         EBUG_ON(!(h)->used);                                            \
 145         (h)->data[0];                                                   \
 146 })
 147
 148 #define heap_full(h)    ((h)->used == (h)->size)
 149
 150 #define heap_sift_down(h, i, cmp)                                       \
 151 do {                                                                    \
 152         size_t _c, _j = i;                                              \
 153                                                                         \
 154         for (; _j * 2 + 1 < (h)->used; _j = _c) {                       \
 155                 _c = _j * 2 + 1;                                        \
 156                 if (_c + 1 < (h)->used &&                               \
 157                     cmp(h, (h)->data[_c], (h)->data[_c + 1]) >= 0)      \
 158                         _c++;                                           \
 159                                                                         \
 160                 if (cmp(h, (h)->data[_c], (h)->data[_j]) >= 0)          \
 161                         break;                                          \
 162                 heap_swap(h, _c, _j);                                   \
 163         }                                                               \
 164 } while (0)
 165
 166 #define heap_sift_up(h, i, cmp)                                         \
 167 do {                                                                    \
 168         while (i) {                                                     \
 169                 size_t p = (i - 1) / 2;                                 \
 170                 if (cmp(h, (h)->data[i], (h)->data[p]) >= 0)            \
 171                         break;                                          \
 172                 heap_swap(h, i, p);                                     \
 173                 i = p;                                                  \
 174         }                                                               \
 175 } while (0)
 176
 177 #define __heap_add(h, d, cmp)                                           \
 178 do {                                                                    \
 179         size_t _i = (h)->used++;                                        \
 180         (h)->data[_i] = d;                                              \
 181                                                                         \
 182         heap_sift_up(h, _i, cmp);                                       \
 183 } while (0)
 184
 185 #define heap_add(h, d, cmp)                                             \
 186 ({                                                                      \
 187         bool _r = !heap_full(h);                                        \
 188         if (_r)                                                         \
 189                 __heap_add(h, d, cmp);                                  \
 190         _r;                                                             \
 191 })
 192
 193 #define heap_add_or_replace(h, new, cmp)                                \
 194 do {                                                                    \
 195         if (!heap_add(h, new, cmp) &&                                   \
 196             cmp(h, new, heap_peek(h)) >= 0) {                           \
 197                 (h)->data[0] = new;                                     \
 198                 heap_sift_down(h, 0, cmp);                              \
 199         }                                                               \
 200 } while (0)
 201
 202 #define heap_del(h, i, cmp)                                             \
 203 do {                                                                    \
 204         size_t _i = (i);                                                \
 205                                                                         \
 206         BUG_ON(_i >= (h)->used);                                        \
 207         (h)->used--;                                                    \
 208         heap_swap(h, _i, (h)->used);                                    \
 209         heap_sift_up(h, _i, cmp);                                       \
 210         heap_sift_down(h, _i, cmp);                                     \
 211 } while (0)
 212
 213 #define heap_pop(h, d, cmp)                                             \
 214 ({                                                                      \
 215         bool _r = (h)->used;                                            \
 216         if (_r) {                                                       \
 217                 (d) = (h)->data[0];                                     \
 218                 heap_del(h, 0, cmp);                                    \
 219         }                                                               \
 220         _r;                                                             \
 221 })
 222
 223 #define heap_resort(heap, cmp)                                          \
 224 do {                                                                    \
 225         ssize_t _i;                                                     \
 226         for (_i = (ssize_t) (heap)->used / 2 -  1; _i >= 0; --_i)       \
 227                 heap_sift_down(heap, _i, cmp);                          \
 228 } while (0)
 229
 230 #define ANYSINT_MAX(t)                                                  \
 231         ((((t) 1 << (sizeof(t) * 8 - 2)) - (t) 1) * (t) 2 + (t) 1)
 232
 233 int bch2_strtoint_h(const char *, int *);
 234 int bch2_strtouint_h(const char *, unsigned int *);
 235 int bch2_strtoll_h(const char *, long long *);
 236 int bch2_strtoull_h(const char *, unsigned long long *);
 237
 238 static inline int bch2_strtol_h(const char *cp, long *res)
 239 {
 240 #if BITS_PER_LONG == 32
 241         return bch2_strtoint_h(cp, (int *) res);
 242 #else
 243         return bch2_strtoll_h(cp, (long long *) res);
 244 #endif
 245 }
 246
 247 static inline int bch2_strtoul_h(const char *cp, long *res)
 248 {
 249 #if BITS_PER_LONG == 32
 250         return bch2_strtouint_h(cp, (unsigned int *) res);
 251 #else
 252         return bch2_strtoull_h(cp, (unsigned long long *) res);
 253 #endif
 254 }
 255
 256 #define strtoi_h(cp, res)                                               \
 257         ( type_is(*res, int)            ? bch2_strtoint_h(cp, (void *) res)\
 258         : type_is(*res, long)           ? bch2_strtol_h(cp, (void *) res)\
 259         : type_is(*res, long long)      ? bch2_strtoll_h(cp, (void *) res)\
 260         : type_is(*res, unsigned)       ? bch2_strtouint_h(cp, (void *) res)\
 261         : type_is(*res, unsigned long)  ? bch2_strtoul_h(cp, (void *) res)\
 262         : type_is(*res, unsigned long long) ? bch2_strtoull_h(cp, (void *) res)\
 263         : -EINVAL)
 264
 265 #define strtoul_safe(cp, var)                                           \
 266 ({                                                                      \
 267         unsigned long _v;                                               \
 268         int _r = kstrtoul(cp, 10, &_v);                                 \
 269         if (!_r)                                                        \
 270                 var = _v;                                               \
 271         _r;                                                             \
 272 })
 273
 274 #define strtoul_safe_clamp(cp, var, min, max)                           \
 275 ({                                                                      \
 276         unsigned long _v;                                               \
 277         int _r = kstrtoul(cp, 10, &_v);                                 \
 278         if (!_r)                                                        \
 279                 var = clamp_t(typeof(var), _v, min, max);               \
 280         _r;                                                             \
 281 })
 282
 283 #define strtoul_safe_restrict(cp, var, min, max)                        \
 284 ({                                                                      \
 285         unsigned long _v;                                               \
 286         int _r = kstrtoul(cp, 10, &_v);                                 \
 287         if (!_r && _v >= min && _v <= max)                              \
 288                 var = _v;                                               \
 289         else                                                            \
 290                 _r = -EINVAL;                                           \
 291         _r;                                                             \
 292 })
 293
 294 #define snprint(buf, size, var)                                         \
 295         snprintf(buf, size,                                             \
 296                    type_is(var, int)            ? "%i\n"                \
 297                  : type_is(var, unsigned)       ? "%u\n"                \
 298                  : type_is(var, long)           ? "%li\n"               \
 299                  : type_is(var, unsigned long)  ? "%lu\n"               \
 300                  : type_is(var, s64)            ? "%lli\n"              \
 301                  : type_is(var, u64)            ? "%llu\n"              \
 302                  : type_is(var, char *)         ? "%s\n"                \
 303                  : "%i\n", var)
 304
 305 ssize_t bch2_hprint(char *buf, s64 v);
 306
 307 bool bch2_is_zero(const void *, size_t);
 308
 309 ssize_t bch2_scnprint_string_list(char *, size_t, const char * const[], size_t);
 310
 311 ssize_t bch2_scnprint_flag_list(char *, size_t, const char * const[], u64);
 312 u64 bch2_read_flag_list(char *, const char * const[]);
 313
 314 #define NR_QUANTILES    15
 315 #define QUANTILE_IDX(i) inorder_to_eytzinger0(i, NR_QUANTILES)
 316 #define QUANTILE_FIRST  eytzinger0_first(NR_QUANTILES)
 317 #define QUANTILE_LAST   eytzinger0_last(NR_QUANTILES)
 318
 319 struct quantiles {
 320         struct quantile_entry {
 321                 u64     m;
 322                 u64     step;
 323         }               entries[NR_QUANTILES];
 324 };
 325
 326 struct time_stat_buffer {
 327         unsigned        nr;
 328         struct time_stat_buffer_entry {
 329                 u64     start;
 330                 u64     end;
 331         }               entries[32];
 332 };
 333
 334 struct time_stats {
 335         spinlock_t      lock;
 336         u64             count;
 337         /* all fields are in nanoseconds */
 338         u64             average_duration;
 339         u64             average_frequency;
 340         u64             max_duration;
 341         u64             last_event;
 342         struct quantiles quantiles;
 343
 344         struct time_stat_buffer __percpu *buffer;
 345 };
 346
 347 void __bch2_time_stats_update(struct time_stats *stats, u64, u64);
 348
 349 static inline void bch2_time_stats_update(struct time_stats *stats, u64 start)
 350 {
 351         __bch2_time_stats_update(stats, start, local_clock());
 352 }
 353
 354 size_t bch2_time_stats_print(struct time_stats *, char *, size_t);
 355
 356 void bch2_time_stats_exit(struct time_stats *);
 357 void bch2_time_stats_init(struct time_stats *);
 358
 359 #define ewma_add(ewma, val, weight)                                     \
 360 ({                                                                      \
 361         typeof(ewma) _ewma = (ewma);                                    \
 362         typeof(weight) _weight = (weight);                              \
 363                                                                         \
 364         (((_ewma << _weight) - _ewma) + (val)) >> _weight;              \
 365 })
 366
 367 struct bch_ratelimit {
 368         /* Next time we want to do some work, in nanoseconds */
 369         u64                     next;
 370
 371         /*
 372          * Rate at which we want to do work, in units per nanosecond
 373          * The units here correspond to the units passed to
 374          * bch2_ratelimit_increment()
 375          */
 376         unsigned                rate;
 377 };
 378
 379 static inline void bch2_ratelimit_reset(struct bch_ratelimit *d)
 380 {
 381         d->next = local_clock();
 382 }
 383
 384 u64 bch2_ratelimit_delay(struct bch_ratelimit *);
 385 void bch2_ratelimit_increment(struct bch_ratelimit *, u64);
 386 int bch2_ratelimit_wait_freezable_stoppable(struct bch_ratelimit *);
 387
 388 struct bch_pd_controller {
 389         struct bch_ratelimit    rate;
 390         unsigned long           last_update;
 391
 392         s64                     last_actual;
 393         s64                     smoothed_derivative;
 394
 395         unsigned                p_term_inverse;
 396         unsigned                d_smooth;
 397         unsigned                d_term;
 398
 399         /* for exporting to sysfs (no effect on behavior) */
 400         s64                     last_derivative;
 401         s64                     last_proportional;
 402         s64                     last_change;
 403         s64                     last_target;
 404
 405         /* If true, the rate will not increase if bch2_ratelimit_delay()
 406          * is not being called often enough. */
 407         bool                    backpressure;
 408 };
 409
 410 void bch2_pd_controller_update(struct bch_pd_controller *, s64, s64, int);
 411 void bch2_pd_controller_init(struct bch_pd_controller *);
 412 size_t bch2_pd_controller_print_debug(struct bch_pd_controller *, char *);
 413
 414 #define sysfs_pd_controller_attribute(name)                             \
 415         rw_attribute(name##_rate);                                      \
 416         rw_attribute(name##_rate_bytes);                                \
 417         rw_attribute(name##_rate_d_term);                               \
 418         rw_attribute(name##_rate_p_term_inverse);                       \
 419         read_attribute(name##_rate_debug)
 420
 421 #define sysfs_pd_controller_files(name)                                 \
 422         &sysfs_##name##_rate,                                           \
 423         &sysfs_##name##_rate_bytes,                                     \
 424         &sysfs_##name##_rate_d_term,                                    \
 425         &sysfs_##name##_rate_p_term_inverse,                            \
 426         &sysfs_##name##_rate_debug
 427
 428 #define sysfs_pd_controller_show(name, var)                             \
 429 do {                                                                    \
 430         sysfs_hprint(name##_rate,               (var)->rate.rate);      \
 431         sysfs_print(name##_rate_bytes,          (var)->rate.rate);      \
 432         sysfs_print(name##_rate_d_term,         (var)->d_term);         \
 433         sysfs_print(name##_rate_p_term_inverse, (var)->p_term_inverse); \
 434                                                                         \
 435         if (attr == &sysfs_##name##_rate_debug)                         \
 436                 return bch2_pd_controller_print_debug(var, buf);                \
 437 } while (0)
 438
 439 #define sysfs_pd_controller_store(name, var)                            \
 440 do {                                                                    \
 441         sysfs_strtoul_clamp(name##_rate,                                \
 442                             (var)->rate.rate, 1, UINT_MAX);             \
 443         sysfs_strtoul_clamp(name##_rate_bytes,                          \
 444                             (var)->rate.rate, 1, UINT_MAX);             \
 445         sysfs_strtoul(name##_rate_d_term,       (var)->d_term);         \
 446         sysfs_strtoul_clamp(name##_rate_p_term_inverse,                 \
 447                             (var)->p_term_inverse, 1, INT_MAX);         \
 448 } while (0)
 449
 450 #define __DIV_SAFE(n, d, zero)                                          \
 451 ({                                                                      \
 452         typeof(n) _n = (n);                                             \
 453         typeof(d) _d = (d);                                             \
 454         _d ? _n / _d : zero;                                            \
 455 })
 456
 457 #define DIV_SAFE(n, d)  __DIV_SAFE(n, d, 0)
 458
 459 #define container_of_or_null(ptr, type, member)                         \
 460 ({                                                                      \
 461         typeof(ptr) _ptr = ptr;                                         \
 462         _ptr ? container_of(_ptr, type, member) : NULL;                 \
 463 })
 464
 465 #define RB_INSERT(root, new, member, cmp)                               \
 466 ({                                                                      \
 467         __label__ dup;                                                  \
 468         struct rb_node **n = &(root)->rb_node, *parent = NULL;          \
 469         typeof(new) this;                                               \
 470         int res, ret = -1;                                              \
 471                                                                         \
 472         while (*n) {                                                    \
 473                 parent = *n;                                            \
 474                 this = container_of(*n, typeof(*(new)), member);        \
 475                 res = cmp(new, this);                                   \
 476                 if (!res)                                               \
 477                         goto dup;                                       \
 478                 n = res < 0                                             \
 479                         ? &(*n)->rb_left                                \
 480                         : &(*n)->rb_right;                              \
 481         }                                                               \
 482                                                                         \
 483         rb_link_node(&(new)->member, parent, n);                        \
 484         rb_insert_color(&(new)->member, root);                          \
 485         ret = 0;                                                        \
 486 dup:                                                                    \
 487         ret;                                                            \
 488 })
 489
 490 #define RB_SEARCH(root, search, member, cmp)                            \
 491 ({                                                                      \
 492         struct rb_node *n = (root)->rb_node;                            \
 493         typeof(&(search)) this, ret = NULL;                             \
 494         int res;                                                        \
 495                                                                         \
 496         while (n) {                                                     \
 497                 this = container_of(n, typeof(search), member);         \
 498                 res = cmp(&(search), this);                             \
 499                 if (!res) {                                             \
 500                         ret = this;                                     \
 501                         break;                                          \
 502                 }                                                       \
 503                 n = res < 0                                             \
 504                         ? n->rb_left                                    \
 505                         : n->rb_right;                                  \
 506         }                                                               \
 507         ret;                                                            \
 508 })
 509
 510 #define RB_GREATER(root, search, member, cmp)                           \
 511 ({                                                                      \
 512         struct rb_node *n = (root)->rb_node;                            \
 513         typeof(&(search)) this, ret = NULL;                             \
 514         int res;                                                        \
 515                                                                         \
 516         while (n) {                                                     \
 517                 this = container_of(n, typeof(search), member);         \
 518                 res = cmp(&(search), this);                             \
 519                 if (res < 0) {                                          \
 520                         ret = this;                                     \
 521                         n = n->rb_left;                                 \
 522                 } else                                                  \
 523                         n = n->rb_right;                                \
 524         }                                                               \
 525         ret;                                                            \
 526 })
 527
 528 #define RB_FIRST(root, type, member)                                    \
 529         container_of_or_null(rb_first(root), type, member)
 530
 531 #define RB_LAST(root, type, member)                                     \
 532         container_of_or_null(rb_last(root), type, member)
 533
 534 #define RB_NEXT(ptr, member)                                            \
 535         container_of_or_null(rb_next(&(ptr)->member), typeof(*ptr), member)
 536
 537 #define RB_PREV(ptr, member)                                            \
 538         container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
 539
 540 /* Does linear interpolation between powers of two */
 541 static inline unsigned fract_exp_two(unsigned x, unsigned fract_bits)
 542 {
 543         unsigned fract = x & ~(~0 << fract_bits);
 544
 545         x >>= fract_bits;
 546         x   = 1 << x;
 547         x  += (x * fract) >> fract_bits;
 548
 549         return x;
 550 }
 551
 552 void bch2_bio_map(struct bio *bio, void *base);
 553 int bch2_bio_alloc_pages(struct bio *bio, gfp_t gfp_mask);
 554
 555 static inline sector_t bdev_sectors(struct block_device *bdev)
 556 {
 557         return bdev->bd_inode->i_size >> 9;
 558 }
 559
 560 #define closure_bio_submit(bio, cl)                                     \
 561 do {                                                                    \
 562         closure_get(cl);                                                \
 563         submit_bio(bio);                                                \
 564 } while (0)
 565
 566 #define kthread_wait_freezable(cond)                                    \
 567 ({                                                                      \
 568         int _ret = 0;                                                   \
 569         while (1) {                                                     \
 570                 set_current_state(TASK_INTERRUPTIBLE);                  \
 571                 if (kthread_should_stop()) {                            \
 572                         _ret = -1;                                      \
 573                         break;                                          \
 574                 }                                                       \
 575                                                                         \
 576                 if (cond)                                               \
 577                         break;                                          \
 578                                                                         \
 579                 schedule();                                             \
 580                 try_to_freeze();                                        \
 581         }                                                               \
 582         set_current_state(TASK_RUNNING);                                \
 583         _ret;                                                           \
 584 })
 585
 586 size_t bch2_rand_range(size_t);
 587
 588 void memcpy_to_bio(struct bio *, struct bvec_iter, void *);
 589 void memcpy_from_bio(void *, struct bio *, struct bvec_iter);
 590
 591 static inline void __memcpy_u64s(void *dst, const void *src,
 592                                  unsigned u64s)
 593 {
 594 #ifdef CONFIG_X86_64
 595         long d0, d1, d2;
 596         asm volatile("rep ; movsq"
 597                      : "=&c" (d0), "=&D" (d1), "=&S" (d2)
 598                      : "0" (u64s), "1" (dst), "2" (src)
 599                      : "memory");
 600 #else
 601         u64 *d = dst;
 602         const u64 *s = src;
 603
 604         while (u64s--)
 605                 *d++ = *s++;
 606 #endif
 607 }
 608
 609 static inline void memcpy_u64s(void *dst, const void *src,
 610                                unsigned u64s)
 611 {
 612         EBUG_ON(!(dst >= src + u64s * sizeof(u64) ||
 613                  dst + u64s * sizeof(u64) <= src));
 614
 615         __memcpy_u64s(dst, src, u64s);
 616 }
 617
 618 static inline void __memmove_u64s_down(void *dst, const void *src,
 619                                        unsigned u64s)
 620 {
 621         __memcpy_u64s(dst, src, u64s);
 622 }
 623
 624 static inline void memmove_u64s_down(void *dst, const void *src,
 625                                      unsigned u64s)
 626 {
 627         EBUG_ON(dst > src);
 628
 629         __memmove_u64s_down(dst, src, u64s);
 630 }
 631
 632 static inline void __memmove_u64s_up(void *_dst, const void *_src,
 633                                      unsigned u64s)
 634 {
 635         u64 *dst = (u64 *) _dst + u64s - 1;
 636         u64 *src = (u64 *) _src + u64s - 1;
 637
 638 #ifdef CONFIG_X86_64
 639         long d0, d1, d2;
 640         asm volatile("std ;\n"
 641                      "rep ; movsq\n"
 642                      "cld ;\n"
 643                      : "=&c" (d0), "=&D" (d1), "=&S" (d2)
 644                      : "0" (u64s), "1" (dst), "2" (src)
 645                      : "memory");
 646 #else
 647         while (u64s--)
 648                 *dst-- = *src--;
 649 #endif
 650 }
 651
 652 static inline void memmove_u64s_up(void *dst, const void *src,
 653                                    unsigned u64s)
 654 {
 655         EBUG_ON(dst < src);
 656
 657         __memmove_u64s_up(dst, src, u64s);
 658 }
 659
 660 static inline void memmove_u64s(void *dst, const void *src,
 661                                 unsigned u64s)
 662 {
 663         if (dst < src)
 664                 __memmove_u64s_down(dst, src, u64s);
 665         else
 666                 __memmove_u64s_up(dst, src, u64s);
 667 }
 668
 669 static inline struct bio_vec next_contig_bvec(struct bio *bio,
 670                                               struct bvec_iter *iter)
 671 {
 672         struct bio_vec bv = bio_iter_iovec(bio, *iter);
 673
 674         bio_advance_iter(bio, iter, bv.bv_len);
 675 #ifndef CONFIG_HIGHMEM
 676         while (iter->bi_size) {
 677                 struct bio_vec next = bio_iter_iovec(bio, *iter);
 678
 679                 if (page_address(bv.bv_page) + bv.bv_offset + bv.bv_len !=
 680                     page_address(next.bv_page) + next.bv_offset)
 681                         break;
 682
 683                 bv.bv_len += next.bv_len;
 684                 bio_advance_iter(bio, iter, next.bv_len);
 685         }
 686 #endif
 687         return bv;
 688 }
 689
 690 #define __bio_for_each_contig_segment(bv, bio, iter, start)             \
 691         for (iter = (start);                                            \
 692              (iter).bi_size &&                                          \
 693                 ((bv = next_contig_bvec((bio), &(iter))), 1);)
 694
 695 #define bio_for_each_contig_segment(bv, bio, iter)                      \
 696         __bio_for_each_contig_segment(bv, bio, iter, (bio)->bi_iter)
 697
 698 size_t bch_scnmemcpy(char *, size_t, const char *, size_t);
 699
 700 void sort_cmp_size(void *base, size_t num, size_t size,
 701           int (*cmp_func)(const void *, const void *, size_t),
 702           void (*swap_func)(void *, void *, size_t));
 703
 704 /* just the memmove, doesn't update @_nr */
 705 #define __array_insert_item(_array, _nr, _pos)                          \
 706         memmove(&(_array)[(_pos) + 1],                                  \
 707                 &(_array)[(_pos)],                                      \
 708                 sizeof((_array)[0]) * ((_nr) - (_pos)))
 709
 710 #define array_insert_item(_array, _nr, _pos, _new_item)                 \
 711 do {                                                                    \
 712         __array_insert_item(_array, _nr, _pos);                         \
 713         (_nr)++;                                                        \
 714         (_array)[(_pos)] = (_new_item);                                 \
 715 } while (0)
 716
 717 #define array_remove_items(_array, _nr, _pos, _nr_to_remove)            \
 718 do {                                                                    \
 719         (_nr) -= (_nr_to_remove);                                       \
 720         memmove(&(_array)[(_pos)],                                      \
 721                 &(_array)[(_pos) + (_nr_to_remove)],                    \
 722                 sizeof((_array)[0]) * ((_nr) - (_pos)));                \
 723 } while (0)
 724
 725 #define array_remove_item(_array, _nr, _pos)                            \
 726         array_remove_items(_array, _nr, _pos, 1)
 727
 728 #define bubble_sort(_base, _nr, _cmp)                                   \
 729 do {                                                                    \
 730         ssize_t _i, _end;                                               \
 731         bool _swapped = true;                                           \
 732                                                                         \
 733         for (_end = (ssize_t) (_nr) - 1; _end > 0 && _swapped; --_end) {\
 734                 _swapped = false;                                       \
 735                 for (_i = 0; _i < _end; _i++)                           \
 736                         if (_cmp((_base)[_i], (_base)[_i + 1]) > 0) {   \
 737                                 swap((_base)[_i], (_base)[_i + 1]);     \
 738                                 _swapped = true;                        \
 739                         }                                               \
 740         }                                                               \
 741 } while (0)
 742
 743 #endif /* _BCACHEFS_UTIL_H */