]> git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/extents.h
Update bcachefs sources to e48731a188 bcachefs: Fix BTREE_TRIGGER_WANTS_OLD_AND_NEW
[bcachefs-tools-debian] / 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 const char *bch2_btree_ptr_invalid(const struct bch_fs *, struct bkey_s_c);
371 void bch2_btree_ptr_to_text(struct printbuf *, struct bch_fs *,
372                             struct bkey_s_c);
373
374 const char *bch2_btree_ptr_v2_invalid(const struct bch_fs *, struct bkey_s_c);
375 void bch2_btree_ptr_v2_to_text(struct printbuf *, struct bch_fs *,
376                             struct bkey_s_c);
377 void bch2_btree_ptr_v2_compat(enum btree_id, unsigned, unsigned,
378                               int, struct bkey_s);
379
380 #define bch2_bkey_ops_btree_ptr (struct bkey_ops) {             \
381         .key_invalid    = bch2_btree_ptr_invalid,               \
382         .val_to_text    = bch2_btree_ptr_to_text,               \
383         .swab           = bch2_ptr_swab,                        \
384         .trans_trigger  = bch2_trans_mark_extent,               \
385         .atomic_trigger = bch2_mark_extent,                     \
386 }
387
388 #define bch2_bkey_ops_btree_ptr_v2 (struct bkey_ops) {          \
389         .key_invalid    = bch2_btree_ptr_v2_invalid,            \
390         .val_to_text    = bch2_btree_ptr_v2_to_text,            \
391         .swab           = bch2_ptr_swab,                        \
392         .compat         = bch2_btree_ptr_v2_compat,             \
393         .trans_trigger  = bch2_trans_mark_extent,               \
394         .atomic_trigger = bch2_mark_extent,                     \
395 }
396
397 /* KEY_TYPE_extent: */
398
399 const char *bch2_extent_invalid(const struct bch_fs *, struct bkey_s_c);
400 void bch2_extent_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
401 bool bch2_extent_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
402
403 #define bch2_bkey_ops_extent (struct bkey_ops) {                \
404         .key_invalid    = bch2_extent_invalid,                  \
405         .val_to_text    = bch2_extent_to_text,                  \
406         .swab           = bch2_ptr_swab,                        \
407         .key_normalize  = bch2_extent_normalize,                \
408         .key_merge      = bch2_extent_merge,                    \
409         .trans_trigger  = bch2_trans_mark_extent,               \
410         .atomic_trigger = bch2_mark_extent,                     \
411 }
412
413 /* KEY_TYPE_reservation: */
414
415 const char *bch2_reservation_invalid(const struct bch_fs *, struct bkey_s_c);
416 void bch2_reservation_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
417 bool bch2_reservation_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
418
419 #define bch2_bkey_ops_reservation (struct bkey_ops) {           \
420         .key_invalid    = bch2_reservation_invalid,             \
421         .val_to_text    = bch2_reservation_to_text,             \
422         .key_merge      = bch2_reservation_merge,               \
423         .trans_trigger  = bch2_trans_mark_reservation,          \
424         .atomic_trigger = bch2_mark_reservation,                \
425 }
426
427 /* Extent checksum entries: */
428
429 bool bch2_can_narrow_extent_crcs(struct bkey_s_c,
430                                  struct bch_extent_crc_unpacked);
431 bool bch2_bkey_narrow_crcs(struct bkey_i *, struct bch_extent_crc_unpacked);
432 void bch2_extent_crc_append(struct bkey_i *,
433                             struct bch_extent_crc_unpacked);
434
435 /* Generic code for keys with pointers: */
436
437 static inline bool bkey_is_btree_ptr(const struct bkey *k)
438 {
439         switch (k->type) {
440         case KEY_TYPE_btree_ptr:
441         case KEY_TYPE_btree_ptr_v2:
442                 return true;
443         default:
444                 return false;
445         }
446 }
447
448 static inline bool bkey_extent_is_direct_data(const struct bkey *k)
449 {
450         switch (k->type) {
451         case KEY_TYPE_btree_ptr:
452         case KEY_TYPE_btree_ptr_v2:
453         case KEY_TYPE_extent:
454         case KEY_TYPE_reflink_v:
455                 return true;
456         default:
457                 return false;
458         }
459 }
460
461 static inline bool bkey_extent_is_inline_data(const struct bkey *k)
462 {
463         return  k->type == KEY_TYPE_inline_data ||
464                 k->type == KEY_TYPE_indirect_inline_data;
465 }
466
467 static inline unsigned bkey_inline_data_offset(const struct bkey *k)
468 {
469         switch (k->type) {
470         case KEY_TYPE_inline_data:
471                 return sizeof(struct bch_inline_data);
472         case KEY_TYPE_indirect_inline_data:
473                 return sizeof(struct bch_indirect_inline_data);
474         default:
475                 BUG();
476         }
477 }
478
479 static inline unsigned bkey_inline_data_bytes(const struct bkey *k)
480 {
481         return bkey_val_bytes(k) - bkey_inline_data_offset(k);
482 }
483
484 #define bkey_inline_data_p(_k)  (((void *) (_k).v) + bkey_inline_data_offset((_k).k))
485
486 static inline bool bkey_extent_is_data(const struct bkey *k)
487 {
488         return  bkey_extent_is_direct_data(k) ||
489                 bkey_extent_is_inline_data(k) ||
490                 k->type == KEY_TYPE_reflink_p;
491 }
492
493 /*
494  * Should extent be counted under inode->i_sectors?
495  */
496 static inline bool bkey_extent_is_allocation(const struct bkey *k)
497 {
498         switch (k->type) {
499         case KEY_TYPE_extent:
500         case KEY_TYPE_reservation:
501         case KEY_TYPE_reflink_p:
502         case KEY_TYPE_reflink_v:
503         case KEY_TYPE_inline_data:
504         case KEY_TYPE_indirect_inline_data:
505                 return true;
506         default:
507                 return false;
508         }
509 }
510
511 static inline struct bch_devs_list bch2_bkey_devs(struct bkey_s_c k)
512 {
513         struct bch_devs_list ret = (struct bch_devs_list) { 0 };
514         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
515         const struct bch_extent_ptr *ptr;
516
517         bkey_for_each_ptr(p, ptr)
518                 ret.devs[ret.nr++] = ptr->dev;
519
520         return ret;
521 }
522
523 static inline struct bch_devs_list bch2_bkey_dirty_devs(struct bkey_s_c k)
524 {
525         struct bch_devs_list ret = (struct bch_devs_list) { 0 };
526         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
527         const struct bch_extent_ptr *ptr;
528
529         bkey_for_each_ptr(p, ptr)
530                 if (!ptr->cached)
531                         ret.devs[ret.nr++] = ptr->dev;
532
533         return ret;
534 }
535
536 static inline struct bch_devs_list bch2_bkey_cached_devs(struct bkey_s_c k)
537 {
538         struct bch_devs_list ret = (struct bch_devs_list) { 0 };
539         struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
540         const struct bch_extent_ptr *ptr;
541
542         bkey_for_each_ptr(p, ptr)
543                 if (ptr->cached)
544                         ret.devs[ret.nr++] = ptr->dev;
545
546         return ret;
547 }
548
549 static inline unsigned bch2_bkey_ptr_data_type(struct bkey_s_c k, const struct bch_extent_ptr *ptr)
550 {
551         switch (k.k->type) {
552         case KEY_TYPE_btree_ptr:
553         case KEY_TYPE_btree_ptr_v2:
554                 return BCH_DATA_btree;
555         case KEY_TYPE_extent:
556         case KEY_TYPE_reflink_v:
557                 return BCH_DATA_user;
558         case KEY_TYPE_stripe: {
559                 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
560
561                 BUG_ON(ptr < s.v->ptrs ||
562                        ptr >= s.v->ptrs + s.v->nr_blocks);
563
564                 return ptr >= s.v->ptrs + s.v->nr_blocks - s.v->nr_redundant
565                         ? BCH_DATA_parity
566                         : BCH_DATA_user;
567         }
568         default:
569                 BUG();
570         }
571 }
572
573 unsigned bch2_bkey_nr_ptrs(struct bkey_s_c);
574 unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c);
575 unsigned bch2_bkey_nr_ptrs_fully_allocated(struct bkey_s_c);
576 bool bch2_bkey_is_incompressible(struct bkey_s_c);
577 unsigned bch2_bkey_sectors_compressed(struct bkey_s_c);
578
579 unsigned bch2_bkey_replicas(struct bch_fs *, struct bkey_s_c);
580 unsigned bch2_bkey_durability(struct bch_fs *, struct bkey_s_c);
581
582 void bch2_bkey_mark_replicas_cached(struct bch_fs *, struct bkey_s,
583                                     unsigned, unsigned);
584
585 void bch2_bkey_extent_entry_drop(struct bkey_i *, union bch_extent_entry *);
586 void bch2_bkey_append_ptr(struct bkey_i *, struct bch_extent_ptr);
587 void bch2_extent_ptr_decoded_append(struct bkey_i *,
588                                     struct extent_ptr_decoded *);
589 union bch_extent_entry *__bch2_bkey_drop_ptr(struct bkey_s,
590                                              struct bch_extent_ptr *);
591 union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s,
592                                            struct bch_extent_ptr *);
593
594 #define bch2_bkey_drop_ptrs(_k, _ptr, _cond)                            \
595 do {                                                                    \
596         struct bkey_ptrs _ptrs = bch2_bkey_ptrs(_k);                    \
597                                                                         \
598         _ptr = &_ptrs.start->ptr;                                       \
599                                                                         \
600         while ((_ptr = bkey_ptr_next(_ptrs, _ptr))) {                   \
601                 if (_cond) {                                            \
602                         _ptr = (void *) bch2_bkey_drop_ptr(_k, _ptr);   \
603                         _ptrs = bch2_bkey_ptrs(_k);                     \
604                         continue;                                       \
605                 }                                                       \
606                                                                         \
607                 (_ptr)++;                                               \
608         }                                                               \
609 } while (0)
610
611 void bch2_bkey_drop_device(struct bkey_s, unsigned);
612 const struct bch_extent_ptr *bch2_bkey_has_device(struct bkey_s_c, unsigned);
613 bool bch2_bkey_has_target(struct bch_fs *, struct bkey_s_c, unsigned);
614
615 bool bch2_bkey_matches_ptr(struct bch_fs *, struct bkey_s_c,
616                            struct bch_extent_ptr, u64);
617
618 bool bch2_extent_normalize(struct bch_fs *, struct bkey_s);
619 void bch2_bkey_ptrs_to_text(struct printbuf *, struct bch_fs *,
620                             struct bkey_s_c);
621 const char *bch2_bkey_ptrs_invalid(const struct bch_fs *, struct bkey_s_c);
622
623 void bch2_ptr_swab(struct bkey_s);
624
625 /* Generic extent code: */
626
627 enum bch_extent_overlap {
628         BCH_EXTENT_OVERLAP_ALL          = 0,
629         BCH_EXTENT_OVERLAP_BACK         = 1,
630         BCH_EXTENT_OVERLAP_FRONT        = 2,
631         BCH_EXTENT_OVERLAP_MIDDLE       = 3,
632 };
633
634 /* Returns how k overlaps with m */
635 static inline enum bch_extent_overlap bch2_extent_overlap(const struct bkey *k,
636                                                           const struct bkey *m)
637 {
638         int cmp1 = bkey_cmp(k->p, m->p) < 0;
639         int cmp2 = bkey_cmp(bkey_start_pos(k),
640                             bkey_start_pos(m)) > 0;
641
642         return (cmp1 << 1) + cmp2;
643 }
644
645 int bch2_cut_front_s(struct bpos, struct bkey_s);
646 int bch2_cut_back_s(struct bpos, struct bkey_s);
647
648 static inline void bch2_cut_front(struct bpos where, struct bkey_i *k)
649 {
650         bch2_cut_front_s(where, bkey_i_to_s(k));
651 }
652
653 static inline void bch2_cut_back(struct bpos where, struct bkey_i *k)
654 {
655         bch2_cut_back_s(where, bkey_i_to_s(k));
656 }
657
658 /**
659  * bch_key_resize - adjust size of @k
660  *
661  * bkey_start_offset(k) will be preserved, modifies where the extent ends
662  */
663 static inline void bch2_key_resize(struct bkey *k, unsigned new_size)
664 {
665         k->p.offset -= k->size;
666         k->p.offset += new_size;
667         k->size = new_size;
668 }
669
670 /*
671  * In extent_sort_fix_overlapping(), insert_fixup_extent(),
672  * extent_merge_inline() - we're modifying keys in place that are packed. To do
673  * that we have to unpack the key, modify the unpacked key - then this
674  * copies/repacks the unpacked to the original as necessary.
675  */
676 static inline void extent_save(struct btree *b, struct bkey_packed *dst,
677                                struct bkey *src)
678 {
679         struct bkey_format *f = &b->format;
680         struct bkey_i *dst_unpacked;
681
682         if ((dst_unpacked = packed_to_bkey(dst)))
683                 dst_unpacked->k = *src;
684         else
685                 BUG_ON(!bch2_bkey_pack_key(dst, src, f));
686 }
687
688 #endif /* _BCACHEFS_EXTENTS_H */