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