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

   1 /* SPDX-License-Identifier: GPL-2.0 */
   2 #ifndef _BCACHEFS_EXTENTS_H
   3 #define _BCACHEFS_EXTENTS_H
   4
   5 #include "bcachefs.h"
   6 #include "bkey.h"
   7 #include "extents_types.h"
   8
   9 struct bch_fs;
  10 struct btree_trans;
  11
  12 /* extent entries: */
  13
  14 #define extent_entry_last(_e)                                           \
  15         ((typeof(&(_e).v->start[0])) bkey_val_end(_e))
  16
  17 #define entry_to_ptr(_entry)                                            \
  18 ({                                                                      \
  19         EBUG_ON((_entry) && !extent_entry_is_ptr(_entry));              \
  20                                                                         \
  21         __builtin_choose_expr(                                          \
  22                 type_is_exact(_entry, const union bch_extent_entry *),  \
  23                 (const struct bch_extent_ptr *) (_entry),               \
  24                 (struct bch_extent_ptr *) (_entry));                    \
  25 })
  26
  27 /* downcast, preserves const */
  28 #define to_entry(_entry)                                                \
  29 ({                                                                      \
  30         BUILD_BUG_ON(!type_is(_entry, union bch_extent_crc *) &&        \
  31                      !type_is(_entry, struct bch_extent_ptr *) &&       \
  32                      !type_is(_entry, struct bch_extent_stripe_ptr *)); \
  33                                                                         \
  34         __builtin_choose_expr(                                          \
  35                 (type_is_exact(_entry, const union bch_extent_crc *) || \
  36                  type_is_exact(_entry, const struct bch_extent_ptr *) ||\
  37                  type_is_exact(_entry, const struct bch_extent_stripe_ptr *)),\
  38                 (const union bch_extent_entry *) (_entry),              \
  39                 (union bch_extent_entry *) (_entry));                   \
  40 })
  41
  42 #define extent_entry_next(_entry)                                       \
  43         ((typeof(_entry)) ((void *) (_entry) + extent_entry_bytes(_entry)))
  44
  45 static inline unsigned
  46 __extent_entry_type(const union bch_extent_entry *e)
  47 {
  48         return e->type ? __ffs(e->type) : BCH_EXTENT_ENTRY_MAX;
  49 }
  50
  51 static inline enum bch_extent_entry_type
  52 extent_entry_type(const union bch_extent_entry *e)
  53 {
  54         int ret = __ffs(e->type);
  55
  56         EBUG_ON(ret < 0 || ret >= BCH_EXTENT_ENTRY_MAX);
  57
  58         return ret;
  59 }
  60
  61 static inline size_t extent_entry_bytes(const union bch_extent_entry *entry)
  62 {
  63         switch (extent_entry_type(entry)) {
  64 #define x(f, n)                                         \
  65         case BCH_EXTENT_ENTRY_##f:                      \
  66                 return sizeof(struct bch_extent_##f);
  67         BCH_EXTENT_ENTRY_TYPES()
  68 #undef x
  69         default:
  70                 BUG();
  71         }
  72 }
  73
  74 static inline size_t extent_entry_u64s(const union bch_extent_entry *entry)
  75 {
  76         return extent_entry_bytes(entry) / sizeof(u64);
  77 }
  78
  79 static inline void __extent_entry_insert(struct bkey_i *k,
  80                                          union bch_extent_entry *dst,
  81                                          union bch_extent_entry *new)
  82 {
  83         union bch_extent_entry *end = bkey_val_end(bkey_i_to_s(k));
  84
  85         memmove_u64s_up_small((u64 *) dst + extent_entry_u64s(new),
  86                               dst, (u64 *) end - (u64 *) dst);
  87         k->k.u64s += extent_entry_u64s(new);
  88         memcpy_u64s_small(dst, new, extent_entry_u64s(new));
  89 }
  90
  91 static inline bool extent_entry_is_ptr(const union bch_extent_entry *e)
  92 {
  93         return extent_entry_type(e) == BCH_EXTENT_ENTRY_ptr;
  94 }
  95
  96 static inline bool extent_entry_is_stripe_ptr(const union bch_extent_entry *e)
  97 {
  98         return extent_entry_type(e) == BCH_EXTENT_ENTRY_stripe_ptr;
  99 }
 100
 101 static inline bool extent_entry_is_crc(const union bch_extent_entry *e)
 102 {
 103         switch (extent_entry_type(e)) {
 104         case BCH_EXTENT_ENTRY_crc32:
 105         case BCH_EXTENT_ENTRY_crc64:
 106         case BCH_EXTENT_ENTRY_crc128:
 107                 return true;
 108         default:
 109                 return false;
 110         }
 111 }
 112
 113 union bch_extent_crc {
 114         u8                              type;
 115         struct bch_extent_crc32         crc32;
 116         struct bch_extent_crc64         crc64;
 117         struct bch_extent_crc128        crc128;
 118 };
 119
 120 #define __entry_to_crc(_entry)                                          \
 121         __builtin_choose_expr(                                          \
 122                 type_is_exact(_entry, const union bch_extent_entry *),  \
 123                 (const union bch_extent_crc *) (_entry),                \
 124                 (union bch_extent_crc *) (_entry))
 125
 126 #define entry_to_crc(_entry)                                            \
 127 ({                                                                      \
 128         EBUG_ON((_entry) && !extent_entry_is_crc(_entry));              \
 129                                                                         \
 130         __entry_to_crc(_entry);                                         \
 131 })
 132
 133 static inline struct bch_extent_crc_unpacked
 134 bch2_extent_crc_unpack(const struct bkey *k, const union bch_extent_crc *crc)
 135 {
 136 #define common_fields(_crc)                                             \
 137                 .csum_type              = _crc.csum_type,               \
 138                 .compression_type       = _crc.compression_type,        \
 139                 .compressed_size        = _crc._compressed_size + 1,    \
 140                 .uncompressed_size      = _crc._uncompressed_size + 1,  \
 141                 .offset                 = _crc.offset,                  \
 142                 .live_size              = k->size
 143
 144         if (!crc)
 145                 return (struct bch_extent_crc_unpacked) {
 146                         .compressed_size        = k->size,
 147                         .uncompressed_size      = k->size,
 148                         .live_size              = k->size,
 149                 };
 150
 151         switch (extent_entry_type(to_entry(crc))) {
 152         case BCH_EXTENT_ENTRY_crc32: {
 153                 struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
 154                         common_fields(crc->crc32),
 155                 };
 156
 157                 *((__le32 *) &ret.csum.lo) = crc->crc32.csum;
 158
 159                 memcpy(&ret.csum.lo, &crc->crc32.csum,
 160                        sizeof(crc->crc32.csum));
 161
 162                 return ret;
 163         }
 164         case BCH_EXTENT_ENTRY_crc64: {
 165                 struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
 166                         common_fields(crc->crc64),
 167                         .nonce                  = crc->crc64.nonce,
 168                         .csum.lo                = (__force __le64) crc->crc64.csum_lo,
 169                 };
 170
 171                 *((__le16 *) &ret.csum.hi) = crc->crc64.csum_hi;
 172
 173                 return ret;
 174         }
 175         case BCH_EXTENT_ENTRY_crc128: {
 176                 struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
 177                         common_fields(crc->crc128),
 178                         .nonce                  = crc->crc128.nonce,
 179                         .csum                   = crc->crc128.csum,
 180                 };
 181
 182                 return ret;
 183         }
 184         default:
 185                 BUG();
 186         }
 187 #undef common_fields
 188 }
 189
 190 static inline bool crc_is_compressed(struct bch_extent_crc_unpacked crc)
 191 {
 192         return (crc.compression_type != BCH_COMPRESSION_TYPE_none &&
 193                 crc.compression_type != BCH_COMPRESSION_TYPE_incompressible);
 194 }
 195
 196 /* bkey_ptrs: generically over any key type that has ptrs */
 197
 198 struct bkey_ptrs_c {
 199         const union bch_extent_entry    *start;
 200         const union bch_extent_entry    *end;
 201 };
 202
 203 struct bkey_ptrs {
 204         union bch_extent_entry  *start;
 205         union bch_extent_entry  *end;
 206 };
 207
 208 static inline struct bkey_ptrs_c bch2_bkey_ptrs_c(struct bkey_s_c k)
 209 {
 210         switch (k.k->type) {
 211         case KEY_TYPE_btree_ptr: {
 212                 struct bkey_s_c_btree_ptr e = bkey_s_c_to_btree_ptr(k);
 213
 214                 return (struct bkey_ptrs_c) {
 215                         to_entry(&e.v->start[0]),
 216                         to_entry(extent_entry_last(e))
 217                 };
 218         }
 219         case KEY_TYPE_extent: {
 220                 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
 221
 222                 return (struct bkey_ptrs_c) {
 223                         e.v->start,
 224                         extent_entry_last(e)
 225                 };
 226         }
 227         case KEY_TYPE_stripe: {
 228                 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
 229
 230                 return (struct bkey_ptrs_c) {
 231                         to_entry(&s.v->ptrs[0]),
 232                         to_entry(&s.v->ptrs[s.v->nr_blocks]),
 233                 };
 234         }
 235         case KEY_TYPE_reflink_v: {
 236                 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
 237
 238                 return (struct bkey_ptrs_c) {
 239                         r.v->start,
 240                         bkey_val_end(r),
 241                 };
 242         }
 243         case KEY_TYPE_btree_ptr_v2: {
 244                 struct bkey_s_c_btree_ptr_v2 e = bkey_s_c_to_btree_ptr_v2(k);
 245
 246                 return (struct bkey_ptrs_c) {
 247                         to_entry(&e.v->start[0]),
 248                         to_entry(extent_entry_last(e))
 249                 };
 250         }
 251         default:
 252                 return (struct bkey_ptrs_c) { NULL, NULL };
 253         }
 254 }
 255
 256 static inline struct bkey_ptrs bch2_bkey_ptrs(struct bkey_s k)
 257 {
 258         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k.s_c);
 259
 260         return (struct bkey_ptrs) {
 261                 (void *) p.start,
 262                 (void *) p.end
 263         };
 264 }
 265
 266 #define __bkey_extent_entry_for_each_from(_start, _end, _entry)         \
 267         for ((_entry) = (_start);                                       \
 268              (_entry) < (_end);                                         \
 269              (_entry) = extent_entry_next(_entry))
 270
 271 #define __bkey_ptr_next(_ptr, _end)                                     \
 272 ({                                                                      \
 273         typeof(_end) _entry;                                            \
 274                                                                         \
 275         __bkey_extent_entry_for_each_from(to_entry(_ptr), _end, _entry) \
 276                 if (extent_entry_is_ptr(_entry))                        \
 277                         break;                                          \
 278                                                                         \
 279         _entry < (_end) ? entry_to_ptr(_entry) : NULL;                  \
 280 })
 281
 282 #define bkey_extent_entry_for_each_from(_p, _entry, _start)             \
 283         __bkey_extent_entry_for_each_from(_start, (_p).end, _entry)
 284
 285 #define bkey_extent_entry_for_each(_p, _entry)                          \
 286         bkey_extent_entry_for_each_from(_p, _entry, _p.start)
 287
 288 #define __bkey_for_each_ptr(_start, _end, _ptr)                         \
 289         for ((_ptr) = (_start);                                         \
 290              ((_ptr) = __bkey_ptr_next(_ptr, _end));                    \
 291              (_ptr)++)
 292
 293 #define bkey_ptr_next(_p, _ptr)                                         \
 294         __bkey_ptr_next(_ptr, (_p).end)
 295
 296 #define bkey_for_each_ptr(_p, _ptr)                                     \
 297         __bkey_for_each_ptr(&(_p).start->ptr, (_p).end, _ptr)
 298
 299 #define __bkey_ptr_next_decode(_k, _end, _ptr, _entry)                  \
 300 ({                                                                      \
 301         __label__ out;                                                  \
 302                                                                         \
 303         (_ptr).idx      = 0;                                            \
 304         (_ptr).has_ec   = false;                                        \
 305                                                                         \
 306         __bkey_extent_entry_for_each_from(_entry, _end, _entry)         \
 307                 switch (extent_entry_type(_entry)) {                    \
 308                 case BCH_EXTENT_ENTRY_ptr:                              \
 309                         (_ptr).ptr              = _entry->ptr;          \
 310                         goto out;                                       \
 311                 case BCH_EXTENT_ENTRY_crc32:                            \
 312                 case BCH_EXTENT_ENTRY_crc64:                            \
 313                 case BCH_EXTENT_ENTRY_crc128:                           \
 314                         (_ptr).crc = bch2_extent_crc_unpack(_k,         \
 315                                         entry_to_crc(_entry));          \
 316                         break;                                          \
 317                 case BCH_EXTENT_ENTRY_stripe_ptr:                       \
 318                         (_ptr).ec = _entry->stripe_ptr;                 \
 319                         (_ptr).has_ec   = true;                         \
 320                         break;                                          \
 321                 }                                                       \
 322 out:                                                                    \
 323         _entry < (_end);                                                \
 324 })
 325
 326 #define __bkey_for_each_ptr_decode(_k, _start, _end, _ptr, _entry)      \
 327         for ((_ptr).crc = bch2_extent_crc_unpack(_k, NULL),             \
 328              (_entry) = _start;                                         \
 329              __bkey_ptr_next_decode(_k, _end, _ptr, _entry);            \
 330              (_entry) = extent_entry_next(_entry))
 331
 332 #define bkey_for_each_ptr_decode(_k, _p, _ptr, _entry)                  \
 333         __bkey_for_each_ptr_decode(_k, (_p).start, (_p).end,            \
 334                                    _ptr, _entry)
 335
 336 #define bkey_crc_next(_k, _start, _end, _crc, _iter)                    \
 337 ({                                                                      \
 338         __bkey_extent_entry_for_each_from(_iter, _end, _iter)           \
 339                 if (extent_entry_is_crc(_iter)) {                       \
 340                         (_crc) = bch2_extent_crc_unpack(_k,             \
 341                                                 entry_to_crc(_iter));   \
 342                         break;                                          \
 343                 }                                                       \
 344                                                                         \
 345         (_iter) < (_end);                                               \
 346 })
 347
 348 #define __bkey_for_each_crc(_k, _start, _end, _crc, _iter)              \
 349         for ((_crc) = bch2_extent_crc_unpack(_k, NULL),                 \
 350              (_iter) = (_start);                                        \
 351              bkey_crc_next(_k, _start, _end, _crc, _iter);              \
 352              (_iter) = extent_entry_next(_iter))
 353
 354 #define bkey_for_each_crc(_k, _p, _crc, _iter)                          \
 355         __bkey_for_each_crc(_k, (_p).start, (_p).end, _crc, _iter)
 356
 357 /* Iterate over pointers in KEY_TYPE_extent: */
 358
 359 #define extent_for_each_entry_from(_e, _entry, _start)                  \
 360         __bkey_extent_entry_for_each_from(_start,                       \
 361                                 extent_entry_last(_e), _entry)
 362
 363 #define extent_for_each_entry(_e, _entry)                               \
 364         extent_for_each_entry_from(_e, _entry, (_e).v->start)
 365
 366 #define extent_ptr_next(_e, _ptr)                                       \
 367         __bkey_ptr_next(_ptr, extent_entry_last(_e))
 368
 369 #define extent_for_each_ptr(_e, _ptr)                                   \
 370         __bkey_for_each_ptr(&(_e).v->start->ptr, extent_entry_last(_e), _ptr)
 371
 372 #define extent_for_each_ptr_decode(_e, _ptr, _entry)                    \
 373         __bkey_for_each_ptr_decode((_e).k, (_e).v->start,               \
 374                                    extent_entry_last(_e), _ptr, _entry)
 375
 376 /* utility code common to all keys with pointers: */
 377
 378 void bch2_mark_io_failure(struct bch_io_failures *,
 379                           struct extent_ptr_decoded *);
 380 int bch2_bkey_pick_read_device(struct bch_fs *, struct bkey_s_c,
 381                                struct bch_io_failures *,
 382                                struct extent_ptr_decoded *);
 383
 384 /* KEY_TYPE_btree_ptr: */
 385
 386 int bch2_btree_ptr_invalid(const struct bch_fs *, struct bkey_s_c, unsigned, struct printbuf *);
 387 void bch2_btree_ptr_to_text(struct printbuf *, struct bch_fs *,
 388                             struct bkey_s_c);
 389
 390 int bch2_btree_ptr_v2_invalid(const struct bch_fs *, struct bkey_s_c, unsigned, struct printbuf *);
 391 void bch2_btree_ptr_v2_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
 392 void bch2_btree_ptr_v2_compat(enum btree_id, unsigned, unsigned,
 393                               int, struct bkey_s);
 394
 395 #define bch2_bkey_ops_btree_ptr ((struct bkey_ops) {            \
 396         .key_invalid    = bch2_btree_ptr_invalid,               \
 397         .val_to_text    = bch2_btree_ptr_to_text,               \
 398         .swab           = bch2_ptr_swab,                        \
 399         .trans_trigger  = bch2_trans_mark_extent,               \
 400         .atomic_trigger = bch2_mark_extent,                     \
 401 })
 402
 403 #define bch2_bkey_ops_btree_ptr_v2 ((struct bkey_ops) {         \
 404         .key_invalid    = bch2_btree_ptr_v2_invalid,            \
 405         .val_to_text    = bch2_btree_ptr_v2_to_text,            \
 406         .swab           = bch2_ptr_swab,                        \
 407         .compat         = bch2_btree_ptr_v2_compat,             \
 408         .trans_trigger  = bch2_trans_mark_extent,               \
 409         .atomic_trigger = bch2_mark_extent,                     \
 410 })
 411
 412 /* KEY_TYPE_extent: */
 413
 414 bool bch2_extent_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
 415
 416 #define bch2_bkey_ops_extent ((struct bkey_ops) {               \
 417         .key_invalid    = bch2_bkey_ptrs_invalid,               \
 418         .val_to_text    = bch2_bkey_ptrs_to_text,               \
 419         .swab           = bch2_ptr_swab,                        \
 420         .key_normalize  = bch2_extent_normalize,                \
 421         .key_merge      = bch2_extent_merge,                    \
 422         .trans_trigger  = bch2_trans_mark_extent,               \
 423         .atomic_trigger = bch2_mark_extent,                     \
 424 })
 425
 426 /* KEY_TYPE_reservation: */
 427
 428 int bch2_reservation_invalid(const struct bch_fs *, struct bkey_s_c,
 429                              unsigned, struct printbuf *);
 430 void bch2_reservation_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
 431 bool bch2_reservation_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
 432
 433 #define bch2_bkey_ops_reservation ((struct bkey_ops) {          \
 434         .key_invalid    = bch2_reservation_invalid,             \
 435         .val_to_text    = bch2_reservation_to_text,             \
 436         .key_merge      = bch2_reservation_merge,               \
 437         .trans_trigger  = bch2_trans_mark_reservation,          \
 438         .atomic_trigger = bch2_mark_reservation,                \
 439 })
 440
 441 /* Extent checksum entries: */
 442
 443 bool bch2_can_narrow_extent_crcs(struct bkey_s_c,
 444                                  struct bch_extent_crc_unpacked);
 445 bool bch2_bkey_narrow_crcs(struct bkey_i *, struct bch_extent_crc_unpacked);
 446 void bch2_extent_crc_append(struct bkey_i *,
 447                             struct bch_extent_crc_unpacked);
 448
 449 /* Generic code for keys with pointers: */
 450
 451 static inline bool bkey_is_btree_ptr(const struct bkey *k)
 452 {
 453         switch (k->type) {
 454         case KEY_TYPE_btree_ptr:
 455         case KEY_TYPE_btree_ptr_v2:
 456                 return true;
 457         default:
 458                 return false;
 459         }
 460 }
 461
 462 static inline bool bkey_extent_is_direct_data(const struct bkey *k)
 463 {
 464         switch (k->type) {
 465         case KEY_TYPE_btree_ptr:
 466         case KEY_TYPE_btree_ptr_v2:
 467         case KEY_TYPE_extent:
 468         case KEY_TYPE_reflink_v:
 469                 return true;
 470         default:
 471                 return false;
 472         }
 473 }
 474
 475 static inline bool bkey_extent_is_inline_data(const struct bkey *k)
 476 {
 477         return  k->type == KEY_TYPE_inline_data ||
 478                 k->type == KEY_TYPE_indirect_inline_data;
 479 }
 480
 481 static inline unsigned bkey_inline_data_offset(const struct bkey *k)
 482 {
 483         switch (k->type) {
 484         case KEY_TYPE_inline_data:
 485                 return sizeof(struct bch_inline_data);
 486         case KEY_TYPE_indirect_inline_data:
 487                 return sizeof(struct bch_indirect_inline_data);
 488         default:
 489                 BUG();
 490         }
 491 }
 492
 493 static inline unsigned bkey_inline_data_bytes(const struct bkey *k)
 494 {
 495         return bkey_val_bytes(k) - bkey_inline_data_offset(k);
 496 }
 497
 498 #define bkey_inline_data_p(_k)  (((void *) (_k).v) + bkey_inline_data_offset((_k).k))
 499
 500 static inline bool bkey_extent_is_data(const struct bkey *k)
 501 {
 502         return  bkey_extent_is_direct_data(k) ||
 503                 bkey_extent_is_inline_data(k) ||
 504                 k->type == KEY_TYPE_reflink_p;
 505 }
 506
 507 /*
 508  * Should extent be counted under inode->i_sectors?
 509  */
 510 static inline bool bkey_extent_is_allocation(const struct bkey *k)
 511 {
 512         switch (k->type) {
 513         case KEY_TYPE_extent:
 514         case KEY_TYPE_reservation:
 515         case KEY_TYPE_reflink_p:
 516         case KEY_TYPE_reflink_v:
 517         case KEY_TYPE_inline_data:
 518         case KEY_TYPE_indirect_inline_data:
 519                 return true;
 520         default:
 521                 return false;
 522         }
 523 }
 524
 525 static inline bool bkey_extent_is_unwritten(struct bkey_s_c k)
 526 {
 527         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
 528         const struct bch_extent_ptr *ptr;
 529
 530         bkey_for_each_ptr(ptrs, ptr)
 531                 if (ptr->unwritten)
 532                         return true;
 533         return false;
 534 }
 535
 536 static inline bool bkey_extent_is_reservation(struct bkey_s_c k)
 537 {
 538         return k.k->type == KEY_TYPE_reservation ||
 539                 bkey_extent_is_unwritten(k);
 540 }
 541
 542 static inline struct bch_devs_list bch2_bkey_devs(struct bkey_s_c k)
 543 {
 544         struct bch_devs_list ret = (struct bch_devs_list) { 0 };
 545         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
 546         const struct bch_extent_ptr *ptr;
 547
 548         bkey_for_each_ptr(p, ptr)
 549                 ret.devs[ret.nr++] = ptr->dev;
 550
 551         return ret;
 552 }
 553
 554 static inline struct bch_devs_list bch2_bkey_dirty_devs(struct bkey_s_c k)
 555 {
 556         struct bch_devs_list ret = (struct bch_devs_list) { 0 };
 557         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
 558         const struct bch_extent_ptr *ptr;
 559
 560         bkey_for_each_ptr(p, ptr)
 561                 if (!ptr->cached)
 562                         ret.devs[ret.nr++] = ptr->dev;
 563
 564         return ret;
 565 }
 566
 567 static inline struct bch_devs_list bch2_bkey_cached_devs(struct bkey_s_c k)
 568 {
 569         struct bch_devs_list ret = (struct bch_devs_list) { 0 };
 570         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
 571         const struct bch_extent_ptr *ptr;
 572
 573         bkey_for_each_ptr(p, ptr)
 574                 if (ptr->cached)
 575                         ret.devs[ret.nr++] = ptr->dev;
 576
 577         return ret;
 578 }
 579
 580 static inline unsigned bch2_bkey_ptr_data_type(struct bkey_s_c k, const struct bch_extent_ptr *ptr)
 581 {
 582         switch (k.k->type) {
 583         case KEY_TYPE_btree_ptr:
 584         case KEY_TYPE_btree_ptr_v2:
 585                 return BCH_DATA_btree;
 586         case KEY_TYPE_extent:
 587         case KEY_TYPE_reflink_v:
 588                 return BCH_DATA_user;
 589         case KEY_TYPE_stripe: {
 590                 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
 591
 592                 BUG_ON(ptr < s.v->ptrs ||
 593                        ptr >= s.v->ptrs + s.v->nr_blocks);
 594
 595                 return ptr >= s.v->ptrs + s.v->nr_blocks - s.v->nr_redundant
 596                         ? BCH_DATA_parity
 597                         : BCH_DATA_user;
 598         }
 599         default:
 600                 BUG();
 601         }
 602 }
 603
 604 unsigned bch2_bkey_nr_ptrs(struct bkey_s_c);
 605 unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c);
 606 unsigned bch2_bkey_nr_ptrs_fully_allocated(struct bkey_s_c);
 607 bool bch2_bkey_is_incompressible(struct bkey_s_c);
 608 unsigned bch2_bkey_sectors_compressed(struct bkey_s_c);
 609
 610 unsigned bch2_bkey_replicas(struct bch_fs *, struct bkey_s_c);
 611 unsigned bch2_extent_ptr_durability(struct bch_fs *, struct extent_ptr_decoded *);
 612 unsigned bch2_bkey_durability(struct bch_fs *, struct bkey_s_c);
 613
 614 void bch2_bkey_drop_device(struct bkey_s, unsigned);
 615 void bch2_bkey_drop_device_noerror(struct bkey_s, unsigned);
 616 const struct bch_extent_ptr *bch2_bkey_has_device(struct bkey_s_c, unsigned);
 617 bool bch2_bkey_has_target(struct bch_fs *, struct bkey_s_c, unsigned);
 618
 619 void bch2_bkey_extent_entry_drop(struct bkey_i *, union bch_extent_entry *);
 620
 621 static inline void bch2_bkey_append_ptr(struct bkey_i *k, struct bch_extent_ptr ptr)
 622 {
 623         EBUG_ON(bch2_bkey_has_device(bkey_i_to_s_c(k), ptr.dev));
 624
 625         switch (k->k.type) {
 626         case KEY_TYPE_btree_ptr:
 627         case KEY_TYPE_btree_ptr_v2:
 628         case KEY_TYPE_extent:
 629                 EBUG_ON(bkey_val_u64s(&k->k) >= BKEY_EXTENT_VAL_U64s_MAX);
 630
 631                 ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
 632
 633                 memcpy((void *) &k->v + bkey_val_bytes(&k->k),
 634                        &ptr,
 635                        sizeof(ptr));
 636                 k->u64s++;
 637                 break;
 638         default:
 639                 BUG();
 640         }
 641 }
 642
 643 void bch2_extent_ptr_decoded_append(struct bkey_i *,
 644                                     struct extent_ptr_decoded *);
 645 union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s,
 646                                            struct bch_extent_ptr *);
 647
 648 #define bch2_bkey_drop_ptrs(_k, _ptr, _cond)                            \
 649 do {                                                                    \
 650         struct bkey_ptrs _ptrs = bch2_bkey_ptrs(_k);                    \
 651                                                                         \
 652         _ptr = &_ptrs.start->ptr;                                       \
 653                                                                         \
 654         while ((_ptr = bkey_ptr_next(_ptrs, _ptr))) {                   \
 655                 if (_cond) {                                            \
 656                         _ptr = (void *) bch2_bkey_drop_ptr(_k, _ptr);   \
 657                         _ptrs = bch2_bkey_ptrs(_k);                     \
 658                         continue;                                       \
 659                 }                                                       \
 660                                                                         \
 661                 (_ptr)++;                                               \
 662         }                                                               \
 663 } while (0)
 664
 665 bool bch2_bkey_matches_ptr(struct bch_fs *, struct bkey_s_c,
 666                            struct bch_extent_ptr, u64);
 667 bool bch2_extents_match(struct bkey_s_c, struct bkey_s_c);
 668 bool bch2_extent_has_ptr(struct bkey_s_c, struct extent_ptr_decoded, struct bkey_s_c);
 669
 670 void bch2_extent_ptr_set_cached(struct bkey_s, struct bch_extent_ptr *);
 671
 672 bool bch2_extent_normalize(struct bch_fs *, struct bkey_s);
 673 void bch2_bkey_ptrs_to_text(struct printbuf *, struct bch_fs *,
 674                             struct bkey_s_c);
 675 int bch2_bkey_ptrs_invalid(const struct bch_fs *, struct bkey_s_c,
 676                            unsigned, struct printbuf *);
 677
 678 void bch2_ptr_swab(struct bkey_s);
 679
 680 /* Generic extent code: */
 681
 682 enum bch_extent_overlap {
 683         BCH_EXTENT_OVERLAP_ALL          = 0,
 684         BCH_EXTENT_OVERLAP_BACK         = 1,
 685         BCH_EXTENT_OVERLAP_FRONT        = 2,
 686         BCH_EXTENT_OVERLAP_MIDDLE       = 3,
 687 };
 688
 689 /* Returns how k overlaps with m */
 690 static inline enum bch_extent_overlap bch2_extent_overlap(const struct bkey *k,
 691                                                           const struct bkey *m)
 692 {
 693         int cmp1 = bkey_lt(k->p, m->p);
 694         int cmp2 = bkey_gt(bkey_start_pos(k), bkey_start_pos(m));
 695
 696         return (cmp1 << 1) + cmp2;
 697 }
 698
 699 int bch2_cut_front_s(struct bpos, struct bkey_s);
 700 int bch2_cut_back_s(struct bpos, struct bkey_s);
 701
 702 static inline void bch2_cut_front(struct bpos where, struct bkey_i *k)
 703 {
 704         bch2_cut_front_s(where, bkey_i_to_s(k));
 705 }
 706
 707 static inline void bch2_cut_back(struct bpos where, struct bkey_i *k)
 708 {
 709         bch2_cut_back_s(where, bkey_i_to_s(k));
 710 }
 711
 712 /**
 713  * bch_key_resize - adjust size of @k
 714  *
 715  * bkey_start_offset(k) will be preserved, modifies where the extent ends
 716  */
 717 static inline void bch2_key_resize(struct bkey *k, unsigned new_size)
 718 {
 719         k->p.offset -= k->size;
 720         k->p.offset += new_size;
 721         k->size = new_size;
 722 }
 723
 724 /*
 725  * In extent_sort_fix_overlapping(), insert_fixup_extent(),
 726  * extent_merge_inline() - we're modifying keys in place that are packed. To do
 727  * that we have to unpack the key, modify the unpacked key - then this
 728  * copies/repacks the unpacked to the original as necessary.
 729  */
 730 static inline void extent_save(struct btree *b, struct bkey_packed *dst,
 731                                struct bkey *src)
 732 {
 733         struct bkey_format *f = &b->format;
 734         struct bkey_i *dst_unpacked;
 735
 736         if ((dst_unpacked = packed_to_bkey(dst)))
 737                 dst_unpacked->k = *src;
 738         else
 739                 BUG_ON(!bch2_bkey_pack_key(dst, src, f));
 740 }
 741
 742 #endif /* _BCACHEFS_EXTENTS_H */